- #1
puddipop
- 2
- 0
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 not divide y and x does not divide z.I wrote this in logic notation first, so I have that down. What I am having difficulty with is the actual prove/disprove part. I understand the steps needed to be taken (1. Assume... etc.), but am having trouble actually applying it. There are other similar questions, but I figured if I could get some help on this question, I could figure out the other ones as well, by applying the same concept...
Also, how do I know what to choose: prove, or disprove? In what circumstances would I attempt to prove, and in what circumstances would I attempt to disprove?
Any help would be greatly appreciated. :)
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 not divide y and x does not divide z.I wrote this in logic notation first, so I have that down. What I am having difficulty with is the actual prove/disprove part. I understand the steps needed to be taken (1. Assume... etc.), but am having trouble actually applying it. There are other similar questions, but I figured if I could get some help on this question, I could figure out the other ones as well, by applying the same concept...
Also, how do I know what to choose: prove, or disprove? In what circumstances would I attempt to prove, and in what circumstances would I attempt to disprove?
Any help would be greatly appreciated. :)