Wednesday, 8 May 2019

elementary number theory - If a divides bc and gcd(a,b)=d then fracad divides c




I'm trying to prove that if a divides bc and gcd(a,b)=d then ad divides c. I tried using Bezout identity but couldn't get anywhere.


Answer



Let a=ad and b=bd. Note that a and b are relatively prime. We want to show that a divides c. Since ad divides bdc, it follows that a divides bc.



By the Bezout Identity there are integers x and y such that ax+by=1. Multiply through by c. Note that a divides axc and a divides bcy. The result follows.


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}...