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?
Let P be a prime > 7, and let D={p1, p2, ..., pn} (n>1) be the set of all primes < sqrt(P). Consider a disjoint decomposition of the set D, say D = Q union R,
The quadratic part of the quadratic sieve factoring algorithm illustrated with a small integer. Let z = 33 = 3 * 11 We know that it is trivial to factor such a
If p is prime, there exist an element g such that g**(p-1) = 1 mod p, and for 0 < k < (p-1), g**k is not = 1 mod p. g is called a generator mod p. I don't know
Here's how I want to define the magnum 357 test! take N; if 'N' passes the 2-PRP test, then... if 3, 5, or 7 divides 'N', then 'N' is composite... and we are