Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:primality_test
|
| gptkbp:appliesTo |
gptkb:Mersenne_numbers
|
| gptkbp:category |
gptkb:mathematics
|
| gptkbp:complexity |
O(p^2)
|
| gptkbp:countryOfPublication |
gptkb:French
|
| gptkbp:field |
number theory
|
| gptkbp:firstPublished |
1878
|
| gptkbp:initialValue |
s_0 = 4
|
| gptkbp:input |
prime number p
|
| gptkbp:namedAfter |
gptkb:Édouard_Lucas
gptkb:Derrick_Henry_Lehmer |
| gptkbp:notableFor |
Great Internet Mersenne Prime Search
|
| gptkbp:output |
whether 2^p - 1 is prime
|
| gptkbp:relatedTo |
gptkb:Lucas_sequence
gptkb:Mersenne_prime primality testing |
| gptkbp:step |
uses recurrence relation s_n = s_{n-1}^2 - 2
|
| gptkbp:supportsAlgorithm |
deterministic
|
| gptkbp:testCondition |
s_{p-2} ≡ 0 mod (2^p - 1)
|
| gptkbp:usedFor |
determining if a Mersenne number is prime
|
| gptkbp:bfsParent |
gptkb:Lucas_primality_test
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Lucas–Lehmer test
|