A Nice Fibonacci Reciprocal Sum
Offered By: Michael Penn via YouTube
Course Description
Overview
Explore a fascinating mathematical concept involving reciprocals of Fibonacci numbers in this 23-minute video lecture. Delve into the calculation of a sum using reciprocals of 1+f_{2n+1}, where f_m represents the mth Fibonacci number. Follow along as the instructor guides you through various proof methods, including induction, monotone, and induction formula. Learn how to apply Lemma 1 and gain a deeper understanding of this intriguing mathematical problem. Perfect for mathematics enthusiasts and students looking to expand their knowledge of number theory and Fibonacci sequences.
Syllabus
Intro
Proof by induction
Proof by monotone
Proof by induction formula
Apply lemma 1
Take it home
Taught by
Michael Penn
Related Courses
Introduction to Algorithms and Data structures in C++Udemy Fundamentals of Dynamic Programming
LinkedIn Learning Discrete Math
Math at Andrews via YouTube Big O Notation - Full Course
freeCodeCamp Why Don't They Teach Newton's Calculus of What Comes Next?
Mathologer via YouTube