GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
301 | Find Greatest Common Divisor of 1160718174 and 316258250, using repeated division. | 7 |
302 | Find Greatest Common Divisor of 12 and 9, using prime factorization. | 7 |
303 | Find Greatest Common Divisor of 98 and 273, using prime factorization. | 7 |
304 | Find Greatest Common Divisor of 133 and 28, using Euclidean algorithm. | 7 |
305 | Find Greatest Common Divisor of 16261 and 85652, using Euclidean algorithm. | 7 |
306 | Find Greatest Common Divisor of 54 and 60, using Euclidean algorithm. | 7 |
307 | Find Greatest Common Divisor of 5 and 2, using prime factorization. | 7 |
308 | Find Greatest Common Divisor of 5 and 25, using prime factorization. | 7 |
309 | Find Greatest Common Divisor of 26 and 10, using prime factorization. | 7 |
310 | Find Greatest Common Divisor of 18 and 81, using prime factorization. | 7 |
311 | Find Greatest Common Divisor of 24 and 16, using prime factorization. | 7 |
312 | Find Greatest Common Divisor of 25 and 75, using prime factorization. | 7 |
313 | Find Greatest Common Divisor of 8 and 3, using prime factorization. | 7 |
314 | Find Greatest Common Divisor of 32 and 46, using prime factorization. | 7 |
315 | Find Greatest Common Divisor of 84 and 2, using prime factorization. | 7 |
316 | Find Greatest Common Divisor of 71 and 71, using prime factorization. | 7 |
317 | Find Greatest Common Divisor of 42 and 12, using prime factorization. | 7 |
318 | Find Greatest Common Divisor of 14 and 28, using prime factorization. | 7 |
319 | Find Greatest Common Divisor of 87 and 48, using prime factorization. | 7 |
320 | Find Greatest Common Divisor of 4 and 24, using prime factorization. | 7 |
321 | Find Greatest Common Divisor of 21 and 9, using prime factorization. | 7 |
322 | Find Greatest Common Divisor of 70 and 50, using prime factorization. | 7 |
323 | Find Greatest Common Divisor of 2 and 78, using prime factorization. | 7 |
324 | Find Greatest Common Divisor of 39 and 90, using prime factorization. | 7 |
325 | Find Greatest Common Divisor of 0, 30, 0, 45, 0 and 60, using prime factorization. | 7 |
326 | Find Greatest Common Divisor of 90 and 25, using prime factorization. | 7 |
327 | Find Greatest Common Divisor of 86 and 180, using prime factorization. | 7 |
328 | Find Greatest Common Divisor of 102 and 351, using prime factorization. | 7 |
329 | Find Greatest Common Divisor of 43650 and 4980, using Euclidean algorithm. | 7 |
330 | Find Greatest Common Divisor of 20 and 10, using prime factorization. | 7 |
331 | Find Greatest Common Divisor of 1 and 0, using prime factorization. | 7 |
332 | Find Greatest Common Divisor of 525, 619, 1766, 2400, 2510, 4291, 4296, 4316, 4393, 5272, 5383, 6120, 6262, 6340, 7550, 7827, 8052 and 9880, using prime factorization. | 7 |
333 | Find Greatest Common Divisor of 466 and 267, using prime factorization. | 7 |
334 | Find Greatest Common Divisor of 1315 and 572, using Euclidean algorithm. | 6 |
335 | Find Greatest Common Divisor of 1000 and 5040, using Euclidean algorithm. | 6 |
336 | Find Greatest Common Divisor of 2486625522 and 41582215163, using prime factorization. | 6 |
337 | Find Greatest Common Divisor of 123456 and 789, using prime factorization. | 6 |
338 | Find Greatest Common Divisor of 104 and 64, using repeated division. | 6 |
339 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using prime factorization. | 6 |
340 | Find Greatest Common Divisor of 35 and 192, using prime factorization. | 6 |
341 | Find Greatest Common Divisor of 504 and 385, using Euclidean algorithm. | 6 |
342 | Find Greatest Common Divisor of 19 and 160, using prime factorization. | 6 |
343 | Find Greatest Common Divisor of 1430, 650 and 910, using prime factorization. | 6 |
344 | Find Greatest Common Divisor of 215 and 364, using prime factorization. | 6 |
345 | Find Greatest Common Divisor of 104 and 64, using Euclidean algorithm. | 6 |
346 | Find Greatest Common Divisor of 291 and 252, using prime factorization. | 6 |
347 | Find Greatest Common Divisor of 11111 and 111111, using Euclidean algorithm. | 6 |
348 | Find Greatest Common Divisor of 119 and 272, using Euclidean algorithm. | 6 |
349 | Find Greatest Common Divisor of 36 and 54, using prime factorization. | 6 |
350 | Find Greatest Common Divisor of 48, 36 and 124, by listing out the factors. | 6 |