2
votes
1answer
98 views

Generalised Fibonacci

How to find the nth term of the recurrence in $\log n$ time. $$ \begin{array}{rcl} F[n]&=&F[n-1]+F[n-3]\\ F[2]&=&1\\ F[3]&=&2\\ F[4]&=&3\\ F[5]&=&4 \end{array} ...
1
vote
1answer
76 views

General formula of Fibonacci look alike series

I'm trying to discover the general formula of a series defined with recursion: $$ a_1 = 2, a_2 = 3, a_3 = 4 $$ and $$ a_n = a_{n-1} + a_{n-3} $$ It looks like Fibonacci, but the starting points are ...
0
votes
1answer
46 views

Generalized Fibonacci Sequence

I'm having trouble with a problem I encountered while studying Number Theory. This problem comes from the book Number Theory by George E. Andrews. It defines a generalized Fibonacci sequence $F_1$, ...
0
votes
2answers
127 views

Fibonacci series, which is most pure mathematically? [closed]

There are various methods of generating the Fibonacci series. I'm going to list 3 of them in this question. Method 1: f[n] = f[n - 1] + f[n - 2] Method 2: (more ...
3
votes
1answer
56 views

Find a sequence

Find the function for the sequence $a_0 = 0, a_1 = 1$ and $a_{n}=a_{n+10}+a_n$ for all $n>0$.
3
votes
1answer
117 views

Golden ratio, $n$-bonacci numbers, and radicals of the form $\sqrt[n]{\frac{1}{n-1}+\sqrt[n]{\frac{1}{n-1}+\sqrt[n]{\frac{1}{n-1}+\cdots}}}$

The following infinite nested radical $$\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\cdots}}}}$$ is known to converge to $\phi=\displaystyle\frac{\sqrt{5}+1}{2}$. It is also known that the similar infinite ...
1
vote
1answer
44 views

Looking for a sum 1/(Fib(n)*Fib(n+2))

I am looking for the sum of the series: $$\sum_{n=1}^{\infty}\frac{1}{F_{n}F_{n+2}},$$ where $F_{n}$ is the $n$-th Fibonacci number. I was thinking about splitting the fraction into 2 like in the ...
1
vote
2answers
57 views

Help with a proof I can't quite

Let $(F_j)^\infty_{j=1}$ be the sequence of Fibonacci numbers. For all $n \in \mathbb{N}$, $\sum\limits_{k=1}^{2n-1}F_kF_{k+1}=(F_{2n})^2$. I handled the base case quite well but couldn't go very ...
1
vote
0answers
60 views

Linear combination of numbers: Express the $n^{th}$ Fibonacci number in terms of known constants.

Given the concept that any number can be expressed as a combination of other numbers can the $n^{th}$ Fibonacci number be expressed in terms of $\zeta(3)$ and $\ln(2/e)$ ? If possible, show all work ...
28
votes
4answers
555 views

Fibonacci numbers from $998999$

Is there a nice explanation of ...
1
vote
2answers
95 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$ ...
0
votes
0answers
23 views

Relation between series and equations

There is following quotes from wiki on Plastic number: The powers of the plastic number $A(n) = ρ^n$ satisfy the recurrence relation $A(n) = A(n − 2) + A(n − 3)$ for $n > 2$. And 2nd is that ...
3
votes
1answer
88 views

Fibonacci series mod a number

I'm trying to write a program with an input of numbers $n$ and $k$ (where $n<10^{20}$ and $k<10^9$), where I compute fib[n] % k. What is a good FAST way of computing this? I have read many ...
3
votes
3answers
88 views

Fibonacci Sequence, Golden Ratio

I've been asked to show that $x_n \rightarrow L$ as $n \rightarrow \infty$ where $x_n = F_{n+1}/F_{n}$ for $n \in \mathbb{Z}^+$, where $F_n$ denotes the $n^{th}$ Fibonacci number. I am supposed to use ...
3
votes
1answer
158 views

What is the sum of Fibonacci reciprocals?

How can I calculate $\sum\limits_{n=1}^{\infty}\frac{1}{F_n}$, where $F_0=0$, $F_1=1$ and $F_n=F_{n-1}+F_{n-2}$? Empirically, the result is around $3.35988566$. Is there a "more mathematical way" to ...
3
votes
1answer
79 views

A Fibonacci series

Let $F_n$ be the $n^{th}$ term of the Fibonacci sequence. That is, $F_1 = F_2 = 1$ and $F_n$ is defined recursively for $n\geq3$ by $F_n = F_{n-2}+F_{n-1}$. It is a known fact that $$ ...
2
votes
2answers
116 views

Sum $\frac{1}{1\times2}+\frac{1}{1\times3}+\frac{1}{2\times5}+\frac{1}{3\times8}+\cdots$

If $f_n$ is the Fibonacci series, with $1,1,2,3,5,8,\ldots$ prove that $$\sum_{i=2}^\infty\frac{1}{f_{i-1}\cdot f_{i+1}} = 1$$ So my idea was to try to convert this series into a telescoping sum ...
0
votes
2answers
76 views

Limit of ratio of successive n-nacci numbers?

The n-nacci numbers are defined as $${}_nF_k = {}_nF_{k - 1} + {}_nF_{k - 2} + \cdots + {}_nF_{k - n + 1}$$ Now, it's pretty well-known that the limit of successive $2$-nacci numbers (i.e. the ...
41
votes
5answers
4k views

Does every prime divide some Fibonacci number?

I am tring to show that $\forall a \in \Bbb P\; \exists n\in\Bbb N : a|F_n$, where $F$ is the fibonacci sequence defined as $\{F_n\}:F_0 = 0, F_1 = 1, F_n = F_{n-1} + F_{n-2}$ $(n=2,3,...)$. How can ...
0
votes
0answers
55 views

Sequence of $r_n:=\frac{x_{n+1}}{x_n}$ where $x_n$ is a sequence

Let $f:X\rightarrow X$ be a function on some complete metric space $(X,d)$. Let, $x_n$ is a sequence in the metric space defined by $x_{n+1}=f(x_n)$ and starting from $x_0$. My questions are (1) ...
1
vote
3answers
92 views

How to go about solving this recurrence relation?

In my discrete math class we were given the problem of finding an explicit formula for this recurrence relation and proving its correctness via induction. $$a_n=2a_{n-1}+a_{n-2}+1, a_1 = 1, a_2=1.$$ I ...
8
votes
1answer
115 views

Is this number rational or irrational?

Start writing down the Fibonacci numbers, using two digits for each one 01 01 02 03 05 08 13 21 34 55 ... Eventually you will reach three digit numbers. When ...
2
votes
3answers
384 views

Limit of the ratio of consecutive Fibonacci numbers [duplicate]

I have read in a book that the limit of the ratio of consequent Fibonacci numbers is the golden ratio. However, it was just mentioned thus not justified. So, my question is how would you derive the ...
1
vote
1answer
77 views

Fibonacci… Easier by induction or directly via Binet's formula

I have tried both for several of them and haven't been able to get anywhere in 3 hours of work. It seems to not matter which method I choose, I end up in the middle of a HUGE mess of algebra. Could ...
2
votes
3answers
400 views

Why is 11 times the 7th term of a fibonacci series equal to the sum of 10 terms?

Why is 11 times the 7th term of a fibonacci series equal to the sum of 10 terms? I was watching scam-school on youtube the other day and this number trick just astonished me. Can someone please ...
1
vote
1answer
45 views

Question about Fibonacci sequence

I proved that at Fib. $$\frac{1}{f_{n-1}f_{n+1}}=\frac{1}{f_{n-1}f_{n}}-\frac{1}{f_{n}f_{n+1}}$$ I need to prove two thing: 1.$$\sum_{n=2}^{\infty}\frac{1}{f_{n-1}f_{n+1}}=1$$ 2. ...
0
votes
3answers
143 views

A sum involving Fibonacci numbers, $\sum_{k=1}^\infty F_k/k!$

Let $F_k$ be Fibonacci numbers. I am looking for a closed form of the sum $\sum_{k=1}^\infty F_k/k!$. I tried to use Wolfram Alpha, but it is not doing the sum Fibonacci[k]/k! , k=1 to infinity. ...
2
votes
1answer
211 views

How do I use telescopic cancellation to prove the Fibonacci Sum Identity

I am reading a textbook which attempts to prove the Fibonacci Sum Identity by rearranging the Fibonacci recurrence relation as follows and then using telescoping cancellation to prove the identity: ...
1
vote
5answers
180 views

A Non-recursive Fibonacci Sequence

How can I determine the general term of a Fibonacci Sequence? Is it possible for any one to calculate F2013 and large numbers like this? Is there a general formula for the nth term of the Fibonacci ...
2
votes
4answers
4k views

Help with Induction proof on Fibonacci sequence?

I can't seem to solve this problem. It is: The Fibonacci numbers $F(0), F(1), F(2),\dots $ are defined as follows: $F(0) ::= 0$ $F(1) ::= 1$ $F(n) ::= F(n-1) + F(n-2)\qquad(\forall n \ge 2 $) ...
3
votes
1answer
127 views

Monotonicity of the sequence $ ( F_n^{\frac{1}{n}} ) $, where $ ( F_n ) $ is the Fibonacci sequence

Let $ F_n = F_{n-1} + F_{n-2} $ with $ F_0 = 1 $, $ F_1 = 1 $ (the Fibonacci sequence). I would like to know whether $ F_n^{\frac{1}{n}} $ is monotonically increasing in $ n $. It is not difficult to ...
1
vote
2answers
72 views

What is the approx value of $f(50001)/f(50000)$ where $f(i)$ gives the value of the $i$-th number in the Fibonacci series?

What is the approx value of $f(50001)/f(50000)$ where $f(i)$ gives the value of the $i$-th number in the Fibonacci series?
1
vote
1answer
79 views

About the percentage of the mutiples of a prime $p$ in Fibonacci sequence

Suppose that a sequence $\{f_n\}$ is defined as $$f_1=f_2=1, f_{n+2}=f_{n+1}+f_n\ \ (n\ge1).$$ Supposing that for a prime number $p$ and a natural number $N$,$$F_p(N)=\{\ n\ |\ n \in\mathbb N,\ n\le ...
2
votes
2answers
115 views

Is Fibonacci sequence the minimum of unique pairwise sum sequence?

Let $(a_n)_{n=1}^\infty$ be a strictly increasing (condition added per earlier answer of Amitesh Datta) sequence of natural numbers where all pairwise element sums are unique. Can anyone prove or ...
1
vote
1answer
58 views

Solving $ F_{n} = \sum_{i=1}^{n-1} (F_{i}\cdot F_{n-i}) $?

I need to find $F_{n}$ in : $$ F_{n} = \sum_{i=1}^{n-1} (F_{i}\cdot F_{n-i}) , F_0 = 0 , n>=2 $$ This equation screams convolution , I think , but I find it as a quite long solution sometimes. ...
1
vote
3answers
74 views

Find $F_{n}$ in : $F_{n} +2F_{n-1} + … + (n+1)\cdot F_{0} = 3^{n}$

I'm stuck with the question for a while : Find in $$F_{n} +2F_{n-1} + ... + (n+1)\cdot F_{0} = 3^{n}$$ the element $F_{n}$ . Placing $n-1$ instead on $n$ results in : $$F_{n-1} +2F_{n-2} + ... + ...
8
votes
7answers
395 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 ...
3
votes
0answers
79 views

A Fibonacci like Stochastic process

Let $X_0, X_1$ and $\{a_n,n\geq0\}\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 that ...
6
votes
5answers
284 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 ...
-3
votes
2answers
373 views

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

how to prove that $$a_n=\frac{1}{\sqrt{5}} ((\frac{1+\sqrt{5}}{2})^n-(\frac{1-\sqrt{5}}{2})^n)$$ without use induction is there any help ? thanks for all
1
vote
1answer
66 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 ...
1
vote
3answers
95 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 ...
12
votes
4answers
4k 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\}$.
14
votes
1answer
249 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 ...
0
votes
1answer
91 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 ...
1
vote
1answer
54 views

All sequences constructed by using the denominator as nominator and the sum of denominator and nominator as denominator converges to $\phi-1$

Assume we are given any number a. Write it in the form $a = \frac{b}{c}$ (if rational, in the usual way, if irrational, use forms like $\frac{a}{1}$). Construct a sequence ...
6
votes
1answer
267 views

Fibonacci numbers that are powers?

The Fibonacci sequence is: $$\left(f_n\right) = \left(0,1,1,2,3,5,8,13,21,34,55,89,144,\dots\right)$$ where we start with $0$ and $1$ and each term in the sequence is the sum of the two previous ...
2
votes
2answers
152 views

Proof That the Ratio of Sucessive N-nacci Numbers Tends to 2.

For the paper that I'm working on involving N-nacci Recursion Formulas I need to prove that $$ \lim_ {n \to \infty}\lim_{a \to \infty} \left | \frac{f^{(n)}_{a+1}}{f^{(n)}_a} \right | = 2$$ To start ...
3
votes
1answer
94 views

Convergence of $\sum_{n=1}^{\infty}(-1)^n\frac{n}{f_n}$ where $f_n$ is the $n$'th Fibonacci number

Can we show convergence of$$B=\sum_{n=1}^{\infty}(-1)^n\frac{n}{f_n}$$where $f_n$ is the $n$'th Fibonacci number? And then can we determine the exact value of $B$?
4
votes
1answer
123 views

Fibonacci Sequence and series limits

1) Let $F_1 = 1$, $F_2 = 1$, and $F_n = F_{n-1} + F_{n-2}$ for $n \geq 3$. How do you prove that $$\sum_{n=2}^\infty \frac1{F_{n-1} F_{n+1}} = 1$$ $$\sum_{n=2}^\infty \frac{F_n}{F_{n-1} F_{n+1}} ...