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 514596726 and 1176, using prime factorization. | 2 |
| 2952 | Find Greatest Common Divisor of 63 and 315, using prime factorization. | 2 |
| 2953 | Find Greatest Common Divisor of 18 and 126, using prime factorization. | 2 |
| 2954 | Find Greatest Common Divisor of 3000 and 1215000000, using prime factorization. | 2 |
| 2955 | Find Greatest Common Divisor of 75 and 360, using prime factorization. | 2 |
| 2956 | Find Greatest Common Divisor of 20 and 50, using prime factorization. | 2 |
| 2957 | Find Greatest Common Divisor of 48 and 24, using prime factorization. | 2 |
| 2958 | Find Greatest Common Divisor of 13, 3, 3, 2, 2 and 1, using prime factorization. | 2 |
| 2959 | Find Greatest Common Divisor of 48 and 4, using prime factorization. | 2 |
| 2960 | Find Greatest Common Divisor of 45. | 2 |
| 2961 | Find Greatest Common Divisor of 255 and 633, using Euclidean algorithm. | 2 |
| 2962 | Find Greatest Common Divisor of 144. | 2 |
| 2963 | Find Greatest Common Divisor of 91 and 143, using Euclidean algorithm. | 2 |
| 2964 | Find Greatest Common Divisor of 2310 and 2311, using Euclidean algorithm. | 2 |
| 2965 | Find Greatest Common Divisor of 77, 105 and 143, using Euclidean algorithm. | 2 |
| 2966 | Find Greatest Common Divisor of 30, 42 and 70, using prime factorization. | 2 |
| 2967 | Find Greatest Common Divisor of 1860 and 484, using Euclidean algorithm. | 2 |
| 2968 | Find Greatest Common Divisor of 112 and 30, using Euclidean algorithm. | 2 |
| 2969 | Find Greatest Common Divisor of 32 and 640, using prime factorization. | 2 |
| 2970 | Find Greatest Common Divisor of 316 and 8051, using Euclidean algorithm. | 2 |
| 2971 | Find Greatest Common Divisor of 316 and 8051, using prime factorization. | 2 |
| 2972 | Find Greatest Common Divisor of 26 and 8051, using Euclidean algorithm. | 2 |
| 2973 | Find Greatest Common Divisor of 20 and 54, using prime factorization. | 2 |
| 2974 | Find Greatest Common Divisor of 172 and 20, using Euclidean algorithm. | 2 |
| 2975 | Find Greatest Common Divisor of 150 and 180, using prime factorization. | 2 |
| 2976 | Find Greatest Common Divisor of 96 and 181, using prime factorization. | 2 |
| 2977 | Find Greatest Common Divisor of 85 and 2025, using Euclidean algorithm. | 2 |
| 2978 | Find Greatest Common Divisor of 56. | 2 |
| 2979 | Find Greatest Common Divisor of 56. | 2 |
| 2980 | Find Greatest Common Divisor of 411, 567 and 693, using Euclidean algorithm. | 2 |
| 2981 | Find Greatest Common Divisor of 411 and 567, using Euclidean algorithm. | 2 |
| 2982 | Find Greatest Common Divisor of 34 and 225, using Euclidean algorithm. | 2 |
| 2983 | Find Greatest Common Divisor of 567 and 441, using Euclidean algorithm. | 2 |
| 2984 | Find Greatest Common Divisor of 384 and 269, using prime factorization. | 2 |
| 2985 | Find Greatest Common Divisor of 384 and 1296, using prime factorization. | 2 |
| 2986 | Find Greatest Common Divisor of 209 and 551, using prime factorization. | 2 |
| 2987 | Find Greatest Common Divisor of 108 and 72, using Euclidean algorithm. | 2 |
| 2988 | Find Greatest Common Divisor of 188 and 162, using Euclidean algorithm. | 2 |
| 2989 | Find Greatest Common Divisor of 84 and 60, using Euclidean algorithm. | 2 |
| 2990 | Find Greatest Common Divisor of 122125. | 2 |
| 2991 | Find Greatest Common Divisor of 91. | 2 |
| 2992 | Find Greatest Common Divisor of 143. | 2 |
| 2993 | Find Greatest Common Divisor of 162 and 12, using prime factorization. | 2 |
| 2994 | Find Greatest Common Divisor of 0 and 1, using repeated division. | 2 |
| 2995 | Find Greatest Common Divisor of 18 and 87, using repeated division. | 2 |
| 2996 | Find Greatest Common Divisor of 210. | 2 |
| 2997 | Find Greatest Common Divisor of 210 and 100, using Euclidean algorithm. | 2 |
| 2998 | Find Greatest Common Divisor of 96 and 128, using prime factorization. | 2 |
| 2999 | Find Greatest Common Divisor of 26 and 49, using Euclidean algorithm. | 2 |
| 3000 | Find Greatest Common Divisor of 73304 and 40635, using repeated division. | 2 |