Strong Induction and the Fibonacci Numbers
Lecture no. 13 from the course: Prove It: The Art of Mathematical Argument
Taught by Professor Bruce H. Edwards | 30 min | Categories: The Great Courses Plus Online Mathematics Courses
Use a technique called strong induction to prove an elementary theorem about prime numbers. Next, apply strong induction to the famous Fibonacci sequence, verifying the Binet formula, which can specify any number in the sequence. Test the formula by finding the 21-digit-long 100th Fibonacci number.