How to find gcd of two numbers

Question

How to get idea

Answer 1

You can use the euclidian algorithm:

gcd(12,10)

12 % 10 = 2
10 % 2 = 0 -> mod returns 0
-> gcd(12,10) = 2

gcd(14,9)

14 % 9 = 5
9 % 5 = 4
5 % 4 = 1
4 % 1 = 0 -> mod returns 0
gcd(14,9) = 1

gcd(20,5)

20 % 5 = 0
gcd(20,5) = 5

Answer 2

a way to do it in pyhton:
def gcd(a, b):
while a != b:
if a > b:
a -= b
else:
b -= a
return a

Answer 3

Perhaps it is not so easy to find that in so long code there, so the solution here in C# (can be implemented very well in any other language):
int Gteil(int a, int b) {
int rest = a % b;
if (rest == 0)
return b;
else
return Gteil(b, rest);
}

Answer 4

https://code.sololearn.com/carOWug97vyE/?ref=app

Answer 5

Ideas for calculation gcd can be found in the math books of a high school.

Answer 6

Ex: for 10,12
10: divisors are 1,2,5,10
12: divisors are 1,2,3,4,6,12
GCD(10,12)
The greatest common divisor is 2.
Since common divisors are 1,2. Greater is 2.

Find common divisors, pick greater one..

Answer 7

I want a general case for a,b

Answer 8

K.Srujan Kumar Please don't ask for codes here. We gave you two alternatives how you can solve the problem. You only need to convert it into a code. I am sure you can do it. :)

Answer 9

Okk tnq

Answer 10

K.Srujan Kumar

If you need help with your code please show us your attemp.

Answer 11

If you like a possible solution can be found here:
https://code.sololearn.com/cEv41IqV7eYc/?ref=app
Have lots of fun with it!

Answer 12

Plzz

Answer 13

Print the program plzzz