{"id":183149,"date":"2026-02-18T11:17:53","date_gmt":"2026-02-18T10:17:53","guid":{"rendered":"https:\/\/liora.io\/en\/?p=183149"},"modified":"2026-02-18T11:17:53","modified_gmt":"2026-02-18T10:17:53","slug":"fibonacci-sequence-recursion-cryptography-and-the-golden-ratio","status":"publish","type":"post","link":"https:\/\/liora.io\/en\/fibonacci-sequence-recursion-cryptography-and-the-golden-ratio","title":{"rendered":"Fibonacci sequence: Recursion, cryptography and the golden ratio"},"content":{"rendered":"

In the world of mathematics, the importance of sequences and series in analysis is well established. Sometimes, it’s hard to find a concrete application for concepts invented (or discovered?) in the field. The Fibonacci sequence, on the other hand, can be found in many areas of nature, and continues to fascinate researchers thanks to its properties closely linked to the golden ratio.<\/strong><\/p>\n\n\n\n

History and background<\/h2>\n\n\n\n

The Fibonacci sequence<\/strong> takes its name from the 13th-century Italian mathematician Leonardo of Pisa, also known as Fibonacci. Although he didn’t invent the sequence, he introduced it to Europe with his book “Liber Abaci” (Book of the Abacus or Book of Calculation) in 1202.<\/p>\n\n\n\n

In this book, Fibonacci<\/strong> posed and solved a problem involving the growth of an idealized rabbit population, which leads to this sequence of numbers. It’s worth noting that the Fibonacci sequence was known long before this date in India, where the relationships between the numbers in the sequence were already being studied.<\/strong><\/p>\n\n\n\n

Fibonacci numbers have many applications in nature and art. They can be observed on a variety of scales, from flower petals to galaxy spirals. Flower petals often have Fibonacci<\/strong> numbers – daisies can have 34, 55 or even 89 petals. And sunflower seeds or pine cones are often arranged in spirals following Fibonacci numbers.<\/p>\n\n\n\n

In architecture, the golden ratio, directly linked to the Fibonacci sequence<\/strong>, has been used to create works that are pleasing to the eye thanks to their “perfect” proportions. For example, the Parthenon in Greece and the Taj Mahal in India both seem to use the golden ratio in their construction.<\/p>\n\n\n\n

It’s this universality that makes the Fibonacci sequence so fascinatin<\/strong>g – a simple sequence of numbers that finds its way through mathematics, nature and art, uniting fields that might seem remote at first glance. In the next section, we’ll take a closer look at what these numbers are and how we can generate them ourselves using the Python programming language.<\/a><\/p>\n\n\n\n\n\n\n\n

Romanesco cabbage hides a secret – count the number of spirals, if you can!<\/p>\n\n\n\n

\n
A better understanding of the Fibonacci sequence<\/a><\/div>\n<\/div>\n\n\n\n

Definition and implementation<\/h2>\n\n\n\n

Formally, the Fibonacci sequence<\/strong> is a sequence in which each term is equal to the sum of the two preceding elements. Just knowing the first two terms and the recurrence formula is enough to construct the sequence in its entirety.<\/p>\n\n\n\n

$F_0 = 0$, $F_1 = 1$ and $F_n = F_{n-1}+ F_{n-2}$ for $n geq 2$.<\/strong><\/p>\n\n\n\n

Building a program to provide the nth Fibonacci number<\/strong> is a very good elementary exercise. Before reading on, you can try coding the function yourself!<\/p>\n\n\n\n

Here’s a Python function to solve the problem:<\/p>\n\n\n\n

\t\t\t\t\tdef fibonacci(n):\n    if n in {0, 1}:\n        return n\n    return fibonacci(n-1) + fibonacci(n-2)\t\t\t\t<\/code><\/pre>\n\n\n\n
This initial recursive implementation may be satisfactory<\/strong>, but there is scope for optimizing this code by opting for an iterative approach. Recursion is very restrictive in terms of computation time; in fact, the time complexity of this function is O(n\u00b2). In practice, this means that the function struggles to deliver a result within a satisfactory timeframe when n is large (for example, n = 40).<\/p>\n\n\n\n
Here’s a new approach, this time iterative, which produces the same result using a for loop:<\/p>\n\n\n\n
\n\t\t\t\t\tdef fibonacci(n):\n    a, b, c= 0, 1, 0\n    if n == 0:\n        return 0\n    for i in range(2, n+1):\n        c = a + b\n        a = b\n        b = c\n    return b<\/code><\/pre>\n\n\n\n
One way of optimizing this code would be to cache the elements of the sequence as they are introduced, so as to avoid redundant calculations each time the function is called.<\/p>\n\n\n\n
In addition, there’s a mathematical formula for calculating the exact term of the sequence without recursion. Called Binet’s formula, it uses the golden ratio :<\/p>\n\n\n\n
\t\t\t\t\tdef fibonacci(n):\n    sqrt5 = math.sqrt(5)\n    F_n = int((( (1 + sqrt5) ** n - (1 - sqrt5) ** n ) \/ ( 2 ** n * sqrt5 )))\n    return F_n\t\t<\/code><\/pre>\n\n\n\n
Conclusion<\/h3>\n\n\n\n
The Fibonacci sequence<\/strong> is used in a wide variety of fields, such as cryptography and trading. Among other things, it can be used to generate a list of pseudo-random numbers or to create an elementary encryption system.<\/p>\n\n\n\n
In finance, a tool called the Fibonacci retracement level is used to estimate how far an asset could fall before resuming its trend movement. In time series analysis, Fibonacci<\/strong> numbers are used to determine the optimum number of time periods to use in calculating moving averages.<\/p>\n\n\n\n
\n
Mastering the Fibonacci sequence in Data Science<\/a><\/div>\n<\/div>\n\n\n\n