1. Math
  2. Advanced Math
  3. 1 let fnngt i denote the fibonacci sequence le f1f2...

Question: 1 let fnngt i denote the fibonacci sequence le f1f2...

Question details

1. Let {Fn}n> i denote the Fibonacci sequence, le., F1-F2 = 1 and Fn+ 2-Fn+1 + F, for n 2 1. (a) [3 points) Show that ged(Pnt1, F) ged(F, F for every n 2 2. Using this relation, prove that ged(F, ) -1 for every n2 1. (b) (2 points] Using induction, prove that Fsn is an even integer for every n 2 1.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution