# A twin prime theorem, and a reformulation of the twin prime conjecture

In a previously posted question (A sieve for twin primes; does it imply there are infinite many twin primes?), I demonstrated that a sieve can be constructed that identifies all twin primes, and only twin primes. It relies on the fact that all twin primes (other than the unique example ($3,5$)) have the form $(6n-1, 6n+1)$.

The sieve works as follows: First we list all pairs of numbers having the form $(6n-1, 6n+1)$ for $n \ge 1$. All possible prime twins will be included in the list, as well as many pairs that are not prime twins (some containing no primes at all, such as for $n=20$). Next we generate numbers of the form $m=(6k \pm 1)$, which will include all primes (other than $2$ and $3$, which are not relevant here), and then we generate a multiplier such that all appropriate multiples of the first set of numbers ($m$) will be generated. The appropriate multiplier is of the form $(6j \pm 1)$, because potential multipliers having other forms $(6k, 6k \pm 2, 6k+3)$ will not give multiples of $m$ that have the form $(6n \pm 1)$, and thus are not relevant. If a particular pair of numbers $(6n-1, 6n+1)$ for some value of $n$ contains one or more of such multiples of $m$, it is removed. Note that it does not matter is some of the values of $m$ are not primes, as removing multiples of a compound number just repeats removing multiples of the prime factors of that compound number; it doesn’t change the performance of the sieve. By this sieve, all pairs that contain compound numbers are eliminated and what remains are twin primes. To summarize, pairs of numbers are removed when $(6n \pm 1)=(6j \pm 1)m=(6j \pm 1)(6k \pm 1)$.

What the sieve shows is that $(6n-1, 6n+1)$ is not a twin prime iff $(6n \pm 1)=(6j \pm 1)(6k \pm 1)$, where $j,k,n$ are natural numbers. Expanding, $(6n \pm 1)=(6j \pm 1)(6k \pm 1)$ becomes $(6n \pm 1)=(36jk \pm 6j \pm 6k \pm 1)$. The equality can only be true if the signs attached to the $\pm 1$ on each side of the equation are the same, so we can remove those terms and divide what remains by $6$, obtaining $n=6jk \pm j \pm k$.

Theorem: For natural numbers $j,k,n$, the pair $(6n-1, 6n+1)$ is not a twin prime iff $n=(6jk \pm j \pm k)$. Stated in the affirmative, $(6n-1, 6n+1)$ is a twin prime iff $n \ne (6jk \pm j \pm k)$.

The presented steps leading up to the statement constitute the proof of the theorem. What strikes me as remarkable is that, despite there being no possible algebraic systematization of the prime numbers, the twin primes are perfectly amenable to this simple algebraic characterization.

My first question is: Have I merely rediscovered a fact that was previously known? If so, any references or citations that can be provided would be greatly appreciated. In the unlikely event that this is in fact truly novel, is it publishable?

The above theorem allows a reformulation of the twin prime conjecture, which posits that there is no limit to the size of twin primes. If that conjecture is false, and there is a largest twin prime pair, then there is a number $n_{max}$ such that for all $n>n_{max}$, $n$ can always be expressed as $(6jk \pm j \pm k)$ for some natural numbers $j,k$. If the twin prime conjecture is true, then there is no limit to the size of numbers $n$ which cannot be expressed as $(6jk \pm j \pm k)$.

My second question is: Can any theorists out there suggest how to attack the conjecture as I have reformulated it?

• Use compound arithmetic progressions. It's a good case study and you should be able to get the weak form in a couple of months with a few hints. The strong form looks like it depends on the Riemann Hypothesis. Don't bother using sieve theory for this. – user1329514 Aug 21 '18 at 5:44

## 1 Answer

Let $n$ be the sequence of integers such that $(6n-1,6n+1)$ are twin primes. For your first question, at the very least such an observation has been made here by "Jon Perry" here: https://oeis.org/A002822

You'll find numerous other observations within that link as well. In particular, there are plenty of red-herring reformulations of twin primes, another one being $(4(p-1)!+1)\equiv -p\pmod{p(p+2)}$ iff $(p,p+2)$ are twin primes. I say red-herring because the actual usefulness of these is dubious. In your case, showing a number is not of the form $6ij\pm i\pm j$ is considerably more difficult than it looks.

Concerning your second question, you're effectively asking us to tell you how to prove the twin primes conjecture. The closest thing I can think of is general sieve theory, for which a good introduction can be found here.

• Thanks for the link; can't say I'm surprised that this has been found before. My second question goes to your comment at the end of the second paragraph, proving a number is not of a certain form, rather than to looking at sieve theory. – Keith Backman Aug 8 '18 at 18:43