Testing numbers of the form N = 2kpm − 1 for primality

DOI10.1515/156939206777344610MaRDI QIDQ5424045zbMATH OpenOpenAlexFDO

Authors E. V. Sadovnik

Publication date 2 November 2007

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939206777344610

zbMATH Keywords

complexitydeterministic primality testsLucas sequencesnumbers of the form \(N=2kp^m-1\)

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Testing numbers of the form for primality
• Primality tests for numbers of the form k 2ᵐ 1
• Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)
• Some primality conditions for N=2p^n -1
• A primality test for \(4Kp^n-1\) numbers

Cites work

• scientific article; zbMATH DE number 3077849 (Why is no real title available?)
• scientific article; zbMATH DE number 3091928 (Why is no real title available?)
• PRIMES is in P

Cited in

(12)

• A primality test for \(4Kp^n-1\) numbers
• Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)
• Explicit primality criteria for h 2ⁿ 1
• Testing numbers of the form for primality
• Lucas-Lehmer primality tests for certain prime curios
• Primality of numbers of the form AP^K+1
• Primality tests for numbers of the form k 2ᵐ 1
• A Proof of the Lucas-Lehmer Test
• scientific article; zbMATH DE number 1995935 (Why is no real title available?)
• Some primality conditions for N=2p^n -1
• scientific article; zbMATH DE number 3346438 (Why is no real title available?)
• Some primality tests that eluded Lucas

This page was built for publication: Testing numbers of the form N = 2kpm − 1 for primality

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