I'm trying to figure this out:
Show that for all positive integers m and n
gcd(2m−1,2n−1)=2gcd(m,n)−1
I appreciate your help,
Thanks.
Note: gcd stands for the greatest common divisor.
How to find limh→0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
No comments:
Post a Comment