# Number of Primes Between n and 2n

As we travel further up the number line, primes become more scarce.

But, as n grows larger and larger, the range of numbers between n and 2n grows larger ad larger.

Do these two counteract each other? Does this cause the number of primes between n and 2n to stay relatively consistant, increase, or just shrink regardless?

Related Linear and Abstract Algebra News on Phys.org
mathman
Using the prime number theorem, this can be estimated.
π(n) ~ n/ln(n), so π(2n) - π(n) ~ 2n/ln(2n) - n/ln(n) which is approximately n/ln(n).

Chebyshev (and Erdos) said it and I'll say it again: there's always a prime between n and 2n.

Using the prime number theorem, this can be estimated.
?(n) ~ n/ln(n), so ?(2n) - ?(n) ~ 2n/ln(2n) - n/ln(n) which is approximately n/ln(n).
So as n goes to infinity, the number of primes between n and 2n goes to infinity?

Yes, in the sense that n/logn -> infinity as n -> infinity. (Just use L'Hospital's to see this.)

Yes, in the sense that n/logn -> infinity as n -> infinity. (Just use L'Hospital's to see this.)
Yep, that's what i did.

I don't really like the quote by chebyshev and erdos because it is bit misleading.

Well, the quote is by Erdos. See, Chebyshev proved that there was always a prime between n an 2n using a rather technical argument. Erdos proved it (I think when he was 19 or so) using a combinatorial argument, so he said "Chebyshev said it I'll say it again, there's always a prime between n and 2n."

Hurkyl
Staff Emeritus
Gold Member
Yep, that's what i did.

I don't really like the quote by chebyshev and erdos because it is bit misleading.
I can understand that the quote is entirely inappropriate to the thread, but calling it misleading seems far-fetched to me.

Well, the quote is by Erdos. See, Chebyshev proved that there was always a prime between n an 2n using a rather technical argument. Erdos proved it (I think when he was 19 or so) using a combinatorial argument, so he said "Chebyshev said it I'll say it again, there's always a prime between n and 2n."

Well, we agreed above that the number of primes between n and 2n goes to infinity as n goes to infinlty. Thats a lot of primes. The Erdos quote says there is always a prime, that does not sound like a lot, so IMHO the quote focuses on the triviality of small n and disregards the greater truth for large n.

Well sure, what we said was a sharper result than Bertrand's Postulate. I still don't see how this is misleading (though I will agree it really doesn't have much to do with the the thread.) The fact that there is ALWAYS a prime between n and 2n for all n is interesting on its own, espicialy when you consider that I can give you an arbirarily long list of consecutive composite integers.

I just posted the quote as a joke in the first place.

Well sure, what we said was a sharper result than Bertrand's Postulate. I still don't see how this is misleading (though I will agree it really doesn't have much to do with the the thread.) The fact that there is ALWAYS a prime between n and 2n for all n is interesting on its own, espicialy when you consider that I can give you an arbirarily long list of consecutive composite integers.

I just posted the quote as a joke in the first place.
Yes but that list of r consecutive composite integers must start at some integer n and my gut tells me that n is much larger than r for large r. For instance if r is 100 then n is going to be much larger than 100 and of course 2n-n is the number of integers in this interval. what would be 100/n? my gut tells me it's about 0

so in a simillar fashion r/n goes to zero as r goes to infinity. Remember that r is the number of consecutive composite integers and n is the integer where this sequence starts.

Is my gut mistaken?

It's all good, you don't have to see it my way, my opinions are not 'etched in stone'

Last edited:
You're correct; its huge. The sequence begins at (n+1)!.

But that's not really the point. The fact that PNT, in a way, implies Chebyshev's theorem does not, in any way, mean that Chebyshev's Theorem is "misleading" or unimportant. And it certainly does not take away from the fact that Erdos came up with a magnificent proof of it.

PNT also implies that there are infinite primes, but this does not take anything away from Eucilid's proof of the same.

The sequence begins at (n+1)!.
Not necessarily.

Not necessarily.
OK....

I was speaking of constructing a sequence like this:

(n+1)! + 2, (n+1)! + 3, ..., (n+1)! + n + 1

This is a list of n consecutive composites. When you say "not necessarily" do you mean that you know of another way to construct an arbitrarily long list of composite numbers? If so, I'd be interested. Or, do you mean that not every list of m consecutive composites has to be constructed the way I describe? If this is the case, then I don't really care as I never claimed that the ONLY way to construct a list of n composites was the construction I mentioned above. Perhaps what I wrote in my last post was confusing, but that's only because I thought we understood that I was referring to creating a list of size n for a general n, not a specific n. Certainly for "most" n, there are much lower sequences of n consecutive composites; but this doesn't tell us anything about a general n.

OK....

I was speaking of constructing a sequence like this:

(n+1)! + 2, (n+1)! + 3, ..., (n+1)! + n + 1

This is a list of n consecutive composites. When you say "not necessarily" do you mean that you know of another way to construct an arbitrarily long list of composite numbers? If so, I'd be interested. Or, do you mean that not every list of m consecutive composites has to be constructed the way I describe? If this is the case, then I don't really care as I never claimed that the ONLY way to construct a list of n composites was the construction I mentioned above. Perhaps what I wrote in my last post was confusing, but that's only because I thought we understood that I was referring to creating a list of size n for a general n, not a specific n. Certainly for "most" n, there are much lower sequences of n consecutive composites; but this doesn't tell us anything about a general n.
There are occasions that (n+1)! -1 or (n+1)! +1 or both are composite also, so the sequence begins much sooner at (n+1)! - (n+1), but I don't know if that was what agentredlum had in mind. Also, You must consider agentredlum's prior post where he said the sequence of r composite integers begins at some n. I think he had in mind then the lowest possible n for r consecutive composite integers. Unfortunately your post was for n consecutive composites rather than for r consecutive composites, but n consecutive composites is more germane to the original posts.

Last edited:
From my 'numerical department', the number of primes between n and 2 n is:

100 < #21 > 200
...
1000 < #135 > 2000
...
10000 < #1033 > 20000
...
100000 < #8392 > 200000