Some Algorithms for Prime Testing Using Generalized Lehmer Function

DOI10.2307/2005408MaRDI QIDQ4109716zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Testing numbers of the form for primality
• Primality testing using generalized Fibonacci sequences
• scientific article; zbMATH DE number 1995935
• Some primality tests constructed from a cubic extension of the Lucas functions
• A Lucas-Lehmer primality test for the numbers \(n=Ap_ 1^ {s_ 1}p_ 2^ {s_ 2}\cdots p_ t^ {s_ t}+\omega\)

Cited in

(14)

• Recent developments in primality testing
• Generalizations of the Fibonacci pseudoprimes test
• Recent developments in primality proving
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Some properties associated with a prime characteristic function
• A curious way to test for primes explained
• Primality testing using generalized Fibonacci sequences
• Tables of Fibonacci and Lucas factorizations
• Factoring with Cyclotomic Polynomials
• Lucas Pseudoprimes
• Factorization of the Eighth Fermat Number
• Some Observations on Primality Testing
• Some Primes with Interesting Digit Patterns
• Factorization of the tenth Fermat number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4109716)