Take the Fibonacci numbers modulo m — keep only the remainders — and something has to give: there are finitely many pairs of remainders, so a pair must recur, and once it does the whole sequence repeats. The length of that repeat is the Pisano period π(m). Modulo 2 it is 3; modulo 3 it is 8; modulo 10 it is 60. Every Fibonacci sequence, seen through a modulus, is eventually a loop — a finite cycle you return to. This is the first appearance of the torus: an infinite sequence wrapped onto a ring.
The demo takes Fibonacci modulo a small m and shows the sequence wrapping — returning to (0,1) and repeating: live demo
“An infinite sequence needs infinite memory to track.” — modulo m it is a finite loop; a handful of remainders and you know the whole sequence forever. cited
Finitely many remainders, so the sequence must come back — and it does, on the dot. The infinite made cyclic. Lagrange 1774
On the canonical compiler, F(6) mod 4 = 0, and the pair returns: F(7),F(8) mod 4 = 1,1 — the seed again, so the period is 6: