GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1151 | Find Greatest Common Divisor of 973 and 301, using prime factorization. | 2 |
1152 | Find Greatest Common Divisor of 378, 588 and 252, using prime factorization. | 2 |
1153 | Find Greatest Common Divisor of 33 and 94, using Euclidean algorithm. | 2 |
1154 | Find Greatest Common Divisor of 415 and 142, using Euclidean algorithm. | 2 |
1155 | Find Greatest Common Divisor of 1126 and 884, using prime factorization. | 2 |
1156 | Find Greatest Common Divisor of 116 and 25, using prime factorization. | 2 |
1157 | Find Greatest Common Divisor of 2907 and 105, using prime factorization. | 2 |
1158 | Find Greatest Common Divisor of 9 and 40, using prime factorization. | 2 |
1159 | Find Greatest Common Divisor of 75 and 100, by listing out the factors. | 2 |
1160 | Find Greatest Common Divisor of 750, 900 and 6, using prime factorization. | 2 |
1161 | Find Greatest Common Divisor of 42, 105 and 91, using Euclidean algorithm. | 2 |
1162 | Find Greatest Common Divisor of 359 and 125, using prime factorization. | 2 |
1163 | Find Greatest Common Divisor of 4 and 5, using prime factorization. | 2 |
1164 | Find Greatest Common Divisor of 76 and 70, using Euclidean algorithm. | 2 |
1165 | Find Greatest Common Divisor of 35 and 82, using Euclidean algorithm. | 2 |
1166 | Find Greatest Common Divisor of 85 and 7225, using Euclidean algorithm. | 2 |
1167 | Find Greatest Common Divisor of 9876 and 54321, using prime factorization. | 2 |
1168 | Find Greatest Common Divisor of 64. | 2 |
1169 | Find Greatest Common Divisor of 16 and 24, using Euclidean algorithm. | 2 |
1170 | Find Greatest Common Divisor of 30, 45 and 60, using prime factorization. | 2 |
1171 | Find Greatest Common Divisor of 162 and 53, using Euclidean algorithm. | 2 |
1172 | Find Greatest Common Divisor of 8217949832 and 8181353375, using prime factorization. | 2 |
1173 | Find Greatest Common Divisor of 750, 900 and 6, by listing out the factors. | 2 |
1174 | Find Greatest Common Divisor of 14, 27 and 55, using prime factorization. | 2 |
1175 | Find Greatest Common Divisor of 407 and 1010, using Euclidean algorithm. | 2 |
1176 | Find Greatest Common Divisor of 4 and 9, using prime factorization. | 2 |
1177 | Find Greatest Common Divisor of 250 and 134, using prime factorization. | 2 |
1178 | Find Greatest Common Divisor of 24 and 69, using repeated division. | 2 |
1179 | Find Greatest Common Divisor of 66 and 35, using Euclidean algorithm. | 2 |
1180 | Find Greatest Common Divisor of 26 and 19, using prime factorization. | 2 |
1181 | Find Greatest Common Divisor of 858 and 325, using prime factorization. | 2 |
1182 | Find Greatest Common Divisor of 5245 and 930, using prime factorization. | 2 |
1183 | Find Greatest Common Divisor of 111 and 201, using Euclidean algorithm. | 2 |
1184 | Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, using prime factorization. | 2 |
1185 | Find Greatest Common Divisor of 8813 and 885, using prime factorization. | 2 |
1186 | Find Greatest Common Divisor of 14, 3 and 5, using prime factorization. | 2 |
1187 | Find Greatest Common Divisor of 24, 138, 24 and 138, using prime factorization. | 2 |
1188 | Find Greatest Common Divisor of 73 and 660, using Euclidean algorithm. | 2 |
1189 | Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, using repeated division. | 2 |
1190 | Find Greatest Common Divisor of 187 and 34, using prime factorization. | 2 |
1191 | Find Greatest Common Divisor of 17 and 33, using prime factorization. | 2 |
1192 | Find Greatest Common Divisor of 52598 and 2541, using Euclidean algorithm. | 2 |
1193 | Find Greatest Common Divisor of 1000 and 400, using prime factorization. | 2 |
1194 | Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, by listing out the factors. | 2 |
1195 | Find Greatest Common Divisor of 45 and 126, using prime factorization. | 2 |
1196 | Find Greatest Common Divisor of 725 and 236, using Euclidean algorithm. | 2 |
1197 | Find Greatest Common Divisor of 56 and 72, using prime factorization. | 2 |
1198 | Find Greatest Common Divisor of 187 and 34, using Euclidean algorithm. | 2 |
1199 | Find Greatest Common Divisor of 13 and 16, by listing out the factors. | 2 |
1200 | Find Greatest Common Divisor of 1000 and 400, using Euclidean algorithm. | 2 |