-
1
-
-
84968521991
-
Rabin-Miller primality test: Composite numbers which pass it
-
F. Arnault, Rabin-Miller primality test: Composite numbers which pass it, Math. Comp. 64 (1995), 355-361. MR 95c:11152
-
(1995)
Math. Comp.
, vol.64
, pp. 355-361
-
-
Arnault, F.1
-
2
-
-
84968521991
-
-
F. Arnault, Rabin-Miller primality test: Composite numbers which pass it, Math. Comp. 64 (1995), 355-361. MR 95c:11152
-
MR
, vol.95 C
, pp. 11152
-
-
-
3
-
-
0039193416
-
Constructing Carmichael numbers which are strong pseudoprimes to several bases
-
_, Constructing Carmichael numbers which are strong pseudoprimes to several bases. J. Symbolic Comput. 20 (1995), 151-161. CMP 96:08
-
(1995)
J. Symbolic Comput.
, vol.20
, pp. 151-161
-
-
-
4
-
-
0039193416
-
-
_, Constructing Carmichael numbers which are strong pseudoprimes to several bases. J. Symbolic Comput. 20 (1995), 151-161. CMP 96:08
-
CMP
, vol.96
, pp. 08
-
-
-
6
-
-
84966237268
-
Lucas pseudoprimes
-
R. Baillie and S. Wagstaff, Jr., Lucas pseudoprimes, Math. Comp. 35 (1980), 1391-1417. MR 81j:10005
-
(1980)
Math. Comp.
, vol.35
, pp. 1391-1417
-
-
Baillie, R.1
Wagstaff S., Jr.2
-
7
-
-
84966237268
-
-
R. Baillie and S. Wagstaff, Jr., Lucas pseudoprimes, Math. Comp. 35 (1980), 1391-1417. MR 81j:10005
-
MR
, vol.81 J
, pp. 10005
-
-
-
8
-
-
84968464823
-
On strong pseudoprimes to several bases
-
G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp. 61 (1993), 915-926. MR 94d:11004
-
(1993)
Math. Comp.
, vol.61
, pp. 915-926
-
-
Jaeschke, G.1
-
9
-
-
84968464823
-
-
G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp. 61 (1993), 915-926. MR 94d:11004
-
MR
, vol.94 D
, pp. 11004
-
-
-
11
-
-
85000690564
-
Evaluation and comparison of two efficient primality testing algorithms
-
L. Monier, Evaluation and comparison of two efficient primality testing algorithms, Theoret. Comput. Sci. 11 (1980), 97-108. MR 82a:68078
-
(1980)
Theoret. Comput. Sci.
, vol.11
, pp. 97-108
-
-
Monier, L.1
-
12
-
-
85000690564
-
-
L. Monier, Evaluation and comparison of two efficient primality testing algorithms, Theoret. Comput. Sci. 11 (1980), 97-108. MR 82a:68078
-
MR
, vol.82 A
, pp. 68078
-
-
-
14
-
-
84966228376
-
-
9, Math. Comp. 35 (1980), 1003-1026. MR 82g:10030
-
MR
, vol.82 G
, pp. 10030
-
-
-
15
-
-
33845432604
-
Probabilistic algorithms for testing primality
-
M. O. Rabin, Probabilistic algorithms for testing primality, J. Number Theory 12 (1980), 128-138. MR 81f:10003
-
(1980)
J. Number Theory
, vol.12
, pp. 128-138
-
-
Rabin, M.O.1
-
16
-
-
33845432604
-
-
M. O. Rabin, Probabilistic algorithms for testing primality, J. Number Theory 12 (1980), 128-138. MR 81f:10003
-
MR
, vol.81 F
, pp. 10003
-
-
-
17
-
-
0000091891
-
On numbers analogous to the Carmichael numbers
-
H. C. Williams, On numbers analogous to the Carmichael numbers, Canad. Math. Bull. 20 (1977), 133-143. MR 56:5414
-
(1977)
Canad. Math. Bull.
, vol.20
, pp. 133-143
-
-
Williams, H.C.1
-
18
-
-
0038912487
-
-
H. C. Williams, On numbers analogous to the Carmichael numbers, Canad. Math. Bull. 20 (1977), 133-143. MR 56:5414
-
MR
, vol.56
, pp. 5414
-
-
|