A Lucas-Lehmer primality test for the numbers n=Ap_ 1^ s_ 1p_ 2^ s_ 2 p_ t^ s_ t+

MaRDI QIDQ3625894zbMATH OpenFDO

Authors Daniel Sadornil, Juan Tena Ayuso

Publication date 22 May 2009

zbMATH Keywords

Deterministic primality testsLucas-Lehmer testProth test

Mathematics Subject Classification ID

Primality (11Y11)

Recommendations

• Some primality conditions for N=2p^n -1
• Explicit primality criteria for h 2ⁿ 1
• Lucas-Lehmer primality tests for certain prime curios
• Primality tests for numbers of the form k 2ᵐ 1
• Probable prime tests for generalized Mersenne numbers

Cited in

(13)

• Probable prime tests for generalized Mersenne numbers
• Explicit primality criteria for h 2ⁿ 1
• Primality testing of Woodall numbers
• Lucas-Lehmer primality tests for certain prime curios
• A generalised Lucasian primality test
• Primality testing and prime constellations
• A Proof of the Lucas-Lehmer Test
• Some Algorithms for Prime Testing Using Generalized Lehmer Function
• scientific article; zbMATH DE number 1512695 (Why is no real title available?)
• Some primality conditions for N=2p^n -1
• scientific article; zbMATH DE number 7199615 (Why is no real title available?)
• Classical and Alternative Approaches to the Mersenne and Fermat Numbers
• scientific article; zbMATH DE number 3334321 (Why is no real title available?)

Describes a project that uses

Uses Software

• Maple

This page was built for publication: A Lucas-Lehmer primality test for the numbers \(n=Ap_ 1^ {s_ 1}p_ 2^ {s_ 2}\cdots p_ t^ {s_ t}+\omega\)

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