Volume of Smallest Tetrahedron with Integer Edges and Integer Volume
Jump to navigation
Jump to search
This theorem requires a proof..
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
The volume of the smallest tetrahedron with integer edges and integer volume is $3$.
There are $2$ possible sets of edges:
- $32, 33, 35, 40, 70, 76$
- $21, 32, 47, 56, 58, 76$
Proof
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- Apr. 1992: Kevin L. Dove and John S. Sumner: Tetrahedra with Integer Edges and Integer Volume (Math. Mag. Vol. 65, no. 2: pp. 104 – 111) www.jstor.org/stable/2690489
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $3$