Lucas–Lehmer–Riesel test
Lucas–Lehmer–Riesel test is a Test for determining whether a number is prime.
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 19, 2026 · revision 2443508532
- Described as
- Test for determining whether a number is prime
- What it is
- primality test
- Named after
- Édouard Lucas; Derrick Henry Lehmer
- Wikipedias with a page
- 6
Wikidata item Q3459114 (wikidata.org/wiki/Q3459114), public domain (CC0). Copied 2026-11-19.
What Wikipedia says · copied November 19, 2026 · revision 1361499780
In mathematics, the Lucas–Lehmer–Riesel test is a primality test for numbers of the form N = k · 2n − 1 with odd k < 2n. 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. For numbers of the form N = k · 2n + 1 (Proth numbers), either application of Proth's theorem (a Las Vegas algorithm) or one of the deterministic proofs described in Brillhart–Lehmer–Selfridge 1975 (see Pocklington primality test) are used.
From the Wikipedia article “Lucas–Lehmer–Riesel test” (en.wikipedia.org/wiki/Lucas–Lehmer–Riesel_test), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-19; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
