Smallest Perfect Square Dissection

Theorem

The smallest perfect square dissection is of an integer square of side $112$ into $21$ parts.


Proof



This theorem requires a proof.
In particular: That this is the smallest still needs to be proved.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.


Sources

  • 1978: A.J.W. Duijvestijn: A Simple Perfect Square of Lowest Order (J. Combin. Th. Ser. B Vol. 25: pp. 240 – 243)
  • 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $21$
  • 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $112$
  • 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $21$
  • 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $112$
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.