2014
DOI: 10.1090/s0002-9947-2014-06083-2
|View full text |Cite
|
Sign up to set email alerts
|

Sierpiński and Carmichael numbers

Abstract: We establish several related results on Carmichael, Sierpiński and Riesel numbers. First, we prove that almost all odd natural numbers k have the property that 2 n k + 1 is not a Carmichael number for any n ∈ N; this implies the existence of a set K of positive lower density such that for any k ∈ K the number 2 n k + 1 is neither prime nor Carmichael for every n ∈ N. Next, using a recent result of Matomäki, we show that there are x 1/5 Carmichael numbers up to x that are also Sierpiński and Riesel. Finally, we… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 27 publications
0
3
0
Order By: Relevance
“…This is the main theorem in [3]. Letting K := k odd : 2 n k + 1 n ≥ 0 contains some Carmichael number , the set K is of asymptotic density zero (see [2]). The smallest element of K is 27 (see [3,Theorem 2]), and a representation indicating 27 as a member of K is given by 1729 = 27 × 2 6 + 1 with the Carmichael number 1729 being known as the Ramanujan taxicab number!…”
Section: Introduction and Main Resultsmentioning
confidence: 96%
“…This is the main theorem in [3]. Letting K := k odd : 2 n k + 1 n ≥ 0 contains some Carmichael number , the set K is of asymptotic density zero (see [2]). The smallest element of K is 27 (see [3,Theorem 2]), and a representation indicating 27 as a member of K is given by 1729 = 27 × 2 6 + 1 with the Carmichael number 1729 being known as the Ramanujan taxicab number!…”
Section: Introduction and Main Resultsmentioning
confidence: 96%
“…Besides k = 1 there are other values of k for which the sequence 2 n k + 1 does not contain any Carmichael numbers. Indeed, in [2], it has been shown, among other things, that if we put K = {k : (2 n k + 1) n≥0 contains some Carmichael number}, then K is of asymptotic density zero. This contrasts with the known fact, proved by Erdős and Odlyzko [9], that the set {k : (2 n k + 1) n≥0 contains some prime number} is of positive lower density.…”
Section: Introductionmentioning
confidence: 99%
“…The conjecture was proved unconditionally by Matomäki [20] in the special case that a is a quadratic residue modulo b, and using an extension of her methods Wright [23] established the conjecture in full generality. The techniques introduced in [1] have led to many other investigations into the arithmetic properties of Carmichael numbers; see [2][3][4][5]7,8,10,[14][15][16][17][18][19]21,24] and the references therein.…”
mentioning
confidence: 99%