Question

let m divides n. then GCD and LCM of m,n are​

Answer 1

Answer:

G.C.D. = m, L.C. M. = n

Step-by-step explanation:

G.C.D = m

L.C.M.= n

Answer 2

GCD (m,n) = m and LCM (m,n) = n

Explanation:

• GCD = Greatest common divisor

• GCD of two number is the greatest common divisor that divides both them.
• LCM = Least common multiple
• LCM of two numbers is the least common multiple that is divisible by both of them.

Given : m divides n

Also, m divides itself .           [a number divides itself]

So , m is the GCD of m and n that divides both of them.

Also, if m divides n , then n is a multiple of m.

Also, n is a multiple of itself     [a number is multiple of  itself]

Then, n is the LCM of m and n that is divisible by both of them.

Hence, GCD (m,n) = m and LCM (m,n) = n

# Learn more :

Find LCM and GCD of 540and 2592 by prime factorization method

https://brainly.in/question/6142897