For $n \ge 0$, let $f_n$ denote the $n$th fibonacci number (that is, $f_0 = 0, f_1 = 1$, and $f_n = f_{n-1} + f_{n-2}$ for all $n \ge 2$). what is the greatest possible value of the greatest common divisor of two consecutive fibonacci numbers?

Maci and i are making a small kite. two sides are 10". two sides are 5". the shorter diagonal is 6". round all your answers to the nearest tenth. 1. what is the distance from the peak of the kite to the intersection of the diagonals? 2. what is the distance from intersection of the diagonals to the top of the tail? 3. what is the length of the longer diagonal?