Proofing a Sum of the Fibonacci Sequence by Induction
In this exercise we are going to proof that the sum from 1 to n over F(i)^2 equals F(n) * F(n+1) with the help of induction, where F(n) is the nth Fibonacci number.
ā° Timeline 00:00 Exercise 00:10 Base case 00:47 Induction hypothesis 00:56 Induction step
š All Discrete Mathematics Exercises https://www.youtube.com/playlist?list=PLY9Po-aXYcD6LdOzLeBhcHIShPwCQNeSD
š All Linear Algebra Exercises https://www.youtube.com/playlist?list=PLY9Po-aXYcD5BnL_9CcYy421JLvwn9XHH
šµ Music Reverie by Nomyn https://soundcloud.com/nomyn Creative Commons ā Attribution 3.0 Unported ā CC BY 3.0 Free Download / Stream: http://bit.ly/2RM3qu4 Music promoted by Audio Library https://youtu.be/LRNX-lgE8mo ... https://www.youtube.com/watch?v=QUN1Rf36SKw
4545168 Bytes