One of the key missing elements of the prime number sequence is the ability to identify the i th term in the sequence. That works two ways – can we calculate the i th term and if we have a prime number can we identify its position in the sequence?
This blog has shown how it is possible to lay out specific composite numbers in a series of arrays or helices. Each array/helix is related to a specific prime number and the composite numbers in each array/helix are prime multiples of that specific prime number. The composite array/helix can be translated into a secondary array/helix by dividing each composite by the specific prime number. The secondary array is rich in prime numbers and the composites that fill the gaps in the secondary array are all multiples of the specific prime number and all larger prime numbers (i.e. multiples of smaller primes are excluded). The important thing to bear in mind is that ALL primes larger than the specific prime number are included AND that the primes are arranged in an array. With a little careful transfer of “lines” (i.e. rows or columns depending on how you have arranged them) a “line of symmetry” at p#/2 runs through the middle of each secondary array/helix.
The next thing to bear in mind is the number of positions in the each array/helix. This is crucial to counting primes and identifying the i th term. The number is the same for both primary (i.e. composite) and secondary (i.e. prime rich) array.
So the array associated with prime number 5 has a mere 2 positions. As we have seen this leads to the well known 6n+/-1 formula.
The array associated with prime number 7 has 8 positions. Due to the absence of composites in the secondary array (i.e. the first composite appearing is 49) we can count the primes:
The array – associated with prime number 7, the fourth prime number – starts with 11, which is the fifth prime number (i.e. +1 from 4 to 5). We know there are 8 lines in the array so the first prime number in the second line will be the 13th prime number. Based on the more advanced/larger arrays we cannot predict exactly what the 13th prime number will be but we do know that the NEXT prime number will be the 13th. In this case the next prime is + 5#=30 i.e. 11 + 30 = 41.
Moving on we can see that adding pi to pi-1 # gives a good way of counting the primes as we know the number of primes separating pi from pi + pi-1 # .
Looking at the first prime in the second row of each array/helix:
13th prime is 41
48th prime is 223
345th prime is 2327……except that 2327 is not prime: 2333 is the 345th prime so you will need to see the table to see what it provides
Meanwhile the series 13, 48, 345, 3250, 42333 is not registered on OEIS so maybe no one has got here yet?
Meanwhile I have found out that Microsoft Excel starts to be of little use if you need more than around 15 significant digits so this is as far as I can go:
The 9,414,916,809,097th prime number is the first prime number after 304,250,263,527,257.
I can make a stab at both the
362,597,750,396,746th prime number
and the 1,539,772,852,781,310th prime number
but excel being excel and I have also reached the limit of primes.utm.edu