benchmarks.wiki / Public workspace
AIME 2025 I / Let ABCDE be a convex pentagon with AB=14,BC=7,CD=24,DE=13,EA=26, and…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
question
Let be a convex pentagon with and . For each point in the plane, define . The least possible value of can be expressed as , where and are positive integers and is not divisible by the square of any prime. Find .
Plain-text mathematical notation (without MathML)
Let ABCDE be a convex pentagon with AB=14,BC=7,CD=24,DE=13,EA=26, and ∠B=∠E=60^(∘). For each point X in the plane, define f(X)=AX+BX+CX+DX+EX. The least possible value of f(X) can be expressed as m+n√(p), where m and n are positive integers and p is not divisible by the square of any prime. Find m+n+p.
Original LaTeX notation
Let $ABCDE$ be a convex pentagon with $AB=14, BC=7, CD=24, DE=13, EA=26,$ and $\angle B=\angle E=60^\circ$. For each point $X$ in the plane, define $f(X)=AX+BX+CX+DX+EX$. The least possible value of $f(X)$ can be expressed as $m+n\sqrt{p}$, where $m$ and $n$ are positive integers and $p$ is not divisible by the square of any prime. Find $m+n+p$.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
initial import