The normality of digits in almost constant additive functions

From MaRDI portal
(Redirected from Publication:368538)




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 Omega(n). If we concatenate the last lceil y frac{log log log n}{log b} ceil 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.









This page was built for publication: The normality of digits in almost constant additive functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368538)