NPR1(n) =number of primes below 10n
NPR2(n)= number of primes with at most n digits
NPR3(n)= number of distinct prime divisors below (10n)!
For a given n, which of the above is the biggest?
Rationalize your conclusion.
|
||
perplexus dot info |
|
|
|||||||||||||||||||||||||