Lucas Pseudoprimes

Type: Article

Publication Date: 1980-10-01

Citations: 18

DOI: https://doi.org/10.2307/2006406

Abstract

We define several types of pseudoprimes with respect to Lucas sequences and prove the analogs of various theorems about ordinary pseudoprimes.For example, we show that Lucas pseudoprimes are rare and we count the Lucas sequences modulo n with respect to which n is a Lucas pseudoprime.We suggest some powerful new primality tests which combine Lucas pseudoprimes with ordinary pseudoprimes.Since these tests require the evaluation of the least number f(n) for which the Jacobi symbol (f(n)/n) is less than 1, we evaluate the average order of the function /.1. Introduction.A pseudoprime to base a (or psp(a)) is a composite number n such that a"~x = 1 (mod ri), i.e., n satisfies the conclusion of Fermat's "Little Theorem" even though n is not prime.Pseudoprimes have been studied intensively.(See

Locations

  • Mathematics of Computation - View - PDF

Similar Works

Action Title Year Authors
+ PDF Chat Lucas pseudoprimes 1980 Robert Baillie
Samuel S. Wagstaff
+ Lucas pseudoprimes 2000 A. Rotkiewicz
+ Weak Pseudoprimality Associated with the Generalized Lucas Sequences 2022 Dorin Andrica
Ovidiu Bagdasar
Michael Th. Rassias
+ Extensions in the theory of Lucas and Lehmer pseudoprimes 2005 Andrew D. Loveless
+ Some Remarks on Primality Testing Based on Lucas Functions 2023 Siguna Müller
+ Tabulating Absolute Lucas Pseudoprimes 2023 Chloe Helmreich
Jonathan Webster
+ PDF Chat A lower bound for the counting function of Lucas pseudoprimes 1988 Péter L. Erdős
Péter Kiss
Andràs Sárközy
+ Primality testing with Lucas functions 1993 Rudolf Lidl
Winfried Müller
+ PDF Chat On Generalized Lucas Pseudoprimality of Level k 2021 Dorin Andrica
Ovidiu Bagdasar
+ A Lower Bound for the Counting Function of Lucas Pseudoprimes 1988 P. Erdos
Péter Kiss
Andràs Sárközy
+ LUCAS SEQUENCES {Uk} FOR WHICH U2p AND Up ARE PSEUDOPRIMES FOR ALMOST ALL PRIMES p 2003 Lawrence Somer
+ SOME REMARKS ON LUCAS PSEUDOPRIMES 2012 Noriyuki Suwa
+ PDF Chat Square-free Lucas d-pseudoprimes and Carmichael-Lucas numbers 2007 Walter Carlip
Lawrence Somer
+ Lucas Pseudoprimes of Special Types 2008 Lawrence Somer
+ Constructing Carmichael Numbers which are Strong Pseudoprimes to Several Bases 1995 François Arnault
+ On the Combined Fermat/Lucas Probable Prime Test⋆ 1999 Siguna Müller
+ On Lucas Pseudoprimes which are Products of s Primes 1986 Péter Kiss
Bui Minh Phong
Erik Lieuwens
+ PDF Chat Primitive Lucas d-pseudoprimes and Carmichael–Lucas numbers 2007 Walter Carlip
Lawrence Somer
+ PDF Chat Frobenius pseudoprimes 2000 Jon Grantham
+ On some links between the generalised Lucas pseudoprimes of level <i>k</i> 2023 Dorin Andrica
Ovidiu Bagdasar
Michael Th. Rassias