Some Algorithms for Prime Testing Using Generalized Lehmer Function

DOI10.2307/2005408zbMath0342.10007OpenAlexW4256655851MaRDI QIDQ4109716

J. S. Judd, Hugh C. Williams

Publication date: 1976

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

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

zbMATH Keywords

algorithmsprimality testingpseudoprime divisors of the first 385 Fibonacci and Lucas numbers

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Related Items (10)

Some Observations on Primality Testing ⋮ Some Primes with Interesting Digit Patterns ⋮ Lucas Pseudoprimes ⋮ Tables of Fibonacci and Lucas factorizations ⋮ Factorization of the Eighth Fermat Number ⋮ Recent developments in primality testing ⋮ Sequences of numbers generated by addition in formal groups and new primality and factorization tests ⋮ Factoring with Cyclotomic Polynomials ⋮ Recent developments in primality proving ⋮ Factorization of the tenth Fermat number

This page was built for publication: Some Algorithms for Prime Testing Using Generalized Lehmer Function