De Koninck, Jean-Marie; Kátai, Imre Using large prime divisors to construct normal numbers. (English) Zbl 1274.11117 Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput. 39, 45-62 (2013). Summary: Given an integer \(q \geq 2\), a \(q\)-normal number is an irrational number \(\xi\) such that any preassigned sequence of \(\ell\) digits occurs in the \(q\)-ary expansion of \(\xi\) at the expected frequency, namely \(1/q^{\ell}\). Let \(\eta(x)\) be a slowly increasing function such that \(\frac{\log\eta(x)}{\log x}\to 0\) as \(x \to\infty\). Then, letting \(P(n)\) stand for the largest prime factor of \(n\), set \(Q(n)\) to be the smallest prime divisor of \(n\) which is larger than \(\eta(n)\), while setting \(Q(n)=1\) if \(P(n) >\eta(n)\). Then, we show that the real number \(0. Q(1)Q(2)\dots\) is a normal number in base 10. With various similar constructions, we create large families of normal numbers in any given base \(q \geq 2\). Finally, we consider exponential sums involving the \(Q(n)\) function. Cited in 2 Documents MSC: 11K16 Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. 11N37 Asymptotic results on arithmetic functions 11A41 Primes Keywords:normal numbers; largest prime factor; smallest prime factor PDFBibTeX XMLCite \textit{J.-M. De Koninck} and \textit{I. Kátai}, Ann. Univ. Sci. Budap. Rolando Eötvös, Sect. Comput. 39, 45--62 (2013; Zbl 1274.11117)