Results 1 
4 of
4
Building Pseudoprimes With A Large Number Of Prime Factors
, 1995
"... We extend the method due originally to Loh and Niebuhr for the generation of Carmichael numbers with a large number of prime factors to other classes of pseudoprimes, such as Williams's pseudoprimes and elliptic pseudoprimes. We exhibit also some new Dickson pseudoprimes as well as superstrong ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
We extend the method due originally to Loh and Niebuhr for the generation of Carmichael numbers with a large number of prime factors to other classes of pseudoprimes, such as Williams's pseudoprimes and elliptic pseudoprimes. We exhibit also some new Dickson pseudoprimes as well as superstrong Dickson pseudoprimes.
PSEUDOPRIMES, PERFECT NUMBERS, AND A PROBLEM OF LEHMER
, 1996
"... Two classical problems In elementary number theory appear, at first, to be unrelated. The first, posed by D. H. Lehmer in [7], asks whether there is a composite integer N such that </>{N) divides Nl, where &(N) is Euler's totient function. This question has received considerable atte ..."
Abstract
 Add to MetaCart
Two classical problems In elementary number theory appear, at first, to be unrelated. The first, posed by D. H. Lehmer in [7], asks whether there is a composite integer N such that </>{N) divides Nl, where &(N) is Euler's totient function. This question has received considerable attention and it has been demonstrated that such an integer, if it exists, must be extraordinary.