GCD calculator

The greatest common division calculator computes GCD of two or more integers. Calculator implements four different computation methods: prime factorization, repeated division, Euclidean algorithm and listing out the factors.

ID	Problem	Count
1	Find Greatest Common Divisor of 2 and 4, using prime factorization.	77
2	Find Greatest Common Divisor of 48, 36 and 124, using prime factorization.	68
3	Find Greatest Common Divisor of 4 and 6, using prime factorization.	63
4	Find Greatest Common Divisor of 8 and 12, using prime factorization.	53
5	Find Greatest Common Divisor of 3 and 6, using prime factorization.	52
6	Find Greatest Common Divisor of 48, 36 and 124, using Euclidean algorithm.	50
7	Find Greatest Common Divisor of 18 and 24, using prime factorization.	46
8	Find Greatest Common Divisor of 12 and 8, using prime factorization.	46
9	Find Greatest Common Divisor of 5 and 10, using prime factorization.	46
10	Find Greatest Common Divisor of 48, 36 and 124, using repeated division.	42
11	Find Greatest Common Divisor of 3 and 9, using prime factorization.	41
12	Find Greatest Common Divisor of 4 and 8, using prime factorization.	39
13	Find Greatest Common Divisor of 2 and 6, using prime factorization.	37
14	Find Greatest Common Divisor of 4 and 10, using prime factorization.	37
15	Find Greatest Common Divisor of 6 and 4, using prime factorization.	36
16	Find Greatest Common Divisor of 7 and 21, using prime factorization.	36
17	Find Greatest Common Divisor of 42823 and 6409, using prime factorization.	36
18	Find Greatest Common Divisor of 8 and 6, using prime factorization.	36
19	Find Greatest Common Divisor of 6 and 3, using prime factorization.	34
20	Find Greatest Common Divisor of 9 and 12, using prime factorization.	32
21	Find Greatest Common Divisor of 9 and 18, using prime factorization.	31
22	Find Greatest Common Divisor of 3 and 3, using prime factorization.	31
23	Find Greatest Common Divisor of 6 and 8, using prime factorization.	31
24	Find Greatest Common Divisor of 4 and 4, using prime factorization.	31
25	Find Greatest Common Divisor of 4 and 2, using prime factorization.	30
26	Find Greatest Common Divisor of 5 and 5, using prime factorization.	30
27	Find Greatest Common Divisor of 9 and 15, using prime factorization.	30
28	Find Greatest Common Divisor of 4 and 30, using prime factorization.	30
29	Find Greatest Common Divisor of 10 and 4, using prime factorization.	29
30	Find Greatest Common Divisor of 91 and 21, using prime factorization.	29
31	Find Greatest Common Divisor of 15 and 10, using prime factorization.	29
32	Find Greatest Common Divisor of 3 and 12, using prime factorization.	29
33	Find Greatest Common Divisor of 6 and 9, using prime factorization.	29
34	Find Greatest Common Divisor of 18 and 24, using Euclidean algorithm.	28
35	Find Greatest Common Divisor of 8 and 4, using prime factorization.	28
36	Find Greatest Common Divisor of 10 and 2, using prime factorization.	28
37	Find Greatest Common Divisor of 9 and 6, using prime factorization.	28
38	Find Greatest Common Divisor of 5 and 15, using prime factorization.	27
39	Find Greatest Common Divisor of 10 and 8, using prime factorization.	27
40	Find Greatest Common Divisor of 2 and 2, using prime factorization.	27
41	Find Greatest Common Divisor of 18 and 7, using prime factorization.	26
42	Find Greatest Common Divisor of 6 and 20, using prime factorization.	26
43	Find Greatest Common Divisor of 2 and 18, using prime factorization.	26
44	Find Greatest Common Divisor of 6 and 10, using prime factorization.	26
45	Find Greatest Common Divisor of 10 and 5, using prime factorization.	25
46	Find Greatest Common Divisor of 25 and 60, using prime factorization.	25
47	Find Greatest Common Divisor of 28 and 36, using prime factorization.	25
48	Find Greatest Common Divisor of 4 and 14, using prime factorization.	24
49	Find Greatest Common Divisor of 2 and 8, using prime factorization.	24
50	Find Greatest Common Divisor of 238 and 12, using prime factorization.	24

GCD calculator

Find Greatest Common Divisor of 0 and 5, using repeated division.

Report an Error!

GCD – Solved Problems Database