arXiv · 1007.5349
Relations de récurrence linéaires, primitivité et loi de Benford
Abstract
We prove that many sequences of positive numbers $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in many bases $b>2$. Our techniques rely on Perron-Frobenius theory via the companion matrix of the characteristic polynomial of the defining equation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hugues Deligny, Paul Jolissaint. 2010-08-17. Relations de récurrence linéaires, primitivité et loi de Benford. https://arxiv.org/abs/1007.5349
Cite the original work for its findings. Save a collection to share your selection of sources.