Results 11 to 20 of about 100 (72)
Primality tests, linear recurrent sequences and the Pell equation [PDF]
, 2022 We study new primality tests based on linear recurrent sequences of degree two exploiting a matrix approach. The classical Lucas test arises as a particular case and we see how it can be easily improved.
Di Scala, Antonio +7 more
core +1 more source
Strengthening the Baillie-PSW primality test
, 2021 Author original manuscript (preprint)In 1980, the first and third authors proposed a probabilistic primality test that has become known as the Baillie-PSW primality test.
Fiori, Andrew +2 more
core +1 more source
Could, or should, the ancient Greeks have discovered the Lucas-Lehmer test? [PDF]
, 2019 The Lucas-Lehmer (LL) test is the most efficient known for testing the primality of Mersenne numbers, i.e. the integers Ml = 2l − 1, for l ≥ 1. The Mersenne numbers are so-called in honour of the French scholar Marin Mersenne (1588-1648), who in 1644 ...
Granger, Robert
core +1 more source
Primality test via quantum factorization
, 1997 We consider a probabilistic quantum implementation of a variation of the Pocklington-Lehmer N - 1 primality test using Shor's algorithm. O(log3 N log log N log log log N) elementary q-bit operations are required to determine the primality of a number N ...
Chau, HF, Lo, HK
core +1 more source
, 2022 Tema ovog rada bit će testovi prostosti. Testove prostosti dijelimo na determinističke i vjerojatnosne. Sukladno tome, rad je podijeljen na dva dijela.
Moguš, Magdalena
core
Lucas Sequences in Primality Testing
, 2014 Prime or composite? This classification determines whether or not integers can be used in digital security. One such way to begin testing an integers primality is with the Fermat test, which says that if n is a prime number and a is an integer then an-1 ≡
Karl Heimbuck (10081618)
core +1 more source
Generalized lucas-lehmer tests using Pell conics
, 2012 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.
Hambleton, Samuel A.
core +1 more source
Effective primality tests for some integers of the forms 𝐴5ⁿ-1 and 𝐴7ⁿ-1
, 1987 It is shown how polynomial time prime tests, which are both fast and deterministic, can be developed for many numbers of the form A r n − 1 ( r =
H. C. Williams
core +1 more source
Autistic Savants and large number primality detection.
, 2020 In a sequel to the paper on small number primality detection by mental arithmetic. In this paper, we consider primality detection of four digit prime numbers, leading next to larger six digit and eight digit numbers, optionally scaled to arbitrary sized ...
Dr Bheemaiah. Anil K (Anil Kumar B)
core +1 more source
, 2014 The aim of this thesis is to explain quadratic number field theory and prove correctness of the Lucas-Lehmer primality test. A quadratic number field is a field of the form Q( √ m).
Vejpustek, Ondřej
core