Density of Carmichael numbers with three prime factors

被引：6

作者：

Balasubramanian, R

Nagaraj, SV

机构：

来源：

关键词：

Carmichael number; primality testing;

D O I：

10.1090/S0025-5718-97-00857-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We get an upper bound of O(x(5/14+o(1))) on the number of Carmichael numbers less than or equal to x with exactly three prime factors.

引用

页码：1705 / 1708

页数：4

共 11 条

[1] AVERAGE-CASE ERROR-ESTIMATES FOR THE STRONG PROBABLE PRIME TEST
DAMGARD, I
LANDROCK, P
POMERANCE, C
[J]. MATHEMATICS OF COMPUTATION, 1993, 61 (203) : 177 - 194
[2] KOBLITZ N, 1987, COURSE NUMBER THEORY
[3] MULTIPLICATIVE FUNCTIONS OF POLYNOMIAL VALUES IN SHORT INTERVALS
NAIR, M
[J]. ACTA ARITHMETICA, 1992, 62 (03) : 257 - 269
[4] THE CARMICHAEL NUMBERS UP TO 10(15)
PINCH, RGE
[J]. MATHEMATICS OF COMPUTATION, 1993, 61 (203) : 381 - 391
[5] THE PSEUDOPRIMES TO 25.109
POMERANCE, C
SELFRIDGE, JL
WAGSTAFF, SS
[J]. MATHEMATICS OF COMPUTATION, 1980, 35 (151) : 1003 - 1026
[6] POMERANCE C, 1993, CARMICHAEL NUMBERS, V11, P199
[7] Ramanujan S, 1915, P LOND MATH SOC, V14, P347
[8] RIBENBOIM P, 1989, BOOK PRIME NUMBER RE
[9] [No title captured]
[10] [No title captured]