Recent content by fritzh

Cool. Thanks for all the help. I'm a chemistry major who keeps taking math classes for some reason.

Maybe Let x be divisible by n: x=kn y=y x*y=kn*y xy is a multiple of n, so xy is divisible by n. Proof by contraposition. This is my first introduction to formal logic and proofs (MAT385) aside from proofs like those found in calc III. Thus, I thank you for the pointers on specifics.

Is this sufficient? Is the attached sufficient. By write the definition of x, did you mean x=kn?

I see. Seeing the implication differently does change quite a bit. Thank you.

Homework Statement 28. Prove the given statement: If the product of two integers is not divisible by an integer n, then neither integer is divisible by n. Homework Equations Proof by contraposition The Attempt at a Solution Originally the problem states: (xy/n)'→(x/n /\ y/n)'...