GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1201 | Find Greatest Common Divisor of 960 and 112, using Euclidean algorithm. | 2 |
1202 | Find Greatest Common Divisor of 950 and 600, using prime factorization. | 2 |
1203 | Find Greatest Common Divisor of 75 and 100, by listing out the factors. | 2 |
1204 | Find Greatest Common Divisor of 32 and 60, using prime factorization. | 2 |
1205 | Find Greatest Common Divisor of 32 and 60, by listing out the factors. | 2 |
1206 | Find Greatest Common Divisor of 58 and 32, using prime factorization. | 2 |
1207 | Find Greatest Common Divisor of 456 and 74, using prime factorization. | 2 |
1208 | Find Greatest Common Divisor of 800, 400 and 200, using repeated division. | 2 |
1209 | Find Greatest Common Divisor of 910 and 6517, using prime factorization. | 2 |
1210 | Find Greatest Common Divisor of 5 and 92, using prime factorization. | 2 |
1211 | Find Greatest Common Divisor of 160485, 2, 127104 and 14, using prime factorization. | 2 |
1212 | Find Greatest Common Divisor of 63018702 and 11388300, using Euclidean algorithm. | 2 |
1213 | Find Greatest Common Divisor of 42 and 77, using Euclidean algorithm. | 2 |
1214 | Find Greatest Common Divisor of 44 and 36, using Euclidean algorithm. | 2 |
1215 | Find Greatest Common Divisor of 40 and 125, using prime factorization. | 2 |
1216 | Find Greatest Common Divisor of 34 and 14, using prime factorization. | 2 |
1217 | Find Greatest Common Divisor of 162 and 108, using prime factorization. | 2 |
1218 | Find Greatest Common Divisor of 24 and 20, using Euclidean algorithm. | 2 |
1219 | Find Greatest Common Divisor of 72 and 21, using prime factorization. | 2 |
1220 | Find Greatest Common Divisor of 72 and 252, using prime factorization. | 2 |
1221 | Find Greatest Common Divisor of 911 and 172, using prime factorization. | 2 |
1222 | Find Greatest Common Divisor of 604 and 138, using prime factorization. | 2 |
1223 | Find Greatest Common Divisor of 27 and 5, using prime factorization. | 2 |
1224 | Find Greatest Common Divisor of 205800 and 6468, using prime factorization. | 2 |
1225 | Find Greatest Common Divisor of 12345. | 2 |
1226 | Find Greatest Common Divisor of 1 and 5, using prime factorization. | 2 |
1227 | Find Greatest Common Divisor of 132 and 250, using prime factorization. | 2 |
1228 | Find Greatest Common Divisor of 56 and 999, using Euclidean algorithm. | 2 |
1229 | Find Greatest Common Divisor of 10 and 45, using prime factorization. | 2 |
1230 | Find Greatest Common Divisor of 85 and 7225, using Euclidean algorithm. | 2 |
1231 | Find Greatest Common Divisor of 81, 2, 8, 9 and 1, using prime factorization. | 2 |
1232 | Find Greatest Common Divisor of 670 and 5000, using prime factorization. | 2 |
1233 | Find Greatest Common Divisor of 98 and 1200, using prime factorization. | 2 |
1234 | Find Greatest Common Divisor of 98 and 1120, using prime factorization. | 2 |
1235 | Find Greatest Common Divisor of 60, 4 and 8, by listing out the factors. | 2 |
1236 | Find Greatest Common Divisor of 30 and 40, by listing out the factors. | 2 |
1237 | Find Greatest Common Divisor of 8 and 10, by listing out the factors. | 2 |
1238 | Find Greatest Common Divisor of 8 and 10, using repeated division. | 2 |
1239 | Find Greatest Common Divisor of 18 and 45, using prime factorization. | 2 |
1240 | Find Greatest Common Divisor of 124 and 360, using Euclidean algorithm. | 2 |
1241 | Find Greatest Common Divisor of 108 and 144, using Euclidean algorithm. | 2 |
1242 | Find Greatest Common Divisor of 2349 and 1537, using Euclidean algorithm. | 2 |
1243 | Find Greatest Common Divisor of 12 and 53, using repeated division. | 2 |
1244 | Find Greatest Common Divisor of 12 and 53, using Euclidean algorithm. | 2 |
1245 | Find Greatest Common Divisor of 6, 89, 8 and 1, using prime factorization. | 2 |
1246 | Find Greatest Common Divisor of 7469 and 2463, using prime factorization. | 2 |
1247 | Find Greatest Common Divisor of 1147 and 899, using Euclidean algorithm. | 2 |
1248 | Find Greatest Common Divisor of 1147 and 889, using Euclidean algorithm. | 2 |
1249 | Find Greatest Common Divisor of 84 and 378, using prime factorization. | 2 |
1250 | Find Greatest Common Divisor of 216 and 324, using prime factorization. | 2 |