Abstract
It has long been known that sequences such as the powers of 2 and the factorials satisfy Benford’s Law; that is, leading digits in these sequences occur with frequencies given by , . In this article, we consider the leading digits of the Mersenne numbers , where pn is the n-th prime. In light of known irregularities in the distribution of primes, one might expect that the leading digit sequence of has worse distribution properties than “smooth” sequences with similar rates of growth, such as . Surprisingly, the opposite seems to be true; indeed, we present data, based on the first billion terms of the sequence , showing that leading digits of Mersenne numbers behave in many respects more regularly than those in the above smooth sequences. We state several conjectures to this effect, and we provide an heuristic explanation for the observed phenomena based on classic models for the distribution of primes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.