#1. Prove that n is odd if and only if n3 is odd for all n E N . #2. Prove that 1 f,, , 1 > ( +/ 5J_ ,for all n > I where f denotes the Fibonacci sequence. #3. Suppose that f is a recursively defined function from z +to z +such that /(1) =1and /(2) = 5 and...
