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

Optimal packing of 2 unit squares in a square

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

Value: $2$ 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