The Number of Prime Factors Function on Shifted Primes and Normal Numbers
Jean-Marie Koninck () and
Imre Kátai ()
Additional contact information
Jean-Marie Koninck: Université Laval
Imre Kátai: Eötvös Lorand University
A chapter in Topics in Mathematical Analysis and Applications, 2014, pp 315-326 from Springer
Abstract:
Abstract In a series of papers, we have constructed large families of normal numbers using the concatenation of the values of the largest prime factor P(n), as n runs through particular sequences of positive integers. A similar approach using the smallest prime factor function also allowed for the construction of normal numbers. Letting ω(n) stand for the number of distinct prime factors of the positive integer n, we show that the concatenation of the successive values of | ω ( n ) − ⌊ log log n ⌋ | $$\vert \omega (n) -\lfloor \log \log n\rfloor \vert $$ , as n runs through the integers n ≥ 3, yields a normal number in any given basis q ≥ 2. We show that the same result holds if we consider the concatenation of the successive values of | ω ( p + 1 ) − ⌊ log log ( p + 1 ) ⌋ | $$\vert \omega (p + 1) -\lfloor \log \log (p + 1)\rfloor \vert $$ , as p runs through the prime numbers.
Keywords: Normal numbers; Number of distinct prime factors; 11K16; 11N37; 11A41 (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-06554-0_12
Ordering information: This item can be ordered from
http://www.springer.com/9783319065540
DOI: 10.1007/978-3-319-06554-0_12
Access Statistics for this chapter
More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().