Can you divide one square paper into five equal squares? You have a scissor and glue. You can measure and cut and then attach as well. Only condition is You can't waste any paper.
The Wallace-Bolyai-Gerwien Theorem theorem says:
Any two simple polygons of equal area are equidecomposable
(where simple means no self intersections and equidecomposable means finitely cut and glued).
For your problem you can take the first polygon to be a unit square and the second to be a sqrt(5) by 1/sqrt(5) rectangle and apply this theorem. Then perform the remaining four cuts.
Also, the generalisation of your question is the 2d analogue of Hilbert's 3rd Problem which asks whether given any two polyhedra with equal volume can one be finitely cut and glued into the other. The answer here, unlike in the 2d case, is "no" which was proved by Dehn using Dehn invariants in 1900.
Cut from (0,0) to (1,1/2), and from (0,1/2) to (1,1). We can glue these three pieces together to get a ring with circumference $\sqrt 5$ and height $\sqrt 5 / 5$. Now it's easy!
Since $1+2i$ has length $\sqrt5$, you can lift a square fundamental domain of $\mathbb C/\mathbb Z[i]$ to $\mathbb C/(1+2i)\mathbb Z[i]$. Overlay a square fundamental domain for the larger torus to get a way to divide a square into 5 smaller squares.
It's pretty easy to decompose any rectangle into a square geometrically, but the general decomposition is not as nice.
protected by Lucia Apr 14 '15 at 20:30
Thank you for your interest in this question.
Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site (the association bonus does not count).
Would you like to answer one of these unanswered questions instead?