Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Some new kinds of pseudoprimes
HTML articles powered by AMS MathViewer

by Jerzy Browkin PDF
Math. Comp. 73 (2004), 1031-1037 Request permission

Erratum: Math. Comp. 74 (2005), 1573-1573.

Abstract:

We define some new kinds of pseudoprimes to several bases, which generalize strong pseudoprimes. We call them Sylow $p$-pseudoprimes and elementary Abelian $p$-pseudoprimes. It turns out that every $n<10^{12},$ which is a strong pseudoprime to bases 2, 3 and 5, is not a Sylow $p$-pseudoprime to two of these bases for an appropriate prime $p|n-1.$ We also give examples of strong pseudoprimes to many bases which are not Sylow $p$-pseudoprimes to two bases only, where $p=2$ or $3.$
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 11A15, 11A51, 11Y11
  • Retrieve articles in all journals with MSC (2000): 11A15, 11A51, 11Y11
Additional Information
  • Jerzy Browkin
  • Affiliation: Institute of Mathematics, University of Warsaw, ul. Banacha 2, PL–02–097 Warsaw, Poland
  • Email: bro@mimuw.edu.pl
  • Received by editor(s): February 19, 1998
  • Received by editor(s) in revised form: October 23, 2002
  • Published electronically: August 20, 2003
  • © Copyright 2003 American Mathematical Society
  • Journal: Math. Comp. 73 (2004), 1031-1037
  • MSC (2000): Primary 11A15; Secondary 11A51, 11Y11
  • DOI: https://doi.org/10.1090/S0025-5718-03-01617-X
  • MathSciNet review: 2031424