Mahadee–Kamrujjaman Conjecture on uniform digit distribution in large primes
Prove the Mahadee–Kamrujjaman Conjecture asserting that, in base 10, the digits of prime numbers are uniformly distributed as the magnitude of primes grows without bound; specifically, for each digit d in {0,1,2,3,4,5,6,7,8,9}, if P_n(d) denotes the probability (or relative frequency) of digit d occurring among primes less than 10^n, then lim_{n→∞} P_n(d) = 0.1.
References
Finally, based on our experimentation on the probability distribution of each digit in the construct of a big prime numbers to device efficient mutation operation for decimal chromosome representation in GA, we propose a novel conjecture on the distribution of digits on prime which is stated below: Digits of a prime are uniformly distributed as the length of primes tends to infinity. i.e. Let P_n (d) be the probability of occurrence of a digit, d in {0,1,2,…,9} in primes of length less than 10n then for any choice of d, lim_{n→∞} P_n(d)=0.1.