
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 modulonwith respect to whichnis 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 numberf(n)f(n)for which the Jacobi symbol(f(n)/n)(f(n)/n)is less than 1, we evaluate the average order of the functionf.
Power residues, reciprocity, primality testing, Fibonacci and Lucas numbers and polynomials and generalizations, Software, source code, etc. for problems pertaining to number theory, strong pseudoprime, pseudoprime, Lucas sequence, Lucas pseudoprime, Euler pseudoprime, Primes
Power residues, reciprocity, primality testing, Fibonacci and Lucas numbers and polynomials and generalizations, Software, source code, etc. for problems pertaining to number theory, strong pseudoprime, pseudoprime, Lucas sequence, Lucas pseudoprime, Euler pseudoprime, Primes
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 72 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
