| Information | |
|---|---|
| has gloss | eng: In mathematics, the Lucas–Lehmer–Riesel test is a primality test for numbers of the form N = k2n − 1, with 2n > k. The test was developed by Hans Riesel and it is based on the Lucas–Lehmer primality test. It is the fastest deterministic algorithm known for numbers of that form. The Brillhart–Lehmer–Selfridge test is the fastest deterministic algorithm for numbers of the form N = k2n + 1 |
| lexicalization | eng: Lucas-Lehmer-Riesel test |
| lexicalization | eng: Lucas–Lehmer–Riesel test |
| instance of | e/Primality test |
| Meaning | |
|---|---|
| Dutch | |
| has gloss | nld: De Lucas-Lehmer-Rieseltest is een test om de primaliteit van een getal N te testen, waarbij N = k*2^n-1, met 2^n > k. De test is ontwikkeld door Hans Riesel en hij is gebaseerd op de bestaande Lucas-Lehmertest voor mersennegetallen. Hij staat beschreven in het artikel "Lucasian Criteria for the Primality of h*2^n-1". |
| lexicalization | nld: Lucas-Lehmer-Riesel-test |
| lexicalization | nld: Lucas-Lehmer-Rieseltest |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint