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

Can we print n distinct natural numbers such that their sum is not a fibonacci number?

Can we print n distinct natural numbers such that their sum is not a fibonacci number? for eg if n = 3 then 3 numbers can be 1, 2, 3 since 1+2+3=6 which is not a fibonacci number
spsp
  • 11
0
votes
0 answers

More about $\log(Fib(n))$ element of $\theta(n)$, as seen in these previous posts...

To demonstrate that this result below is true, but for all logarithm base greater than 1, can we just say that 'Logarithms in different bases differ only by a constant multiplier' ? $$\frac{n}{2}\log(2) = n\log(\sqrt{2}) \leq \log(F_n) \leq…
0
votes
2 answers

Given $F_m$ be the $m^\text{th}$ number in the Fibonacci sequence. Prove that for all natural $n$, $|F_n^2 + F_nF_{n + 1} - F_{n + 1}^2| = 1$.

Given $F_m$ be the $m^\text{th}$ number in the Fibonacci sequence. Prove that for all natural $n$, $$\large |F_n^2 + F_nF_{n + 1} - F_{n + 1}^2| = 1$$ (When I'm bored, I do random stuff.) There has been a solution below if you want to check out.…
0
votes
2 answers

Prove that for all natural $n$, $F_{2n - 1}^2 \equiv -1 \pmod {F_{2n + 1}}$ and $F_{2n + 1}^2 \equiv -1 \pmod {F_{2n - 1}}$.

Given $F_m$ be the $m^\text{th}$ number in the Fibonacci sequence. Prove that for all natural $n$, $$ F_{2n - 1}^2 \equiv -1 \pmod {F_{2n + 1}} \text{ and } F_{2n + 1}^2 \equiv -1 \text{ (mod }F_{2n - 1})$$ It is sufficient to prove…
0
votes
3 answers

Relation between $m$th Fibonacci number and Golden Ratio

Can anyone tell me how to interpret the following expression $F_m\sim\phi^m$? EDIT: The following answer was where I have seen this notation.
0
votes
0 answers

Formula for the Tribonacci sequence

Is there a formula for the Tribonacci sequence, where the formula for Fibonacci is: $$F_n=\frac{(1+\sqrt 5)^n-(1-\sqrt 5)^n)}{2^n\sqrt 5}.$$
BOB
  • 57
0
votes
2 answers

What is the first 11 digit prime of Fibonacci?

I am having difficulty finding the first eleven-digit prime number of Fibonacci.. If anyone has an answer I would greatly appreciate it. I'm mostly asking this because it's one part of a greater puzzle I am trying to solve..
0
votes
1 answer

Show that $F^2_{n+2} – F^2_{n-2}$ is not a multiple of a Fibonacci number.

For $F_n$ as n-th Fibonacci number, I tried for a few first numbers $n=2,3,4,5$ the numerical value of $F^2_{n+2} – F^2_{n-2}$. Unlike the previous exercises of the book, when the r.h.s. was another Fibonacci number, in this case I can't find a…
user200918
0
votes
1 answer

Why $\frac{F_{n+2}}{F_{n+1}}=1+\frac{F_n}{F_{n+1}}$?

Why $\frac{F_{n+2}}{F_{n+1}}=1+\frac{F_n}{F_{n+1}}$ (seems to) hold for every fibonacci number $F_n$?
0
votes
0 answers

Fibonacci sequence from natural numbers

Is there a manipulation that can be performed on the natural number sequence (1,2,3,...) in order to give the Fibonacci sequence? I know the recurrence relation starting from 1,1 and successively adding the two previous numbers of the sequence.…
Raghib
  • 347
0
votes
1 answer

Some proof question about Fibonacci sequence

The Fibonacci sequence as $f(n)$ (1) show that $f(n) \le (\frac{7}{4})^n$, for all$ n \ge 0$ (2) show that $f(n) \ge \frac{1}{3}(\frac{3}{2})^n$, for all $ n \ge 1$ thanks.
0
votes
2 answers

Sum of specific Fibonacci sequence

This is from problem 20 Is there a simplified expression for sum of Fibonacci numbers: $$F(a)+F(a+4)+F(a+8)+\ldots + F(a+4m)\;\;?$$ https://resources.thiel.edu/mathproject/atps/PDF/Chapt02.PDF It is problem 20. I am thinking that maybe I could…
Xia
  • 51
  • 3
0
votes
2 answers

Fibonacci solution..

Let $\ p(n)$ be a function which follows fibonacci sequence. Domain of function is only natural numbers. Now is there any way to figure out number of solutions for the equation $\ p(n) = n+1$ analytically?
0
votes
0 answers

proving that no positive integer can be written in two different ways as the sum of distinct non-consecutive Fibonacci numbers

How to prove that no positive integer can be written in two different ways as the sum of distinct non-consecutive Fibonacci numbers?
0
votes
0 answers

Is it true that F2n is divided by Fn (Fibonacci)

How can I prove that $F_{2n}$ is divisible by $F_n$ in the Fibonacci sequence?
eva
  • 107