Appendix a Solutions and Hints to Exercises
Appendix A Solutions and Hints to Exercises Chapter 1 1.1 1. Suppose that there are only finitely many prime p ≡ 3 (mod 4), and label them p1,...,pn. Then consider N = 4p1 ...pn − 1. This number is clearly odd, and has remainder 3 after dividing by 4. So its prime divisors are all odd, and they can’t all be 1 (mod 4), as the product of numbers which are 1 (mod 4) is again 1 (mod 4). So N has a prime divisor p ≡ 3(mod4).But p must be different from all the pi , since p|N but pi N for all i = 1,...,n. So there must be infinitely many primes p ≡ 3(mod4). 2. Suppose that there are only finitely many prime p ≡ 5 (mod 6), and label them p1,...,pn. Then consider N = 6p1 ...pn − 1. This number is clearly odd, and has remainder 5 after dividing by 6. So (6, N) = 1, and the prime divisors of N can’t all be 1 (mod 6), as the product of numbers which are 1 (mod 6) is again 1 (mod 6). So N has a prime divisor p ≡ 5(mod6).But p must be different from all the pi , since p|N but pi N for all i = 1,...,n. So there must be infinitely many primes p ≡ 5(mod6). 1.2 1. Suppose that p|x2 +1. If x is even, clearly p is odd. Then x2 ≡−1(modp) (and as p = 2, we have x2 ≡ 1(modp)), and so x4 ≡ 1(modp).
[Show full text]