Saturday, 24 September 2016

gcd and lcm - Suppose b,cintextbfZ+ are relatively prime (i.e., gcd(b,c)=1), and a,|,(b+c). Prove that gcd(a,b)=1 and gcd(a,c)=1

Suppose b,cZ+ are relatively prime (i.e., gcd(b,c)=1), and a|(b+c). Prove that gcd(a,b)=1 and gcd(a,c)=1.



I've been trying to brainstorm how to prove this. I have determined that gcd(b,b+c)=1, but I am not sure if this fact will aid in proving this statement at all.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...