Sunday, 14 September 2014

proof writing - How to prove that gcd(a,m)legcd(a,mn) for any integer n

I'm trying to show that gcd for any integer n



Taking a classical algebra course and can not seem to figure out how to prove this. I know about Bezout's Identity but don't know how I could apply it to this problem.

No comments:

Post a Comment

real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}

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