KnowraPrimality testLinked fromLinked fromThe 17 pages that link to Primality test, each with the reason it gives.All 17Broader topic 2Related 5Narrower topic 9Compared with 1Prime numberNarrower topic: Primality testing generalizes trial division to much larger integers.Trial divisionNarrower topic: Trial division gives a simple definitive test when the candidate range is manageable.Lucas sequenceNarrower topic: Special Lucas sequences underpin efficient tests for primality.Édouard LucasNarrower topic: Lucas’s criteria belong to the broader study of efficient primality testing.Fermat numberNarrower topic: Testing enormous Fermat numbers is a specialized challenge within computational primality testing.Wilson's theoremNarrower topic: Wilson's congruence gives a deterministic primality criterion with very high computational cost.PseudoprimeNarrower topic: Pseudoprimes arise when a test's prime-identifying condition also accepts composites.Agoh–Giuga conjectureNarrower topic: The conjecture would give a direct, if computationally costly, primality criterion.Proth's theoremNarrower topic: Proth's theorem supplies a deterministic test for its restricted number family.