Squaring the square

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Squaring the square is the problem of tiling an integral square using only other integral squares. (An integral square is a square whose sides have integer length.) The name was coined in a humorous analogy with squaring the circle.

Squaring the square is an easy task unless additional conditions are set. The most studied restriction is that the squaring be perfect, meaning the sizes of the smaller squares are all different. A related problem is squaring the plane, which can be done even with the restriction that each natural number occurs exactly once as a size of a square in the tiling.

The order of a squared square is its number of constituent squares.

Squaring the square is the problem of tiling an integral square using only other integral squares. (An integral square is a square whose sides have integer length.) The name was coined in a humorous analogy with squaring the circle.

Squaring the square is an easy task unless additional conditions are set. The most studied restriction is that the squaring be perfect, meaning the sizes of the smaller squares are all different. A related problem is squaring the plane, which can be done even with the restriction that each natural number occurs exactly once as a size of a square in the tiling.

The order of a squared square is its number of constituent squares. When the constraint of all the squares being different sizes is relaxed, a squared square such that the side lengths of the smaller squares do not have a common divisor larger than 1 is called a "Mrs. Perkins's quilt".

As the greatest common divisor of all the smaller side lengths should be 1, a 2k × 2k square, for example, cannot be divided into four k × k squares, where k ≥ 2. The Mrs. Perkins's quilt problem asks for a Mrs. Perkins's quilt with the fewest pieces for a given n\times n square.

The number of pieces required is at least \log_2 n , and at most 6\log_2 n . Computer searches have found exact solutions for small values of n (small enough to need up to 18 pieces). For n=1,2,3,\dots the number of pieces required is:

See also

Square packing in a square Dividing a square into similar rectangles Perfect rectangle

Text derived from https://en.wikipedia.org/w/index.php?oldid=1352288988 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.