Lucas-Lehmer test: Difference between revisions

Lucas-Lehmer Test: for <math>p</math> aan odd prime, the Mersenne number <math>2^p-1</math> is prime if and only if <math>2^p-1</math> divides <math>S(p-1)</math> where <math>S(n+1)=(S(n))^2-2</math>, and <math>S(1)=4</math>.