Packing unit squares in a square $s(35)$

Optimal packing of 35 unit squares in a square

The side of the smallest square into which $35$ unit squares can be packed.

Value: $6$ Verified upper bound

Verified bounds

Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.

Updates from the literature