I cannot proof 2 problem.....*-*!!!

1.Prove that if gcd(a,b)=1,then gcd(a+b,ab)=1.

2.If gcd(a,b)=1,and c|(a+b),then gcd(a,c)=gcd(b,c)=1.

(I can show proof gcd(a,c)=1 but I can show gcd(b,c)=1.)

....Thank !

Results 1 to 4 of 4

- December 12th 2009, 11:40 PM #1

- Joined
- Dec 2009
- Posts
- 12

- December 13th 2009, 12:53 PM #2

- Joined
- Oct 2009
- Posts
- 4,261
- Thanks
- 2

- December 13th 2009, 06:48 PM #3
Notice that gcd(n,m)=1 iff the m-class is in the !

since gcd(a,b)=1, we have gcd(a+b,a)=1, and gcd(a+b,b)=1 by the euler algrithem.

thus gcd(a+b,ab)=1, that is because the statement "gcd(a+b,a)=1, and gcd(a+b,b)=1 " mean that a and b are in the group, so the product of a-class and b-class lies in the group, that is equivalent to say gcd(a+b,ab)=1.

- December 13th 2009, 11:30 PM #4

- Joined
- Dec 2009
- Posts
- 12