World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

A local Benford Law for a class of arithmetic sequences

    https://doi.org/10.1142/S1793042119500325Cited by:0 (Source: Crossref)

    It is well known that sequences such as the Fibonacci numbers and the factorials satisfy Benford’s Law; that is, leading digits in these sequences occur with frequencies given by P(d)=log10(1+1/d), d=1,2,,9. In this paper, we investigate leading digit distributions of arithmetic sequences from a local point of view. We call a sequence locally Benford distributed of order k if, roughly speaking, k-tuples of consecutive leading digits behave like k independent Benford-distributed digits. This notion refines that of a Benford distributed sequence, and it provides a way to quantify the extent to which the Benford distribution persists at the local level. Surprisingly, most sequences known to satisfy Benford’s Law have rather poor local distribution properties. In our main result we establish, for a large class of arithmetic sequences, a “best-possible” local Benford Law; that is, we determine the maximal value k such that the sequence is locally Benford distributed of order k. The result applies, in particular, to sequences of the form {an}, {and}, and {nβanα}, as well as the sequence of factorials {n!} and similar iterated product sequences.

    This work originated with an undergraduate research project carried out at the Illinois Geometry Lab in 2016. Some of the experimental results in this paper were generated using the Illinois Campus Computing Cluster, a high performance computing platform at the University of Illinois.

    AMSC: 11K31, 11K06, 11N05, 11B05
    Remember to check out the Most Cited Articles!

    Check out new Number Theory books in our Mathematics 2021 catalogue