Fibonacci Numbers
- Get link
- X
- Other Apps
The sequence of numbers that starts as $1,1,$ and continues with each new number calculated as the sum of the previous two numbers, i.e.,
$1,1,2,3,5,8,13,21,34,55,89,144....$
is called the sequence of Fibonacci numbers. It was first described in 1202 by Leonardo of Pisa, better known as Fibonacci. It appeared in his book Liber Abaci as the solution to a problem involving the growing number of rabbits over time. Since then, Fibonacci numbers have seen many interesting applications and connections to a variety of topics, both within mathematics and in other disciplines, such as computer science, physics, chemistry, biology, and architecture.
This pattern of Fibonacci numbers is given by $u_1 = 1, u_2 = 1$ and the recursive formula
$u_n = u_{n-1} + u_{n-2}, n > 2$.
Simple Properties of Fibonacci Numbers
$1.$
Sum of the Fibonacci Numbers
The sum of the first n Fibonacci numbers can be expressed as
$u_1 + u_2 + ... + u_{n-1} + u_n = u_{n+2} − 1.$
$2.$
Sum of Odd Terms
The sum of the Odd Terms of a Fibonacci sequence can be expressed as
$u_1 + u_3 + u_5 +... + u_{2n-1} = u_{2n}.$
$3.$
Sum of Even Terms
The sum of the Even Terms of a Fibonacci sequence can be expressed as
$u_2 + u_4 + u_6 +... + u_{2n} = u_{2n+1} - 1.$
$4.$
Sum of Fibonacci Numbers with Alternating Signs
The sum of the Fibonacci numbers with alternating signs can be expressed as
$u_1 - u_2 + u_3 - u_4 +...+(-1)^{n+1}u_n = (-1)^{n+1}u_{n-1} + 1.$
$5.$
Sum of Squares
The sum of the squares of the first n Fibonacci numbers can be expressed as
$u^2_1 - u^2_2 +...+u^2_{n-1} + u^2_n = u_nu_{n+1}.$
$6.$
Difference of Squares of Fibonacci Numbers
$u_{2n} = u^2_{n+1} - u^2_{n-1} $
- Get link
- X
- Other Apps
Comments
Post a Comment