Prove that for all integers a, b, and c,
(a) if c divides a and c divides b, then for all integers x and y, c divides ax + b.
(b) if a divides b − 1 and a divides c − 1, then a divides
(c) if a divides b, then for all natural numbers n, an divides bn
(d) if a is odd, c > 0, c divides a and c divides a + 2, then c = 1.
(e) if there exist integers m and n such that am + bn = 1 and then c does not divide a or c does not divide b.
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.