Show that gcd (a, m) $\displaystyle $\leq$$ gcd(a, mn) for any integers a,m and n.
Follow Math Help Forum on Facebook and Google+
Originally Posted by Statsnoob2718 Show that gcd (a, m) $\displaystyle $\leq$$ gcd(a, mn) for any integers a,m and n. Sometimes gcd(0,0) is defined as 0 which would provide an exception, but aside form that, show that gcd(a,m) | gcd(a,mn).
View Tag Cloud