Testing numbers of the form for primality

DOI10.1515/DMA.2008.019MaRDI QIDQ3184538zbMATH OpenOpenAlexFDO

Authors E. V. Sadovnik

Publication date 21 October 2009

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

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

zbMATH Keywords

variation of Lucas primality test

Mathematics Subject Classification ID

Primality (11Y11)

Recommendations

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

Cited in

(14)

• Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\).
• A primality test for \(4Kp^n-1\) numbers
• Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)
• Primality testing of Woodall numbers
• Primality of numbers of the form AP^K+1
• Primality tests for numbers of the form k 2ᵐ 1
• Effective Primality Tests for Some Integers of the Forms A5 n - 1 and A7 n - 1
• Some Algorithms for Prime Testing Using Generalized Lehmer Function
• scientific article; zbMATH DE number 1995935 (Why is no real title available?)
• scientific article; zbMATH DE number 2154275 (Why is no real title available?)
• scientific article; zbMATH DE number 2163454 (Why is no real title available?)
• Two algorithms to find primes in patterns
• Testing numbers of the form N = 2kpm − 1 for primality
• A primality test for \(Kp^{n}+1\) numbers

This page was built for publication: Testing numbers of the form for primality

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