Divisibility

1. Definition. The natural numbers are the numbers {1, 2, 3, 4, . . .}.

2. Definition. The integers are {. . . , −3, −2, −1, 0, 1, 2, 3, . . .}.
3. Definition. Suppose a and d are integers. Then d divides a, denoted by d|a
if and only if there is an integer k such that a = kd.
4. Prove: Let n be an integer. If 6|n, then 3|n.
5. Theorem. Let a, b, and c be integers. If a|b and a|c, then a|(b + c).
6. Theorem. Let a, b, and c be integers. If a|b and a|c, then a|(b − c).
7. Theorem. Let a, b, and c be integers. If a|b and a|c, then a|bc.
8. Question. Is the converse of the above theorem true? If a|bc, does it follow
that a|b and a|c?
9. Question. Can you keep the same hypothesis, but replace the conclusion by
a2 |bc?
10. Question. Can you weaken the hypothesis of the previous theorem and still
prove the conclusion?
11. Question. Suppose that a|c and b|c. Can we conclude that ab|c? Justify your
answer.
12. Prove. A natural number is divisible by 3 if and only if the sum of its digits
is divisible by 3.
13. Exercise. Devise and prove the other divisibility criteria, similar to the pre-
ceding one.