Lucas–Lehmer–Riesel test
id:
lucas-lehmer-riesel-test-270-13418174
title:
Lucas–Lehmer–Riesel test
text:
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, either application of Proth's theorem or one of the deterministic proofs described in Brillhart–Lehmer–Selfridge 1975 are used.
brand slug:
wiki
category slug:
encyclopedia
description:
Test for determining whether a number is prime
original url:
https://en.wikipedia.org/wiki/Lucas%E2%80%93Lehmer%E2%80%93Riesel_test
date created:
date modified:
2024-01-14T11:56:58Z
main entity:
{"identifier":"Q3459114","url":"https://www.wikidata.org/entity/Q3459114"}
image:
fields total:
13
integrity:
14