Recent content by gwial

Ok, sorry if i put one line in section 2 when it was suppose to be in section 1. Thats just how our prof stated the question

Ok perfect thanks for the right direction.

Homework Statement Use strong mathematical induction to prove that the Fibonacci numbers satisfy the inequality fn > (√2)n Homework Equations for all integers n > 6. The Fibonacci numbers fn are defined recursively by: f0 =0,f1 =1 For all n > 1, fn = fn−1 + fn−2 The Attempt at a...