A local Benford Law for a class of arithmetic sequences

Abstract

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 [Formula: see text], [Formula: see text]. 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 [Formula: see text] if, roughly speaking, [Formula: see text]-tuples of consecutive leading digits behave like [Formula: see text] 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 [Formula: see text] such that the sequence is locally Benford distributed of order [Formula: see text]. The result applies, in particular, to sequences of the form [Formula: see text], [Formula: see text], and [Formula: see text], as well as the sequence of factorials [Formula: see text] and similar iterated product sequences.