Results 1 
1 of
1
The RabinMonier theorem for Lucas pseudoprimes
 Math. Comp
, 1997
"... Abstract. We give bounds on the number of pairs (P, Q)with0≤P, Q < n such that a composite number n is a strong Lucas pseudoprime with respect to the parameters (P, Q). 1. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We give bounds on the number of pairs (P, Q)with0≤P, Q < n such that a composite number n is a strong Lucas pseudoprime with respect to the parameters (P, Q). 1.