4 ms·
A few comments asked if the limit is 100%. The answer is yes, but it use some advanced math. Luckily the main steps are nice and easy to explain theorems. So if
by gus_massa 10y ago
A few comments asked if the limit is 100%. The answer is yes, but it use some advanced math. Luckily the main steps are nice and easy to explain theorems. So if you blindly believe the theorems then you will be fine.
First, it's easier to think about
q(m) = 1 - p(m) = PROD (1 - 1/prim(k))
{m = 1 to k}
i.e. the proportion of integers that are not divisible by any of the first m prime numbers. We want to prove the limit of q(m) is 0.
We need an auxiliary result. It is well known that the sum of the reciprocals of the primes is infinite. https://en.wikipedia.org/wiki/Divergence_of_the_sum_of_the_reciprocals_of_the_primes https://en.wikipedia.org/wiki/Divergence_of_the_sum_of_the_r...
SUM 1/prim(m) = + ∞
{m = 1 to ∞}
["Intuitive fake explanation": There are infinite primes, they are not so far away, so the sum of 1/primes is infinite.]
The second result is usual in complex analysis. https://en.wikipedia.org/wiki/Infinite_product https://en.wikipedia.org/wiki/Infinite_product The real version says that if we have infinite numbers x(1), x(2) ,... x(m) such that 0 <= x(m) < 1 then
* If
SUM x(m) = + ∞
{m = 1 to ∞}
then
PROD (1 + x(m)) = +∞
{m = 1 to ∞}
and
PROD (1 - x(m)) = 0
{m = 1 to ∞}
["Intuitive fake explanation": For the first result, (1+x) * (1+y) * (1+z) > 1 + x + y + z . So if x + y + z + ... goes to infinite, then (1+x) * (1+y) * (1+z) * ... goes to infinite too. The second part uses a similar idea, with more hand waving and the fact that log(1+x) ~= x.]
Now we can join both results. If we take x(m) = 1/prim(m) then using the first result we have that
SUM 1/prim(m) = + ∞
{m = 1 to ∞}
and then using the second part of the second theorem
PROD (1 - 1/prim(m)) = 0
{m = 1 to ∞}
- dedalus 10y agoAn amazing explanation I must say regardless of all the fake disclaimers does illuminate the key point :-)