**“Fibonacci Series”**, sounds familiar, right?

An Easy To Understand sequence represented as 0 1 1 2 3 5 8 13…. where each number is the sum of the preceding two numbers, with the series starting from 0, 1. But, did you ever realise how magical these numbers are?

Let’s get deeper into these numbers in this article.

Fibonacci numbers appear in so many contexts in our lives and surroundings, for example, the number of the petals in a flower, the seed heads of a flower, paintings and a lot more. In fact, the beauty of a human face is based on Golden Ratio whose nth power forms the nth Fibonacci number. (nth Fibonacci number is 1.618^{n} where **1.618 is the Golden ratio**).

These numbers display a lot of magical patterns.

Given the Fibonacci numbers: 1 1 2 3 5 8 13 21 34 55 89…

Let’s square these numbers: 1 1 4 9 25 64 169…….

The addition of two Fibonacci numbers gives us the next Fibonacci number. But, What’s so special about their squares ?

Look closely to see that the addition of the 2 consecutive numbers from this squared series of Fibonacci numbers would give you alternate Fibonacci numbers. Let’s realise this:

The squared Fibonacci series is: 1 1 4 9 25 64…

Now, 1+1 = 2

1+4 = 5 [the next alternate Fibonacci number to 2]

4+9 = 13 [the next alternate Fibonacci number to 5] And, so on..

1 1 **2** 3 **5** 8 **13** 21……

Let us now add more than 2 numbers of this squared series increasingly.

1+1+4 = 6

1+1+4+9 = 15

1+1+4+9+25 = 40

1+1+4+9+25+64 = 104

These do not seem to be Fibonacci numbers. But, if you analyse closely, you can see that these numbers enclose hidden Fibonacci numbers.

1+1+4=2* 3

1+1+4+9=3*5

1+1+4+9+25=5*8

1+1+4+9+25+64=8*13

But, why is it that? 1^{2}+1^{2}+2^{2}+3^{2}+5^{2}+8^{2} = 8*13

To show this, We would make squares with side length = the Fibonacci numbers and put them as shown:

Put the two squares with side length 1,1 side by side and the square with side 2 beneath them.

Add square of side length 3 to the side of the rectangle previously formed.

And, square of side length 5 beneath it.

What should be the area of this whole Rectangle, thus formed ?

Area of this rectangle = sum of the areas of squares inside it = 1^{2}+1^{2}+2^{2}+3^{2}+5^{2}+8^{2}

Also, Area of rectangle = length*breadth = 8*(8+5) = 104 which proves that

**1 ^{2}+1^{2}+2^{2}+3^{2}+5^{2}+8^{2} = 8 *13**

If we continue this process of merging these squares to form rectangles, we can get rectangles with dimensions:

8*13

13*21

21*34

34*55

55*89….

If we divide the dimensions of these rectangles keeping the larger dimension in the numerator, we end up with these figures:

8*13 => 13/8= 1.625

13*21 => 21/13 =1.615

21*34 => 34/21 = 1.619

34*55 => 55/34 = 1.6176

55*89 =>89/55 = 1.61818

As we continue dividing the dimensions of larger rectangles, we would get close to 1.618033… which is defined as the Golden Ratio.

This Golden Ratio, particularly is of great interest to mathematicians since it holds great significance in our surroundings and environment.

Reference: https://www.youtube.com/watch?v=SjSHVDfXHQ4

This article is contributed by **Saloni**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Check if a M-th fibonacci number divides N-th fibonacci number
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Working with Magic numbers in Linux
- Magic Square
- Find nth Magic Number
- Magic Square | Even Order
- Josephus Problem Using Bit Magic
- Check if a number is magic (Recursive sum of digits is 1)
- Count Magic squares in a grid
- Program for Fibonacci numbers
- Count Fibonacci numbers in given range in O(Log n) time and O(1) space
- Sum of Fibonacci Numbers
- Non Fibonacci Numbers
- GCD and Fibonacci Numbers
- Even Fibonacci Numbers Sum
- Large Fibonacci Numbers in Java
- Program to print first n Fibonacci Numbers | Set 1
- Largest subset whose all elements are Fibonacci numbers
- Interesting facts about Fibonacci numbers
- C Program for Fibonacci numbers