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
17
votes
3 answers

How many numbers are in the Fibonacci sequence below a given threshold?

Assuming I'm asked to generate Fibonacci numbers up to N, how many numbers will I generate? I'm looking for the count of Fibonacci numbers up to N, not the Nth number. So, as an example, if I generate Fibonacci numbers up to 25, I will generate: 1,…
17
votes
5 answers

Fibonacci's final digits cycle every 60 numbers

How would you go about to prove that the final digits of the Fibonacci numbers recur after a cycle of 60? References: The sequence of final digits in Fibonacci numbers repeats in cycles of 60. The last two digits repeat in 300, the last three in…
crazyGuy
  • 273
  • 1
  • 2
  • 6
16
votes
2 answers

Fibonacci[n]-1 is always composite for n>6. why?

In[11]:= Select[Table[Fibonacci[n], {n, 1, 10000}], PrimeQ[# - 1] &] Out[11]= {3, 8} Edit: Fibonacci[n]-1 is always composite for n>6. why? $$\sum\limits_{i = 0}^n {{F_i}} = {F_{n + 2}} - 1$$ In[16]:= Select[Table[Fibonacci[n], {n, 1, 10000}],…
a boy
  • 841
13
votes
5 answers

Why does the Fibonacci Series start with 0, 1?

The Fibonacci Series is based on the principle that the succeeding number is the sum of the previous two numbers. Then how is it logical to start with a 0? Shouldn't it start with 1 directly?
Graviton
  • 526
  • 1
  • 3
  • 14
9
votes
3 answers

Significance of starting the Fibonacci sequence with 0, 1....

DISCLAIMER: I do not deal with in-depth mathematics on a daily basis as some of you may, so please pardon my ignorance or lack of coherence on this topic. QUESTION: What is the significance of starting the Fibonacci sequence with $0,1$ ? For…
9
votes
4 answers

Is Binet's formula for the Fibonacci numbers exact?

Is Binet's formula for the Fibonacci numbers exact? $F_n = \frac{(1+\sqrt{5})^n-(1-\sqrt{5})^n}{2^n \sqrt{5}}$ If so, how, given the irrational numbers in it? Thanks.
N. McA.
  • 190
8
votes
5 answers

Show that $f(2n)= f(n+1)^2 - f(n-1)^2$

Let $f(n)=f(n-1)+f(n-2)$ be the Fibonacci sequence with $f(0)=0,f(1)=1$. Show that $$f(2n)= f(n+1)^2 - f(n-1)^2.$$ I have tried several different approaches to this problem. Both inducting from the rhs and the lhs, and I end up going in circles. Any…
user97701
8
votes
4 answers

Fibonacci sequence: how to prove that $\alpha^n=\alpha\cdot F_n + F_{n-1}$?

Let $F_n$ be the $n$th Fibonacci number. Let $\alpha = \frac{1+\sqrt5}2$ and $\beta =\frac{1-\sqrt5}2$. How to prove that $\alpha^n=\alpha\cdot F_n + F_{n-1}$? I'm completely stuck on this question. I've managed to take the equation form of $F$ and…
Bas
  • 83
8
votes
1 answer

For which $N$ is it possible to arrange all whole numbers from $1$ to $N$ in such a way that every adjacent pair sums up to a Fibonacci number?

Recently I came up with a problem regarding Fibonacci numbers: For which $N$ is it possible to arrange all whole numbers from $1$ to $N$ in such a way that every adjacent pair sums up to a Fibonacci number? I have manually tested a bunch of cases…
7
votes
2 answers

Why are the Fibonacci quotients $\frac{F_{2n}}{F_{2n+1}}$ the only rationals that make $\frac{x}{1 - x - x^2}$ a non-negative integer?

I've been studying A081018 as part of a programming challenge. Skipping some of the introductory material, the crux of the question is that we have the equation $$S = \frac{x}{1 - x - x^2}$$ and we want to know which values $x \in \mathbb{Q}$…
7
votes
4 answers

Is there a Fibonacci number whose square is another Fibonacci?

Introduction We’re all familiar with the Fibonacci sequence: $1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 \ldots$ I was messing around a little on a piece of paper and came to the conclusion that there wouldn’t be any numbers from the sequence that when…
D. Ataro
  • 181
  • 6
7
votes
4 answers

Fibonacci Sequence explained to a noob

I've wanted to code something. I decided to take up simulating the Fibonacci sequence. Except: I can't understand what I thought is a simple process. I want to start at the very beginning which from what I see is $(0,1)$. Well. $0 + 1 = 1$. I get…
3man75
  • 89
  • 2
7
votes
1 answer

Fibonacci in Arithmetic Progression

I was reading a book, where the author said, with no proof, that No four distinct fibonacci numbers are in arithmetic progression. I tried with no progress for about one hour. Can anyone show me a proof, please?
6
votes
3 answers

Fibonacci sequence: Given $n$ and $\mathrm{Fib}(n)$, is it possible to calculate $\mathrm{Fib}(n-1)$?

Given $n$ and $\newcommand{\Fib}{\mathrm{Fib}} \Fib(n)$, is it possible to calculate the previous number in the Fibonacci sequence - $\Fib(n-1)$ using integer math in constant time? In other words, I believe I'm looking for a closed form…
sevzas
  • 161
6
votes
5 answers

Summation of Fibonacci numbers $F_n$ with $n$ odd vs. even

Compare the summation below: $$\begin{align} \smash[b]{\sum_{i=1}^n F_{2i-1}}&=F_1+F_3+F_5+\cdots+F_{2n-1}\\ &=1+2+5+\cdots+F_{2n-1}\\ &=F_{2n}\\ \end{align} $$ with this one: $$\begin{align} \smash[b]{\sum_{i=1}^n…
1
2 3
11 12