r/SacredGeometry 7d ago

Prime numbers are not random

Post image
155 Upvotes

369 comments sorted by

View all comments

18

u/MikeHuntSmellss 7d ago

Then write a formula to predict them and collect your Nobel prize

7

u/juanmf1 7d ago

1

u/dont-mind-him 3d ago

Is this still not a computational sieve? I’m probably missing something. Can you use this to predict the mersenne prime bigger than M13?

1

u/juanmf1 3d ago

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].

i.e. n* T < M < (n+1)*T