Square packing in a square is the problem of determining the maximum number of unit squares (squares of side length one) that can be packed inside a larger square of side length .
If is an integer, the answer is , but the precise – or even asymptotic – amount of unfilled space for an arbitrary non-integer is an open question.
