| 
November 5th, 2009, 07:06 AM
| | Junior Member | | Join Date: Mar 2009
Posts: 44
Country:  Thanks: 17
Thanked 0 Times in 0 Posts
| |  Another coprime proof
Hi all,
Prove that if gcd(a,m) = gcd(b,m) = 1 then gcd(ab,m) = 1. |
November 5th, 2009, 07:34 AM
| | MHF Contributor | | Join Date: Oct 2009
Posts: 1,147
Thanks: 52
Thanked 392 Times in 370 Posts
| |
Quote:
Originally Posted by sirellwood  Hi all,
Prove that if gcd(a,m) = gcd(b,m) = 1 then gcd(ab,m) = 1. |
Suppose there's a prime p s.t. p divides ab and m ==> (p divides a or p divides b) and (p divides m) ==>....
Tonio | | The following users thank tonio for this useful post: | |  |
November 5th, 2009, 10:05 AM
| | Junior Member | | Join Date: Mar 2009
Posts: 44
Country: Thanks: 17
Thanked 0 Times in 0 Posts
| |
I see where you are going! thanks! | | Thread Tools | | | | Display Modes |  Linear Mode | 
Posting Rules
| You may not post new threads You may not post replies You may not post attachments You may not edit your posts
HTML code is Off | | | All times are GMT -7. The time now is 05:22 AM. | | |
 | |  |
