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

2
votes
2answers
1k views

Solve the recurrence of $T(n)= 3T(n-1)+1$ with$ T(0)=2$ by iteration of the recurrence

Solve the recurrence of $T(n)= 3T(n-1)+1$ with $T(0)=2$ by iteration of the recurrence. (I was told that there is no need to prove it by induction) I googled "iteration of the recurrence." I did not ...
3
votes
3answers
1k 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
2answers
145 views

Suppose that a recursive routine were invoked to calculate F(4). How many times would a recursive call of F(1) occur?

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$$ Suppose that a recursive routine were invoked to calculate $F_4$. How many times would a ...
1
vote
3answers
707 views

Prove that $F(n+3)=2F(n+1)+ F(n)$ for $n \ge 0$

The definition of a Fibonacci number is as follows: $$F(0)=0\\ F(1)=1\\ F(n)= F(n-2)+F(n-1)\text{ for }n\geq 2$$ Prove the given property of the Fibonacci numbers directly from the definition. ...
0
votes
1answer
78 views

Is the Fibonacci number-like function too trivial to investigate about?

To make some interesting recursive function, I generalized Fibonacci numbers to a function $f(x)$ such that satisfies the following condition: Given a function $g(x)$, such that $g(0)=0$ and ...
8
votes
8answers
525 views

Why is the Fibonacci ratio though a decreasing function, it is alternating and decreasing?

I tried to find the ratio of consecutive terms of the Fibonacci series and found that it is a decreasing function and it converges . I tried it though a small code piece in python so that I can have a ...
-1
votes
3answers
1k views

Show that the limit exists and find it's value? [duplicate]

The Fibonacci series defined recursively by $x(1) = 1, x(2) = 2$ and $x(n+1) = x(n) + x(n-1)$ Find$$\lim_{n\rightarrow\infty}\frac{x(n+1)}{x(n)}$$
6
votes
4answers
1k views

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.
3
votes
2answers
5k 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 ...
4
votes
0answers
102 views

A Fibonacci like Stochastic process

Let $X_0, X_1$ and $\{a_n,n\geq0\}$ are i.i.d. $\sim $Bernoulli$(1/2)$ taking values in $\{0,2\}$. Let us define $X_n$ for $n>1$ as below$$X_{n+1}=a_nX_n+a_{n-1}X_{n-1},\ n\geq1 $$ Then it follows ...
6
votes
5answers
297 views

Fibonacci-like sequence

Today I have to deal with something which reminds Fibonacci sequence. Let's say I have a certain number k, which is n-th number of certain sequence. This sequence however is created by recursive ...
0
votes
3answers
668 views

What are the first 3 digits of the product of the first 1000 fibonacci numbers

What are the first 3 digits of the product of the first 1000 Fibonacci numbers? Could anyone give me hints on how to start this problem? I haven't done a problem like this before and I am curious ...
6
votes
1answer
474 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 ...
-1
votes
2answers
553 views

Fibonacci sequence - how to prove $a_n=\frac{1}{\sqrt{5}} ((\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n)$ without induction [closed]

How to prove that $$a_n=\frac{1}{\sqrt{5}} ((\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n)$$ without using induction?
2
votes
1answer
319 views

Seeking a combinatorial proof of the Fibonacci identity $f_{2k-1}f_{4k}=f_{2k}+f_{2k}f_{4k-1}$

I would appreciate if somebody could help me with the following problem Q: Show that (for $k,n\in \mathbb{N}$), if $f_1=f_2=1$, $f_{n+2}=f_{n+1}+f_n$, then ...
2
votes
5answers
3k views

What is the summation notation for the Fibonacci numbers?

I learned about summation notation the other day, and I'm looking for a way to write the Fibonacci numbers with it. What would it look like?
0
votes
3answers
95 views

Fiddling with a Fibonacci-Like Sequence

Let $X\in\mathbb{Z}.$ Let $F_n$ be a sequence of positive integers given by $$F_{i+1}=F_i+F_{i-1}$$ $$F_2=X*F_1+F_0$$ I am trying to find an upper bound or (sharp) inequality of $F_i$ in terms of ...
7
votes
2answers
129 views

Error in Fibonacci recurrence proof by induction?

I'm working on a problem from a number theory book (Number Theory by George E. Andrews - problem 1-1-11). The text reads: Prove: $\displaystyle F_1F_2+F_2F_3+F_3F_4+\ldots+F_{2n-1}F_{2n}=F_{2n}^2$ ...
6
votes
3answers
167 views

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

Have I correctly derived an inverse to the Binet formula?

I was interested by another user's question on finding such an inverse and in particular noted Will Orrick's comment in the best answer that one can square both sides to obtain a quartic.I thought I'd ...
3
votes
1answer
167 views

Important numbers in Combinatorics

I recently went through some important numbers like the Stirling and Bell number for calculation of partitions /equivalence relations. I was wondering if someone can help me get a list of important ...
3
votes
1answer
129 views

Invent a combinatorial interpretation for the ''Tribonacci numbers''

" Recall that our combinatorial interpretation of the Fibonacci numbers $f_0 = f_1 = 1$ with $f_n = f_{n-1} + f_{n-2}$ for $n \geq 2$ was the number of ways to tile a board of length $n$ using squares ...
2
votes
3answers
112 views

How to prove? (Do not use mathematical induction)

I would appreciate if somebody could help me with the following problem: Q: Show that $$f_1=f_2=1, f_{n+2}=f_{n+1}+f_{n}(n\in \mathbb{N})~~~~ \Rightarrow ...
0
votes
2answers
170 views

intuition for the closed form of the fibonacci sequence

I'm trying to picture this closed form from Wikipedia visually: The idea is, if you take $\phi^n / \sqrt{5}$ and round it to the nearest integer, you'll get the $n$th Fibonacci number. I see ...
2
votes
2answers
492 views

How do I prove Binet's Formula? [duplicate]

My initial prompt is as follows: For $F_{0}=1$, $F_{1}=1$, and for $n\geq 1$, $F_{n+1}=F_{n}+F_{n-1}$. Prove for all $n\in \mathbb{N}$: ...
3
votes
2answers
95 views

What is the functional inverse (with respect to $h$ (!)) of $f^{\circ h}(x)={F(h) +x F(h-1) \over F(1+h) +x F(h) }$?

I've considered the fractional iteration of $f(x) = {1 \over 1+x} $ for which the general expression depending on the iteration-height parameter $h$ might be assumed by the formula $$ f^{\circ h}(x) ...
1
vote
1answer
74 views

What is the broader name for fibonacci and lucas sequences?

Fibonacci and Lucas sequences are very similar in their definition. However, I could just as easily make another series with a similar definition; an example would be: $$x_0 = 53$$ $$x_1 = 62$$ $$x_n ...
2
votes
1answer
191 views

Register Machine on Fibonacci Numbers

This problem is easy to understand but I am struggling to come up with any solutions. According to Wikipedia a register machine is a generic class of abstract machines used in a manner similar to a ...
1
vote
2answers
669 views

proof by induction to demonstrate all even Fibonacci numbers have indices divisible by 3

I am practicing proof by induction, and would like to use induction to prove the following hypothesis about the Fibonacci numbers: $$(\forall n\ge0) \space 0\equiv n\space mod \space 3 \iff 0 \equiv ...
2
votes
2answers
176 views

Induction on the Fibonacci sequence?

Prove by induction that the $i$th Fibonacci number satisfies the equality: $$F_i = \frac {\phi^i - \hat\phi{}^i}{\sqrt5}$$ where $\phi$ is the golden ratio and $\hat\phi$ is its conjugate. ...
1
vote
1answer
95 views

Prove relation between Lucas and Fibonacci numbers using tilings

I struggle a lot with combinatorial proofs and was hoping for some help. I need to prove by strong induction that $L_n = F_{n-2} + F_n$ and how this shows that $L_n$ counts the tilings of the circular ...
7
votes
2answers
185 views

Fiboncacci theorem: Proof by induction

I have the following theorem to prove by induction: $$ F_{n} \cdot F_{n+1} - F_{n-2}\cdot F_{n-1}=F_{2n-1} $$ It is mentioned in my script that the proof should be possible only by using the ...
2
votes
2answers
524 views

How can I find an inverse to the Binet formula?

I'm already aware of the Binet formula $F_n = \frac{\varphi^n + \frac{1}{\varphi^n}}{\sqrt{5}}$. I'm attempting to find the inverse of that formula so I can find the position in the sequence of ...
1
vote
3answers
396 views

Proof of identity $F_m F_n + F_{m−1} F_{n−1} = F_{m+n−1}$ for Fibonacci numbers

I'm lost on where to start on this proof: Using the fact that $A^m A^n = A^{m+n}$ , prove the identity $F_m F_n + F_{m−1} F_{n−1} = F_{m+n−1}$ I want to use induction starting with n = 1, but would ...
1
vote
0answers
81 views

Simplify Fibonacci Power Series

I am working on an algorithm to count the number of models for Exactly One in Three SAT (X3SAT) instances. It is known that a chain of X3SAT clauses of length $c$ has $F(c+3)$ satisfying assignments ...
7
votes
1answer
152 views

Identity for $e$ in terms of the Fibonacci sequence.

The following identity appears in Martin Gardner's paper, "Dr. Matrix on Little Known Fibonacci Curiosities: $$e = \frac{1 + 1 + \frac{2}{2!} + \frac{3}{3!} + \frac{5}{4!} + \frac{8}{5!} + ...
4
votes
2answers
493 views

Computing first digits of Fibonacci numbers

How would you compute the first $k$ digits of the first $n$th Fibonacci numbers (say, calculate the first 10 digits of the first 10000 Fibonacci numbers) without computing (storing) the whole numbers ...
1
vote
3answers
101 views

Fibonacci series in 0-Even-Odd-Even-Odd-N series up to N

Another question from the test for the Normale of Pisa: Consider the series $S_n$ of integer numbers repeteandly even - odd - even - odd that start with 0 and finish with n, so with n = 3 we get 2 ...
1
vote
3answers
112 views

Fibonacci and the algebraic expression $x^2-x-1$

$$\left( \left( 1/2\,{\frac {-\beta+ \sqrt{{\beta}^{2}-4\,\delta\, \alpha}}{\alpha}} \right) ^{i}- \left( -1/2\,{\frac {\beta+ \sqrt{{ \beta}^{2}-4\,\delta\,\alpha}}{\alpha}} \right) ^{i} \right) ...
16
votes
4answers
8k views

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 $\left\{1,1,3,5,8,13,21,...\right\}$.
4
votes
1answer
123 views

Fibonacci Coding - Error detection/correction

I'm researching into Fibonacci coding and up until this point I have surprised myself and understood the majority of what I have been reading. I'm now looking into the usefulness of Fibonacci ...
3
votes
3answers
187 views

Combinatorics — Fibonacci: formula for $F_1+F_3+ \cdots +F_{2n+1} $

For the following expression, find a simple formula which only involves one Fibonacci number. Then prove it by induction. $$F_1+F_3+ \cdots +F_{2n+1} $$ I'm be appreciated for any help. I have no ...
4
votes
1answer
279 views

Number of Permutations Fixed by the Fundamental Transformation is Fibonacci

Writing a permutation in $S_n$ as a product of disjoint cycles, we define a standard representation by writing each cycle with its largest element first, and ordering the cycles by the increasing ...
3
votes
3answers
175 views

“Fat” sets of integers and Fibonacci numbers

Let us call a set of integers "fat" if each of its elements is at least as large as its cardinality. For example, the set $\{10,4,5\}$ is fat, $\{1,562,13,2\}$ is not. Define $f(n)$ to count the ...
14
votes
1answer
283 views

Fibonacci Sequence in $\mathbb Z_n$.

Consider a Fibonacci sequence, except in $\mathbb Z_n$ instead of $\mathbb Z$: $$F(1) = F(2) = 1$$ $$F(n+2) = F(n+1) + F(n)$$ It is easy to see that each of these sequences must cycle through some ...
6
votes
4answers
723 views

Fibonacci identity proof

I've been struggled for this identity for a while, how can I use combinatorial proof to prove the Fibonacci identity $$F_2+F_5+\dots+F_{3n-1}=\frac{F_{3n+1}-1}{2}$$ I know that $F_n$ is number of ...
0
votes
1answer
143 views

quick approximation for largest fibonacci under a limit?

I asked in a previous post about finding a closed form for: $$\sum_{i=0}^{n}F_{3i}$$ which is the sum of the even fibs less than or equal to the nth even fib. the great answersI got showed me a very ...
5
votes
3answers
461 views

Closed form for the sum of even fibonacci numbers?

I recently took a look a project euler, and I am trying to think of a smart way to do number 2. I looked at the sequence, and I saw that the question is basically asking for $$ \sum_{i=1}^n F_{3i} $$ ...
0
votes
2answers
273 views

Verify the following identity for Fibonacci numbers

This is a homework problem that I would very much appreciate some help with. Thanks!
5
votes
3answers
175 views

Summation of Fibonacci numbers.

Let $f_n$ be the sequence of Fibonacci numbers. We need to show that $$\sum_{n\ge0} f_n x^n = \dfrac{1}{1-x-x^2}$$ I remember a solution when we are using the generating functions like: $f(x) = F_0 ...