Find Prime Double Pairs: Frequency & Infinity

  • Thread starter Thread starter mathman
  • Start date Start date
  • Tags Tags
    Prime
mathman
Science Advisor
Homework Helper
Messages
8,130
Reaction score
573
Starting at 10, for any set of 5 consecutive odd numbers, at most 4 can be prime (the number ending in 5 cannot be prime). Moreover any such set has to have the number ending in 5 as the middle of two pairs of prime (you cannot have 3 consecutive odd primes when you start after 10). The first example of such a set is 11, 13, 17, 19. The next is 101, 103, 107, 109. How frequently does such a sequence occur? Is it known if there are an infinite number of such pairs of pairs?
 
Last edited:
Physics news on Phys.org
mostly related with the twin prime conjecture. If there exists an infinite of twin primes
( I am quite sure there is ) then IT IS possible that there exist an infinite of such sequences. Still an open problem, il try to close it this summer.
 
Recent work has shown there exists an infinite number of arithmetic series within primes.

Using your example of 11, 13, 17, 19. Is the same as 9 + 2n for n = 1, 2, 3, 4. Saying in this sequence that the number of terms is 4, t = 4, the proof shows that there exists in primes arithmetic series of the form a + dn for all t. t = 22 is the largest that has ever been calculated:

11,410,337,850,553 + 4,609,098,694,200n

for n = 1, 2, 3 … 22

However, the twin prime conjecture may be close to being solved, read here: http://mathworld.wolfram.com/news/2004-06-09/twinprimes/

Sorry but I have not heard of your problem before.
 
Hi, 11, 13, 17, 19 isn't quite an arithmetic progression. B. Green & Tao's result, exciting though it is, on arbitrarily long arithmetic progressions of primes won't help here since it 'just' guarantees a progression of primes of the form n+dt for t=1..k for whatever value of k you like but you have no control over d. (it's actually slightly stronger- it guarantees such a progression in any subset of the primes that's dense enough)

Unfortunately I don't know much about mathman's problem apart from the obvious connections to the twin primes conjecture. I can't think of anything right off that would prevent infinitely many such sequences.

edit- http://mathworld.wolfram.com/PrimeConstellation.html gives the Hardy-Littlewood conjecture for the frequency of primes clusters you're looking at.
 
Last edited:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top