Construction of normal numbers by classified prime divisors of integers. II (Q372720)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6217302
Language Label Description Also known as
default for all languages
No label defined
    English
    Construction of normal numbers by classified prime divisors of integers. II
    scientific article; zbMATH DE number 6217302

      Statements

      Construction of normal numbers by classified prime divisors of integers. II (English)
      0 references
      0 references
      0 references
      21 October 2013
      0 references
      normal numbers
      0 references
      primes
      0 references
      classified primes
      0 references
      arithmetic function
      0 references
      For positive integers \(q\) and \(n\) with \(q\geq2\) we denote by NEWLINE\[NEWLINEn=\varepsilon_0(n)+\varepsilon_1(n)q+\cdots+\varepsilon_t(n)q^tNEWLINE\]NEWLINE 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 NEWLINE\[NEWLINEx=0.a_1a_2a_3\ldotsNEWLINE\]NEWLINE 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}\).NEWLINENEWLINEIn 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 NEWLINE\[NEWLINE\mathbb{P}=\mathcal{R}\cup\mathbb{P}_0\cup\cdots\cup\mathbb{P}_{q-1}.NEWLINE\]NEWLINE 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}\).NEWLINENEWLINELet \(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 NEWLINE\[NEWLINET(n)=H(p_1)\ldots H(p_r).NEWLINE\]NEWLINENEWLINENEWLINEIn 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 NEWLINE\[NEWLINE\pi([u,u+v]\cap\mathbb{P}_i)=\delta\pi([u,u+v])+\mathcal{O}\left(\frac{u}{\log^cu}\right)NEWLINE\]NEWLINE holds uniformly for \(2\leq v\leq u\), \(i=0,1,\ldots,q-1\), and similarly NEWLINE\[NEWLINE\pi([u,u+v]\cap\mathcal{R})=(1-q\delta)\pi([u,u+v])+\mathcal{O}\left(\frac{u}{\log^cu}\right),NEWLINE\]NEWLINE then NEWLINE\[NEWLINE\xi=0.T(1)T(2)T(3)\ldotsNEWLINE\]NEWLINE is normal to base \(q\).NEWLINENEWLINEIn 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

      Identifiers