On good initial values for the Lucas-Lehmer sequence

DOI10.1016/J.JNT.2010.06.006MaRDI QIDQ710501zbMATH OpenOpenAlexFDO

Authors Bruno Deschamps

Publication date 19 October 2010

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jnt.2010.06.006

zbMATH Keywords

good initial valueLucas-Lehmer sequence

Mathematics Subject Classification ID

Factorization; primality (11A51) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Review text

A sequence \((u_n)_{n\geq 0}\) of integers such that \(u_{n+1}=u_n^2-2\), \(n\geq 0\) is called Lucas-Lehmer. A good initial value \(u_0\) for such a sequence satisfies by definition \[ \forall p\geq p_0,\;p\,\text{prime}:\quad 2^p-1\,\text{is prime}\Leftrightarrow 2^p-1\mid u_{p-2}. \] The author proves that there are infinitely many good initial values for a Lucas-Lehmer sequence.

Recommendations

• A Proof of the Lucas-Lehmer Test
• Primitive divisors of Lucas and Lehmer sequences. II
• On divisors of Lucas and Lehmer numbers
• Primitive divisors of Lucas and Lehmer sequences, III
• On primes in Lucas sequences

Cites work

• A Proof of the Lucas-Lehmer Test
• A Really Trivial Proof of the Lucas-Lehmer Test

Cited in

(1)

• ``Good numbers

This page was built for publication: On good initial values for the Lucas-Lehmer sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710501)