Exercise 2.4.20* (Carmichael numbers)

Let k be a positive integer such that 6 k + 1 = p 1 , 12 k + 1 = p 2 , 18 k + 1 = p 3 are all prime numbers, and put m = p 1 p 2 p 3 . Show that ( p i 1 ) ( m 1 ) , i = 1 , 2 , 3 . Conclude that ( a , m ) = 1 then a m 1 1 ( mod m ) , that is, that m is a Carmichael number. (It is conjectured that there are infinitely many k for which the numbers p i are all prime; the first three are k = 1 , 6 , 35 .)

Answers

Proof.

a)
Using p 1 1 ( mod p 1 1 ) , and p 1 1 = 6 k , we obtain m 1 p 2 p 3 1 ( mod p 1 1 ) , p 2 p 3 1 = ( 12 k + 1 ) ( 18 k + 1 ) 1 = 216 k 2 + 30 k = 6 k ( 36 k + 5 ) 0 ( mod p 1 1 ) ,

so

p 1 1 m 1 .

Similarly, with p 2 1 = 12 k ,

m 1 p 1 p 3 1 , p 1 p 3 1 = ( 6 k + 1 ) ( 18 k + 1 ) 1 = 108 k 2 + 24 k = 12 k ( 9 k + 2 ) 0 ( mod p 2 1 ) ,

so

p 2 1 m 1 .

Finally, with p 3 1 = 18 k ,

m 1 p 1 p 2 1 ( mod p 3 1 ) p 1 p 2 1 = ( 6 k + 1 ) ( 12 k + 1 ) 1 = 72 k 2 + 18 k = 18 k ( 4 k + 1 ) 0 ( mod p 3 1 )

so

p 3 1 m 1 .

b)
Suppose that a m = 1 . Then a p i = 1 , for i = 1 , 2 , 3 . By Fermat theorem, a p i 1 1 ( mod p i ) , i = 1 , 2 , 3 .

Since p i 1 m 1 , we have

a m 1 1 ( mod p i ) , i = 1 , 2 , 3 .

Since p 1 , p 2 , p 3 are distinct primes, therefore relatively prime by pairs, a m 1 1 ( mod p 1 p 2 p 3 ) , that is

a m 1 1 ( mod m )

for all integer a prime to m , so the composite m = p 1 p 2 p 3 is a Carmichael number.

User profile picture
2024-08-25 10:14
Comments