Pioneer Journal of Algebra, Number Theory and its Applications 12/2015; 10(1-2):51-70.
ISSN/ISBN: Not available at this time. DOI: Not available at this time.
Abstract: It is known that the first digits of prime numbers follow a generalized Benford law (GB) with size-dependent exponent that converges asymptotically to the uniform distribution. Based on two different statistics, we show the existence of size-dependent exponents that outperform in precision the optimal size-dependent exponent in Luque and Lacasa (2009) uniformly over some finite ranges. This result also holds for prime squares. Extending the approach to prime powers, different rates of convergence of the size-dependent GB’s to a GB with inverse power exponent are determined and compared. Furthermore, we introduce a criterion of counting compatibility, which indicates whether or not a given size-dependent GB that belongs to the first digits of some integer sequence is compatible with the asymptotic counting function of this sequence if it exists. We show the existence of a one-parametric size-dependent GB for the sequence of prime powers that is counting compatible with the prime number theorem and determine its optimal size- dependence. Finally, based on the theory of distribution functions of integer sequences, it is proved that the first digits of prime powers converge asymptotically to a GB with inverse power exponent. In particular, asymptotically as the power goes to infinity the sequences of prime powers obey Benford’s law.
Bibtex:
@article{,
title={Prime powers and generalized Benford law},
author={H{\"u}rlimann, Werner},
journal={Pioneer Journal of Algebra, Number Theory and its Applications 12/2015},
volume={10},
number={1--2},
pages={51--70},
year={2015},
}
Reference Type: Journal Article
Subject Area(s): Statistics