GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2951 | Find Greatest Common Divisor of 9, 12 and 21, using Euclidean algorithm. | 2 |
| 2952 | Find Greatest Common Divisor of 2, 4, 6 and 10, using prime factorization. | 2 |
| 2953 | Find Greatest Common Divisor of 2, 4, 6 and 10, using Euclidean algorithm. | 2 |
| 2954 | Find Greatest Common Divisor of 21, 45, 9 and 81, using Euclidean algorithm. | 2 |
| 2955 | Find Greatest Common Divisor of 21, 45, 9 and 81, by listing out the factors. | 2 |
| 2956 | Find Greatest Common Divisor of 377 and 610, using Euclidean algorithm. | 2 |
| 2957 | Find Greatest Common Divisor of 123456789 and 987654321, using Euclidean algorithm. | 2 |
| 2958 | Find Greatest Common Divisor of 8, 12 and 24, by listing out the factors. | 2 |
| 2959 | Find Greatest Common Divisor of 8, 12 and 24, using Euclidean algorithm. | 2 |
| 2960 | Find Greatest Common Divisor of 391, 667513, 1134 and 1215, using repeated division. | 2 |
| 2961 | Find Greatest Common Divisor of 391 and 667, using repeated division. | 2 |
| 2962 | Find Greatest Common Divisor of 36, 48, 84 and 140, using prime factorization. | 2 |
| 2963 | Find Greatest Common Divisor of 530778276 and 999983, using Euclidean algorithm. | 2 |
| 2964 | Find Greatest Common Divisor of 63, 105 and 210, using repeated division. | 2 |
| 2965 | Find Greatest Common Divisor of 63, 105 and 210, using prime factorization. | 2 |
| 2966 | Find Greatest Common Divisor of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 and 17, using prime factorization. | 2 |
| 2967 | Find Greatest Common Divisor of 15265. | 2 |
| 2968 | Find Greatest Common Divisor of 33 and 150, using Euclidean algorithm. | 2 |
| 2969 | Find Greatest Common Divisor of 10692 and 25, using Euclidean algorithm. | 2 |
| 2970 | Find Greatest Common Divisor of 528 and 72, using prime factorization. | 2 |
| 2971 | Find Greatest Common Divisor of 456 and 72, using prime factorization. | 2 |
| 2972 | Find Greatest Common Divisor of 44208 and 88456, using Euclidean algorithm. | 2 |
| 2973 | Find Greatest Common Divisor of 530778276 and 30841329, using prime factorization. | 2 |
| 2974 | Find Greatest Common Divisor of 530778276 and 999983, using prime factorization. | 2 |
| 2975 | Find Greatest Common Divisor of 96, 84 and 60, using prime factorization. | 2 |
| 2976 | Find Greatest Common Divisor of 54, 72 and 90, using prime factorization. | 2 |
| 2977 | Find Greatest Common Divisor of 100 and 5, using repeated division. | 2 |
| 2978 | Find Greatest Common Divisor of 36, 54 and 120, using prime factorization. | 2 |
| 2979 | Find Greatest Common Divisor of 90, 126 and 210, using prime factorization. | 2 |
| 2980 | Find Greatest Common Divisor of 90, 126 and 210, using Euclidean algorithm. | 2 |
| 2981 | Find Greatest Common Divisor of 792 and 55, using Euclidean algorithm. | 2 |
| 2982 | Find Greatest Common Divisor of 187 and 61, using prime factorization. | 2 |
| 2983 | Find Greatest Common Divisor of 81 and 122, using prime factorization. | 2 |
| 2984 | Find Greatest Common Divisor of 15 and 72, using prime factorization. | 2 |
| 2985 | Find Greatest Common Divisor of 30, 45 and 75, using prime factorization. | 2 |
| 2986 | Find Greatest Common Divisor of 54 and 306, using prime factorization. | 2 |
| 2987 | Find Greatest Common Divisor of 192 and 264, using Euclidean algorithm. | 2 |
| 2988 | Find Greatest Common Divisor of 520 and 314, using Euclidean algorithm. | 2 |
| 2989 | Find Greatest Common Divisor of 731 and 952, using Euclidean algorithm. | 2 |
| 2990 | Find Greatest Common Divisor of 4453 and 5767, using Euclidean algorithm. | 2 |
| 2991 | Find Greatest Common Divisor of 138 and 24, using Euclidean algorithm. | 2 |
| 2992 | Find Greatest Common Divisor of 9900, 1952303375 and 1836, by listing out the factors. | 2 |
| 2993 | Find Greatest Common Divisor of 140 and 56, using prime factorization. | 2 |
| 2994 | Find Greatest Common Divisor of 220 and 558, using prime factorization. | 2 |
| 2995 | Find Greatest Common Divisor of 123 and 36, using Euclidean algorithm. | 2 |
| 2996 | Find Greatest Common Divisor of 34 and 55, using prime factorization. | 2 |
| 2997 | Find Greatest Common Divisor of 3915 and 825, using Euclidean algorithm. | 2 |
| 2998 | Find Greatest Common Divisor of 15, 25 and 5, using prime factorization. | 2 |
| 2999 | Find Greatest Common Divisor of 5, 15 and 23, using prime factorization. | 2 |
| 3000 | Find Greatest Common Divisor of 20 and 84, using prime factorization. | 2 |