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.
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
Cites work
- scientific article; zbMATH DE number 5355793 (Why is no real title available?)
- scientific article; zbMATH DE number 1789350 (Why is no real title available?)
- scientific article; zbMATH DE number 783336 (Why is no real title available?)
- A construction of a normal number for the continued fraction transformation
- A note on additive functions
- Construction of normal numbers by classified prime divisors of integers
- Construction of normal numbers with respect to the \(q\)-Cantor series expansion for certain \(q\)
- DISTRIBUTION FUNCTIONS OF ADDITIVE ARITHMETIC FUNCTIONS
- Explicit construction of normal lattice configurations
- Generating normal numbers over Gaussian integers
- Normal sequences for Markov shifts and intrinsically ergodic subshifts
- Normality of numbers generated by the values of entire functions
- Normality of numbers generated by the values of polynomials at primes
- Note on Normal Decimals
- Note on normal numbers
- On a problem on normal numbers raised by Igor Shparlinski
- Random Generators and Normal Numbers
- The Construction of Decimals Normal in the Scale of Ten
- The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions
- Typicality of normal numbers with respect to the Cantor series expansion
Cited in
(8)- New normality constructions for continued fraction expansions
- A generalisation of core partitions
- The \(t\)-core of an \(s\)-core
- The number of prime factors function on shifted primes and normal numbers
- Some Normal Numbers Generated by Arithmetic Functions
- The prime-counting Copeland-Erdős constant
- Unexpected distribution phenomenon resulting from Cantor series expansions
- scientific article; zbMATH DE number 4163000 (Why is no real title available?)
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)