iMetrics
Tips

Math obsession

Science & Math Newsletter
- The Math seminar to general public 2017
- Discrete Math Puzzle
- Math & Programming

- Pi, Napier number

- Euler's formula
- Primitive root & Recurring decimal
- Euclidean Algotithm & Billiard Theorem


- IMO Official Site
- IOI Japan Past exercise

- Newsletter in Japanese

Crossroads Cafe
- Meet at the Crossroads

- Night Sky-Walk 1,  2,  3
- Multi-languages
 

Aviation
- Weather & Dispatch
- Biennial Review

Consultancy Service

Apr. 17, 2017

click and move on on to Math & Science
i <3 Math & Flying

 

Hill's tetrahedra

The third on Hilbert's list of mathematical problems, presented in 1900, was the first to be solved. The problem is related to the following question: given any two polyhedra of equal volume, is it always possible to cut the first into finitely many polyhedral pieces which can be reassembled to yield the second?

Based on earlier writings by Gauss, Hilbert conjectured that this is not always possible. This was confirmed within the year by his student Max Dehn, who proved that the answer in general is "no" by producing a counterexample.

The answer for the analogous question about polygons in 2 dimensions is "yes" and had been known for a long time; this is the Bolyai–Gerwien theorem.

In geometry, the Hill's tetrahedra are a family of space-filling tetrahedra. They were discovered in 1896 by M. J. M. Hill, a professor of mathematics at the University College London, who showed that they are scissor-congruent to a cube.

Copyright (c) iMetrics.co.jp 2017 All Rights Reserved.