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$.

learn more… | top users | synonyms

1
vote
1answer
36 views

Prove fibonacci with matrixes [duplicate]

I have a question which i could not figure out the answer to, it was the hardest of them all that i got and i couldnt figure it out, its a proof of fibonaccis serie using matrixes and i need som help ...
3
votes
3answers
1k views

Why is fibonacci coding useful?

I have read this wiki article but it seems not very clear to me. Why should we ever use fibonacci coding in data compression if even regular binary coding always gives better results? I mean, it seems ...
2
votes
3answers
52 views

Proof with Fibonacci Sequence

I was working on my homework assignment for one of my classes and I have come across a proof question that my classmates and I are finding difficult to answer. The problem is asking us to prove that ...
1
vote
1answer
26 views

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 ...
3
votes
1answer
41 views

Fibonacci sequence in the factorization of certain polynomials having a root at the Golden Ratio

I was playing around with the Golden Ratio $\Phi = \frac{1 + \sqrt 5}{2}$ on Wolfram Alpha and I noticed that if $F_n$ denotes the $n{th}$ Fibonacci number, then the polynomial $P_n(x) = x^n - F_n x - ...
5
votes
0answers
125 views

Are all totients of Fibonacci Numbers distinct?

This question was inspired while I was seeing how certain recurrence relations would behave when I applied Multiplative Functions. Let $F_{n}$ be a sequence for which $F_{1}=1,F_{2}=1$, and ...
1
vote
0answers
25 views

How to make inductive step for a Fibonacci proof [duplicate]

I have to prove $F^2_{n−1} = F^2_n + F^2_{n−1}$ for any $n >=1$ by induction (for the Fibonacci sequence). For the basis step, I have: $n = 1; $ $F_{(1)-1} = F^2_{(1)} + F^2_{(1)-1} ->$ $ ...
2
votes
2answers
169 views

Applying Fibonacci Fast Doubling Identities

So I sort of understand of how these identities came about from reading this article. $F_{2n+1} = F_{n}^2 + F_{n+1}^2$ $F_{2n} = 2F_{n+1}F_{n}-F_{n}^2 $ But I don't understand how to apply ...
0
votes
2answers
30 views

Let $F_n$ denote the nth Fibonacci number and prove that the following re true for every possible integer $n$

$$\sum_{i = 1}^n F_{i}^2 = F_n F_{n+1}$$ -I solved a similar Fibonacci sequence that was the following: $$\sum_{i = 1}^n F_i = F_{n + 2} - 1$$ But, I am having trouble with this one, any help is ...
3
votes
0answers
55 views

Fibonacci numbers properties

I've verified that $F_{41} \mod F_{32}= F_{23}$ where $41-32=9$ and $32-9=23$. I suppose these facts are correlated. Is there a simple way to show how? Simpler question: how can I justify that ...
2
votes
0answers
24 views

Prove that $\sum^{n}_{i=0}\binom{n}{i}F_{i}=F_{2n}$ [duplicate]

I am asked: Let $F_{i}$ denote the $i$-th Fibonacci number. Prove that $$\sum^{n}_{i=0}\binom{n}{i}F_{i}=F_{2n}$$ I have the base case and the inductive hypothesis, but I'm not sure what ...
11
votes
1answer
305 views

How to prove this series about Fibonacci number?

How to prove this series: I have no idea where to start. $$\sum_{n=1}^{\infty }\frac{F_{n}}{2^{n}}=2$$ where $F_{1}=1,~F_{2}=1,~F_n=F_{n-1}+F_{n-2},~~n\geq 3$.
3
votes
2answers
7k views

Roulette betting system probability

The Fibonacci is a popular Roulette betting system that is based on a naturally occurring mathematical sequence. The sequence itself is cumulative. In other words, the next number is equal to the sum ...
27
votes
2answers
713 views

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 ...
7
votes
2answers
295 views

Prove Divisibility In Fibonacci Sequence Over A Prime Number

In The Fibonacci sequence which is defined as $$ F_n=F_{n-1}+F_{n-2}, $$ lets say we have the number $p$ which is an odd prime. Prove that: $F_{p-1} + F_{p+1} -1$ Is divisible by $p$. Prove that ...
1
vote
0answers
52 views

Help me find the mistake in my solution of the limit

Let $x_1=1, x_2=2,$ $$x_n=x_{n-1}+x_{n-2}, (n>2)$$ The task is to find: $$\lim \limits_{x\to\infty}\frac{x_{n+1}}{x_n}!$$ My attempt at solution: We write the recursive formula as: ...
4
votes
1answer
22 views

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, ...
4
votes
0answers
53 views

The $q$-continued fraction for tribonacci constant and others

Let $q = e^{-2\pi}$. We are familiar with Ramanujan's beautiful continued fraction, $$\cfrac{q^{1/5}}{1 + \cfrac{q} {1 + \cfrac{q^2} {1 + \cfrac{q^3} {1+\ddots}}}} = {\sqrt{5+\sqrt{5}\over ...
0
votes
2answers
163 views

Rate of Convergence vs Radius of Convergence

What is the difference between finding the 'rate of convergence' and the radius of convergence'? The question I am trying to solve here is to find the rate of convergence of the ratio of Fibonacci ...
5
votes
3answers
269 views

Prove: $\binom{n}{0}F_0+\binom{n}{1}F_1+\binom{n}{2}F_2+\cdots+\binom{n}{n}F_n=F_{2n}$

Prove: $\binom{n}{0}F_0+\binom{n}{1}F_1+\binom{n}{2}F_2+\cdots+\binom{n}{n}F_n=F_{2n}$; I was stuck with this question for a while... Help me please!!! Thanks!!!
2
votes
1answer
62 views

On $4n+1 = x^2, 5n+1 = y^2$ and the Fibonacci numbers

While answering this question, I decided to look at the particular case, $$4n+1 = x^2\\5n+1 = y^2$$ to be solved simultaneously. The solutions for $n,x,y$ are A157459, A007805, and A049629, ...
9
votes
1answer
312 views

Infinite sum of reciprocal shifted Fibonacci numbers

I found on Wikipedia the following infinite sum : $$\sum_{k=0}^{\infty} \frac{1}{1+F_{2k+1}}=\frac{\sqrt{5}}{2}$$ There is no reference for this sum in the article and I couldn't find it ...
12
votes
0answers
96 views

Do all rational numbers repeat in Fibonacci coding?

In a regular, positional number system (like our decimal numbers), every rational number ends in a repeating sequence (even if it's just 0). For example, 1/3 in base 10 is 0.33333..., in base 5 it's ...
1
vote
0answers
38 views

Does 1/4 eventually repeat in Fibonacci coding?

In a regular, positional number system (like our decimal numbers), every rational number ends in a repeating sequence (even if it's just 0). For example, 1/3 in base 10 is 0.33333..., in base 5 it's ...
6
votes
1answer
211 views

Prove $F_{1}^{2}+F_{2}^{2}+\dots+F_{n}^{2}=F_{n}F_{n+1}$ using geometric approach

Prove the identity: $F_{1}^{2}+F_{2}^{2}+\dots+F_{n}^{2}=F_{n}F_{n+1}$, where $F_i$ denotes a Fibonacci number. How can I prove it using a geometric approach?
0
votes
1answer
43 views

Need help calculating probability…

First time here, so I hope you'll not get too frustrated if I make any etiquette mistakes for this forum. So here's my question. I know there are snow day calculators out there, but I'm trying to ...
4
votes
4answers
2k views

For the Fibonacci numbers, show for all $n$: $F_1^2+F_2^2+\dots+F_n^2=F_nF_{n+1}$

The definition of a Fibonacci number is as follows: $$F_0=0\\F_1=1\\F_n=F_{n-1}+F_{n-2}\text{ for } n\geq 2$$ Prove the given property of the Fibonacci numbers for all n greater than or equal to 1. ...
1
vote
0answers
22 views

Find length of sequence with fibonacci principle

Let assume we have sequence: $${l_{n + 1}} = {l_n} + {l_{n - 1}} $$ $$\begin{array}{l}{l_0} = 0\\{l_1} = 01\\{l_2} = 010\end{array}$$ Our goal to get $|{l_n}|$ (length). For ${l_0}$ it's 0, for ...
1
vote
2answers
41 views

Proof and geometrical significance of $F(n+1)^2-F(n) \cdot F(n+2)$?

My son notes that for Fibonacci numbers $F_n$, $$ (F_{n+1})^2-F_n \cdot F_{n+2} =(-1)^n $$ I assume that this is true. Update: I see that the proof is already here: Prove the given property of the ...
8
votes
1answer
2k views

Relationship between Primes and Fibonacci Sequence

I recently stumbled across an unexpected relationship between the prime numbers and the Fibonacci sequence. We know a lot about Fibonacci numbers but relatively little about primes, so this connection ...
0
votes
0answers
41 views

Is the following statement true: $F_n\leq p\leq F_{n+2}$

Let be $n\in\{2,3,\ldots\}$ Is the following statement true: There exists a prime number so that $F_n\leq p\leq F_{n+2}$ while $F_n$ is a Fibonacci number.
6
votes
1answer
567 views

Flaw in induction proof that the Fibonacci sequence is bounded by $(5/3)^n$

The Fibonacci sequence is defined by $a_1 = 1, a_2 = 1$ and for all $n \ge 2, a_{n+1} = a_n + a_{n-1}$. Thus the sequence begins $$1,1,2,3,5,8,13,21,...$$ Prove that for all $n \ge 1, a_n ...
0
votes
2answers
214 views

Proof of the inequality $F_i<(5/3)^i$ for the Fibonacci numbers

The example states: As an example, we prove that the Fibonacci numbers, F0 = 1, F1 = 1, F2 = 2, F3 = 3, F4 = 5,..., Fi = Fi - 1 + Fi - 2, satisfy Fi < (5/3)i, for all i >= 1. To do this, we ...
3
votes
1answer
55 views

Fibonacci sequence digits

We define the Fibonacci sequence by $F_{n+2}=F_{n+1}+F_{n}$, with $F_0=0$ and $F_1=1$. How to compute the last $30$ digits of $F_{2^{200}}$ for instance? can we use Python?how?
2
votes
0answers
67 views

Fibonacci Numbers and the Harmonic Series

$$\sum_{k=1}^{n} \frac{1}{k}=H_n=\frac{p_n}{q_n}$$ Where $p_n,q_n$ are coprime intergers. The first few values for $p_n+q_n$ are $2,5,7,37,197,69,504,1041,9649$. When are $p_n+q_n$ Fibonacci ...
4
votes
1answer
78 views

Some heuristics about the Pisano Period, primes and Fibonacci primes. What reasons are behind them?

I started to read about the Pisano Period, $\pi(n)$, applied to the classic Fibonacci sequence and made some simple tests looking for possible properties of the sequence. I have observed the following ...
1
vote
2answers
81 views

Domino tiling extended in N dimensions.

The standard domino tiling problem, is the number of ways to tile a board of size 2xn by dominos of size 2x1. The answer directly follows a recursion, the same as the Fibonacci series. If I extend ...
0
votes
1answer
30 views

Is there some function which return probability to select prime number from $n$ first Fibonacci numbers.

So my question is: is there function return probability to select prime number from $n$ first Fibonacci numbers. So maybe it realize with $\pi(n)$ function?
1
vote
1answer
33 views

How is this identity for Fibonacci numbers called?

In the course of proving another identity, I've found that $$F_n \equiv F_kF_{n-k+1} + F_{k-1}F_{n-k}$$ …for all corresponding n and ...
9
votes
2answers
137 views

Show that for a given $s$ there are a finite number of Fibonacci number of form $n^2+s$

It is well known that the last Fibonacci number $F_k$ such that $\exists \ n \in \Bbb{N} : F_k = n^2$ is $144$. Thus there are only $4$ perfect squares among the Fibonacci sequence (assuming you ...
0
votes
2answers
81 views

How to find a formula relating fibonacci sequence?

By shifting property of fibonacci numbers, $$F_{m+n} = F_m · F_{n+1} + F_{m-1} · F_n$$ where $F_k$ denotes the kth Fibonacci number . I want to extend it to some n numbers . So , how to find a ...
1
vote
4answers
97 views

Fibonacci inequality

If $F_n$ denotes the $n$-th Fibonacci number ($F_0 = 0, F_1 = 1, F_{n+2} = F_{n+1} + F_n$), show that the inequalities $F_{2n-2} < F_n^2 < F_{2n-1}$ hold for all $n ≥ 3$.
3
votes
1answer
1k views

Exponential lower bound for Fibonacci numbers

Can someone show me how to solve through induction, $F(N) \geq (3/2)^N$ for all $N\geq N_0$, where $F(n)$ is the Fibonacci function and $N_0$ is some positive integer. I know that $N_0$ should be ...
1
vote
1answer
37 views

Is it rational or not?

I have two interesting question : Is this number rational or not: $$0.F_{1}F_{2}F_{3}...$$, where $F_{i}$ - Fibonacci number. And is this number rational or not: $$0.p_{1}p_{2}...$$
57
votes
3answers
667 views

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$ ...
9
votes
2answers
258 views

A number $N$ is a $k$-nacci number if and only if …

For $k\ge 2\in\mathbb N$, one can define the $n$-th $k$-nacci number $f_k(n)\ (n=0,1,\cdots)$ as $$f_k(0)=f_k(1)=\cdots=f_{k}(k-2)=0,\ \ ...
1
vote
2answers
66 views

Seeking a combinatorial proof $F_{mn}$ always a multiple of $F_m$

I would appreciate if somebody could help me with the following problem Q: Let $F_n$ the sequence of Fibonacci numbers, given by $F_1 = 1, F_2 = 1$ and $F_n = F_{n-1} + F_{n-2}$ for $n \geq 2$ ...
4
votes
2answers
54 views

Find $\mathrm{lcm}(F_{m},F_{n},F_{k})$.

So consider three Fibonacci numbers. My question is: Find $\mathrm{lcm}(F_{m},F_{n},F_{k})$, where lcm is least common multiple.
0
votes
0answers
23 views

Is the “Fibonacci square tiling” of Fibonacci-sided rectangles always optimal?

Is an optimal square tiling of a rectangle with side lengths of successive Fibonacci numbers always the sequence of Fibonacci numbers, as in the picture below?
2
votes
0answers
109 views

Can I use the equality $\phi^2=\phi+1$ without proving it?

I am looking at the following exercise: Show with induction, that the $i^{\rm th}$ Fibonacci number satisfies the equality: $$F_i=\frac{\phi^i-\hat{\phi}^i}{\sqrt{5}}$$ where $\phi$ ...