🧩
Equivalence Classes & Fibonacci Sprint
Count a congruence-mod-n class's elements, or iterate F(n)=F(n-1)+F(n-2) from F0=0, F1=1 -- two chapters' own defined-structure counts.
⏱️ 75s
▶ Log in to play