See On Github

Wikipedia Description

In mathematics, the Fibonacci numbers or Fibonacci sequence are the numbers in the following integer sequence : or (often, in modern usage): By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence F n of Fibonacci numbers is defined by the recurrence relation with seed values or The Fibonacci sequence is named after Italian mathematician Fibonacci. His 1202 book Liber Abaci introduced the sequence to Western European mathematics, although the sequence had been described earlier in Indian mathematics. By modern convention, the sequence begins either with F 0 =0 or with F 1 =1. The Liber Abaci began the sequence with F 1 =1. Fibonacci numbers are closely related to Lucas numbers in that they are a complementary pair of Lucas sequences. They are intimately connected with the golden ratio ; for example, the closest rational approximations to the ratio are 2/1,3/2,5/3,8/5,.... Applications include computer algorithms such as the Fibonacci search technique and the Fibonacci heap data structure, and graphs called Fibonacci cubes used for interconnecting parallel and distributed systems. They also appear in biological settings, such as branching in trees, phyllotaxis (the arrangement of leaves on a stem), the fruit sprouts of a pineapple, the flowering of an artichoke, an uncurling fern and the arrangement of a pine cone 's bracts. https://en.wikipedia.org/wiki/Fibonacci_number

Tags
recursion

Implementations