Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
primality test
|
| gptkbp:appliesTo |
gptkb:Mersenne_numbers
|
| gptkbp:category |
gptkb:algorithm
|
| gptkbp:complexity |
O(p^2)
|
| gptkbp:field |
number theory
|
| gptkbp:firstPublished |
1878
|
| https://www.w3.org/2000/01/rdf-schema#label |
Lucas–Lehmer Primality Test
|
| gptkbp:input |
Mersenne number of the form 2^p - 1
|
| gptkbp:namedAfter |
gptkb:Édouard_Lucas
gptkb:Derrick_Henry_Lehmer |
| gptkbp:notableFor |
discovery of largest known primes
|
| gptkbp:numberOfStages |
set s=4
|
| gptkbp:output |
prime or composite
|
| gptkbp:relatedTo |
gptkb:Lucas_sequence
Mersenne prime |
| gptkbp:step |
if s mod (2^p-1) = 0, then 2^p-1 is prime
otherwise, 2^p-1 is composite repeat s = s^2 - 2 for p-2 times |
| gptkbp:supportsAlgorithm |
deterministic
|
| gptkbp:usedFor |
testing primality of Mersenne numbers
|
| gptkbp:usedIn |
Great Internet Mersenne Prime Search
|
| gptkbp:bfsParent |
gptkb:Mersenne_Primes
|
| gptkbp:bfsLayer |
8
|