# Questions tagged [lucas-lehmer-test]

The Lucas–Lehmer test (LLT) is a primality test for Mersenne numbers.

13 questions
Filter by
Sorted by
Tagged with
35 views

### if such counter example to Lehmer's totient problem exists then could we have more counter examples?

Lehmer's totient problem asks whether there is any composite number $n$ such that Euler's totient function $φ(n)$ divides $n − 1$. which it is unsolved problem or we may reformulate that question as : ...
227 views

### Can my Home PC Handle the Lucas-Lehmer Test by Itself? (or Do I Need GIMPS)

Last year, the largest Mersenne prime $2^{82,589,933}$ that we now know of was discovered. It contains almost $25,000,000$ digits if expanded out. I do not understand much how GIMPS operates, other ...
420 views

455 views

188 views

### Lucas Lehmer Test

I have tried to write a function that test if it is prime using Lucas Lehmer Test ...
59 views

### Pell-Lucas number

I'm studying about Pell number and Pell-Lucas number whose have Binet formula $P_n=\frac{\alpha^n-\beta^n}{\alpha-\beta}$ and $Q_n=\alpha^n+\beta^n$, where $\alpha=1+\sqrt{2}$ and $\beta=1-\sqrt{2}$, ...
75 views

### What are some basic properties of the quotient $s_n\over M_p$ where $M_p$ is a Mersenne prime?

I've been exploring the Lucas-Lehmer test for a while now. I already know the square of one Mersenne $(2^n-1)^2$ is $(2^{n-1}-1)(2^{n+1}-1)+2^{n-1}$. Today I'm looking to use the properties of the ...
217 views

### What area's of mathematics are needed to make a basic understanding of the FFT algorithm ?

I know FFT is used in signal processing ( at last check), the Lucas-Lehmer Test and probably many other things. But what is the Fast Fourier Transform and what area's of math will help me understand ...
The usual ( but simple version) Lucas-Lehmer primality test, as done on Mersenne numbers ( of form $2^n-1$) is as follows: s_0=4\\s_n=(s_{n-1})^2-2 \pmod {2^n-1}\\if\;s_{p-2}\equiv0\pmod{2^n-1}\\2^...
We start, with the original Lucas-Lehmer test format: $s_0=4\\ s_i=s_{i-1}^2-2 \pmod {2^p-1}$ We can note, right away, that all terms are even. Dividing out the factor of 2, we get: \$s_0=2\\ s_i=...