The answer to exercise marked [BB] can be found in the Back of the Book.
(a) [BB] Given integers d, x and y, suppose there exist integers m and n such that d = mx + ny. Prove that gcd (x,y) | d.
(b) Is the converse of (a) true? If gcd (x, y) |d, need there exist integers m and n such that d = mx + ny?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.