1980
DOI: 10.2307/2006406
|View full text |Cite
|
Sign up to set email alerts
|

Lucas Pseudoprimes

Abstract: 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 tha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
37
0

Year Published

1980
1980
2001
2001

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 25 publications
(39 citation statements)
references
References 14 publications
2
37
0
Order By: Relevance
“…By the above, 2" -1 is an spsp (2). Since it is divisible by 2P -1 for each divisor p of«, and since the numbers 2P -1 with distinct primes p are relatively prime, 2" -1 has at least as many prime factors as «.…”
Section: Propositionmentioning
confidence: 89%
See 3 more Smart Citations
“…By the above, 2" -1 is an spsp (2). Since it is divisible by 2P -1 for each divisor p of«, and since the numbers 2P -1 with distinct primes p are relatively prime, 2" -1 has at least as many prime factors as «.…”
Section: Propositionmentioning
confidence: 89%
“…Thus, the strong form of the prime fc-tuples conjecture implies that at least cx1'2/ln2x integers below x are simultaneously psp (2) and psp(3). Table 6 Number of pseudoprimes to bases 2, 3, 5, 7 below a limit 9.…”
Section: The Controversy Concerning the Growth Rate Of C(x)mentioning
confidence: 99%
See 2 more Smart Citations
“…Clearly one can generalize the idea of a Carmichael number by allowing the pseudoprimality test in the definition to vary over some larger class of tests (perhaps including some of those found in [1], [2], [4], [6], [8], [9], [11], [16], [19], [26]), and indeed such generalizations have been considered (see for example [5], [8], [13], [15], [17], [18], [19], [21], [22], [27]). But there is also a natural algebraic way of generalizing the concept of a Carmichael number that makes no mention of pseudoprimality.…”
Section: Introductionmentioning
confidence: 99%