An elementary proof that random Fibonacci sequences grow exponentially

From MaRDI portal
Publication:863329

DOI10.1016/J.JNT.2006.01.002zbMATH Open1171.11044arXivmath/0510159OpenAlexW2075512443WikidataQ56019341 ScholiaQ56019341MaRDI QIDQ863329FDOQ863329


Authors: Eran Makover, Jeffrey McGowan Edit this on Wikidata


Publication date: 26 January 2007

Published in: Journal of Number Theory (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/math/0510159




Recommendations



Cites Work


Cited In (17)





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)