- #1
rooski
- 61
- 0
Homework Statement
let a and b be relatively prime positive integers.
if c is a positive integer and a | bc then prove that a | c
The Attempt at a Solution
I started by trying to prove the contra-positive. If a is not divisible by bc then a is not divisible by c.
it follows that a mod bc > 0 in this case.
Now suppose x = bc.
If a mod c is > 0 as well, then a mod c = a mod x.
It follows that a is equivalent to c mod x, or c mod bc.
Is this ample proof?
Last edited: