olymmath

IMO 1979 Problem 6

  • Day 2

Let AA and EE be opposite vertices of an octagon. A frog starts at vertex A.A. From any vertex except EE it jumps to one of the two adjacent vertices. When it reaches EE it stops. Let ana_n be the number of distinct paths of exactly nn jumps ending at EE . Prove that: a2n−1=0,a2n=(2+2)n−1−(2−2)n−12.a_{2n-1}=0, a_{2n}={(2+\sqrt2)^{n-1} - (2-\sqrt2)^{n-1} \over\sqrt2}.

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.

Add a solution

Locator imo/1979/p6 · Tag N5C1A2YNFH · Edit this page on GitHub · Keys: j next, k previous