Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 2.4.20* (Carmichael numbers)
Exercise 2.4.20* (Carmichael numbers)
Let be a positive integer such that are all prime numbers, and put . Show that , . Conclude that then , that is, that is a Carmichael number. (It is conjectured that there are infinitely many for which the numbers are all prime; the first three are .)
Answers
Proof.
- a)
-
Using
, and
, we obtain
so
Similarly, with ,
so
Finally, with ,
so
- b)
-
Suppose that
. Then
, for
. By Fermat theorem,
Since , we have
Since are distinct primes, therefore relatively prime by pairs, , that is
for all integer prime to , so the composite is a Carmichael number.