
	Where results make sense

Topic: Primality test

Related Topics

Prime number

Fermat prime

Generalized Riemann hypothesis

Composite number

AKS primality test

Integer factorization

Multiplicative group of integers modulo n

RSA

General number field sieve

2 (number)

Sieve of Eratosthenes

Number theory

59 (number)

	ipedia.com: Primality test Article (Site not responding. Last check: 2007-11-07)
		The simplest primality "test" is as follows: Given an input number N, we check each integer k > 1 other than N to see whether N is divisible by k.
		The simplest true primality test is as follows: Given an input number N, we check whether it is divisible by any integer between 1 and N exclusive.
		A more convenient primality test is as follows: Given an input number N, we check whether it is divisible by any integer greater than 1 and less than or equal to the square root of N.
	www.ipedia.com /primality_test.html (835 words)

	Encyclopedia: AKS primality test (Site not responding. Last check: 2007-11-07)
		The AKS primality test (also known as Agrawal-Kayal-Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by three Indian scientists named Manindra Agrawal, Neeraj Kayal and Nitin Saxena on August 6, 2002 in a scientific paper titled "PRIMES is in P".
		The AKS primality test is based upon the equivalence
		The AKS primality test (also known as Agrawal-Kayal-Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm discovered and published by three India n scientists named Manindra Agrawal, Neeraj Kayal and Nitin Saxena in August 6, 2002 in a scientific paper titled "PRIMES is in P".
	www.nationmaster.com /encyclopedia/AKS-primality-test (1530 words)

	math lessons - Miller-Rabin primality test
		The Miller-Rabin primality test is a primality test: an algorithm which determines whether a given number is prime, similar to the Fermat primality test and the Solovay-Strassen primality test.
		Just like with the Fermat and Solovay-Strassen tests, with the Miller-Rabin test we will rely on an equality or set of equalities that hold true for prime values, and then see whether or not they hold for a number that we want to test for primality.
		Like all probabilistic primality tests, there are values of n that will repeatedly produce liars, thus claiming that n is prime when it is actually composite -- these values are known as pseudoprimes.
	www.mathdaily.com /lessons/Miller-Rabin_primality_test (706 words)

	Prime k-tuplets (Site not responding. Last check: 2007-11-07)
		In keeping with similar published lists, I have decided not to accept anything other than true, verifiable primes.
		Numbers which have merely passed the Fermat test, a^N = a (mod N), will need to be validated.
		Otherwise the numbers may have to be subjected to a general primality test, such as the Jacobi sum test of Adleman, Pomerance, Rumely, Cohen and Lenstra (APRT-CLE in UBASIC, for example), or Atkin and Morain's Elliptic Curve program, ECPP.
	www.ltkz.demon.co.uk /ktuplets.htm (5928 words)

Try your search on: Qwika (all wikis)