First digit counting compatibility II: twin prime powers
The first digits of twin primes follow a generalized Benford law with size-dependent exponent and tend to be uniformly distributed, at least over the finite range of twin primes up to 10^m, m=5,...,16. The extension to twin prime powers for a fixed power exponent is considered. Assuming the Hardy-Littlewood conjecture on the asymptotic distribution of twin primes, it is claimed that the first digits of twin prime powers associated to any fixed power exponent converge asymptotically to a generalized Benford law with inverse power exponent. In particular, the sequences of twin prime power first digits presumably converge asymptotically to Benford’s law as the power exponent goes to infinity. Numerical calculations and the analytical first digit counting compatibility criterion support these conjectured statements.
see the manuscript
Copyright (c) 2016 Journal of Progressive Research in Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
TRANSFER OF COPYRIGHT
JPRM is pleased to undertake the publication of your contribution to Journal of Progressive Research in Mathematics.
The copyright to this article is transferred to JPRM(including without limitation, the right to publish the work in whole or in part in any and all forms of media, now or hereafter known) effective if and when the article is accepted for publication thus granting JPRM all rights for the work so that both parties may be protected from the consequences of unauthorized use.