Explicit primality criteria for $(p-1)p^n-1$
From MaRDI portal
Publication:4501051
DOI10.1090/S0025-5718-00-01212-6zbMath1018.11062OpenAlexW1918379444MaRDI QIDQ4501051
Andreas Stein, Hugh C. Williams
Publication date: 3 September 2000
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-00-01212-6
Related Items (3)
Primality test for numbers of the form \(A p^n + w_n\) ⋮ Unnamed Item ⋮ A primality test for \(4Kp^n-1\) numbers
Cites Work
- A class of primality tests for trinomials which includes the Lucas-Lehmer test
- Explicit Primality Criteria for h ⋅2 k ± 1
- Explicit Bounds for Primality Testing and Related Problems
- Effective Primality Tests for Some Integers of the Forms A5 n - 1 and A7 n - 1
- The primality of certain integers of the form $2A r^n - 1$
- The Primality of N=2A3n-1
This page was built for publication: Explicit primality criteria for $(p-1)p^n-1$
