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
3answers
66 views

Prove by induction that the Fibonacci sequence $≤ [(1+\sqrt{5})/2]^{n−1}$, for all $n ≥ 0$.

If $F(n)$ is the Fibonacci Sequence, defined in the following way: $$ F(0)=0 \\ F(1)=1 \\ F(n)=F(n-1)+F(n-2) $$ I need to prove the following by induction: $$F(n) \leq ...
0
votes
1answer
100 views

Fibonacci relation formula

There are three numbers a,b,c such that c=a+b. Let f(n) be n'th Fibonacci number,can we write f(a)+f(b) in terms of f(c) and c. If yes,how? I have tried deriving it using Binnets formula but did'nt ...
0
votes
1answer
144 views

Can the sum of different sets Fibonacci numbers be the same?

Is it possible to have two sets having at least one different element and the sum of Fibonacci of all elements be the same? As in, two subsets: ...
1
vote
3answers
134 views

How many $a$-nary sequences of length $b$ never have $c$ consecutive occurrences of a digit?

Let $S(a,b,c): = \#\{a$-nary sequences of length $b$ without $c$ consecutive occurrences of a digit$\}$. For example, $S(2,n,3)$ would be the number of binary sequences of length $n$ without $3$ ...
4
votes
1answer
64 views

The 9 most significant digits in Fibonacci series (Project Euler 104)

With regards to project Euler, problem 104: https://projecteuler.net/problem=104 The essence of the question here is how to keep track of the 9 most significant digits of a Fibonacci series (Keeping ...
3
votes
1answer
1k views

Find the sum of Fibonacci Series

I have given a Set A i have to find the sum of Fibonacci Sum of All the Subset of A ...
2
votes
1answer
124 views

Calculating Irrationals raised to some Power modulo 1000000007 [closed]

Lets define a function F as $F(n) = 1+(\frac{1+{\sqrt 5}}{2})^n$ As per wolfram site, ${\sqrt 5}\%99991=10104$ As per wolfram site, ${\sqrt 5}\%1000000007=no\_solution$ I need to find the value of ...
2
votes
1answer
145 views

Relation between Fibonacci Numbers [closed]

Is there any relation between $f(a), f(b)$ and $f(a+b)$ where $f(n)$ is the $n$'th fibonacci number?
1
vote
0answers
13 views

Potential Function Runtime

The potential function of a Fibonacci Heap is Φ(H) = t(H) + 2m(H) CLRS states in Figure 21.2 ...
0
votes
1answer
60 views

Interesting question on Fibonacci numbers. [duplicate]

Ran across this interesting question about the Fibonacci numbers but quite unsure how to go about it, any ideas ?
1
vote
1answer
34 views

Weird informatic problem with Fibonacci numbers in which I have some troubles

I don't know what happended to this website but for months I am not able to connect me in it. As I understand it the website is closed. It is in this website I found this problem. Let $L$ be ...
0
votes
1answer
44 views

Proof a formula of the Fibonacci sequence with induction

It turns out that the Fibonacci sequence satisfies the following explicit formula: For all integers $F_{n} ≥ 0$, $F_{n} = \frac{1}{\sqrt{5}}[(\frac{1+\sqrt{5}}{2})^{n+1} - ...
11
votes
0answers
313 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 ...
8
votes
2answers
846 views

Sum of inverse of Fibonacci numbers

If $F(n)$ is the nth Fibonacci number, How can I prove that: $$\sum_{i=1}^{\infty} \frac{1}{F(i)}\approx 3.36\, .$$
2
votes
1answer
56 views

The sum of the Reciprocal of the Partial Sum of the Consecutive Fibonacci Numbers Series [closed]

How to prove that this conjecture is true for $n$th order Fibonacci number: $$1\le\sum_{n=1}^\infty\dfrac{1}{F_{n+2}-1}<2.5$$
0
votes
1answer
27 views

Use partial fractions to write $\frac{1}{x^2 + x – 1}$ as $\frac{A_1}{x – α_1} + \frac{A_2}{x – α_2}$ and write it as a power series

Find the roots $α_1$, $α_2$ of $x^2 + x – 1$ and use partial fractions to write $\frac{1}{x^2 + x – 1}$ as $\frac{A_1}{x – α_1} + \frac{A_2}{x – α_2}$ , for suitable $A_1, A_2$. Using the power series ...
0
votes
2answers
38 views

Prove that $\frac{a_{n+1}}{a_n}<2$ for every n>1 using induction

Fibonacci sequence of $a_n$: Prove that $\frac{a_{n+1}}{a_n}\leq2$ for every $n\geq1$. I was able to prove this using the base case: $$n=1 | n=2$$ ...
14
votes
4answers
5k views

Fibonacci modular results

Can any one give a generalization of the following properties in a single proof? I have checked the results, which I have given below by trial and error method. I am looking for a general proof, which ...
4
votes
1answer
56 views

Can $F_n^2-F_m^2$ be factored as a product of Fibonacci or Lucas numbers when $n-m$ is odd?

The Fibonacci and Lucas numbers are defined for all integers $n$ by the recurrence relations $$F_n=F_{n-1}+F_{n-2}\text{ where }F_1=1\text{ and }F_2=1,$$ $$L_n=L_{n-1}+L_{n-2}\text{ where }L_1=1\text{ ...
0
votes
2answers
46 views

Prove that $F_nF_{n+1}=\frac{1}{4}(F_{n+2}^2-F_{n-1}^2)$

The Fibonacci and Lucasnumbers are defined for all integers $n$ by the recurrence relations $$F_n=F_{n-1}+F_{n-2}\text{ where }F_1=1\text{ and }F_2=1,$$ $$L_n=L_{n-1}+L_{n-2}\text{ where }L_1=1\text{ ...
2
votes
2answers
62 views

Prove that for all $n \geq 1$, $F_{-n}$ = $(-1)^{n+1}F_n$ where F is the Fibonacci numbers.

Prove that for all $n \geq 1$, $F_{-n}$ = $(-1)^{n+1}F_n$ where F is the Fibonacci numbers. I've already shown that the formula holds for $n = 1$ and $n = 2$. So I supposed the formula holds for $n$ ...
4
votes
1answer
62 views

Proof Fibonacci derivation

I was wondering how to prove that $$f(n+m+2) = f(n+1)f(m+1) + f(n)f(m)$$ where $f$ is the fibonacci sequence and n, m are positive integers. Can be this done with induction? I'm lost with this ...
0
votes
2answers
47 views

Variations on Fibonacci Sequence

Do mathematicians use variations on the Fibonacci sequence? I'm thinking specifically about something like this: Start with three $1s$ and for each consecutive number, add the three previous number ...
1
vote
1answer
20 views

Is $\sum_{n,m \geq 0} F_n^m x^n y^m$ a rational generating function?

I am curious if the generating function defined by: $$ F(x,y)=\sum_{n=0}^{\infty} \sum_{m=0}^{\infty} F_{n}^m x^n y^m$$ where $F_n$ is the $n$th fibonacci number, is a rational function. That is, Is ...
1
vote
2answers
28 views

General solution expressed in $a_0$ and $a_1$ of a Fibonacci-like sequence?

What is the general solution expressed in $a_0$ and $a_1$ of a Fibonacci-like sequence ? I mean if $a_0,a_1$ are given and $a_{n+1}:=a_n+a_{n-1}$ ...
1
vote
2answers
1k views

Formula for binary sequences of length m with no n consecutive 1s?

Formula for binary sequences of length $m$ with no $n$ consecutive $1$s? I know The number of binary strings of length $m$ without consecutive $1$s is the Fibonacci number $F_{m+2}$. But how about ...
2
votes
0answers
23 views

fibonacci recurrence problem. [duplicate]

The Fibonacci numbers Fn are defined by the recurrence Fn=Fn−1+Fn−2, with base cases F0=0 and F1=1. Prove that any non-negative integer can be written as the sum of distinct and non-consecutive ...
39
votes
13answers
6k views

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, ...
0
votes
1answer
28 views

Fibonacci n-step numbers

I have searched the web for a definition and I found that this are typically defined as $F^n_{m} = F^n_{m-1} + F^n_{m-2} + \dots + F^n_{m-n}$ where $n$ stands for the number of previous numbers who ...
8
votes
2answers
108 views

Why do ratios of these Fibonacci-type sequences approach $\pi$?

Define $A_n$ by $A_1=12$, $A_2=18$, and $A_n=A_{n-1}+A_{n-2}$ for $n\ge3$. Similarly define $B_n$ by $B_1=5$, $B_2=5$, and $B_n=B_{n-1}+B_{n-2}$ for $n\ge3$. Terms of $A_n$: $12, 18, 30, 48, ...
0
votes
1answer
37 views

Reference request for a divisibility property of Fibonacci numbers

Define the Fibonacci numbers $F_n$ by $F_n=F_{n-1}+F_{n-2}$ and initial values $F_0=0$ and $F_1=1.$ I would like to get a reference for the following result: If $p$ is a prime number with $p \equiv ...
9
votes
1answer
1k views

Proof that Fibonacci Sequence modulo m is periodic? [duplicate]

It's well known that the Fibonacci sequence $\pmod m$ (where $m \in \mathbb N$) is periodic. I have figured out a proof for this, but upon googling, I found proofs online that were far more ...
0
votes
1answer
37 views

Sum of digits of Fibonacci number a perfect square

During my problem solving with Fibonacci numbers following thought crossed my mind. How many Fibonacci numbers are there such that sum of its digits is a perfect square? Here is a list of ...
1
vote
4answers
64 views

Basic Discrete Mathematics Recurrence question

Good afternoon, I've been assigned the following problem from my Intro to Discrete Mathematics: Show that $\sum_{i=1}^n$ F(i) = F(n+2) - 1 note: F(n) is the nth term in the fibonacci sequence. ...
0
votes
1answer
54 views

Find a generating function with Fibonacci

$$G(x) = \sum_{n=1}^\infty na_n x^n $$ Hello. I need to find a generating function for the summation above, where $a_n$ is the Fibonacci sequence. I have found the generating function for the ...
0
votes
1answer
107 views

Greatest Common Divisor with Fibonacci Numbers [duplicate]

Prove that for all integers $n\geq 0$: $$\gcd(F_{n+1},F_n)=1$$ I am extremely lost. Please can some provide some hint or direction? Thank you so very much
2
votes
2answers
193 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 ...
-2
votes
4answers
45 views

Fibonacci Numbers Induction?

Show that $a_n=n^2+n+1$ satisfies \begin{cases} a_0=1\\ a_k=a_{k-1}+2k & \text{for $k>0$} \end{cases} I want to use induction to solve this problem. but I don't know what my base will be ...
3
votes
3answers
92 views

Induction Proof for $F_{2n} = F^2_{n+1} - F^2_{n-1}$

As stated in the tag, I'm trying to prove by induction the claim $F_{2n} = F^2_{n+1} - F^2_{n-1}$, where $F_{n}$ is the $n^{th}$ Fibonacci number. I've spent hours on the inductive step without ...
0
votes
2answers
450 views

Proving that $fib(n) < (5/3)^n$ for $n \ge 1$ by induction

I know this has been shown before here but no post really answered my question. I had this problem given to me as an induction practice problem and I couldn't solve it without help. When I got the ...
0
votes
1answer
53 views

Fibonacci-like formula for Padovan sequence

For the Fibonacci sequence, one can show the following and easy to calculate equation : $$\forall n\in \mathbb Z,~\mathcal F_n=\mathcal F_{\lfloor\frac{n}{2}\rfloor+1}^2-(-1)^n\mathcal ...
1
vote
1answer
332 views

Prove by induction for $F(2n) = F(n)[F(n-1) + F(n+1)]$ for all $n\ge 1$

I am totally stumped by this question. I have proved the base case. Then for $k$ is $1$ assume the relation to be true. When I try to prove for $k+1$, the terms just do not simplify to what I want. Is ...
12
votes
1answer
346 views

How to prove this series about Fibonacci number: $\sum_{n=1}^{\infty }\frac{F_{n}}{2^{n}}=2$? [duplicate]

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$.
13
votes
4answers
1k views

Infinite Series: Fibonacci/ $2^n$

I presented the following problem to some of my students recently (from Senior Mathematical Challenge- edited by Gardiner) In the Fibonacci sequence $1, 1, 2, 3, 5, 8, 13, 21, 34, 55,\ldots$ each ...
0
votes
1answer
53 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
57 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
34 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 ...
4
votes
1answer
257 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 - ...