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 - The Fusion of Science and Community**

Join Physics Forums Today!

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

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

# Help with prime factorization proof

Loading...

Similar Threads - Help prime factorization | Date |
---|---|

Proof for primes help! | Mar 25, 2012 |

Help with Mobius Inversion in Riemann's Zeta Function by Edwards (J to Prime Pi) | Dec 28, 2011 |

HELP! Mathematical notation needed for a prime mod 12 pattern | Jan 5, 2011 |

Factorials of prime numbers? please help | Jul 6, 2010 |

Primes in ring of Gauss integers - help | Jan 16, 2005 |

**Physics Forums - The Fusion of Science and Community**