Selfridge–Conway primality test
E604130
The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Selfridge–Conway primality test canonical | 1 |
| Selfridge’s test for primality | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6540039 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Selfridge–Conway primality test Context triple: [John L. Selfridge, notableWork, Selfridge–Conway primality test]
-
A.
Adleman–Pomerance–Rumely primality test
The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
-
B.
Fermat primality test
The Fermat primality test is a probabilistic algorithm that checks whether a number is prime by verifying congruences derived from Fermat's little theorem.
-
C.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
D.
Carmichael number
A Carmichael number is a composite integer that nonetheless satisfies Fermat's primality test for all bases coprime to it, making it a classic example of a Fermat pseudoprime.
-
E.
Berlekamp’s algorithm for factoring polynomials over finite fields
Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Selfridge–Conway primality test Target entity description: The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
-
A.
Adleman–Pomerance–Rumely primality test
The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
-
B.
Fermat primality test
The Fermat primality test is a probabilistic algorithm that checks whether a number is prime by verifying congruences derived from Fermat's little theorem.
-
C.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
D.
Carmichael number
A Carmichael number is a composite integer that nonetheless satisfies Fermat's primality test for all bases coprime to it, making it a classic example of a Fermat pseudoprime.
-
E.
Berlekamp’s algorithm for factoring polynomials over finite fields
Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
- F. None of above. chosen
Statements (26)
| 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
ⓘ
deterministic primality tests ⓘ trial division ⓘ |
| field | number theory ⓘ |
| hasProperty |
Monte Carlo algorithm
ⓘ
linked to:
Monte Carlo method
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
ⓘ
linked to:
John H. Conway
John L. Selfridge ⓘ |
| output | probable prime or composite classification ⓘ |
| propertyTested | primality of integers ⓘ |
| purpose | determine whether a given integer is prime ⓘ |
| relatedTo |
Fermat primality test
ⓘ
Miller–Rabin primality test ⓘ
linked to:
Miller primality test
composite number detection ⓘ primality testing ⓘ probable prime tests ⓘ |
| uses | probabilistic methods ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Selfridge–Conway primality test Description of subject: The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Selfridge–Conway primality test