Primality test for numbers of the form \(A p^n + w_n\)
From MaRDI portal
Publication:491620
DOI10.1016/J.JDA.2015.03.003zbMath1364.11160arXiv1306.4562OpenAlexW3121503054MaRDI QIDQ491620
Publication date: 18 August 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.4562
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On distinguishing prime numbers from composite numbers
- A class of primality tests for trinomials which includes the Lucas-Lehmer test
- Effective primality tests for integers of the forms \(N=k3^ n+1\) and \(N=k2^ m3^ n+1\)
- Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\).
- PRIMES is in P
- Primality Testing and Jacobi Sums
- Effective Primality Tests for Some Integers of the Forms A5 n - 1 and A7 n - 1
- The Pseudoprimes to 25 ⋅10 9
- Cubic reciprocity and generalised Lucas-Lehmer tests for primality of 𝐴.3ⁿ±1
- A generalization of Proth's theorem
- Explicit primality criteria for $(p-1)p^n-1$
- Biquadratic reciprocity and a Lucasian primality test
- The Primality of N=2A3n-1
- Some Prime Numbers of the Forms 2A3 n + 1 and 2A3 n - 1
This page was built for publication: Primality test for numbers of the form \(A p^n + w_n\)