Some primality tests that eluded Lucas
From MaRDI portal
Publication:887438
DOI10.1007/S10623-015-0088-0zbMATH Open1364.11161OpenAlexW561113958MaRDI QIDQ887438FDOQ887438
Authors: Eric Roettger, Hugh C. Williams, Richard K. Guy 
Publication date: 26 October 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0088-0
Recommendations
- scientific article; zbMATH DE number 7199615
- scientific article; zbMATH DE number 1995935
- A generalised Lucasian primality test
- Primality tests, linear recurrent sequences and the Pell equation
- Some primality conditions for \(N=2p^n -1\)
- On primes in Lucas sequences
- Explicit primality criteria for \(h \cdot 2^n \pm 1\)
- Some primality tests constructed from a cubic extension of the Lucas functions
- Testing numbers of the form N = 2kpm − 1 for primality
- scientific article; zbMATH DE number 4079505
Cites Work
- Title not available (Why is that?)
- Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\).
- A generalization of Proth's theorem
- Some extensions of the Lucas functions
- On Principal Ideal Testing in Totally Complex Quartic Fields and the Determination of Certain Cyclotomic Constants
- A cubic extension of the Lucas functions
- SOME FOURTH-ORDER LINEAR DIVISIBILITY SEQUENCES
- New Primality Criteria and Factorizations of 2 m ± 1
- Determination of the Primality of N by Using Factors of N 2 ± 1
- Some monoapparitic fourth order linear divisibility sequences
Cited In (21)
- Title not available (Why is that?)
- Explicit primality criteria for \(h \cdot 2^n \pm 1\)
- Title not available (Why is that?)
- Classical and Alternative Approaches to the Mersenne and Fermat Numbers
- Divisibity, iterated digit sums, primality tests
- Lucas-Lehmer primality tests for certain prime curios
- Some primality conditions for \(N=2p^n -1\)
- Title not available (Why is that?)
- On primes in Lucas sequences
- Efficient computation of terms of linear recurrence sequences of any order
- A cubic extension of the Lucas functions
- A primality test for \(4Kp^n-1\) numbers
- Some extensions of the Lucas functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Primality tests, linear recurrent sequences and the Pell equation
- Title not available (Why is that?)
- A Note on Primality Testing Using Lucas Sequences
- A note on Lucas-Lehmer sequences
- A note on public key cryptography based on Williams-Guy functions
- Generalized Lucas-Lehmer tests using Pell conics
This page was built for publication: Some primality tests that eluded Lucas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887438)
