Skip to content

Mathematics Quote by Matt Parker

“The Lucas-Lehmer primality test also uses a recursive function to produce a sequence of numbers (the Lucas-Lehmer sequence). This sequence starts with 4, and each number after that is the previous number squared, minus 2 (see below). For any Mersenne number (such as 2^3 - 1 = 7 and 2 ^ 8 - 1 =…” quote by Matt Parker
Download Open image
““The Lucas-Lehmer primality test also uses a recursive function to produce a sequence of numbers (the Lucas-Lehmer sequence). This sequence starts with 4, and each number after that is the previous number squared, minus 2 (see below). For any Mersenne number (such as 2^3 - 1 = 7 and 2 ^ 8 - 1 = 255), you take its power of 2 ( so, 3 and 8 in our examples) and, if the Lucas-Lehmer number in the position one less than that power ( so, second and seventh) is an exact multiple ( no remainders allowed) of the Mersenne number, then it is definitely prime.””

Matt Parker

About This Quote

Source Video: Numberphile episode on Lucas‑Lehmer test, 2018

The test checks Mersenne numbers for primality by iterating a specific recurrence; if the final term is divisible by the original number, it is prime.

In simple terms: A method to prove certain numbers are prime.

Key Takeaway

Use the test to verify large primes.

Themes

mathematics number theory algorithm primality testing

Mood

analytical curious

Type

educational technical

When to use this quote

  • research
  • cryptography
  • education
  • software development

Key Concepts

recursion modular arithmetic Mersenne primes

Questions to Reflect On

  • Can you explain the recurrence in simple terms?
  • Why are Mersenne primes important?
A Different Perspective

Complexity grows quickly for very large exponents.

3.9 out of 5 (4 ratings)

More by Matt Parker

Explore all 39 Matt Parker quotes

More Mathematics quotes

Browse all 4,333 Mathematics quotes