Hi, my name is Ross and I am a parent of a 18 year old who is taking a discrete mathematics class and ask me if I could help him out in figuring a question out, but I don't have the slightest clue how to figure this question out so if you could please help me with this question I would greatly appreciate it.


Let f0 = 0; f1 = 1,... be the Fibonacci sequence where for all n greater than or equal to 2 fn = fn-1 + fn-2. Let Q = (1+square root of 5)/2. Show that for all positive n greater than or equal to 0, fn less than or equal to Q^(n-1).



This is typically proved by mathematical induction ( a topic in the discrete math course).