Questions tagged [fibonacci-numbers]

Questions on the Fibonacci numbers, a special sequence of integers that satisfy the recurrence $F_n=F_{n-1}+F_{n-2}$ with the initial conditions $F_0=0$ and $F_1=1$.

The $n$th Fibonacci number $F_n$ is defined recursively, by

$$F_n = F_{n - 1} + F_{n - 2}$$

for $n > 1$, and $F_0 = 0,\; F_1 = 1$. There is a closed form expression, namely

$$F_n = \frac{\varphi^n - (1 - \varphi)^n}{\sqrt{5}}$$

where the golden ratio $\varphi$ is equal to $\frac{1 + \sqrt{5}}{2}$.

Combinatorial identities involving the Fibonacci numbers have been extensively studied, and the numbers arise frequently in nature and in popular culture.

Reference: Fibonacci number.

2190 questions
1
vote
1 answer

Showing the fibonacci sequence for any number n

My lecturer was explaining how the Fibonacci sequence can be displayed for a number n. The formula is fib(n)=fib(n-1) +fib(n-2) Say we had to find the fib for 5 that would be: fib(5)= fib(5-1) +fib(5-2) =fib(4) + fib(3) =fib(3) +fib(1) =fib(2) + fib…
Alonso
  • 435
1
vote
1 answer

Fibonacci Mystery

I saw this on a "numberphile" video and tried to prove it but couldn't do anything. Theorem: Let $n \ge 2$ and $F_m$ is the $m^{\text{th}}$ number in the Fibonacci sequence. Then, if we look all $F_m$ ($m \ge 1$) in modulo $n$, we will have a…
1
vote
0 answers

Re-formation of Fibonacci sequence formula

I was doing some question on Fibonacci Sequence and came across this formula $$\large F_n = \frac{\left(\frac{1+\sqrt5}{2}\right)^n - \left(\frac{1-\sqrt5}{2}\right)^n}{\sqrt5}$$ I started thinking “Is there a better way to write this formula?…
1
vote
2 answers

Given a value of k, is it possible to express explicitly the collection of x satisfying Fib(x)=k

From Wikipedia, the formula to extend to all real the Fibonacci number is: $$ \text{Fib}(x)=\frac{\varphi^x - \cos(\pi x)\varphi^{-x}}{\sqrt 5} $$ Given a value of k, is it possible to express explicitly the collection of x satisfying Fib(x)=k ?
1
vote
0 answers

Calculate the nth term of the Fibonacci Sequence

The polynomial for the Fibonacci recurrence $F(n) = F(n-1) + F(n-2)$ is $$x^{2} = x + 1.$$ The solutions are : $ϕ = \frac{1+\sqrt 5}{2}$ and $ψ = \frac{1-\sqrt 5}{2}.$ So the Fibonacci sequence, for real number has the form $F(n) = u ϕ^{n} + v…
user231764
1
vote
3 answers

Prove that $F(n+3)=2F(n+1)+ F(n)$ for $n \ge 0$

The definition of a Fibonacci number is as follows: $$F(0)=0\\ F(1)=1\\ F(n)= F(n-2)+F(n-1)\text{ for }n\geq 2$$ Prove the given property of the Fibonacci numbers directly from the definition. $F(n+3)=2F(n+1)+ F(n)$ for $n$ greater than or equal to…
Natasha
  • 333
1
vote
3 answers

Proving Fibonacci Identites

Possible Duplicate: Showing that an equation holds true with a Fibonacci sequence: $F_{n+m} = F_{n-1}F_m + F_n F_{m+1}$ Hi! I needed to solve several Fibonaccii identites, but I couldn't come along with two of them. Could you please help me to…
muffel
  • 2,879
1
vote
1 answer

BlackWhite mathematics

I got this question: In the famous Atlantis city BlackWhite the houses have five levels and each level is painted either by black or by white paint, but two adjacent floors can’t be both black or they would anger the gods. (It is allowed to have…
Leo
  • 89
1
vote
2 answers

Fibonacci variant with small exponent

The standard Fibonacci sequence defined by $F(n) := F(n-1) + F(n-2)$ has exponential asymptotic growth as stated e.g. here (with the approximate base being the golden ratio). What happens if the recurrence equation is altered by adding an exponent…
silver
  • 794
1
vote
2 answers

Zeckendorf with Negative Fibonacci Numbers

Zeckendorf : Every positive integer N can be expressed uniquely as a sum of distinct non-consecutive Fibonacci numbers I was wondering if this theorem can be applied with the extended Fibonacci numbers, and especially I am looking for a way to find…
Crypto
  • 129
1
vote
2 answers

General tribonacci explicit formula

I have been thinking about finding an explicit formula for the tribonacci numbers, where, namely: $$a_n = a_{n-1}+a_{n-2}+a_{n-3}$$ and $a_1 = 0, a_1 = 1, a_2 = 1.$ Obviously, these beginning terms can be shifted, but we'll leave them as such for…
user817934
1
vote
0 answers

Why does the limit of adjacent numbers in the n-bonacci sequence approach 2 as n goes to infinity?

(1, 1.0) (2, 1.618033988749895) (3, 1.8392867552141612) (4, 1.9275619754829254) (5, 1.9659482366454852) (6, 1.9835828434243263) (7, 1.991964196605035) (8, 1.9960311797354147) (9, 1.9980294702622867) (10, 1.9990186327101012) (11,…
1
vote
1 answer

How can I show Fibonacci identity?

How can I Show a Fibonacci identity: $$\sum_{k=0}^{n}F_{k}F_{n-k}=\sum_{k=0}^{n}(k+1)F_{k+1}(-2)^{n-k}$$ Can anyone help me, i have no idea.
Kathe
  • 43
1
vote
3 answers

Fibonacci and the algebraic expression $x^2-x-1$

$$\left( \left( 1/2\,{\frac {-\beta+ \sqrt{{\beta}^{2}-4\,\delta\, \alpha}}{\alpha}} \right) ^{i}- \left( -1/2\,{\frac {\beta+ \sqrt{{ \beta}^{2}-4\,\delta\,\alpha}}{\alpha}} \right) ^{i} \right) \left( \sqrt{{\beta}^{2}-4\,\delta\,\alpha}…
1
vote
2 answers

Fibonacci matrix for different constant values in recurrence relation

For Fibonacci series we have a recurrence relation $F_n=F_{n-1}+F_{n-2}$.So the initial matrix can be written as $$A=\begin{bmatrix} 1 &1\\ 1 &0 \\ \end{bmatrix}$$ where $a_{11}=F_{n+1}, a_{21}$ and $a_{12}$ are $F_n$ and $a_{22}=F_{n-1}$ We can…
Lucifer
  • 11