Evaluate gcd(Fn,Fn+1)\text{gcd}(F_n, F_{n+1})gcd(Fn,Fn+1) where FnF_nFn is the nnn-th Fibonacci number (F1=1,F2=1,F3=2,F4=3,F5=5,F6=8,F7=13F_1=1, F_2=1, F_3=2, F_4=3, F_5=5, F_6=8, F_7=13F1=1,F2=1,F3=2,F4=3,F5=5,F6=8,F7=13).
0
1
2
FnF_nFn