Publication date
December 1982
DOI Publisher
Published by Elsevier Ltd. ISSN
0898-1221Abstract
AbstractA method for constructing larger Carmichael numbers from known Carmichael numbers is presented. A Carmichael number of 432 digits is constructed
AbstractA method for constructing larger Carmichael numbers from known Carmichael numbers is presented. A Carmichael number of 432 digits is constructed
Carmichael numbers up to 10^ were known by the computation of R. G. E. Pinch [10](1998). We have com...
We prove that there exist infinitely many (-1,1)-Carmichael numbers, that is, square-free, composite...
We dedicate this paper to our friend Alf van der Poorten Assuming a conjecture intermediate in stren...
AbstractA method for constructing larger Carmichael numbers from known Carmichael numbers is present...
It is shown that, for all large x, there are more than x0.33 Carmichael numbers up to x, improving o...
Numbers of the form (6m+1)(12m+1)(18m+1) where all three factors are simultaneously prime are the be...
We extend the method of Loh and Niebuhr for the generation of Carmichael numbers with a large number...
We present two effective sieve algorithms suitable for the computation of Carmichael numbers in a gi...
We prove that when (a, m) = 1 and a is a quadratic residue mod m, there are infinitely many Carmicha...
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...
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...
Carmichael numbers up to 10^ were known by the computation of R. G. E. Pinch [10](1998). We have com...
We prove that there exist infinitely many (-1,1)-Carmichael numbers, that is, square-free, composite...
We dedicate this paper to our friend Alf van der Poorten Assuming a conjecture intermediate in stren...
AbstractA method for constructing larger Carmichael numbers from known Carmichael numbers is present...
It is shown that, for all large x, there are more than x0.33 Carmichael numbers up to x, improving o...
Numbers of the form (6m+1)(12m+1)(18m+1) where all three factors are simultaneously prime are the be...
We extend the method of Loh and Niebuhr for the generation of Carmichael numbers with a large number...
We present two effective sieve algorithms suitable for the computation of Carmichael numbers in a gi...
We prove that when (a, m) = 1 and a is a quadratic residue mod m, there are infinitely many Carmicha...
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...
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...
Carmichael numbers up to 10^ were known by the computation of R. G. E. Pinch [10](1998). We have com...
We prove that there exist infinitely many (-1,1)-Carmichael numbers, that is, square-free, composite...
We dedicate this paper to our friend Alf van der Poorten Assuming a conjecture intermediate in stren...
Add to ORKG