Question

Let m divides n then GcD of m,n are

Answer 1

Answer:

The gcd of $m$ and $n$, if  $m$ divides $n$ is $m$

Step-by-step explanation:

The GCD, the greatest common divisor of two numbers is the largest number which is a factor of both numbers.

Here we have two number $m$ and $n$ and $m$ divides $n$. That means $m$ is a factor of $n$. Also $m$ is the largest factor of $m$ itself.

Hence the GCD is $m$