maths.lucas_lehmer_primality_test

In mathematics, the Lucas-Lehmer test (LLT) is a primality test for Mersenne numbers. https://en.wikipedia.org/wiki/Lucas%E2%80%93Lehmer_primality_test

A Mersenne number is a number that is one less than a power of two. That is M_p = 2^p - 1 https://en.wikipedia.org/wiki/Mersenne_prime

The Lucas-Lehmer test is the primality test used by the Great Internet Mersenne Prime Search (GIMPS) to locate large primes.

Functions

lucas_lehmer_test(→ bool)

Module Contents

maths.lucas_lehmer_primality_test.lucas_lehmer_test(p: int) → bool

>>> lucas_lehmer_test(p=7)
True

>>> lucas_lehmer_test(p=11)
False

# M_11 = 2^11 - 1 = 2047 = 23 * 89