PrimeNumbers is a e-mail discussion list for those
who enjoy prime numbers. Some look for patterns, some seek to find new records, others try to understand the distribution. We try to limit our discussion to
prime numbers, primality testing, and very closely
related subjects.
If you enjoy prime numbers there are similar lists you
might enjoy, such as PrimeForm
focusing on primality proving programs and
GIMPS' Mersenne
Primes list.
If you think you have a Goldbach proof -- there are groups which deal specifically with such matters, perhaps try those first?
... For base 2, I recommend LLR, since it will automatically do a Proth test for k*2^n+1 numbers. You could also use PFGW, but you would need to force a
... Others will correct me if I am wrong, but I think they use the same arithmetic engine now. Of course prp.exe does not prove primality. LLR might be the
A Ramanjan Prime Corollary: 2*p_(i-n) > p_i for i > k where k = primepi(p_k) = primepi(R_n). That is, p_k is the n'th Ramanujan Prime, R_n, and the k'th prime.