Here,
$F(0) = 0, F(1) = 1,$ and $F(n) = F(n − 1) + F(n − 2)$ for $n ≥ 2.$
Please give hints, not full answers.
Thanks!
Hints:
The $(kn)^{\text{th}}$ Fibonacci number is a multiple of $F(n)$, where $k, n \in \Bbb{N}$.
$2013 = 3 \cdot 11 \cdot 61$
Copyright © 2021 JogjaFile Inc.
Hints:
The $(kn)^{\text{th}}$ Fibonacci number is a multiple of $F(n)$, where $k, n \in \Bbb{N}$.
$2013 = 3 \cdot 11 \cdot 61$