Discrete math: proofsFor any three integers x, y, and z, if 𝒚 is divisible by...
Discrete math: proofs
For any three integers x, y, and z, if 𝒚 is divisible by x and z is divisible by y, then z is divisible by x.
definition: An integer n is divisible by an integer d with , denoted d|n, if and only if there exists an integer k such that .
Can anyone help, with this problem I don't know how to approach it should I use proof by cases where every number is odd or even. Should I use direct proof or indirect proof?