Thank you for your help!
I have one more question: I know how to use contrapositive for an implication (P => Q becomes not(Q) => not(P)). But, I'm not sure how to do that for a statement that is not an implication.
For example, how would I apply contraposition to this sort of claim?: All x, y...
I wasn't sure if this went in math, or computer science. I'm posting it here, because it is for a computer science course, although it's technically mathematical proofs...
1. The problem:
Prove or disprove the following claim: For all integers x, y, and z, if x does not divide yz then x does...