Lucas–Lehmer–Riesel test
Test for determining whether a number is prime / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Lucas–Lehmer–Riesel test?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.[citation needed] 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[1] (see Pocklington primality test) are used.
This article needs additional citations for verification. (January 2008) |