about account add arrow-down arrow-left arrow-right arrow-up back-arrow register-arrow book-mobile book categories chat-bubble-mobile chat-bubble close college contact-us credit-card drag email-square facebook-mobile facebook-square facebook faq film history home load modal-error person pinterest-square play-mobile play queue remove resume search share show star tick trailer trash twitter-mobile twitter-square twitter university warning warning youtube-square open-eye close-eye promo-tag tag check info info active
13

Strong Induction and the Fibonacci Numbers

Lecture no. 13 from the course: Prove It: The Art of Mathematical Argument

Strong Induction and the Fibonacci Numbers

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.

Reviews