mersenneforum.org - View Single Post - Chebyshev polynomials and higher order Lucas Lehmer algorithm by Kok Seng Chu

Dr Sardonicus · 2022-01-15, 14:44

The sufficiency result (Lemma 2.1) requires a complete factorization of Q + 1 or Q - 1 in order to prove that Q is prime.

2022-01-15, 14:44	#3
Dr Sardonicus Feb 2017 Nowhere 2²×31×47 Posts	The sufficiency result (Lemma 2.1) requires a complete factorization of Q + 1 or Q - 1 in order to prove that Q is prime.