Selfridge–Conway primality test

E604130

algorithm in number theory probabilistic primality test

The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.

Try in SPARQL Jump to: Surface forms Statements Referenced by

Observed surface forms (1)

Surface form	Occurrences
Selfridge’s test for primality	1

Predicate	Object
instanceOf	algorithm in number theory ⓘ probabilistic primality test ⓘ
application	cryptographic key generation ⓘ testing large integers for primality ⓘ
category	computational number theory ⓘ
contrastWith	AKS primality test NERFINISHED ⓘ deterministic primality tests ⓘ trial division ⓘ
field	number theory ⓘ
hasProperty	Monte Carlo algorithm NERFINISHED ⓘ more efficient than naive primality testing for large n ⓘ non-deterministic result for composite numbers ⓘ probabilistic correctness ⓘ zero error probability for primes (under its assumptions) ⓘ
input	integer n > 1 ⓘ
namedAfter	John Horton Conway NERFINISHED ⓘ John L. Selfridge NERFINISHED ⓘ
output	probable prime or composite classification ⓘ
propertyTested	primality of integers ⓘ
purpose	determine whether a given integer is prime ⓘ
relatedTo	Fermat primality test NERFINISHED ⓘ Miller–Rabin primality test NERFINISHED ⓘ composite number detection ⓘ primality testing ⓘ probable prime tests ⓘ
uses	probabilistic methods ⓘ

Full triples — surface form annotated when it differs from this entity's canonical label.

John L. Selfridge → notableWork → Selfridge–Conway primality test ⓘ

this entity surface form: Selfridge’s test for primality