**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Generalizations of Fibonacci numbers

Summary

In mathematics, the Fibonacci numbers form a sequence defined recursively by:
:F_n =
\begin{cases}
0 & n = 0 \
1 & n = 1 \
F_{n - 1} + F_{n - 2} & n > 1
\end{cases}
That is, after two starting values, each number is the sum of the two preceding numbers.
The Fibonacci sequence has been studied extensively and generalized in many ways, for example, by starting with other numbers than 0 and 1, by adding more than two numbers to generate the next number, or by adding objects other than numbers.
Extension to negative integers
Using F_{n-2} = F_n - F_{n-1}, one can extend the Fibonacci numbers to negative integers. So we get:
:... −8, 5, −3, 2, −1, 1, 0, 1, 1, 2, 3, 5, 8, ...
and F_{-n} = (-1)^{n + 1} F_n.
See also Negafibonacci coding.
Extension to all real or complex numbers
There are a number of possible generalizations of the Fibonacci numbers which include the real numbers (and sometimes the complex numbers) in their domai

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related people

No results

Related publications

No results

Related units

No results

Related concepts

No results

Related lectures

Related courses

No results

No results