Explicit Primality Criteria for h ⋅2 k ± 1

DOI10.2307/2152938zbMATH Open0817.11060OpenAlexW4249260519MaRDI QIDQ3137451FDOQ3137451

Authors: Wieb Bosma 

Publication date: 8 August 1995

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2152938

Recommendations

• scientific article; zbMATH DE number 3346438
• Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)
• Explicit primality criteria for \(h \cdot 2^n \pm 1\)
• A note on primality tests for \(N=h\cdot 2^ n-1\)
• Primality tests for numbers of the form \(k\cdot 2^m\pm 1\)

zbMATH Keywords

tablesalgorithmprimality criteria

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11) Software, source code, etc. for problems pertaining to number theory (11-04)

Cited In (17)

• Explicit primality criteria for $(p-1)p^n-1$
• A note on primality tests for \(N=h\cdot 2^ n-1\)
• Biquadratic reciprocity and a Lucasian primality test
• Some Factorizations of 2 n ± 1 and Related Results
• Explicit primality criteria for \(h \cdot 2^n \pm 1\)
• Some computational experiments in number theory
• A proof of the Lucas-Lehmer test and its variations by using a singular cubic curve
• Lucas-Lehmer primality tests for certain prime curios
• Primality tests for numbers of the form \(k\cdot 2^m\pm 1\)
• Title not available (Why is that?)
• Primality testing for numbers of the form \(h\cdot 2^n\pm 1\)
• On integers of the forms \(k\pm 2^{n}\) and \(k2^{n}\pm 1\)
• Title not available (Why is that?)
• On integers of the form 𝑘2ⁿ+1
• Prime-number algorithm for public-key systems
• Primality criteria for pairs \(n\) and \(n+d\)
• A generalised Lucasian primality test

This page was built for publication: Explicit Primality Criteria for h ⋅2 k ± 1

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