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 2nk + 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 2nk + 1 is neither prime nor Carmichael for every n ∈ N. Next, using a recent result of Matomäki, we show that there are x1/5 Carmichael numbers up to x that are also Sierpiński and Riesel. Finally, we show that if 2nk+ 1 is Lehmer, then n 6 150ω(k)2 log k, where ω(k) is the number of distinct primes dividing k.
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
A Sierpiński number [4, page 420] and [1], is an odd positive integer, k, such that no positive int...
ABSTRACT. Sierpi\’{n}ski proved that there are inflnitely many odd integers $k $ such that $k\cdot 2...
We present two effective sieve algorithms suitable for the computation of Carmichael numbers in a gi...
ABSTRACT. Sierpi\’{n}ski proved that there are inflnitely many odd integers $k $ such that $k\cdot 2...
International audienceFor arbitrary integers $k\in\mathbb Z$, we investigate the set $C_k$ of the ge...
International audienceFor arbitrary integers $k\in\mathbb Z$, we investigate the set $C_k$ of the ge...
Abstract. We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also c...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
AbstractWe address conjectures of P. Erdős and conjectures of Y.-G. Chen concerning the numbers in t...
A Sierpinski number is an odd positive integer, k, such that no positive integer of the form k * 2^n...
AbstractWe generalize Carmichael numbers to ideals in number rings and prove a generalization of Kor...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
A Sierpiński number [4, page 420] and [1], is an odd positive integer, k, such that no positive int...
ABSTRACT. Sierpi\’{n}ski proved that there are inflnitely many odd integers $k $ such that $k\cdot 2...
We present two effective sieve algorithms suitable for the computation of Carmichael numbers in a gi...
ABSTRACT. Sierpi\’{n}ski proved that there are inflnitely many odd integers $k $ such that $k\cdot 2...
International audienceFor arbitrary integers $k\in\mathbb Z$, we investigate the set $C_k$ of the ge...
International audienceFor arbitrary integers $k\in\mathbb Z$, we investigate the set $C_k$ of the ge...
Abstract. We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also c...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
AbstractWe address conjectures of P. Erdős and conjectures of Y.-G. Chen concerning the numbers in t...
A Sierpinski number is an odd positive integer, k, such that no positive integer of the form k * 2^n...
AbstractWe generalize Carmichael numbers to ideals in number rings and prove a generalization of Kor...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also constructed...
A Sierpiński number [4, page 420] and [1], is an odd positive integer, k, such that no positive int...