Displaying similar documents to “Subset sums modulo a prime”

Normal numbers and the middle prime factor of an integer

Jean-Marie De Koninck, Imre Kátai (2014)

Colloquium Mathematicae

Similarity:

Let pₘ(n) stand for the middle prime factor of the integer n ≥ 2. We first establish that the size of log pₘ(n) is close to √(log n) for almost all n. We then show how one can use the successive values of pₘ(n) to generate a normal number in any given base D ≥ 2. Finally, we study the behavior of exponential sums involving the middle prime factor function.