Explicit Primality Criteria for h ⋅2 k ± 1
From MaRDI portal
Publication:3137451
DOI10.2307/2152938zbMath0817.11060OpenAlexW4249260519MaRDI QIDQ3137451
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
Software, source code, etc. for problems pertaining to number theory (11-04) Factorization; primality (11A51) Primality (11Y11)
Related Items (10)
Explicit primality criteria for \(h \cdot 2^n \pm 1\) ⋮ Biquadratic reciprocity and a Lucasian primality test ⋮ On integers of the forms \(k\pm 2^{n}\) and \(k2^{n}\pm 1\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Prime-number algorithm for public-key systems ⋮ A generalised Lucasian primality test ⋮ Primality testing for numbers of the form \(h\cdot 2^n\pm 1\) ⋮ Explicit primality criteria for $(p-1)p^n-1$ ⋮ On integers of the form 𝑘2ⁿ+1
This page was built for publication: Explicit Primality Criteria for h ⋅2 k ± 1
