Greatest Common Divisor (GCD, GCF) Calculator step-by-step

Enter values

Last update: 2024-06-18

0/0

Values

Result:

Solution steps

Sort numbers from largest to smallest

= 14, 3

Find GCD of 14 and 3 using Euclid's Algorithm

Calculate the modulo using the Modulo Calculator

Calculate the modulo

mod(14,3)

mod(14,3)

= 2

14 = 4 * 3 + 2

= Remainder 2

2 > 0. Repeat calculation

Calculate the modulo

mod(3,2)

mod(3,2)

= 1

3 = 1 * 2 + 1

= Remainder 1

1 > 0. Repeat calculation

Calculate the modulo

mod(2,1)

mod(2,1)

= 0

2 = 2 * 1 + 0

= Remainder 0

Mod = 0

= 1

Rating: 0

Votes: 0

Related calculators