Exercise 1.3.43 ($F_5$ is composite.)

The numbers F n = 2 2 n + 1 in the preceding problem are called the Fermat numbers, after Pierre de Fermat who thought they might all be primes. Show that F 5 is composite by verifying that

( 2 9 + 2 7 + 1 ) ( 2 23 2 21 + 2 19 2 17 + 2 14 2 9 2 7 + 1 ) = 2 32 + 1 .

(It is not hard to show that F n is prime for n = 0 , 1 , , 4 ; these are the only n for which F n is known to be prime. It is now known that F n is composite for n = 5 , 6 , , 21 . It is conjectured that only finitely many Fermat numbers are prime.)

Answers

Let N = ( 2 9 + 2 7 + 1 ) ( 2 2 3 2 2 1 + 2 1 9 2 1 7 + 2 1 4 2 9 2 7 + 1 ) .

Then, using 2 k + 2 k 2 k + 1 = 0 ,

N = 2 3 2 2 3 0 + 2 2 8 2 2 6 + 2 2 3 2 1 8 2 1 6 + 2 9 + 2 3 0 2 2 8 + 2 2 6 2 2 4 + 2 2 1 2 1 6 2 1 4 + 2 7 + 2 2 3 2 2 1 + 2 1 9 2 1 7 + 2 1 4 2 9 2 7 + 1 = 2 3 2 + ( 2 2 4 + 2 2 3 + 2 2 3 ) + ( 2 1 9 2 1 8 2 1 7 2 1 6 2 1 6 ) + 1 = 2 3 2 + 1 .

More briefly,

2 2 5 + 1 = 4 2 9 4 9 6 7 2 9 7 = 6 4 1 × 6 7 0 0 4 1 7

is composite.

User profile picture
2024-07-12 17:51
Comments