The normality of digits in almost constant additive functions (Q368538): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Joseph Vandehey / rank | |||
Property / author | |||
Property / author: Joseph Vandehey / rank | |||
Normal rank | |||
Property / review text | |||
In the present paper the author shows the normality and non-normality of numbers constructed by concatenating parts of the expansion of the prime divisor counting function. We call a number \(x\) normal to base \(b\) if for every block of digits \(a_1\ldots a_k\) its frequency of occurrences in the \(b\)-adic expansion of \(x\) tends to \(b^{-k}\). Furthermore we denote by \(\Omega\) the prime divisor counting function and by \(\omega\) the distinct prime divisor counting function, which are defined by \(\Omega(p^k)=k\) and \(\omega(p^k)=1\) for every prime \(p\), respectively. For \(z>0\) and \(m\) a positive integer we denote by \(T_b(z,m)\) the truncation function to the last \(m\) base \(b\) digits of \(\lfloor z\rfloor\), where we add leading zeroes if the expansion of \(\lfloor z\rfloor\) is shorter than \(m\) digits. Furthermore, for \(y>0\), let \(K_y(x)=\lceil y\frac{\log\log\log x}{\log b}\rceil\) if \(x>e^e\) and set \(K_y(x)=1\) otherwise. The author could prove that the numbers \[ \theta_{\Omega,y}=0.(T_b(\Omega(1),K_y(1)))\,(T_b(\Omega(2),K_y(2)))\, (T_b(\Omega(3),K_y(3)))\, \ldots \] and \[ \theta_{\omega,y}=0.(T_b(\omega(1),K_y(1)))\,(T_b(\omega(2),K_y(2)))\, (T_b(\omega(3),K_y(3)))\, \ldots \] constructed by concatenating the truncated expansions of the values of the prime divisor counting function and the distinct prime divisor counting function, respectively, are normal to base \(b\) if and only if \(0<y\leq\frac12\). | |||
Property / review text: In the present paper the author shows the normality and non-normality of numbers constructed by concatenating parts of the expansion of the prime divisor counting function. We call a number \(x\) normal to base \(b\) if for every block of digits \(a_1\ldots a_k\) its frequency of occurrences in the \(b\)-adic expansion of \(x\) tends to \(b^{-k}\). Furthermore we denote by \(\Omega\) the prime divisor counting function and by \(\omega\) the distinct prime divisor counting function, which are defined by \(\Omega(p^k)=k\) and \(\omega(p^k)=1\) for every prime \(p\), respectively. For \(z>0\) and \(m\) a positive integer we denote by \(T_b(z,m)\) the truncation function to the last \(m\) base \(b\) digits of \(\lfloor z\rfloor\), where we add leading zeroes if the expansion of \(\lfloor z\rfloor\) is shorter than \(m\) digits. Furthermore, for \(y>0\), let \(K_y(x)=\lceil y\frac{\log\log\log x}{\log b}\rceil\) if \(x>e^e\) and set \(K_y(x)=1\) otherwise. The author could prove that the numbers \[ \theta_{\Omega,y}=0.(T_b(\Omega(1),K_y(1)))\,(T_b(\Omega(2),K_y(2)))\, (T_b(\Omega(3),K_y(3)))\, \ldots \] and \[ \theta_{\omega,y}=0.(T_b(\omega(1),K_y(1)))\,(T_b(\omega(2),K_y(2)))\, (T_b(\omega(3),K_y(3)))\, \ldots \] constructed by concatenating the truncated expansions of the values of the prime divisor counting function and the distinct prime divisor counting function, respectively, are normal to base \(b\) if and only if \(0<y\leq\frac12\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Manfred G. Madritsch / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11K16 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11A63 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6210446 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
normal numbers | |||
Property / zbMATH Keywords: normal numbers / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
additive function | |||
Property / zbMATH Keywords: additive function / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Selberg-Delange method | |||
Property / zbMATH Keywords: Selberg-Delange method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
exponential sum | |||
Property / zbMATH Keywords: exponential sum / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1988104155 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1206.1095 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A construction of a normal number for the continued fraction transformation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random Generators and Normal Numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on normal numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4548818 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on Normal Decimals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Construction of normal numbers by classified prime divisors of integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON A PROBLEM ON NORMAL NUMBERS RAISED BY IGOR SHPARLINSKI / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on additive functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Explicit construction of normal lattice configurations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3531284 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generating normal numbers over Gaussian integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normality of numbers generated by the values of entire functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Construction of normal numbers with respect to the Q-Cantor series expansion for certain Q / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Typicality of normal numbers with respect to the Cantor series expansion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normality of numbers generated by the values of polynomials at primes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: DISTRIBUTION FUNCTIONS OF ADDITIVE ARITHMETIC FUNCTIONS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normal sequences for Markov shifts and intrinsically ergodic subshifts / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4841598 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Construction of Decimals Normal in the Scale of Ten / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:24, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The normality of digits in almost constant additive functions |
scientific article |
Statements
The normality of digits in almost constant additive functions (English)
0 references
23 September 2013
0 references
In the present paper the author shows the normality and non-normality of numbers constructed by concatenating parts of the expansion of the prime divisor counting function. We call a number \(x\) normal to base \(b\) if for every block of digits \(a_1\ldots a_k\) its frequency of occurrences in the \(b\)-adic expansion of \(x\) tends to \(b^{-k}\). Furthermore we denote by \(\Omega\) the prime divisor counting function and by \(\omega\) the distinct prime divisor counting function, which are defined by \(\Omega(p^k)=k\) and \(\omega(p^k)=1\) for every prime \(p\), respectively. For \(z>0\) and \(m\) a positive integer we denote by \(T_b(z,m)\) the truncation function to the last \(m\) base \(b\) digits of \(\lfloor z\rfloor\), where we add leading zeroes if the expansion of \(\lfloor z\rfloor\) is shorter than \(m\) digits. Furthermore, for \(y>0\), let \(K_y(x)=\lceil y\frac{\log\log\log x}{\log b}\rceil\) if \(x>e^e\) and set \(K_y(x)=1\) otherwise. The author could prove that the numbers \[ \theta_{\Omega,y}=0.(T_b(\Omega(1),K_y(1)))\,(T_b(\Omega(2),K_y(2)))\, (T_b(\Omega(3),K_y(3)))\, \ldots \] and \[ \theta_{\omega,y}=0.(T_b(\omega(1),K_y(1)))\,(T_b(\omega(2),K_y(2)))\, (T_b(\omega(3),K_y(3)))\, \ldots \] constructed by concatenating the truncated expansions of the values of the prime divisor counting function and the distinct prime divisor counting function, respectively, are normal to base \(b\) if and only if \(0<y\leq\frac12\).
0 references
normal numbers
0 references
additive function
0 references
Selberg-Delange method
0 references
exponential sum
0 references
0 references