17. You probably know the Fibonacci numbers 1,1,2,3,5,8,⋯ , where f n+2 =f n+1 +f n and we number as f 1 =1,f 2 =1 . Try applying the Euclidean algorithm to a pair of consecutive Fibonacci numbers? As a function or formula of n , how long does it take?