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
6
votes
1 answer

Sum of digits in Fibonacci sequence

This is my first question here so please go easy on me. If you add the digits of each number on the Fibonacci sequence until your number is less than 10, it seems that you get a pattern of 24 numbers which is: 1 2 3 5 8 4 3 7 1 8 9 8 8 7 6 4 1 5 6 2…
xpy
  • 223
6
votes
1 answer

Why are Fibonacci-resistant numbers the golden rectangle numbers?

Let ${}_{1,1}f_n$ be the $n$-th Fibonacci number, where the $1,1$ subscript indicates the sequence starts with $1,1,2,3,5,8,13,\ldots$. So the Lucas numbers are ${}_{2,1}f_n$, leading to $2,1,3,4,7,11,\dotsc$. Consider all ${}_{a,b}f_n$ with $a,b…
6
votes
3 answers

If $f_{n-1}^2=(f_n/2)^2+h^2$ then $n=6$

How can I prove that if $f_n$ is a term of the Fibonacci sequence divisible by $4$ and if $$f_{n-1}^2=(f_n/2)^2+h^2,$$ $h\in\Bbb Z^+$ then $n=6$? I know that since $\gcd(f_k,f_{k+1})=1$ for every $k\in\Bbb N$ then $h$ must be odd and that if…
CIJ
  • 3,437
  • 1
  • 12
  • 19
5
votes
1 answer

Why Fibonacci numbers are too often found on nature?

Fibonacci number has something to do with natural growth. Though the function is very straight forward, we see this in nature. Does nature follow the function or its the simplified model of the function that nature follows? Where do we see Fibonacci…
5
votes
3 answers

How to compute the nth number of a general Fibonacci sequence with matrix multiplication?

If we want to compute the nth Fibonacci number we just power the matrix $M = \left[\begin{array}{cc} 1 & 1 \\ 1 & 0 \end{array}\right]$ $n$ times and we get $M =\left[ \begin{array}{cc} F_{n+1} & F_n \\ F_n & F_{n-1} \end{array}\right]$ But, How…
5
votes
2 answers

Prefix of Fibonacci number

Given some prefix how can we check if this prefix belongs to a Fibonacci number? If yes then to which one? By the prefix of number I define first $n$ digits. For example 10 is prefix of 10231 1234 is prefix of 1234592 and so on. I was trying to get…
5
votes
1 answer

Fibonacci identity

The Fibonacci numbers, given by $f_0 = 1$, $f_1 = 1$ and $f_n = f_{n-1} + f_{n-2}$, for $n \geq 2$ have many interesting properties. Many of these interesting properties can be easily proven combinatorially by interpreting the Fibonacci numbers as…
Gandhi
  • 575
5
votes
1 answer

Prove that $F_{n}^{2}+F_{n+1}^{2}=F_{2n+1}$

Prove that $F_{n}^{2}+F_{n+1}^{2}=F_{2n+1}$ This identity holds for $n>=1$ Instead of using induction, how do I prove it in a geometry approach?
user89260
  • 109
5
votes
2 answers

Solve the recurrence of $T(n)= 3T(n-1)+1$ with $T(0)=2$ by iteration of the recurrence

Solve the recurrence of $T(n)= 3T(n-1)+1$ with $T(0)=2$ by iteration of the recurrence. (I was told that there is no need to prove it by induction) I googled "iteration of the recurrence." I did not really get much except general proofs. Does…
Natasha
  • 333
5
votes
1 answer

How to invert Binet's formula for Fibonacci numbers

According to Wikipedia, it is possible to invert Binet's formula for Fibonacci numbers: $$F_n = \frac{\varphi^n-\psi^n}{\varphi-\psi} = \frac{\varphi^n-\psi^n}{\sqrt 5}$$ where $\varphi = \frac{1 + \sqrt{5}}{2} \approx 1.61803\,39887\ldots$ and…
hkBst
  • 455
5
votes
2 answers

What is the value of $\sum_{n=1}^\infty \frac{1}{F_n F_{n+4}}$ where $F_n$ is nth Fibonacci number?

I found this problem from my old note, with the memo 'The answer is very interesting." But I forgot how to solve it! I rummaged through all my bookshelf, but I couldn't find any clue. The only thing I remember is Partial fraction decomposition is…
okw1124
  • 653
  • 3
  • 10
5
votes
4 answers

Identity of Fibonacci sequence

Let $F_n$ be a Fibonacci sequence with initial terms $F_0=0, F_1=1$ and $F_{n+1}=F_n+F_{n-1}$ for $n\geqslant 1$. Prove that $F_n^2+F_{n+1}^2=F_{2n+1}$ for $n\geqslant 0$ (with mathematical induction). My efforts: For $n=0$ it is true. Suppose that…
RFZ
  • 16,814
5
votes
1 answer

Is the $k$th Fibonacci's rabbit young or adult?

Consider the rabbit Fibonacci problem. We start with one young rabbit couple. At each step, young rabbit couple grows to adult rabbits and adult rabbit couples give birth a young couple. If we denote A for an adult couple and y for a young couple,…
Lærne
  • 2,515
5
votes
1 answer

Proving that every integer has a Fibonacci number multiple

Show that for any positive integer, there exists a Fibonacci number N such that N is divisible by the integer. I'm not really sure how to begin my approach to this problem, would really appreciate any help!
user282727
4
votes
3 answers

Applying Fibonacci Fast Doubling Identities

So I sort of understand of how these identities came about from reading this article. $F_{2n+1} = F_{n}^2 + F_{n+1}^2$ $F_{2n} = 2F_{n+1}F_{n}-F_{n}^2 $ But I don't understand how to apply them. I can certainly derive these identities myself…
1
2
3
11 12