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
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
- Asymptotic normality of additive functions on polynomial sequences in canonical number systems
- On the Normality of Arithmetical Constants
- Asymptotic normality of \(b\)-additive functions on polynomial sequences in number systems
- On simply normal numbers with digit dependencies
- Almost-additive and almost-multiplicative functions with regularity properties
- scientific article; zbMATH DE number 3621876
- Normality of numbers generated by the values of entire functions
- On almost additive functions
- On a generalization of the concept of normal numbers
- scientific article; zbMATH DE number 4187929
Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Cites Work
- Typicality of normal numbers with respect to the Cantor series expansion
- A construction of a normal number for the continued fraction transformation
- Normality of numbers generated by the values of entire functions
- Title not available (Why is that?)
- Note on Normal Decimals
- Note on normal numbers
- The Construction of Decimals Normal in the Scale of Ten
- Title not available (Why is that?)
- Random Generators and Normal Numbers
- Normal sequences for Markov shifts and intrinsically ergodic subshifts
- On a problem on normal numbers raised by Igor Shparlinski
- DISTRIBUTION FUNCTIONS OF ADDITIVE ARITHMETIC FUNCTIONS
- Title not available (Why is that?)
- Generating normal numbers over Gaussian integers
- Normality of numbers generated by the values of polynomials at primes
- Explicit construction of normal lattice configurations
- Construction of normal numbers with respect to the \(q\)-Cantor series expansion for certain \(q\)
- The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions
- Construction of normal numbers by classified prime divisors of integers
- A note on additive functions
Cited In (8)
- New normality constructions for continued fraction expansions
- A generalisation of core partitions
- The number of prime factors function on shifted primes and normal numbers
- The \(t\)-core of an \(s\)-core
- Some Normal Numbers Generated by Arithmetic Functions
- The prime-counting Copeland-Erdős constant
- Unexpected distribution phenomenon resulting from Cantor series expansions
- Title not available (Why is that?)
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)