Building Carmichael numbers with a large number of prime factors and generalization to other numbers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Building Carmichael numbers with a large number of prime factors and generalization to other numbers

D. Guillaume
François Morain

Abstract

We extend the method of Loh and Niebuhr for the generation of Carmichael numbers with a large number of prime factors to other classes of pseudoprimes. In particular, we exhibit the first known strong Fibonacci pseudoprimes. The method can be viewed as a simplified version, yet practical, of the method used by Alford, Granville and Pomerance to prove that there is an infinite number of Carmichael numbers.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1741.pdf (687.8 Ko) Télécharger le fichier

Dates and versions

inria-00076980 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00076980 , version 1

Cite

D. Guillaume, François Morain. Building Carmichael numbers with a large number of prime factors and generalization to other numbers. [Research Report] RR-1741, INRIA. 1992. ⟨inria-00076980⟩
114 View
392 Download

Share

Gmail Facebook Twitter LinkedIn More