Density of Carmichael numbers with three prime factors
R Balasubramanian, SV Nagaraj - Mathematics of computation, 1997 - JSTOR
R Balasubramanian, SV Nagaraj
Mathematics of computation, 1997•JSTOR… We get an upper bound of O(x5/14+o(l)) on the number of Carmichael numbers < x with
exactly three prime factors. … Let Ck (x) denote the number of Carmichael numbers up to x
with k prime factors where k > 3. It is an open problem to show that the function C3(x) is
unbounded. It is not known whether any of the functions Ck(x) is unbounded. … Let C3(x)
denote the number of Carmichael numbers up to x with exactly three prime factors. Then, for
all sufficiently large x we have C3(x) o (X5114+o(l) ) …
exactly three prime factors. … Let Ck (x) denote the number of Carmichael numbers up to x
with k prime factors where k > 3. It is an open problem to show that the function C3(x) is
unbounded. It is not known whether any of the functions Ck(x) is unbounded. … Let C3(x)
denote the number of Carmichael numbers up to x with exactly three prime factors. Then, for
all sufficiently large x we have C3(x) o (X5114+o(l) ) …
We get an upper bound of O(x5/14 + o(1)) on the number of Carmichael numbers ≤ x with exactly three prime factors.
JSTORShowing the best result for this search. See all results
