The normality of digits in almost constant additive functions

From MaRDI portal
Publication:368538

DOI10.1007/S00605-012-0453-2zbMATH Open1284.11105arXiv1206.1095OpenAlexW1988104155MaRDI QIDQ368538FDOQ368538


Authors: Joseph Vandehey Edit this on Wikidata


Publication date: 23 September 2013

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1206.1095




Recommendations




Cites Work


Cited In (8)





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)