Skip to main content
deleted 5 characters in body
Source Link
Q.Q.J.
  • 2.1k
  • 4
  • 24
  • 26

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, that 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.

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, that 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.

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.

Source Link
Q.Q.J.
  • 2.1k
  • 4
  • 24
  • 26

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, that 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.