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

Math

Algebra Calculators

Greatest Common Divisor (GCD, GCF, HCF) Calculator

Enter values

Last update: 2024-06-18

0/0

Values

Result:

1

Solution steps

1.

Sort numbers from largest to smallest

= 13, 8

2.

Find GCD of 13 and 8 using Euclid's Algorithm

1.

Calculate the modulo using the Modulo Calculator

1.

Calculate the modulo

mod(13,8)

mod(13,8)

= 5

2.

13 = 1 * 8 + 5

= Remainder 5

3.

5 > 0. Repeat calculation

1.

Calculate the modulo

mod(8,5)

mod(8,5)

= 3

4.

8 = 1 * 5 + 3

= Remainder 3

5.

3 > 0. Repeat calculation

1.

Calculate the modulo

mod(5,3)

mod(5,3)

= 2

6.

5 = 1 * 3 + 2

= Remainder 2

7.

2 > 0. Repeat calculation

1.

Calculate the modulo

mod(3,2)

mod(3,2)

= 1

8.

3 = 1 * 2 + 1

= Remainder 1

9.

1 > 0. Repeat calculation

1.

Calculate the modulo

mod(2,1)

mod(2,1)

= 0

10.

2 = 2 * 1 + 0

= Remainder 0

11.

Mod = 0

= 1

Rating: 0

Votes: 0

Related calculators

Euclid's Algorithm Calculator

Roots Calculator

Exponent Calculator

Exponential Function Calculator

Logarithm Calculator

Check out 5 similar algebra calculators