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
4
votes
2 answers
4
votes
2 answers

Number of Fibonacci numbers in a range

The definition of the Fibonacci numbers is given by: $$\begin{align}f_1 &= 1;\\ f_2 &= 2;\\ f_n &= f_{n-1} + f_{n-2},\qquad (n >= 3); \end{align}$$ now we are given two numbers $a$ and $b$, and we have to calculate how many Fibonacci numbers are in…
4
votes
2 answers

Sets with out letters that are consecutive

If we have a set that is the alphabet, $\{a,b,..y, z\}$ then how many subsets exist that do not contain consecutive letters? I figured out that a subset of size $1$ has $2$ elements, size $2$ has $3$ elements, size $3$ has $5$ and so on which is the…
tantan69
  • 145
4
votes
3 answers

How to define an increasing sequence of additive values

Let's say I have the following sequence: 25, 50, 75, 100, 125, 150 Each time, 25 is added to the previous value. Now, let's say I have a cumulative version of this: 25, 75, 150, 250 Can I define this using the Fibonacci sequence? How do I find the…
4
votes
1 answer

Show that $\arctan\left({1\over A}\right)=\arctan\left({1\over B}\right)+\arctan\left({1\over C}\right)$

$1,1,2,3,5,8,...$ for $n=1,2,3,4,5,...$ ;It is the n-th Fibonacci numbers. Show that, $\arctan\left({1\over xF_{2n-1}+F_{2n}}\right)=\arctan\left({1\over xF_{2n-1}+F_{2n+1}}\right)+\arctan\left({1\over x^2F_{2n-1}+xF_{2n+2}+F_{2n+2}}\right)$ I…
4
votes
1 answer

First Fibonacci Number with Given Remainder

I wonder is there more effective algorithm than brute-force-search to find the first Fibonacci number with given remainder $~~r~~$ modulo given integer $~~m~~$. $$ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, ...$$ If $~~m=6~~$ and $r=0$ …
Igor
  • 2,153
  • 16
  • 19
4
votes
2 answers

Modulus of sum of sequence of Fibonacci numbers

What is the most efficient way to find the modulus of sum of sequence of fibinacci numbers. For example (F(N) + F(N + 1) + ... + F(M)) mod 1000000007.
3
votes
0 answers

Are $1$ and $3$ the only numbers of the form $2^n-1$ that exist in the Fibonacci sequence?

Are $1$ and $3$ the only numbers of the form $2^n-1$ that exist in the Fibonacci sequence? Then, if they are not the only ones, are there infinite cases? I have tried finding another example using a program, but could not find any, thus my…
Dane Bouchie
  • 1,282
3
votes
0 answers

Fibonacci applied to human population living to dead ratio problem

If this forum is not the right one for my question, please redirect it. I do not know where to ask it. The question might seem tongue-in-cheek, believe me it's not! Last week to occupy my mind, I used this little mathematics trick to find the ratio…
3
votes
2 answers

Non integer Fibonacci numbers

I'm pretty sure we're all familiar with the Fibonacci sequence. Most people with more than passing knowledge of this most marvelous gem are aware of the Binet formula, $Fib(n) = (\varphi^n - (-\varphi)^n)/\sqrt{5}$. Unfortunately, this doesn't allow…
corsiKa
  • 586
3
votes
1 answer

Cycles in the Generalized Fibonacci Sequence modulo a Prime

Suppose I have a fibonacci sequence 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 Now if I have a modulo 5 fibonacci sequence,it will look like 0 1 1 2 3 0 3 3 1 4 0 4 4 3 2 0 2 2 4 1 0 1 1 2 3 0 3 3 1 If I have modulo 7 fibonacci…
Naveen
  • 31
3
votes
1 answer

Formally Prove that the Ratio of Fibonacci Numbers is Always Greater than 1.5

Consider the Fibonacci number $1,2,3,5,8,13,21,\cdots.$ It is well known that the limit of the ratio of Fibonacci numbers tends to the Golden Ratio $\phi$. Today, I want to show that $1.5$ is the smallest ratio between any two fibonacci numbers…
mathz2003
  • 532
3
votes
1 answer

Have I correctly derived an inverse to the Binet formula?

I was interested by another user's question on finding such an inverse and in particular noted Will Orrick's comment in the best answer that one can square both sides to obtain a quartic.I thought I'd solve that quartic. For clarity, here is the…
Lee Sleek
  • 1,682
3
votes
2 answers

Prove that at least one of the first $10^6$ Fibonacci numbers is divisible by 1000

I need to prove that at least one of the first 1000000 Fibonacci numbers is divisible by 1000 and I really don't know how to approach it
3
votes
1 answer

the sum of $f_0+f_2+f_4+f_6+\cdots+f_{2n}$

I really feel like I am missing something. Geometricly, this sum is clear: it's $f_{2n+1}-1$ $$\require{cancel}$$ But when I use the identity $f_{2n}=f_{n+1}^2-f_{n-1}^2$ I get the…
1 2
3
11 12