Constructing Carmichael numbers which are strong pseudoprimes to several bases

被引：6

作者：

Arnault, F ^{[1
]}

机构：

[1] UNIV POITIERS,POITIERS,FRANCE

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1995年 / 20卷 / 02期

关键词：

D O I：

10.1006/jsco.1995.1042

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We describe here a method of constructing Carmichael numbers which are strong pseudoprimes to some sets of prime bases. We apply it to find composite numbers which are found to be prime by the Rabin-Miller test of packages as Axiom or Maple. We also use a variation of this method to construct strong Lucas pseudoprimes with respect to several pairs of parameters.

引用

页码：151 / 161

页数：11

共 14 条

[1] ALFORD R, 1994, LECT NOTES COMPUTER
[2] RABIN-MILLER PRIMALITY TEST - COMPOSITE NUMBERS WHICH PASS IT
ARNAULT, F
[J]. MATHEMATICS OF COMPUTATION, 1995, 64 (209) : 355 - 361
[3] ARNAULT F, UNPUB RABINMONIER TH
[4] BAILLIE R, 1980, MATH COMPUT, V35, P1391, DOI 10.1090/S0025-5718-1980-0583518-6
[5] CHAR BW, 1991, MAPLE 5 LIBRARY REFE
[6] Chernick J., 1939, B AM MATH SOC, V45, P269, DOI [10.1090/S0002-9904-1939-06953-X, DOI 10.1090/S0002-9904-1939-06953-X]
[7] DAVENPORT JH, 1992, P ISSAC 92
[8] ON STRONG PSEUDOPRIMES TO SEVERAL BASES
JAESCHKE, G
[J]. MATHEMATICS OF COMPUTATION, 1993, 61 (204) : 915 - 926
[9] Jenks R.D., 1992, AXIOM SCI COMPUTATIO
[10] KNUTH DE, 1973, ART COMPUTER PROGR 2

← 1 2 →