On Numbers Analogous to the Carmichael Numbers
Canadian mathematical bulletin, Tome 20 (1977) no. 1, pp. 133-143
Voir la notice de l'article provenant de la source Cambridge University Press
A base a pseudoprime is an integer n such that 1 A Carmichael number is a composite integer n such that (1) is true for all a such that (a, n ) = l. It was shown by Carmichael [1] that, if n is a Carmichael number, then n is the product of k(>2) distinct primes P 1,P 2,P 3, ... Pk , and P i-1|n-1(i=1, 2, 3, ..., k).
Williams, H. C. On Numbers Analogous to the Carmichael Numbers. Canadian mathematical bulletin, Tome 20 (1977) no. 1, pp. 133-143. doi: 10.4153/CMB-1977-025-9
@article{10_4153_CMB_1977_025_9,
author = {Williams, H. C.},
title = {On {Numbers} {Analogous} to the {Carmichael} {Numbers}},
journal = {Canadian mathematical bulletin},
pages = {133--143},
year = {1977},
volume = {20},
number = {1},
doi = {10.4153/CMB-1977-025-9},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1977-025-9/}
}
[1] 1. Carmichael, R. D.. A new number theory function, Bull. Amer. Math. Soc., 19 (1910), pp. 232-238. Google Scholar
[2] 2. Chernick, Jack, On Fermat's simple theorem, Bull. Amer. Math. Soc., 45 (1939), pp. 269-274. Google Scholar
[3] 3. Lehmer, D. H., Strong Carmichael numbers, J. Aust. Math. Soc, Ser. A, 21 (1976) pp. 508-510. Google Scholar
[4] 4. Rotkiewicz, A, On the pseudoprimes with respect to the Lucas sequences, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys., 21 (1973), pp. 793-797. Google Scholar
Cité par Sources :