determine the number of terms in a fibonacci sequence that are divisible by $3$

864 Views Asked by At

Consider the Fibonacci sequence $1, 1, 2, 3, 5, 8, 13, 21, . . .$ where each term, after the first two, is the sum of the two previous terms. How many of the first $1000$ terms are divisible by 3?

1

There are 1 best solutions below

1
On

HINT : In mod $3$, $$\color{red}{1},1,2,0,2,2,1,0,\color{red}{1},1,2,0,\cdots$$