Mathematics Stack Exchange
Mathematics Stack Exchange

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.

2003 questions
109
votes
5 answers

Fibonacci number that ends with 2014 zeros?

This problem is giving me the hardest time: Prove or disprove that there is a Fibonacci number that ends with 2014 zeros. I tried mathematical induction (for stronger statement that claims that there is a Fibonacci number that ends in any number…
VividD
  • 15,566
  • 8
  • 58
  • 114
67
votes
5 answers

Does every prime divide some Fibonacci number?

I am tring to show that $\forall a \in \Bbb P\; \exists n\in\Bbb N : a|F_n$, where $F$ is the fibonacci sequence defined as $\{F_n\}:F_0 = 0, F_1 = 1, F_n = F_{n-1} + F_{n-2}$ $(n=2,3,...)$. How can I do this? Originally, I was trying to show that…
Chanhee Jeong
  • 986
  • 9
  • 16
65
votes
3 answers

Closed form solution for $\sum_{n=1}^\infty\frac{1}{1+\frac{n^2}{1+\frac{1}{\stackrel{\ddots}{1+\frac{1}{1+n^2}}}}}$.

Let $$ \text{S}_k = \sum_{n=1}^\infty\cfrac{1}{1+\cfrac{n^2}{1+\cfrac{1}{\ddots1+\cfrac{1}{1+n^2}}}},\quad\text{$k$ rows in the continued fraction} $$ So for example, the terms of the sum $\text{S}_6$…
Simon Parker
  • 4,083
  • 2
  • 15
  • 23
60
votes
1 answer

Quadratic reciprocity via generalized Fibonacci numbers?

This is a pet idea of mine which I thought I'd share. Fix a prime $q$ congruent to $1 \bmod 4$ and define a sequence $F_n$ by $F_0 = 0, F_1 = 1$, and $\displaystyle F_{n+2} = F_{n+1} + \frac{q-1}{4} F_n.$ Then $F_n = \frac{\alpha^n -…
Qiaochu Yuan
  • 359,788
  • 42
  • 777
  • 1,145
55
votes
4 answers

The generating function for the Fibonacci numbers

Prove that $$1+z+2z^2+3z^3+5z^4+8z^5+13z^6+...=\frac{1}{1-(z+z^2)}$$ The coefficients are Fibonacci numbers, i.e., the sequence $\left\{1,1,2,3,5,8,13,21,...\right\}$.
Geeeee
  • 785
  • 1
  • 6
  • 9
53
votes
3 answers

Fibonacci infinite sum resulting in $\pi$

I found the following identity. While trying to prove it, I found some things that I don’t quite understand: $$\frac{\pi}{4}=\sqrt{5} \sum_{n=0}^{\infty} \frac{(-1)^n F_{2n+1}}{(2n+1) \phi^{4n+2}}$$ (where $\phi=\frac{\sqrt{5}+1}{2}$). What I…
user252450
50
votes
4 answers

Eyebrow-raising pattern of number of primes between terms of the Fibonacci number sequence?

So, $$1,1,2,3,5,8,13,21...$$ Any connection to primes?...it appears not. However, in between the Fibonacci numbers are how much primes? Let's see: $1$ and $1$: $0$ $1$ and $2$: $0$ $2$ and $3$: $0$ $2$ and $3$: $0$ $5$ and $8$: $1$ $8$ and $13$:…
HyperLuminal
  • 647
  • 5
  • 15
49
votes
4 answers

Given a Fibonacci number , find the next Fibonacci number

The Fibonacci sequence is $0, 1, 1, 2, 3, 5, 8, 13, 21, 34,\ldots$, where each term after the first two is the sum of the two previous terms. Can we find the next Fibonacci number if we are given any Fibonacci number? For example, if $n = 8$ then…
ppSpp
  • 759
  • 6
  • 14
45
votes
5 answers

Prove that any two consecutive terms of the Fibonacci sequence are relatively prime

Prove that any two consecutive terms of the Fibonacci sequence are relatively prime. My attempt: We have $f_1 = 1, f_2 = 1, f_3 = 2, \dots$, so obviously $\gcd(f_1, f_2) = 1$. Suppose that $\gcd(f_n, f_{n+1}) = 1$; we will show that…
Chan
  • 11,677
  • 17
  • 99
  • 139
44
votes
7 answers

Project Euler, Problem #25

Problem #25 from Project Euler asks: What is the first term in the Fibonacci sequence to contain 1000 digits? The brute force way of solving this is by simply telling the computer to generate Fibonacci numbers until it finds the first one that has…
Paul Manta
  • 3,405
  • 4
  • 33
  • 48
44
votes
5 answers

Is ${F_{n}}^2 - 28$ always a composite number?

The problem is as follows: Prove or disprove that if ${F_{n}}$ is $n$-th Fibonacci number, and $n>5$, then $${F_{n}}^2 - 28$$ cannot be a prime. I came across this problem accidentally while trying to solve another problem. I suspect that there is…
VividD
  • 15,566
  • 8
  • 58
  • 114
42
votes
8 answers

How are we able to calculate specific numbers in the Fibonacci Sequence?

I was reading up on the Fibonacci Sequence, $1,1,2,3,5,8,13,\ldots $ when I noticed some were able to calculate specific numbers. So far I've only figured out creating an array and counting to the value, which is incredibly simple, but I reckon I…
JonnyLitt
  • 623
  • 6
  • 10
42
votes
13 answers

How to prove that the Fibonacci sequence is periodic mod 5 without using induction?

The sequence $(F_{n})$ of Fibonacci numbers is defined by the recurrence relation $$F_{n}=F_{n-1}+F_{n-2}$$ for all $n \geq 2$ with $F_{0} := 0$ and $F_{1} :=1$. Without mathematical induction, how can I show that $$F_{n}\equiv F_{n+20}\pmod…
user225250
40
votes
2 answers

Fibonacci $\equiv -1 \mod p^2$

Is there a prime $p > 3$ such that the Fibonacci number $F_{np} \equiv -1 \mod p^2$ for some natural number $n$? I know none of the first $1000$ primes $> 3$ qualify. EDIT: In response to Calvin Lin's comment: Suppose $n$ is the period mod $p$. Of…
Robert Israel
  • 416,382
  • 24
  • 302
  • 603
38
votes
6 answers

Checking if a number is a Fibonacci or not?

The standard way (other than generating up to $N$) is to check if $(5N^2 + 4)$ or $(5N^2 - 4)$ is a perfect square. What is the mathematical logic behind this? Also, is there any other way for checking the same?
Quixotic
  • 21,425
  • 30
  • 121
  • 207
1
2 3
…
99 100