- #1
Loren Booda
- 3,125
- 4
Somewhere between brute force and Mersenne derivation of primes is the formula I found,
[tex]\prod_{n=1}^Np_n-1=p_Z[/tex]
I guess it would generate more primes pZ than Mersenne in a given interval, but requires knowledge of all primes to pN, the Nth prime. It may produce only primes, rather than Mersenne's hit-or-miss search. The pn here are supposed to follow 2, 3, 5, 7, 11, 13, 17...pN, but the formula might work somewhat with an incomplete sequence of primes.
Have I discovered anything new here? The equation is so simple and effective that it must have already been found.
[tex]\prod_{n=1}^Np_n-1=p_Z[/tex]
I guess it would generate more primes pZ than Mersenne in a given interval, but requires knowledge of all primes to pN, the Nth prime. It may produce only primes, rather than Mersenne's hit-or-miss search. The pn here are supposed to follow 2, 3, 5, 7, 11, 13, 17...pN, but the formula might work somewhat with an incomplete sequence of primes.
Have I discovered anything new here? The equation is so simple and effective that it must have already been found.