I want to know the probability that a number is not divisible by any prime smaller than or equal to n. ie, I find a big number, I trial division it up to 300000 and don't find any factors. I want to know how unlikely that sort of event is.
I've tried to juggle around with some formulas in my head, to come up with something, but so far no good. I feel that it should be pretty simple.
Approximal solutions is OK, but please state in your answer whether or not it is an exact formula or a numerical solution.
I know I can calculate it using all the primes smaller than or equal to n $ prob(n) = (p_1-1)/p_1 \times (p_2-1)/p_2 \times (p_3-1)/p_3 ... $
I want a smaller solution that works with all n's, without knowing all the primes below it. I feel the prime number theorem can be used somewere here but I'm not sure how.
People have got to have encountered this problem before. People do primality proving/factoring all the time, and when the number is large enough, there really is no other way to do it than trial division (because the other methods requires one to work modulo the number to be tested, which is too large). Somebody else have got to have tried testing a large number, not found any factors below n, and wanted to know how unlikely that scenario was. I feel there has to be a ready formula, but I cant find any.
Googling and searching on math.stackexchange has yielded nothing for me.
Thanks in advance for any help