Add to ORKGWe present two effective sieve algorithms suitable for the computation of Carmichael numbers in a given interval. One algorithm was implemented on a vector computer VP1OO to find the Carmichael numbers up to \(10^{14}\). We give some statistics on the numbers found
We establish several related results on Carmichael, Sierpiński and Riesel numbers. First, we prove ...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
AbstractWe describe here a method of constructing Carmichael numbers which are strong pseudoprimes t...
We extend the method of Loh and Niebuhr for the generation of Carmichael numbers with a large number...
We prove that when (a, m) = 1 and a is a quadratic residue mod m, there are infinitely many Carmicha...
We prove that there exist infinitely many (-1,1)-Carmichael numbers, that is, square-free, composite...
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...
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...
It is shown that, for all large x, there are more than x0.33 Carmichael numbers up to x, improving o...
AbstractA method for constructing larger Carmichael numbers from known Carmichael numbers is present...
Abstract. We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also c...
Numbers of the form (6m+1)(12m+1)(18m+1) where all three factors are simultaneously prime are the be...
We establish several related results on Carmichael, Sierpiński and Riesel numbers. First, we prove ...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
AbstractWe describe here a method of constructing Carmichael numbers which are strong pseudoprimes t...
We extend the method of Loh and Niebuhr for the generation of Carmichael numbers with a large number...
We prove that when (a, m) = 1 and a is a quadratic residue mod m, there are infinitely many Carmicha...
We prove that there exist infinitely many (-1,1)-Carmichael numbers, that is, square-free, composite...
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...
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...
It is shown that, for all large x, there are more than x0.33 Carmichael numbers up to x, improving o...
AbstractA method for constructing larger Carmichael numbers from known Carmichael numbers is present...
Abstract. We have constructed a Carmichael number with 10,333,229,505 prime factors, and have also c...
Numbers of the form (6m+1)(12m+1)(18m+1) where all three factors are simultaneously prime are the be...
We establish several related results on Carmichael, Sierpiński and Riesel numbers. First, we prove ...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
AbstractWe describe here a method of constructing Carmichael numbers which are strong pseudoprimes t...