|
Search: id:A087788
|
|
|
| A087788 |
|
Carmichael numbers equal to the product of 3 primes: n=pqr, where p<q<r are primes such that a^{n-1} = 1 ( mod n) if a is prime to n. |
|
+0
5
|
|
| 561, 1105, 1729, 2465, 2821, 6601, 8911, 10585, 15841, 29341, 46657, 52633, 115921, 162401, 252601, 294409, 314821, 334153, 399001, 410041, 488881, 512461, 530881, 1024651, 1152271, 1193221, 1461241, 1615681, 1857241, 1909001, 2508013
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
It is interesting that most of the numbers have the last digit 1. For example 530881, 3581761, 7207201, etc.
|
|
REFERENCES
|
F. Arnault, Constructing Carmichael numbers which are strong pseudoprimes to several bases, Journal of Symbolic Computation, vol. 20, no 2, Aug. 1995, pp. 151-161.
G. Jaeschke, The Carmichael numbers to 10^12, Math. Comp., 55 (1990), 383-389.
O. Ore, Number Theory and Its History, McGraw-Hill, 1948, Reprinted by Dover Publications, 1988, Chapter 14.
|
|
LINKS
|
Harvey Dubner, Journal of Integer Sequences, Vol. 5 (2002) Article 02.2.1, Carmichael Numbers of the form (6m+1)(12m+1)(18m+1).
Math Reference Project, Carmichael Numbers
R. G. E. Pinch, Carmichael numbers up to 10^16 (FTP)
|
|
FORMULA
|
n is composite and square-free, and for p prime, p|n => p-1|n-1. A composite odd number n is a Carmichael number if and only if n is squarefree and p-1 divides n-1 for every prime p dividing n (Korselt, 1899) n=pqr, p-1|n-1, q-1|n-1, r-1|n-1.
|
|
EXAMPLE
|
a(6)=6601=7*23*41: 7-1|6601-1, 23-1|6601-1, 41-1|6601-1, i.e. 6|6600, 22|6600, 40|6600.
|
|
CROSSREFS
|
Cf. A002997.
Sequence in context: A006971 A104016 A002997 this_sequence A083733 A048123 A131672
Adjacent sequences: A087785 A087786 A087787 this_sequence A087789 A087790 A087791
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Miklos Kristof (kristmikl(AT)freemail.hu), Oct 07 2003
|
|
|
Search completed in 0.002 seconds
|
