Just a short primer.
Prime numbers are those numbers that are only divisible by themselves and the number '1'. The set of all primes starts with the number '2', and because all even numbers are multiples of 2, every prime number after that, is odd. Except for the number '2', no new prime number can be a multiple of two.
The next prime number is '3'. '2' and '3' are the only two prime numbers that follow in immediate sequence in the set of Integers or Natural numbers. After that, there are lots of primes that appear as "pairs", in that they are only two numbers apart, like '3' & '5', '5' & '7', '11' & '13'. In fact, it is generally accepted that there are an infinite number of prime pairs.
'3', like '2', is a prime number, thus eliminating all other numbers that are divisible by '3' as a next possible prime number. So, no subsequent prime numbers will land in any third place on the number line, such as: 6 (3x2), 9 (3x3), 12 (3x4 and 6x2), or 15 (you get the picture). The thing is, every time a prime number appears, the following sequence of number will never include another prime that appears in that prime's number of places from the parent prime. I mean, for the nth prime number, no prime will subsequently appear in the positions of n+n, 3n, 4n, 5n, ... and so on. Every prime number, by the nature of primes, becomes the least common denominator of its multiples. (There are no primes that have another prime as one of its factors. By definition, all prime numbers have only itself and '1' as factors).
Since there is only one prime for its multiples, and an infinite number of multiples for each prime factor, the further along the Integer numberline we go, the less likely we are to find the next prime number. Yet, they go on into infinity, just like their multiples.
Every prime number, thus behaves exactly like every other prime number with only the exceptions of '2', being even, and '3' being right next to '2'. Yet, according to the abstract I just read in which some mathematicians claim to have found a way to predict the next prime (in other words, they can determine the nth prime number), All they need to do that with are, the four primes: '2', '3', '5', and '7'.
https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4742238
From these, they have put together a Periodic Table of Primes, or PTP.
"We identify 48 integers out of a period of 2×3×5×7=210 to be the roots of all primes and composites without factors of 2, 3, 5, and 7, each of which is an offspring of the 48 integers uniquely allocated on the PTP."
I wish my math skills were better, because...How does that work?
-Will
Not a great/detailed answer since my maths skills aren’t great. The abstract interested me so I just spent the past hour and a half reading through and trying to formulate it without all the academic jargon here.
If you download the paper, the introduction explains their method well (that’s what I used to formulate this answer). They used a cyclic method and matrices to create the PTP.
The PTP is created using a CTC they develop.
The 48 integers are primes and composites without factors of the first 4 primes within the interval 11 to 211. These numbers become the left column of the PTP table and cycle(1) of the cycle used later in the matrices. These integers are the base for the whole thing.
The 48 integers are, r(1) = 11, r(2) = 13, r(3) = 17, …, r(24) = 107, …, r(48) = 211.
The matrices set out with interval [48(theta - 1) + 1, 48(theta)]. The formula for 48(theta) is r(n) + 210(theta - 1). Where theta is the cycle number. These matrices make up the CTC, with different cycles making up different matrices. Different cycles allow them to observe different patterns among the CTC.
They then use a further formula to eliminate all composites from the CTC.
They use the CTC’s obtained from different cycles (and observations of different patterns) to generate the PTP (which is a matrix of the primes within the given interval).
Using the CTC and PTP they’re then able to work out the total number of primes and twin primes within the interval.
I hope this helps at all
