Computer Science, asked by joneseleanor113, 4 days ago

Write a program to find the g.c.d. of two numbers

Answers

Answered by sanjaysinghroe113
0

Answer:

As per the LCM method, we can obtain the GCD of any two positive integers by finding the product of both the numbers and the least common multiple of both numbers. LCM method to obtain the greatest common divisor is given as GCD (a, b) = (a × b)/ LCM (a, b).

Explanation:

THANKYOU

mark as brainliest

Answered by mayankpandita
0

Answer:

As per the LCM method, we can obtain the GCD of any two positive integers by finding the product of both the numbers and the least common multiple of both numbers. LCM method to obtain the greatest common divisor is given as GCD (a, b) = (a × b)/ LCM (a, b).

Explanation:

please mark me as brilliant

Similar questions