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

Determine the index of a given Fibonacci number

As shown here, the (rounded) index $n$ of a given Fibonacci number $F$ is calculated with $$ n(F) = \left\lfloor \log_\varphi (F \cdot \sqrt{5} + \frac12) \right\rfloor, $$ where $$ \log_\varphi(x) = \frac{\ln(x)}{\ln(\varphi)} =…
KLJ
  • 23
1
vote
3 answers

Prove $\sum^{k}_{i=0}{F(i)} + 1 = F(k+2)$ without induction

I want to prove that $\sum^{k}_{i=0}{F(i)} + 1 = F(k+2)$, where $F(0) = 0$, $F(1) = 1$ and for all $n \geq 2$, $F(n) = F(n-1) + F(n-2)$ without using induction. I want to prove it without induction because I want to implement the equation within…
1
vote
1 answer

Fibonacci-type Sequence Problem

Here is the question, If the tenth number in a Fibonacci-type sequence of increasing positive integers is 301, what is the fourth number? How do I go about solving this without overly complex math? EDIT | Fibonacci-type: the 2 previous numbers sum…
Jolly
  • 123
1
vote
3 answers

Even Fibonacci terms

I'm doing a high school level question and one of the questions is figuring out which of the Fibonacci sequence numbers must be even. The 61st, 62nd, 63rd, 64th, or 65th. And the only information I'm given is how the sequence is defined…
Eli
  • 97
1
vote
1 answer

Prove that $\sum ^n_{i=1 }(-1)^{i-1}F_{2i}=(-1)^{n+1}F_nF_{n+1}$by inductiProve that $F_0-F_2+F_4-F_6+F_8-.....=(-1)^{n+1}F_nF_{n+1}$

Prove that $\sum ^n_{i=1 }(-1)^{i-1}F_{2i}=(-1)^{n+1}F_nF_{n+1}$by induction my attempt: for $n=1$ LHS=RHS=1 suppose this is true for $n$ i.,e $F_2+F_4-F_6+F_8-.....+(-1)^{n-1}F_{2n}=(-1)^{n+1}F_nF_{n+1}$ now we have to prove for $n+1$ so consider…
1
vote
1 answer

Given a fibonacci sequence where $f(n)=f(n-1)+f(n-2) for \space n\ge 2 $and $f(0)=0,f(1)=1$

Prove that there exists four non-negative integers n for which $f(f(n))=f(n)$ I tried to solve it by: $f(f(n-1)+f(n-2))=f(n)$ Thus $f(n-1)+f(n-2)=n$(But I am confused at this) Please give me atleast one hint to solve this problem. For some users…
Saradamani
  • 1,579
1
vote
1 answer

Prove that the Fibonacci numbers obey the identity $\sum_{i=0}^{n} [f(i)]^2=f(n)f(n+1)$ for $n\ge 0$

Prove that the Fibonacci numbers obey the following identity $$\sum_{i=0}^{n} [f(i)]^2=f(n)f(n+1)\;\;\;\;\ n\ge 0$$ Here, $f(0) = 1$. How can we prove this inequality? I have no idea from here.
user546987
1
vote
2 answers

A proof regarding the Fibonacci Sequence.

Say, $F_i$ describes the $i\:th$ term of the Fibonacci sequence where $i\geq0$. I am trying to prove $F_i=\lfloor\dfrac{\phi^i}{\sqrt{5}}+\dfrac{1}{2}\rfloor$, where $\phi$ and $\hat\phi$ are the roots of the equation $x^2-x-1=0$. Also,…
User9523
  • 2,094
1
vote
1 answer

Fibonacci Number Equals to The number of compositions of n+2 using integers $\ge2$

My textbook provides following task - Prove combinatorially following statement : The number of compositions of $n+2$ using integers $\ge2$ is a Fibonacci number So I had tried first several few numbers : (1) if $n = 0$, $n+2 =2$ and it only…
Beverlie
  • 2,645
1
vote
3 answers

Fibonacci numbers prove by induction that $F(n)>2n$ for $ n>7$

So I am having trouble proving that $F(n)>2n$ for all $n>7$. for base case I took n=8, so obviously $f(8)=21> 2*8= 16$ Assuming$ f(n)>2n$ $f(n+1)>2(n+1)$ $f(n)+f(n-1)>2n+2$ $f(n)> 2n$ according to the induction hypothesis and since $n>7$ ,$f(n-1)$…
Lola1984
  • 313
1
vote
1 answer

fibonacci question

Possible Duplicate: Recurrence relation, Fibonacci numbers $(a)$ Consider the recurrence relation $a_{n+2}a_n = a^2 _{n+1} + 2$ with $a_1 = a_2 = 1$. $(i)$ Assume that all $a_n$ are integers. Prove that they are all odd and the integers $a_n$ and…
shingi
  • 19
1
vote
1 answer

What is the name of the "unique" numbers in Fibonacci-like integer sequences?

The first 6 numbers of the Fibonacci is sometimes written as: 0, 1, 1, 2, 3, 5 (fib1) Or 1, 1, 2, 3, 5, 8 (fib2) Then there are the Lucas numbers: 2, 1, 3, 4, 7, 11 However, what I am doing is starting the sequence counter at 0 and continuing…
aiwyn
  • 121
1
vote
1 answer

The time complexity of Fibonacci Sequence

I saw some textbook about the worst-case time complexity of Fibonacci Sequence. However, I have the following question:
SinLok
  • 135
1
vote
0 answers

Fibonacci modular results

5 divides every 5th Fibonacci number. When I did this, it resulted in Lucas number series. EXAMPLES 3,5,8,13,21 21/5= 4.25 5,8,13,21,34 34/5= 6.85 8,13,21,34,55 55/5= 11 QUESTION Does "5 divides every 5th Fibonacci number" the MOST…
Paul
  • 11
1
vote
1 answer

How to show this Fibonacci identity? $f_{3n}=f^3_{n+1} + f^3_n - f^3_{n-1}$

I already know that $f_{n+m}=f_{n-1}f_m + f_nf_{m+1}$. By letting $m=n$ it immediately follows that $f_{2n}=f_{n}(f_{n+1} + f_{n-1})$ and from that we get $f_{2n}=f^2_{n+1} - f^2_{n-1}$. From this one should be able to see that $f_{3n}=f^3_{n+1} +…
Miriam
  • 565