0,1,__,3,5,__,0,6,__,17,5,...
We define the nth term of the Finonacci sequence as F(n).
S(n) denotes the terms of the given sequence.
Then S(n) is defined as:
S(n) = F(n-1) (mod n-1)
Accordingly,
S(1) = F(0) (mod 1) = 1(mod 1) =1
S(2) = F(1) (mod 3) = 1(mod 3) = 1
S(3) = F(2) (mod 5) = 2(mod 5) = 2
S(4) = F(3) (mod 7) = 3( mod 7) = 3
S(5) = F(4) (mod 9) = 5(mod 9) = 5
S(6) = F(5) (mod 11) = 8( mod 11) = 8
S(7) = F(6) (mod 13) = 13(mod 13) = 0
S(8) = F(7) (mod 15) = 21 (mod 15) =6
S(9) = F(8) (mod 17) = 34 (mod 17) =0
S(10) = F(9) (mod 19) = 55(mod 19) = 17
S(11) = F(10) (mod 21) = 89(mod 21) = 5
S(12) r F(11) (mod 23) = 144(mod 23) = 6
Consequently, the required missing terms are:2,8, 0, and 6.
Edited on January 30, 2024, 9:43 am
Puzzle Solution
