Results 1 to 10 of about 7,411,029 (61)
Lucas-Lehmer test is the current standard algorithm used for testing the primality of Mersenne numbers, but it may have limitations in terms of its efficiency and accuracy.
Moustafa Mohamed
exaly +7 more sources
Tuckerman B.
exaly +2 more sources
On the emergence of the Quanta Prime sequence
This paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications.
Moustafa Ibrahim
doaj +1 more source
Mersenne primes, renowned for their captivating form as [Formula: see text] have intrigued mathematicians for centuries. In this paper, we embark on a captivating quest to unveil the intricate nature of Mersenne primes, seamlessly integrating methods ...
Moustafa Ibrahim
doaj +1 more source
A Class of Primality Tests for Trinomials Which Includes the Lucas-Lehmer Test [PDF]
Hugh Williams
exaly +4 more sources
Generalized Lucas-Lehmer Tests Using Pell Conics
Pell conics are used to write a Proth-Riesel twin-primality test. We discuss easy-to-find primality certificates for integers of the form m h±1.
Samuel A. HAMBLETON
exaly +2 more sources
Some of the next articles are maybe not open access.
Cubic Reciprocity and Generalised Lucas-Lehmer Tests for Primality Of ?.3ⁿ±1
Proceedings of the American Mathematical Society, 1999Pedro Berrizbeitia
exaly
A Probabilistic Primality Test Based on the Properties of Certain Generalized Lucas Numbers
Lecture Notes in Computer Science, 1988Piero Filipponi +2 more
exaly

