## Proof for: If a|bc, then a|b.

In my Discrete Mathematics class we are are covering divisibility. One of the problems that the professor covered (quite terribly) is the following:

1. The problem statement, all variables and given/known data

Prove or salvage:

If a|bc, then a|b.

2. Relevant equations

Relevant concepts:

Relatively prime numbers
Divisibility

3. The attempt at a solution

I know that the statement is wrong as it is. I also know that in order to salvage the statement, I must say that a and c are relatively prime. The problem is that I do not know how to rigorously prove this.

Could somebody guide me in how to do this. Teach a man to fish!
 PhysOrg.com science news on PhysOrg.com >> City-life changes blackbird personalities, study shows>> Origins of 'The Hoff' crab revealed (w/ Video)>> Older males make better fathers: Mature male beetles work harder, care less about female infidelity
 Use the following fact: If gcd(a,c)=1, then ax+cy=1 for some integers x,y.

 Tags discrete math, discrete math proofs, proof, prove, salvage

 Similar discussions for: Proof for: If a|bc, then a|b. Thread Forum Replies Calculus & Beyond Homework 5 Calculus & Beyond Homework 21 Calculus & Beyond Homework 1 Calculus & Beyond Homework 1 Calculus & Beyond Homework 11