Available in electronic format
Available in print format
Mathematics of Computation
Journal of the American Mathematical Society
ISSN 1088-6842(e) ISSN 0025-5718(p)
     

Notes on some new kinds of pseudoprimes

Author(s): Zhenxiang Zhang.
Journal: Math. Comp. 75 (2006), 451-460.
MSC (2000): Primary 11A15; Secondary 11A51, 11Y11
Posted: September 15, 2005
Retrieve article in: PDF DVI PostScript

Abstract | References | Similar articles | Additional information

Abstract: J. Browkin defined in his recent paper (Math. Comp. 73 (2004), pp. 1031-1037) some new kinds of pseudoprimes, called Sylow $p$-pseudoprimes and elementary Abelian $p$-pseudoprimes. He gave examples of strong pseudoprimes to many bases which are not Sylow $p$-pseudoprime to two bases only, where $p=2$ or $3$.

In this paper, in contrast to Browkin's examples, we give facts and examples which are unfavorable for Browkin's observation to detect compositeness of odd composite numbers. In Section 2, we tabulate and compare counts of numbers in several sets of pseudoprimes and find that most strong pseudoprimes are also Sylow $2$-pseudoprimes to the same bases. In Section 3, we give examples of Sylow $p$-pseudoprimes to the first several prime bases for the first several primes $p$. We especially give an example of a strong pseudoprime to the first six prime bases, which is a Sylow $p$-pseudoprime to the same bases for all $p\in\{2,3,5,7,11,13\}$. In Section 4, we define $n$ to be a $k$-fold Carmichael Sylow pseudoprime, if it is a Sylow $p$-pseudoprime to all bases prime to $n$ for all the first $k$ smallest odd prime factors $p$ of $n-1$. We find and tabulate all three $3$-fold Carmichael Sylow pseudoprimes $<10^{16}$. In Section 5, we define a positive odd composite $n$ to be a Sylow uniform pseudoprime to bases $b_1,\ldots,b_k$, or a Syl-upsp $(b_1,\ldots,b_k)$ for short, if it is a Syl$_p$-psp $(b_1,\ldots,b_k)$for all the first $\omega(n-1)-1$ small prime factors $p$ of $n-1$, where $\omega(n-1)$ is the number of distinct prime factors of $n-1$. We find and tabulate all the 17 Syl-upsp$(2,3,5)$'s $<10^{16}$ and some Syl-upsp $(2,3,5,7,11)$'s $<10^{24}$. Comparisons of effectiveness of Browkin's observation with Miller tests to detect compositeness of odd composite numbers are given in Section 6.


References:

1.
M. Agrawal, N. Kayal and N. Saxena, Primes is in P, Annals of Mathematics, 160 (2004), 781-793; preprint, August 2002, http://www.cse.iitk.ac.in. MR 2123939

2.
W. R. Alford, A. Granville and C. Pomerance, There are infinitely many Carmichael numbers, Annals of Math. 140 (1994), 703-722. MR 1283874 (95k:11114)

3.
D. Bleichenbacher, Efficiency and Security of Cryptosystems Based on Number Theory, ETH Ph.D. dissertation 11404, Swiss Federal Institute of Technology, Zurich, 1996.

4.
D. M. Bressoud and S. Wagon, A course in computational number theory, Key College Publishing, Springer-Verlag, New York, 2000. MR 1756372 (2001f:11200)

5.
Jerzy Browkin, Some new kinds of pseudoprimes, Math. Comp. 246 (2004), 1031-1037. MR 2031424 (2004m:11006)

6.
R. Crandall and C. Pomerance, Numbers, a computational perspective, Springer-Verlag, New York, 2001. MR 1821158 (2002a:11007)

7.
G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp. 61 (1993), 915-926. MR 1192971 (94d:11004)

8.
G. Miller, Riemann's hypothesis and tests for primality, J. Comput. and System Sci. 13 (1976), 300-317. MR 0480295 (58:470a)

9.
R. G. E. Pinch, The Carmichael numbers up to $10^{16}$, preprint, 1998. http://www.chalcedon. demon.co.uk/carpsp.html.

10.
-, The pseudoprimes up to $10^{13}$, Algorithmic number theory (Leiden, 2000), 459-473, Lecture Notes in Comput. Sci., 1838, Springer, Berlin, 2000. MR 1850626 (2002g:11177) ftp://ftp.dpmms.cam.ac.uk/pub/PSP

11.
C. Pomerance, J. L. Selfridge and Samuel S. Wagstaff, Jr., The pseudoprimes to $25\cdot10^9$, Math. Comp. 35 (1980), 1003-1026. MR 0572872 (82g:10030)

12.
M. O. Rabin, Probabilistic algorithms for testing primality, J. Number Theory 12 (1980), 128-138. MR 0566880 (81f:10003)

13.
Anton Stiglic, The PRIMES is in P little FAQ, http://crypto.cs.mcgill.ca/~stiglic/ PRIMES_P_FAQ.html

14.
Zhenxiang Zhang, Finding strong pseudoprimes to several bases, Math. Comp. 70 (2001), 863-872. MR 1697654 (2001g:11009) http://www.ams.org/journal-getitem?pii=S0025-5718-00-01215-1

15.
-, A one-parameter quadratic-base version of the Baillie-PSW probable prime test, Math. Comp. 71 (2002), 1699-1734. MR 1933051 (2003f:11191) http://www.ams.org/journal-getitem?pii=S0025-5718-02-01424-2

16.
-, Finding $C_3$-strong pseudoprimes, Math. Comp. 74 (2005), 1009-1024. MR 2114662

17.
Zhenxiang Zhang and Min Tang, Finding strong pseudoprimes to several bases. II, Math. Comp. 72 (2003), 2085-2097. MR 1986825 (2004c:11008) http://www.ams.org/journal-getitem?pii=S0025-5718-03-01545-X

18.
Günter M. Ziegler, The great prime number record races, Notices of the AMS 51:4 (2004), 414-416. MR 2039814 (2005a:11198)


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:

Zhenxiang Zhang
Affiliation: Department of Mathematics, Anhui Normal University, 241000 Wuhu, Anhui, People's Republic of China
Email: zhangzhx@mail.ahwhptt.net.cn, ahnu_zzx@sina.com

DOI: 10.1090/S0025-5718-05-01775-8
PII: S 0025-5718(05)01775-8
Keywords: Strong pseudoprimes, Miller tests, Sylow $p$-pseudoprimes, elementary Abelian $p$-pseudoprimes, $k$-fold Carmichael Sylow pseudoprimes, Sylow uniform pseudoprimes
Received by editor(s): September 18, 2004
Posted: September 15, 2005
Additional Notes: This work was supported by the NSF of China Grant 10071001, and the SF of the Education Department of Anhui Province Grant 2002KJ131
Copyright of article: Copyright 2005, American Mathematical Society
The copyright for this article reverts to public domain after 28 years from publication.


  AMS Website Logo Small Comments: webmaster@ams.org
© Copyright 2008, American Mathematical Society
Privacy Statement
Search the AMSPowered by Google