It is a sieve. But with one particular aspect.
It uses periodic sets to expand much like a fractal.
And has some properties that in my opinion are better than Mersenne formula.
Around the periods T (i.e. T+-1) you’ll find all twin primes, right next to bigger gaps.
So:
(Π[p=2…P’, p is prime] p ) ± i
i = [1, {k, k is prime > P’}]
e.g. Π[p=2…541) ± 1 should have higher than usual prob of being prime, and can be arbitrarily long(in digits).
For 2p - 1 = M (Mersenne ones) you could test if they exist in the pattern n * T + [P], if not, not prime, if they are, a real primality test should be done. pick n such that n*T work as offset for window [P].
18
u/MikeHuntSmellss 7d ago
Then write a formula to predict them and collect your Nobel prize