Difference between revisions of "Divisibility of Fibonacci numbers"
Jump to navigation
Jump to search
m |
m |
||
| Line 2: | Line 2: | ||
In fact, a more general statement is true: | In fact, a more general statement is true: | ||
| − | + | '''Every n-th Fibonacci number (i.e. number <math> F_{nk} </math> for some k) is divisible by <math> F_n </math>, the n-th Fibonacci number.''' | |
Among the different ways to prove that is to use the matrix | Among the different ways to prove that is to use the matrix | ||
Revision as of 20:58, 20 December 2021
Recall that Fibonacci numbers are the members of the sequence 1, 1, 2, 3, 5, 8, ..., so that every next number is the sum of two previous numbers. It is a part of the mathematical folklore that every 5th Fibonacci number is divisible by 5. It also happens that 5 is the 5th Fibonacci number. In fact, a more general statement is true:
Every n-th Fibonacci number (i.e. number [math]\displaystyle{ F_{nk} }[/math] for some k) is divisible by [math]\displaystyle{ F_n }[/math], the n-th Fibonacci number.
Among the different ways to prove that is to use the matrix