Conjectured polynomial time primality tests for numbers of special forms

MaRDI QIDQ5744651zbMATH OpenFDO

Authors Predrag Terzić

Publication date 18 February 2016

Full work available at URL http://nntdm.net/papers/nntdm-20/NNTDM-20-5-40-43.pdf

zbMATH Keywords

polynomial timeprimality testprime numbers

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Recommendations

• Effective Primality Tests for Some Integers of the Forms A5 n - 1 and A7 n - 1
• Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)
• Primality test for numbers of the form \((2p)^{2^n}+1\)
• A generalization of Miller’s primality theorem
• Effective primality tests for integers of the forms \(N=k3^ n+1\) and \(N=k2^ m3^ n+1\)

Cited in

(4)

• scientific article; zbMATH DE number 6000685 (Why is no real title available?)
• Primality testing of Woodall numbers
• Explicit Bounds for Primality Testing and Related Problems
• Formal and efficient primality proofs by use of computer algebra oracles

This page was built for publication: Conjectured polynomial time primality tests for numbers of special forms

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