benchmarks.wiki / Public workspace

AIME 2024 / AIME 2024 train b3f10a3a-4864-5944-898c-5892a42d404b

Problem

Answer published by the source. Consult the official source to check your work against its answer.

Problem

Let ABCDABCD be a tetrahedron such that AB=CD=41AB=CD= \sqrt{41}, AC=BD=80AC=BD= \sqrt{80}, and BC=AD=89BC=AD= \sqrt{89}. There exists a point II inside the tetrahedron such that the distances from II to each of the faces of the tetrahedron are all equal. This distance can be written in the form mnp\frac{m \sqrt n}{p}, where mm, nn, and pp are positive integers, mm and pp are relatively prime, and nn is not divisible by the square of any prime. Find m+n+pm+n+p.
Plain-text mathematical notation (without MathML)
Let ABCD be a tetrahedron such that AB=CD=√(41), AC=BD=√(80), and BC=AD=√(89). There exists a point I inside the tetrahedron such that the distances from I to each of the faces of the tetrahedron are all equal. This distance can be written in the form (m√(n))/(p), where m, n, and p are positive integers, m and p are relatively prime, and n is not divisible by the square of any prime. Find m+n+p.
Original LaTeX notation
Let $ABCD$ be a tetrahedron such that $AB=CD= \sqrt{41}$, $AC=BD= \sqrt{80}$, and $BC=AD= \sqrt{89}$. There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt n}{p}$, where $m$, $n$, and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+p$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import