Nonoverlapping Pairs of Explicit Inversive Congruential Pseudorandom Numbers.
Let be a sequence of bases with . In the case when the are slowly growing and satisfy some additional weak conditions, we provide a construction of a number whose -Cantor series expansion is both -normal and -distribution normal. Moreover, this construction will result in a computable number provided we have some additional conditions on the computability of , and from this construction we can provide computable constructions of numbers with atypical normality properties.
We show that the set of absolutely normal numbers is Π⁰₃-complete in the Borel hierarchy of subsets of real numbers. Similarly, the set of absolutely normal numbers is Π⁰₃-complete in the effective Borel hierarchy.
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.