Abstract
In a recent paper [5], general methods were described for the dissection of a square into a finite number n of unequal non-overlapping squares. In this note, examples of such perfect squares are given in which the sides and elements are relatively small integers; in particular, a dissection of a square into 24 different elements, which is believed to be the squaring of least order known at the present time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
