An elementary proof that random Fibonacci sequences grow exponentially

Details An elementary proof that random Fibonacci sequences grow exponentially An elementary proof that random Fibonacci sequences grow exponentially

2005-10-07

arxiv.org/abs/math/0510159v2

Mathematics

Number Theory

7 pages, 2 figures

Scientific paper

We consider random Fibonacci sequences given by $x_{n+1}=\pm \beta x_{n}+x_{n-1}$. Viswanath (\cite{viswanath}), following Furstenberg (\cite{furst}) showed that when $\beta = 1$, $\lim_{n\to \infty}|x_{n}|^{1/n}=1.13...$, but his proof involves the use of floating point computer calculations. We give a completely elementary proof that $1.25577 \ge (E(|x_{n}|))^{1/n} \ge 1.12095$ where $E(|x_{n}|)$ is the expected value for the absolute value of the $n$th term in a random Fibonacci sequence. We compute this expected value using recurrence relations which bound the sum of all possible $n$th terms for such sequences. In addition, we give upper an lower

Affiliated with

Also associated with

No associations

Rating

An elementary proof that random Fibonacci sequences grow exponentially does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An elementary proof that random Fibonacci sequences grow exponentially, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An elementary proof that random Fibonacci sequences grow exponentially will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561480