IMO 1979 Problem 6
- Day 2
- Difficulty band 9
Let and be opposite vertices of an octagon. A frog starts at vertex From any vertex except it jumps to one of the two adjacent vertices. When it reaches it stops. Let be the number of distinct paths of exactly jumps ending at . Prove that:
Dataset text AI-MO AoPS. Quoted with source.
Official text: IMO 1979 official English paper, page 1.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.