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

0
votes
2answers
202 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 ...
2
votes
1answer
68 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, ...
1
vote
0answers
46 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 ...
12
votes
0answers
123 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 ...
0
votes
1answer
48 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 ...
1
vote
0answers
25 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
42 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 ...
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.
4
votes
1answer
62 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
82 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
111 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 ...
0
votes
1answer
31 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?
0
votes
2answers
96 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 ...
1
vote
1answer
36 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 ...
12
votes
0answers
315 views

Are all totient values 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 $F_{n}=...
2
votes
1answer
41 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}...$$
5
votes
2answers
75 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
28 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?
1
vote
1answer
61 views

Convergence of Fibonacci quotients

Let $F_n=F_{n-1}+F_{n-2},~ F_0=0,~F_1=1~$ be the Fibonacci numbers. Then it is well known that $\lim_n \frac{F_{n+1}}{F_n}=\frac{1+\sqrt{5}}{2}$. However, many textbooks proved the above by using ...
2
votes
1answer
47 views

Fibonacci identity $F_{n+1}^2 - (F_{n+1}F_n) - F_n^2 = (-1)^n$

I am trying to prove Let $F_n$ be the $n$th Fibonacci number. Then $F_{n+1}^2 - F_{n+1}F_n - F_n^2 = (-1)^n$ I am not sure where to start with this.
0
votes
2answers
26 views

If $y_n = 2x_n-1$, show that $y_{n+1} = y_n + y_{n-1} + 1$

If $y_n = 2x_n-1$, how do you show $y_{n+1} = y_n + y_{n-1} + 1$ with $y_0 = 1$ and $y_1 = 1$? Would you start with $y_{n+1} = y_n + y_{n-1} + 1$, find a formula for $y_n$ and then compare it with $...
0
votes
1answer
49 views

How do you show $s_n = \frac{x_{n+1}}{x_n}$ where $(x_n)$ is the Fibonacci sequence?

Let $(s_n)$ denote the sequence satisfying: $s_{n+1} = 1 + \frac{1}{s_n}$ with $s_0 = 1$. Let $(x_n)$ denote the Fibonacci sequence and $x_n = \frac{5 + \sqrt{5}}{10}(\frac{1 + \sqrt{5}}{2})^n + \...
1
vote
1answer
66 views

Limit as $n \to \infty$ of $\frac{x_{n+1}}{x_n}$ in the Fibonacci sequence

Given that $x_n = \frac{\sqrt{5}+5}{10} (\frac{1 + \sqrt{5}}{2})^n + \frac{5 - \sqrt{5}}{10}(\frac{1 - \sqrt{5}}{2})^n$ How do you show that $\lim_{n \to \infty} \frac{x_{n+1}}{x_n}$ is the ...
0
votes
1answer
61 views

formula for the nth term of this sequence?

How do you find a formula for the nth term of this sequence? given that $x_n$$_+$$_1$ = $x_n$ + $x_n$$_-$$_1$ (Fibonacci sequence) and $x_0 = 1$ and $x_1 = 1$. Do i complete the square on $x^2 - x - ...
1
vote
2answers
42 views

Finding the limit of the following series, wherever it is convergent

Let $ f(x) = \sum_{n=1}^{\infty}a_nx^n $ where $a_n$ is the nth Fibonacci number. Find the values for which the series is convergent, and find $f(x)$ for those values. (i.e - find the limit when ...
5
votes
1answer
69 views

Limit of a specific sequence involving Fibonacci numbers.

Let, $\left\{F_n\right\}_{n=1}^\infty$ be the Fibonacci sequence, i.e, $F_1=1, F_2=1~\&~ F_{n+2}=F_{n+1}+F_n~\forall ~n \in \mathbb{Z}_+$ Let, $P_1=0, P_2=1$. Divide the line segment $\overline{...
1
vote
2answers
47 views

Proof concerning Fibonacci and recursively defined sequences

The series $(a_n)_{n\in\mathbb{N}}$ is given through $$a_1=1,\quad a_2=\frac{1}{2},\quad a_{n+2}=a_na_{n+1} \quad\text{ for } n\geq1.$$ I want to show that $$a_n = 2^{-f_{n-1}}$$ whereas $\,f_n$ ...
1
vote
2answers
70 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$ ...
6
votes
1answer
95 views

Integral representation for Fibonacci's numbers

We know that, for example, the Gamma function is a perfect integral representation for the factorial $n!$ for a natural number $n$. $$\Gamma[n] = \int_0^{+\infty} t^{n-1}e^{-t}\text{d}t = (n-1)!$$ ...
1
vote
0answers
134 views

Is there a proven way to calculate the entry point(first occurence) of a factor m, in the Fibonacci sequence?

I saw a comment at the OEIS website for the sequence of entry points, of Fibonacci factors. https://oeis.org/A001177 It referenced a paper by Mark Renault in 1996, with the quote from OEIS: http://...
3
votes
2answers
53 views

Do I need induction here?

I am asked to prove, by using induction that $$\sum\limits_{i=1}^n F(2i-1) = F(2n)$$ for all real numbers n where the function F(i) gives the i:th fibonacci number. The series stars off with $F(0) =...
1
vote
4answers
141 views

Proving that $\binom{n}{0}+\binom{n-1}{1}+\binom{n-2}{2}+\cdots =F_{n+1}$ where $F_{n+1}$ is the $n+1$ th Fibonacci number [duplicate]

I have to proove this this identity which connects Fibonacci sequence and Pascal's triangle: $$\begin{pmatrix}n\\0\end{pmatrix}+\begin{pmatrix}n-1\\1\end{pmatrix}+\dotsm+\begin{pmatrix}n-\lfloor\frac{...
3
votes
1answer
59 views

Convergence of Series Whose Terms are Defined Recursively

My recursively defined sequence $(a_n)_{n\in\mathbb{N}}$ is given trough $$a_1 = 1, \quad a_2=\frac{1}{2}\quad a_{n+2}=a_{n}a_{n+1}\quad \text{for } n\geq1$$ and I have to show that the series $$\...
0
votes
2answers
24 views

Closed form expression for zero of recurrence relation

Given the recurrence $d(i+1)=xFib(2i+1)-nFib(2i)$, where $Fib$ denotes the Fibonacci sequence (i.e. $Fib(0)=0, Fib(1)=1, Fib(2)=1, Fib(3)=2$, etc) and $n$ and $x$ are arbitrary integers, is it ...
0
votes
2answers
46 views

How to prove this sequence is null?

I am working on the fibonacci numbers series using the ratio. To prove convergence I want to show that the sequence of the series is going to 0. And then according to the Leibniz criterion the series ...
3
votes
0answers
37 views

Fibonacci numbers and binomial theroem [duplicate]

So I am trying to prove $$\sum_{i=0}^n{nCi×F_i} = F_{2n}$$ Such that $$nCi = \frac {n!}{i!×(n-i)!}$$ And $F_i$ is the ith value of the fibonacci sequence such that $F_0 = 1$ and $F_1 = 1$ I have ...
1
vote
1answer
59 views

Proof: Fibonacci Sequence (2 parts)

Part a) Prove or Disprove: There are only finitely many even Fibonacci numbers. I think I want to disprove this, as I know that every 3rd Fibonacci number is even, and thus there will be infinitely ...
0
votes
0answers
31 views

Divisibility of Fibonacci Sequence mod prime

I have to solve the following problem and I have a few questions: Consider the Fibonacci sequence defined as $F_n:=2F_{n-1}+F_{n-2}$ with $F_0=1$ and $F_1=1$. Now, I need to prove that for any odd ...
3
votes
3answers
117 views

Cesaro identity for Fibonacci numbers

I am stuck with the identity $$ F_{2n} = \sum_{k=1}^n \binom{n}{k} F_k, $$ which happens to be formula 80. I am using induction, but so far without too much result. $$ \sum_{k=1}^{n+1} \binom{n+1}{...
4
votes
1answer
341 views

Given Two Fibonacci numbers, predicting the median Fibonacci number

Wolfram Alpha gives the $100$th fibonacci number to be $354224848179261915075$ and the $104$th fibonacci number to be $2427893228399975082453$. Just from this, can we deduce what the $102$th fibonacci ...
1
vote
1answer
55 views

How many times can $p$ divide $F_n$?

Given a prime $p$ and a number $n$ (or perhaps just an upper bound $x$ with some unknown $n\le x$), trivially one has $$ \operatorname{ord}_p F_n\le\frac{\log F_n}{\log p}\approx\frac{n\log\varphi}{\...
2
votes
2answers
37 views

Sum of Squares for Odd Fibonacci Numbers

I am trying to prove the following theorem by induction: THEOREM: For the Fibonacci sequence $F_1$, $F_2$, ... , $F_n$ defined as, $F_1$ = $F_2$ = 1 $F_n$ = $F_{n-1}$ + $F_{n-2}$ for n >= 3, For ...
3
votes
1answer
117 views

Proving that every integer has a Fibonacci number multiple

Show that for any positive integer, there exists a Fibonacci number N such that N is divisible by the integer. I'm not really sure how to begin my approach to this problem, would really appreciate ...
1
vote
1answer
30 views

Prove that $F_n < 2^n$ for every $n \geq 0$ - Mathematical induction

The Fibonacci sequence $0$, $1$, $1$, $2$, $3$, $5$, $8$, $13$, ... is defined as a sequence whose two first terms are $F_0=0$, $F_1=1$ and each subsequent term is the sum of the two previous ones: $...
2
votes
0answers
35 views

$|x^2-xy-y^2|=1$ implies that $x=\pm F_{n+1},\; y=\pm F_n$

So I've proved that $ A= \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix} \implies A^n= \begin{pmatrix} F_{n+1} & F_n\\ F_n & F_{n-1} \end{pmatrix} $ for Fibonacci numbers $F_i$. I'm ...
2
votes
1answer
42 views

How to apply geometric series concepts into these numbers?

This is a basic level question and it is homework for someone that I am trying to help out. It is indicated as a Fibonacci puzzle. But I am not able to fit the numbers into a general geometric formula....
2
votes
2answers
66 views

Proving a Fibonacci identity: $F_{2n} = F_n (F_{n+1} + F_{n-1})$

$$ F_{2n} = F_n (F_{n+1} + F_{n-1}) $$ I'm so stuck. I've used the definition of Fibonacci to change $F_{2n+2}$ into $F_{2n+1} + F_{2n}$. Can't use other properties, only the inductive hypothesis and ...
1
vote
1answer
49 views

Clarification on tribonacci numbers exercise

From what I know the Tribonacci sequence is given by: T(n) = T(n-1) + T(n-2) + T(n-3) My book says that "We can show by induction that for large enough n, the Fibonacci numbers satisfy the ...
1
vote
1answer
53 views

Are any factors of Lucas numbers divisible by a Fibonacci number greater than three?

The congruence relation for Fibonacci and Lucas numbers is stated: If Fn > 3 is a Fibonacci number then no Lucas number is divisible by Fn. However, does this apply to the factors as well?
1
vote
0answers
44 views

Fibonacci numbers notation

$F_{i}$ denotes the $i^{th}$ Fibonacci number, but what does it mean when there are 2 subscripts, $F_{ij}$? Context: show that $F_{i}$|$F_{ij}$ (where $i$ and $j$ are positive integers) Thanks