Thread: Show that gcd (a, m) is less than equal to gcd(a, mn) for any integers a,m and n.?

1. Show that gcd (a, m) is less than equal to gcd(a, mn) for any integers a,m and n.?

Show that gcd (a, m) $\displaystyle$\leq$$gcd(a, mn) for any integers a,m and n. 2. 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).

,

,

show that gcd(a,m) less than or equal to gcd (a,mn)

Click on a term to search for related topics.