arXiv · 1206.1095
The normality of digits in almost constant additive functions
Abstract
We consider numbers formed by concatenating some of the base b digits from additive functions f(n) that closely resemble the prime counting function Ω(n). If we concatenate the last \lceil y \frac{\log \log \log n}{\log b} \rceil digits of each f(n) in succession, then the number so created will be normal if and only if 0 < y \le 1/2. This provides insight into the randomness of digit patterns of additive function after the Erdos-Kac theorem becomes ineffective.
Explore related subjects
Keep this discovery
Joseph Vandehey. 2012-06-06. The normality of digits in almost constant additive functions. https://arxiv.org/abs/1206.1095
Cite the original work for its findings. Save a collection to share your selection of sources.