Problem 6
Let A and E be opposite vertices of a regular octagon. A frog starts at A and jumps to an adjacent vertex until it reaches E and stops. If a_n counts paths of exactly n jumps ending at E, prove and for .
Step 3 of 5: Step 3
Detailed analysis
Let b_m count paths of length m from a neighboring vertex C to E. The two-step transitions give and . Eliminating b yields for .