benchmarks.wiki / Public workspace
AIME 2024 / AIME 2024 train 25b99ad9-53e1-50fb-b064-a87f7fee5801
Problem
Answer published by the source. Consult the official source to check your work against its answer.
Problem
Consider the paths of length that follow the lines from the lower left corner to the upper right corner on an grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.
Plain-text mathematical notation (without MathML)
Consider the paths of length 16 that follow the lines from the lower left corner to the upper right corner on an 8×8 grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.
Original LaTeX notation
Consider the paths of length $16$ that follow the lines from the lower left corner to the upper right corner on an $8\times 8$ grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.
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