AIME 2018a Problem 14
- Paper
- Answer
Let be a heptagon. A frog starts jumping at vertex . From any vertex of the heptagon except , the frog may jump to either of the two adjacent vertices. When it reaches vertex , the frog stops and stays there. Find the number of distinct sequences of jumps of no more than jumps that end at .
Dataset text AIME 1983 to 2026. Quoted with source.
Show the answer
351
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.