ANSWERS IN MATH HOMEWORK

1. F0 = 0
F1 = 1
Fn+1 = Fn + Fn-1
Fn+1 - Fn-1= Fn + Fn-1 Fn-1
Fn = Fn+1 - Fn-1 FINAL ANSWER

2. Explanation:
Since the Fibonacci Series are equal to { 0 , 1 ,1 , 2 ,3 , 5 , 8 ,13 , … }and if k = 1, then the
value of k which is 1 so there are infinitely many Fibonacci numbers divisible by k.

3. a0 = a1 = 2
an+1 = 4an - 4an-1
an+1+ an-1 = 4an - 4an-1 + 4an-1
an+1+ 4an-1 = 4an
4an = an+1+ 4an-1
4 an an +1+ 4 a n−1
=
4 4
a +4a
an = n +1 4 n−1 FINAL ANSWER

4. an = 3n +1- 2 . 5n
a1 = 31+ 1- 2 . 51 = 32- 2 . 5 = 9 – 10 = - 1
a2 = 32 +1- 2 . 52 = 33- 2 . 52 = 27 – 50 = - 23
a3 = 33 +1- 2 . 53 = 3 4- 2 . 53 = 81 – 250 = - 169
So, the 3-term recurrence relation are -1, -23, -169

an = 3n +1- 2 . 5n + n2
a1 = 31+ 1- 2 . 51 + 12 = 0
a2 = 32 +1- 2 . 52 + 22 = -19
a3 = 33 +1- 2 . 53 + 32 = -160

5. (1)(0) – (1)(1)
0 - 1 = - 1n
 FINAL ANSWER: - 1n

6.

an = an-1 + 2bn-1 bn = -an-1 + 4bn-1

a0 = a0-1 + 2b0-1 b0 = -a0-1 + 4b0-1
a0 = a-1 + 2b-1 b0 = a-1 + 4b-1
0 = a-1 + 2b-1 Equation 1. 1 = a-1 + 4b-1 Equation 2.

0 = a-1 + 2b-1
1 = a-1 + 4b-1___
1 + 6 b−1
6= 6

1 7 1 1
b-1 = so, bn =- n+ 1 a-1 =- so, a-1 =+ n FINAL ANSWER
6 6 3 3

7. X0 = 18
10
Xn + 1 = X -X
3 n n–1
10
X0 + 1 = X –X
3 0 0–1
10
X1 = (18) – X– 1
3
X1 = 60 – X-1

8. Explanation:
Fm
Since the Fibonacci Series are equal to { 0 , 1 ,1 , 2 ,3 , 5 , 8 ,13 , … } So,
Fn

1 2
That is …., are equal to 1.
1 , 2,
1
9. The answer is .
2