Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Every odd prime leaves remainder or on division by . Euclid's argument can be changed to prove that there are infinitely many primes of the form .
Every is a product of primes in one way only. A composite has a prime factor at most . If a prime divides , it divides or . A perfect th power has every exponent a multiple of .
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Part (a). . Repeat this for any number of factors.
Step 2. leaves remainder 3. . It is odd, so all its prime factors are odd.
Step 3. A factor of the form . If every prime factor of had the form , then by part (a) so would . It does not. So some prime has the form .
Step 4. The factor is new. If , then divides , which is impossible. If , then divides , so divides some , which is impossible too. So the list was not complete, and there are infinitely many primes of the form .
Step 5. Part (c). In the proof the list leaves out . With the list the number is still worth a test: . Here and .
Answer: the prime factor of the form is , which is not on the list. Proof complete.
Watch out. The same trick fails for primes of the form : a product of numbers of the form can be of the form , since .
Log in to join the discussion.
Loading…