Journal of Progressive Research in Mathematics(JPRM) 9(1), pp. 1341-1349.

**ISSN/ISBN:** 2395-0218
**DOI:** Not available at this time.

- For online information, click here.

**Abstract:** 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.

**Bibtex:**

```
@article {,
AUTHOR = {Werner H{\"u}rlimann},
TITLE = {First digit counting compatibility II: twin prime powers},
JOURNAL = {Journal of Progressive Research in Mathematics},
YEAR = {2016},
VOLUME = {9},
NUMBER = {1},
PAGES = {1341--1349},
URL = {http://www.scitecresearch.com/journals/index.php/jprm/article/view/890},
}
```

**Reference Type:** Journal Article

**Subject Area(s):** Number Theory