Construction of normal numbers by classified prime divisors of integers. II (Q372720): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
For positive integers \(q\) and \(n\) with \(q\geq2\) we denote by \[ n=\varepsilon_0(n)+\varepsilon_1(n)q+\cdots+\varepsilon_t(n)q^t \] the \(q\)-ary representation with \(\varepsilon_i(n)\in A_q:=\{0,1,\ldots,q-1\}\) for \(0\leq i\leq t\) and \(\varepsilon_t(n)\neq0\). Similarly, for a real \(x\in[0,1)\) we denote by \[ x=0.a_1a_2a_3\ldots \] with \(a_i\in A_q\) its \(q\)-ary expansion. We call a real \(x\in[0,1)\) normal if for any positive integer \(k\) and any block \(B\in A_q^k\) of digits of length \(k\) the number of occurrences of this block within the \(q\)-ary expansion is equal to the expected limiting frequency, namely \(q^{-k}\). In the present paper the authors construct normal numbers using classified prime divisors. Let \(\mathbb{P}\) be the set of all primes. Given an integer \(q\geq2\) they consider partitions of \(\mathbb{P}\) in disjoint sets such that \[ \mathbb{P}=\mathcal{R}\cup\mathbb{P}_0\cup\cdots\cup\mathbb{P}_{q-1}. \] In the next step they associate with every subset \(\mathbb{P}_j\) the digit \(j\) and the empty word \(\Lambda\) with the rest (the elements in \(\mathcal{R}\)), i.e. they define \(H:\mathbb{P}\to A_q\) by \(H(p)=j\) if \(p\in\mathbb{P}_j\), (\(j=0,1,\ldots,q-1\)) and \(H(p)=\Lambda\) if \(p\in\mathcal{R}\). Let \(A_q^*\) be the set of finite words over \(A_q\). Now the prime factor decomposition of every positive integer \(n\) induces a function \(R:\mathbb{N}\to A_q^*\) as follows. We set \(T(1)=\Lambda\) and if \(n=p_1^{a_1}\cdots p_r^{a_r}\), where \(p_1<\cdots<p_r\) are primes and \(a_i\in\mathbb{N}\), then we set \[ T(n)=H(p_1)\ldots H(p_r). \] In the first part of this sequence of papers, the authors needed that the primes are equally distributed with density \(1/q\) in all classes \(\mathbb{P}_i\). Their first result of the present part relaxes this condition. In particular, if there exists a positive number \(\delta<1\) and a real number \(c\geq5\) such that \[ \pi([u,u+v]\cap\mathbb{P}_i)=\delta\pi([u,u+v])+\mathcal{O}\left(\frac{u}{\log^cu}\right) \] holds uniformly for \(2\leq v\leq u\), \(i=0,1,\ldots,q-1\), and similarly \[ \pi([u,u+v]\cap\mathcal{R})=(1-q\delta)\pi([u,u+v])+\mathcal{O}\left(\frac{u}{\log^cu}\right), \] then \[ \xi=0.T(1)T(2)T(3)\ldots \] is normal to base \(q\). In their second and third result, the authors replace the sequence over the positive integers by the sequence \((p-1)_{p\in\mathbb{P}}\) and \((n^2+1)_{n\in\mathbb{N}}\), respectively, and show that the constructed numbers are normal to base \(q\). | |||
Property / review text: For positive integers \(q\) and \(n\) with \(q\geq2\) we denote by \[ n=\varepsilon_0(n)+\varepsilon_1(n)q+\cdots+\varepsilon_t(n)q^t \] the \(q\)-ary representation with \(\varepsilon_i(n)\in A_q:=\{0,1,\ldots,q-1\}\) for \(0\leq i\leq t\) and \(\varepsilon_t(n)\neq0\). Similarly, for a real \(x\in[0,1)\) we denote by \[ x=0.a_1a_2a_3\ldots \] with \(a_i\in A_q\) its \(q\)-ary expansion. We call a real \(x\in[0,1)\) normal if for any positive integer \(k\) and any block \(B\in A_q^k\) of digits of length \(k\) the number of occurrences of this block within the \(q\)-ary expansion is equal to the expected limiting frequency, namely \(q^{-k}\). In the present paper the authors construct normal numbers using classified prime divisors. Let \(\mathbb{P}\) be the set of all primes. Given an integer \(q\geq2\) they consider partitions of \(\mathbb{P}\) in disjoint sets such that \[ \mathbb{P}=\mathcal{R}\cup\mathbb{P}_0\cup\cdots\cup\mathbb{P}_{q-1}. \] In the next step they associate with every subset \(\mathbb{P}_j\) the digit \(j\) and the empty word \(\Lambda\) with the rest (the elements in \(\mathcal{R}\)), i.e. they define \(H:\mathbb{P}\to A_q\) by \(H(p)=j\) if \(p\in\mathbb{P}_j\), (\(j=0,1,\ldots,q-1\)) and \(H(p)=\Lambda\) if \(p\in\mathcal{R}\). Let \(A_q^*\) be the set of finite words over \(A_q\). Now the prime factor decomposition of every positive integer \(n\) induces a function \(R:\mathbb{N}\to A_q^*\) as follows. We set \(T(1)=\Lambda\) and if \(n=p_1^{a_1}\cdots p_r^{a_r}\), where \(p_1<\cdots<p_r\) are primes and \(a_i\in\mathbb{N}\), then we set \[ T(n)=H(p_1)\ldots H(p_r). \] In the first part of this sequence of papers, the authors needed that the primes are equally distributed with density \(1/q\) in all classes \(\mathbb{P}_i\). Their first result of the present part relaxes this condition. In particular, if there exists a positive number \(\delta<1\) and a real number \(c\geq5\) such that \[ \pi([u,u+v]\cap\mathbb{P}_i)=\delta\pi([u,u+v])+\mathcal{O}\left(\frac{u}{\log^cu}\right) \] holds uniformly for \(2\leq v\leq u\), \(i=0,1,\ldots,q-1\), and similarly \[ \pi([u,u+v]\cap\mathcal{R})=(1-q\delta)\pi([u,u+v])+\mathcal{O}\left(\frac{u}{\log^cu}\right), \] then \[ \xi=0.T(1)T(2)T(3)\ldots \] is normal to base \(q\). In their second and third result, the authors replace the sequence over the positive integers by the sequence \((p-1)_{p\in\mathbb{P}}\) and \((n^2+1)_{n\in\mathbb{N}}\), respectively, and show that the constructed numbers are normal to base \(q\). / 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: 11N37 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11A41 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6217302 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
normal numbers | |||
Property / zbMATH Keywords: normal numbers / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
primes | |||
Property / zbMATH Keywords: primes / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
classified primes | |||
Property / zbMATH Keywords: classified primes / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
arithmetic function | |||
Property / zbMATH Keywords: arithmetic function / rank | |||
Normal rank |
Revision as of 09:51, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Construction of normal numbers by classified prime divisors of integers. II |
scientific article |
Statements
Construction of normal numbers by classified prime divisors of integers. II (English)
0 references
21 October 2013
0 references
For positive integers \(q\) and \(n\) with \(q\geq2\) we denote by \[ n=\varepsilon_0(n)+\varepsilon_1(n)q+\cdots+\varepsilon_t(n)q^t \] the \(q\)-ary representation with \(\varepsilon_i(n)\in A_q:=\{0,1,\ldots,q-1\}\) for \(0\leq i\leq t\) and \(\varepsilon_t(n)\neq0\). Similarly, for a real \(x\in[0,1)\) we denote by \[ x=0.a_1a_2a_3\ldots \] with \(a_i\in A_q\) its \(q\)-ary expansion. We call a real \(x\in[0,1)\) normal if for any positive integer \(k\) and any block \(B\in A_q^k\) of digits of length \(k\) the number of occurrences of this block within the \(q\)-ary expansion is equal to the expected limiting frequency, namely \(q^{-k}\). In the present paper the authors construct normal numbers using classified prime divisors. Let \(\mathbb{P}\) be the set of all primes. Given an integer \(q\geq2\) they consider partitions of \(\mathbb{P}\) in disjoint sets such that \[ \mathbb{P}=\mathcal{R}\cup\mathbb{P}_0\cup\cdots\cup\mathbb{P}_{q-1}. \] In the next step they associate with every subset \(\mathbb{P}_j\) the digit \(j\) and the empty word \(\Lambda\) with the rest (the elements in \(\mathcal{R}\)), i.e. they define \(H:\mathbb{P}\to A_q\) by \(H(p)=j\) if \(p\in\mathbb{P}_j\), (\(j=0,1,\ldots,q-1\)) and \(H(p)=\Lambda\) if \(p\in\mathcal{R}\). Let \(A_q^*\) be the set of finite words over \(A_q\). Now the prime factor decomposition of every positive integer \(n\) induces a function \(R:\mathbb{N}\to A_q^*\) as follows. We set \(T(1)=\Lambda\) and if \(n=p_1^{a_1}\cdots p_r^{a_r}\), where \(p_1<\cdots<p_r\) are primes and \(a_i\in\mathbb{N}\), then we set \[ T(n)=H(p_1)\ldots H(p_r). \] In the first part of this sequence of papers, the authors needed that the primes are equally distributed with density \(1/q\) in all classes \(\mathbb{P}_i\). Their first result of the present part relaxes this condition. In particular, if there exists a positive number \(\delta<1\) and a real number \(c\geq5\) such that \[ \pi([u,u+v]\cap\mathbb{P}_i)=\delta\pi([u,u+v])+\mathcal{O}\left(\frac{u}{\log^cu}\right) \] holds uniformly for \(2\leq v\leq u\), \(i=0,1,\ldots,q-1\), and similarly \[ \pi([u,u+v]\cap\mathcal{R})=(1-q\delta)\pi([u,u+v])+\mathcal{O}\left(\frac{u}{\log^cu}\right), \] then \[ \xi=0.T(1)T(2)T(3)\ldots \] is normal to base \(q\). In their second and third result, the authors replace the sequence over the positive integers by the sequence \((p-1)_{p\in\mathbb{P}}\) and \((n^2+1)_{n\in\mathbb{N}}\), respectively, and show that the constructed numbers are normal to base \(q\).
0 references
normal numbers
0 references
primes
0 references
classified primes
0 references
arithmetic function
0 references