Exercise 2.18., so as , we have and . Moreover, , where , so that and . Thus (C) is correct.
Exercise 2.19. The Euclidean algorithm gives
Thus , and therefore the correct answers are (i): (B) and (ii): (E).
Exercise 2.20. We find , and divides both and , so Corollary 4.2.15 implies that . (If one does not see that straightaway, a more systematic approach is also possible, using the Euclidean algorithm.)
Proposition 4.4.2 states that an integer is an integral linear combination of and if and only if . Hence we have:
is an integral linear combination of and because ;
and cannot be written as integral linear combinations of and because and .
Therefore (C) is the correct answer.
Exercise 2.21. We find:
Alice’s answer is not correct; we have no theorem supporting her reasoning.
Bob’s answer is also not correct; his argument shows that and can both be written as linear combinations of and , but that was not the question!
Claire’s answer, giving a counterexample to the statement, is correct.
Dave’s answer is not correct because his negation of the statement is wrong. The correct negation is:
‘‘There exist , where is a multiple of and is a
multiple of , such that is not an integral linear combination
of and , or is an integral linear combination of and .’’
Hence (A) is the correct answer.