Saturday, 17 June 2017

elementary number theory - Show that gcd(2m1,2n1)=2gcd(m,n)1








I'm trying to figure this out:



Show that for all positive integers m and n



gcd



I appreciate your help,

Thanks.



Note: \gcd stands for the greatest common divisor.

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