Elementarization of Benko's solution of Hilbert's third problem
Hilbert's third problem asked whether every two 3-dimensional polytopes of same volume can be cut into the same finitely many pieces. Already in 1900, a counterexample was given by \textit{M. Dehn} [Gött. Nachr. 1900, 345--354 (1900; JFM 31.0505.02)] with the cube and the regular tetrahedron. In 2007, \textit{D. Benko} [Am. Math. Mon. 114, No. 8, 665--676 (2007; Zbl 1155.52010)] gave a much more simple proof for the fact, that the cube and the regular tetrahedron are a counterexample. The proof makes use of a certain approximation of real numbers by rationals.NEWLINENEWLINEThe author of this note gives an even more elementarized proof by showing a variant of Benko's approximation lemma with elementary mathematics. The author further introduces weighted angle-sums to present the remaining part of Benko's proof in a well-arranged way.
- Władysław Kretkowski and Hilbert's third problem
- scientific article; zbMATH DE number 39691 (Why is no real title available?)
- Triangle-Free Partitions of Euclidean Space
- Note for the third Hilbert problem: a fractal construction
- Hilbert's third problem and Dehn invariant -- an elementarization with spherical triangles
This page was built for publication: Elementarization of Benko's solution of Hilbert's third problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442462)
