New Primality Criteria and Factorizations of 2 m ± 1

DOI10.2307/2005583zbMath0311.10009OpenAlexW4247937737WikidataQ55878130 ScholiaQ55878130MaRDI QIDQ4068791

John Brillhart, D. H. Lehmer, John L. Selfridge

Publication date: 1975

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2005583

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Primes (11A41)

Related Items (42)

Prime clusters and Cunningham chains ⋮ Some Observations on Primality Testing ⋮ Some Primes with Interesting Digit Patterns ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Products of integers with few nonzero digits ⋮ Pseudoprimality related to the generalized Lucas sequences ⋮ Building pseudoprimes with a large number of prime factors ⋮ Lucas Pseudoprimes ⋮ Some primality tests that eluded Lucas ⋮ Certifying giant nonprimes ⋮ Tables of Fibonacci and Lucas factorizations ⋮ Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors ⋮ On the liftability of the automorphism group of smooth hypersurfaces of the projective space ⋮ Recent developments in primality testing ⋮ The influence of computers in the development of number theory ⋮ Large Sophie Germain primes ⋮ A large pair of twin primes ⋮ Finding prime pairs with particular gaps ⋮ The density of primes \(P\), such that \(-1\) is a residue modulo \(P\) of two consecutive Fibonacci numbers, is \(2/3\) ⋮ Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients ⋮ Elliptic Curves and Primality Proving ⋮ Checking the odd Goldbach conjecture up to 10²⁰ ⋮ Primality tests for 2^{𝑝}±2^{(𝑝+1)/2}+1 using elliptic curves ⋮ On the primality of $n! \pm 1$ and $2 \times 3 \times 5 \times \dotsm \times p \pm 1$ ⋮ Gaussian Mersenne and Eisenstein Mersenne primes ⋮ Some remarks concerning the M.I.T. public-key cryptosystem ⋮ Divisors in residue classes, constructively ⋮ Repunit R49081 is a probable prime ⋮ On a family of sequences related to Chebyshev polynomials ⋮ Unnamed Item ⋮ Square-free Lucas d-pseudoprimes and Carmichael-Lucas numbers ⋮ Some new kinds of pseudoprimes ⋮ Sequences of numbers generated by addition in formal groups and new primality and factorization tests ⋮ Strengthening the Baillie-PSW primality test ⋮ Estimating the counts of Carmichael and Williams numbers with small multiple seeds ⋮ A primality test for 𝐾𝑝ⁿ+1 numbers ⋮ Weak pseudoprimality associated with the generalized Lucas sequences ⋮ Recent developments in primality proving ⋮ New Fibonacci and Lucas primes ⋮ A New Method for Producing Large Carmichael Numbers ⋮ Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes ⋮ Short effective intervals containing primes

This page was built for publication: New Primality Criteria and Factorizations of 2 m ± 1