I have devised a sieve for identifying twin primes. My first question will be: Have I just rediscovered something already known? By comparing my sieve to the Sieve of Erastosthenes, I argue that there are an infinite number of twin primes. My next question is: Can my argument be tightened up into a proof?
In order to make my argument, I first have to present a ‘bloated’ formalization of the Sieve of Erastosthenes, Consider two infinite lists of natural numbers. The first runs from $2$ to infinity, and each entry is an element index $k$. The corresponding entries in the second list are the element values, which in this case is also $k$. Looking at the first element index ($2$), we compute $(j+1)k$ for $j \ge 1$. For each computed value, we look in the set of element values, and if it occurs there, we put a strike through it. Then we move to the next index and repeat this process. Although it is obvious that there is no need to perform the process with index $4$ (and many other subsequent indices), we do it anyway, as it has no untoward effect other than bloating the effort invested. Doing this extra work has some relevance to the next sieve presented for twin primes. What remains in the list of element values without any strikes through them are prime numbers. We know independently that the prime numbers are infinite, and thus the Sieve of Erastosthenes does not exhaust them; that is, it does not strike out every element value as the list proceeds to infinity.
Now for my sieve for twin primes. Setting aside the unique twin prime $(3,5)$, all other twin primes consist of numbers of the form $(6k \pm 1)$. So once again we make two lists: the first is the element index $k$ and runs from $1$ to infinity. The second is a list of element values which are the ordered pairs $(6k-1, 6k+1)$. Note that there are the same number of elements as in the Sieve of Erastosthenes, but that only one-third of all possible numerical values are represented within the actual elements.
The logic of my sieve is best seen in the context of an actual example, so let’s look at $k=1$ giving the pair $(5,7)$ which are both primes. We want to identify and strike out subsequent elements in which either of the members is divisible by either $5$ or $7$. We do that by calculating $(5+5\cdot 6j), (-5+5\cdot 6j), (7+7\cdot 6j),$ and $(-7+7\cdot 6j)$ for $j\ge 1$. Then for any element which features any of the calculated values, we strike out the element (NOT just the value). In the example given ($k=1$), it is apparent that elements containing the numbers $35, 65, 95,...,25, 55, 85,...49, 91, 133,...35, 77, 119,...$ are stricken. Just to assuage those who don’t see numbers like $10, 20, 30,...$ being stricken, I remind you that these numbers do not have the form $(6k \pm 1)$ and thus are not found in any of the elements in the list.
Generalizing, the computed values to cause the striking of an element are just $\pm (6k \pm 1)+6j(6k \pm 1)$, or $(6j \pm 1)(6k \pm 1)$. We must evaluate all indices (values of $k$), even though some (such as $k=20$) give no primes, because others (such as $k=4$) give at least one prime. This ensures that all primes of the form $(6k\pm 1)$ will be generated, and thus multiples of them will be identified and lead to removal of appropriate elements. As with the bloated version of the Sieve of Erastosthenes, some unnecessary work ("removing" multiples of composites) is done, but the process ensures than no primes are missed. I contend that what remains in the list of elements that are not stricken out is a complete set of twin primes (at least up to the point the process was carried out) because every candidate pair $(6k\pm 1)$ is examined, and every one of those containing at least one composite is stricken.
Question 1: Is this sieve already known? If so, references or cites would be appreciated.
The argument for an infinite number of twin primes goes as follows: The list of elements (ordered pairs) in my sieve contains the same number of entries as does the Sieve of Erastosthenes. In each case, for every prime number, some elements are stricken from the list. But in my case, each prime results in only one-third the number of strikes as occur in the Sieve of Erastosthenes. If a certain number of strikes cannot exhaust a list of a given number of elements, it seems that one-third the number ought not to exhaust an equally long list. Moreover, none of the numbers in my ordered pairs that results in a strike of the element is a number that doesn’t occur and result in a strike in the Sieve of Erastosthenes. In the end, however, I understand the issue is dependent on how the strikes are distributed, as (in an extreme example) thirty strikes though a single element will not exhaust a list that one strike through each of thirty elements would. The other weak spot is that each of the elements in my sieve has two members, and hence twice as many ways to incur a strike. My intuition tells me that these are addressable problems, but I don’t see the way to a proof.
Question 2: Can this line of thought be tightened up into a proof?