Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\).
From MaRDI portal
Publication:1401290
DOI10.1016/S0304-3975(02)00617-5zbMath1048.11101MaRDI QIDQ1401290
Mauricio Odremán, Pedro Berrizbeitia, Juan G. Tena Ayuso
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (3)
Some primality tests that eluded Lucas ⋮ Primality test for numbers of the form \(A p^n + w_n\) ⋮ Primality test for numbers of the form (2p)2n+1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On distinguishing prime numbers from composite numbers
- Effective primality tests for integers of the forms \(N=k3^ n+1\) and \(N=k2^ m3^ n+1\)
- Primality Testing and Jacobi Sums
- Implementation of a new primality test
- Effective Primality Tests for Some Integers of the Forms A5 n - 1 and A7 n - 1
- A Proof of the Lucas-Lehmer Test
- Determination of the Primality of N by Using Factors of N 2 ± 1
- Cubic reciprocity and generalised Lucas-Lehmer tests for primality of 𝐴.3ⁿ±1
- A generalization of Lehmer's functions
This page was built for publication: Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\).
