GCD

(the database of solved problems)

All the problems and solutions shown below were generated using the GCD Calculator.

Select category

ID	Problem	Count
2701	Find Greatest Common Divisor of 600 and 480, using prime factorization.	2
2702	Find Greatest Common Divisor of 429 and 299, using Euclidean algorithm.	2
2703	Find Greatest Common Divisor of 429 and 299, using repeated division.	2
2704	Find Greatest Common Divisor of 429 and 299, by listing out the factors.	2
2705	Find Greatest Common Divisor of 210 and 45, using Euclidean algorithm.	2
2706	Find Greatest Common Divisor of 1109 and 4999, using Euclidean algorithm.	2
2707	Find Greatest Common Divisor of 3587 and 1819, using Euclidean algorithm.	2
2708	Find Greatest Common Divisor of 24 and 12, using prime factorization.	2
2709	Find Greatest Common Divisor of 424 and 82, using repeated division.	2
2710	Find Greatest Common Divisor of 424 and 82, using Euclidean algorithm.	2
2711	Find Greatest Common Divisor of 2 and 2147483647, using Euclidean algorithm.	2
2712	Find Greatest Common Divisor of 500 and 40, using Euclidean algorithm.	2
2713	Find Greatest Common Divisor of 2, 6, 12, 20 and 30, using prime factorization.	2
2714	Find Greatest Common Divisor of 51, 68 and 85, using prime factorization.	2
2715	Find Greatest Common Divisor of 8, 18 and 30, using repeated division.	2
2716	Find Greatest Common Divisor of 5544 and 6600, using Euclidean algorithm.	2
2717	Find Greatest Common Divisor of 33 and 16, using prime factorization.	2
2718	Find Greatest Common Divisor of 128 and 164, using prime factorization.	2
2719	Find Greatest Common Divisor of 328, 769, 541, 986, 215 and 734, using prime factorization.	2
2720	Find Greatest Common Divisor of 2151 and 863, using repeated division.	2
2721	Find Greatest Common Divisor of 26513 and 32321, using prime factorization.	2
2722	Find Greatest Common Divisor of 217 and 583, using Euclidean algorithm.	2
2723	Find Greatest Common Divisor of 15 and 2, using prime factorization.	2
2724	Find Greatest Common Divisor of 486 and 153, using Euclidean algorithm.	2
2725	Find Greatest Common Divisor of 238.	2
2726	Find Greatest Common Divisor of 12, 120, 30 and 42, using prime factorization.	2
2727	Find Greatest Common Divisor of 195 and 455, using prime factorization.	2
2728	Find Greatest Common Divisor of 155590302 and 4200021066, using Euclidean algorithm.	2
2729	Find Greatest Common Divisor of 5859 and 1232, using Euclidean algorithm.	2
2730	Find Greatest Common Divisor of 5859 and 1232, using prime factorization.	2
2731	Find Greatest Common Divisor of 1372 and 4536, using prime factorization.	2
2732	Find Greatest Common Divisor of 1372 and 4536, using Euclidean algorithm.	2
2733	Find Greatest Common Divisor of 4148 and 7684, using Euclidean algorithm.	2
2734	Find Greatest Common Divisor of 7293 and 3640, using Euclidean algorithm.	2
2735	Find Greatest Common Divisor of 27 and 36, using repeated division.	2
2736	Find Greatest Common Divisor of 55, 65, 201 and 3, using prime factorization.	2
2737	Find Greatest Common Divisor of 782221.	2
2738	Find Greatest Common Divisor of 800 and 72, using prime factorization.	2
2739	Find Greatest Common Divisor of 2025 and 1109, using Euclidean algorithm.	2
2740	Find Greatest Common Divisor of 212 and 338, using prime factorization.	2
2741	Find Greatest Common Divisor of 90 and 385, using prime factorization.	2
2742	Find Greatest Common Divisor of 82 and 76, using prime factorization.	2
2743	Find Greatest Common Divisor of 358 and 309, using repeated division.	2
2744	Find Greatest Common Divisor of 1812 and 2134, using prime factorization.	2
2745	Find Greatest Common Divisor of 142766 and 1729, using prime factorization.	2
2746	Find Greatest Common Divisor of 1638 and 4675, using prime factorization.	2
2747	Find Greatest Common Divisor of 4158 and 7056, using prime factorization.	2
2748	Find Greatest Common Divisor of 7394592 and 264817800, using prime factorization.	2
2749	Find Greatest Common Divisor of 1377, 1701 and 9477, using prime factorization.	2
2750	Find Greatest Common Divisor of 3963, 6933 and 9633, using prime factorization.	2