An elementary proof that random Fibonacci sequences grow exponentially

From MaRDI portal




Abstract: We consider random Fibonacci sequences given by . Viswanath (cite{viswanath}), following Furstenberg (cite{furst}) showed that when , limnoinfty|xn|1/n=1.13..., but his proof involves the use of floating point computer calculations. We give a completely elementary proof that 1.25577ge(E(|xn|))1/nge1.12095 where E(|xn|) is the expected value for the absolute value of the nth term in a random Fibonacci sequence. We compute this expected value using recurrence relations which bound the sum of all possible nth terms for such sequences. In addition, we give upper an lower









This page was built for publication: An elementary proof that random Fibonacci sequences grow exponentially

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863329)