#density of primes in an interval
64 messages · Page 1 of 1 (latest)
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with: ```diff
+close
The maximum number of prime numbers that can be found in the interval n < p < n + 10, where n is a multiple of 10 and p is prime, is four.
To see why this is the case, note that the possible values of n modulo 10 are 0, 2, 4, 6, and 8. If n ends in 0 or 5, then n+2, n+4, n+6, and n+8 are all even and therefore not prime. If n ends in 2 or 8, then either n+2 or n+8 is divisible by 5 and therefore not prime. Similarly, if n ends in 4 or 6, then either n+4 or n+6 is divisible by 5 and therefore not prime. This leaves only the possibility that n ends in 1, 3, 7, or 9, in which case at most four primes can be found in the interval n < p < n + 10.
There is no known conjecture or theorem that states that for any interval of consecutive integers that is a multiple of 10, the maximum number of prime numbers in that interval is four. However, the behavior of primes in arithmetic progressions is a well-studied area of number theory, and there are several results that give bounds on the number of primes in such intervals. The specific case of intervals of the form n < p < n + 10 has been extensively studied and is well understood.
Hope this helps @chilly heath
...isn't n mod 10 = 0 since... y'know, n is a multiple of 10?
Yes, you are correct. I apologize for the error in my previous response. If n is a multiple of 10, then n mod 10 is equal to 0, and the possible values of n modulo 10 are 0, 2, 4, 6, and 8. The maximum number of primes in the interval n < p < n + 10 is four, and this is achieved when n ends in 1, 3, 7, or 9. Thank you for pointing out my mistake.
...what? You just made the same mistake again.
If n mod 10 = 0, then n == 0 (mod 10).
Like, that's almost literally saying exactly the same thing.
It's not 0, 2, 4, 6, or 8, it's 0, 0, 0, 0, or 0.
Because it's 0.
I don't think it's that complicated. It's 4 because primes become less dense the higher you count, so they're most dense on the interval (0, 10), which has 4; {2, 3, 5, 7}.
I apologise for being incorrect. I can see where I went wrong I will refrain myself from helping people.
Obviously that's not formally proved, but it's a much more intuitive reason to suspect that's the answer than whatever you were trying to do.
...what is this, man? You were wrong about something. It happens.
Why are you using ChatGPT to generate answers
No, refrain from doing so.
Will do, won’t happen again.
Thanks
yeah
n+2
n+4
n+6
n+8 are obviously not primes
If n ≥ 10,
Then
Among
n+1
n+3
n+5 (divisible by 5)
n+7
n+9
At least 1 number should be divisible by 3
Was missing a number there
how did you come to that conclusion though
Actually, at least 2 numbers should be divisible because every 3rd number is divisible by 3
1 2 3 4 5 6 7 8 9
Literally how number 3 works
See
its okay you dont have to explain it i already got the answer thanks though
Ah alright.
The answer is 3/9?
its 4
Ah yeah 4
Maximum so yeah 4
why would you get a fraction though
You asked for density 💀
Isn't density frequency/total?
But yeah, the frequency would be 4.
i meant density as in how much primes exist in that interval not the literal density
n = k (mod 3) hence 0 ≤ integer k ≤ 2
If k = 0,
n+3 and n+9 mod k = 0
If k = 1,
n+5 = 6 = 0 (mod 3) [update: this is dumb because n+5 is always divisible by 5 BUT this is also the case when you will get the maximum number of primes]
If k = 2,
n+1 and n+7 = 0 (mod 3)
Proof by exhaustion
We can always remove the even numbers when n ≥ 10
And based on the n mod 3, we can remove other numbers
@tall harbor @pine pond Super fast my ass
He's been told off, but if there are any further instances we'll ban him
Actually
we should ban him already
I'll ask the admins
Eh, ok i don't mind either way, the shame is enough