Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
primality test
|
| gptkbp:appliesTo |
gptkb:Mersenne_numbers
|
| gptkbp:complexity |
O(p^2)
|
| gptkbp:field |
number theory
|
| gptkbp:firstPublished |
1930
|
| 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 |
gptkb:Great_Internet_Mersenne_Prime_Search_(GIMPS)
|
| gptkbp:numberOfStages |
Set s = 4
|
| gptkbp:output |
prime or composite
|
| gptkbp:relatedTo |
gptkb:Lucas_sequence
gptkb:Lehmer_random_number_generator Mersenne prime |
| gptkbp:step |
If s = 0, then 2^p - 1 is prime
If s ≠ 0, then 2^p - 1 is composite Repeat s = s^2 - 2 mod (2^p - 1) for p-2 times |
| gptkbp:supportsAlgorithm |
deterministic
|
| gptkbp:usedFor |
testing primality of Mersenne numbers
|
| gptkbp:bfsParent |
gptkb:Mersenne_prime
|
| gptkbp:bfsLayer |
7
|