E.7 Online-assessed exercises from week 3
Exercise 3.17. We have
and ,
where , , , and are prime (as we showed using the
Sieve of Eratosthenes in Section 4.6).
Proposition 4.7.10 implies that
|
|
|
By
Corollary 4.7.5, has positive factors. Hence (A) is the correct answer.
Exercise 3.18. We have
because (or because their prime
factorizations are and , or
alternatively by the Euclidean algorithm), so Theorem 5.2.2
implies that:
-
•
the congruence has no solutions because
;
-
•
the congruence has no solutions because
;
-
•
the congruence has no solutions because
.
Hence (B) is the correct answer.
Exercise 3.19. The highest common
factor of and is because
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
As , the congruence has solutions, and we can simplify it to
, where and are coprime because (divide by in the integral linear
combination found above). Hence the complete solution is given by
|
|
|
so that (D) is the correct answer.
Exercise 3.20. We use the
Euclidean algorithm to show that and are coprime and to
write as an integral linear combination of them:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Hence the Chinese Remainder Theorem (Theorem 5.3.2) applies; in
the notation of this theorem, we have , , , , and , and the complete solution is given by
|
|
|
(Note that no further simplification is
possible because .) Hence (C) is the correct
answer.
Exercise 3.21. We have
(because and and , or
by prime factorization), and does not divide , so
Proposition 5.3.5 implies that the two congruences cannot be
solved simultaneously. Hence (A) is the correct answer.