A primality test for 𝐾𝑝ⁿ+1 numbers
From MaRDI portal
Publication:5497037
DOI10.1090/S0025-5718-2014-02849-4zbMath1352.11105OpenAlexW2906963319MaRDI QIDQ5497037
Antonio M. Oller-Marcén, José María Grau, Daniel Sadornil
Publication date: 30 January 2015
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2014-02849-4
Related Items (2)
Relative class numbers inside the \(p\)th cyclotomic field ⋮ A primality test for \(4Kp^n-1\) numbers
Cites Work
- Effective primality tests for integers of the forms \(N=k3^ n+1\) and \(N=k2^ m3^ n+1\)
- Generalized strong pseudoprime tests and applications
- Fast multiplication of large numbers
- Deterministic primality test for numbers of the form $A^2.3^n+1$, $n \ge 3$ odd
- An 𝑂̃(log²(𝑁)) time primality test for generalized Cullen numbers
- A generalization of Miller’s primality theorem
- New Primality Criteria and Factorizations of 2 m ± 1
- Cubic reciprocity and generalised Lucas-Lehmer tests for primality of 𝐴.3ⁿ±1
- A generalization of Proth's theorem
- Some Prime Numbers of the Forms 2A3 n + 1 and 2A3 n - 1
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A primality test for 𝐾𝑝ⁿ+1 numbers
