The full step-by-step solution to problem: 7RQ from chapter: 5.R was answered by , our top Math solution expert on 06/21/17, 07:45AM. The answer to “a) Give a recursive definition of the Fibonacci numbers.________________b) Show that fn > an-2 whenever n? 3, where fn is the nth term of the Fibonacci sequence and a = (1 +?5)/2.” is broken down into a number of easy to follow steps, and 32 words. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. Since the solution to 7RQ from 5.R chapter was answered, more than 227 students have viewed the full step-by-step answer. This full solution covers the following key subjects: fibonacci, recursive, give, nth, Numbers. This expansive textbook survival guide covers 101 chapters, and 4221 solutions.