I have to prove that if ab is divisible by the prime p, and a is not divisible by p, then b is divisible by p.(adsbygoogle = window.adsbygoogle || []).push({});

In order to prove this, I have to show (a,p)=1. I am not sure what this statement means.

Then I am supposed to use the fact that 1=sa + tp when s,t are elements of the set of integers. (This statement was already proved in class). Then I figured to multiply across by b so that we get

b= sab + tpb. I am not sure where to from here. I have not seen to many proofs regarding prime factorization. Thanks

Ed

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Help with prime factorization proof

**Physics Forums | Science Articles, Homework Help, Discussion**