GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
351 | Find Greatest Common Divisor of 60 and 225, using prime factorization. | 6 |
352 | Find Greatest Common Divisor of 48, 36 and 124, by listing out the factors. | 6 |
353 | Find Greatest Common Divisor of 1315 and 572, using Euclidean algorithm. | 6 |
354 | Find Greatest Common Divisor of 96 and 80, using prime factorization. | 6 |
355 | Find Greatest Common Divisor of 2486625522 and 41582215163, using prime factorization. | 6 |
356 | Find Greatest Common Divisor of 63777 and 9, using prime factorization. | 6 |
357 | Find Greatest Common Divisor of 1430, 650 and 910, using prime factorization. | 6 |
358 | Find Greatest Common Divisor of 174 and 8, using prime factorization. | 6 |
359 | Find Greatest Common Divisor of 1 and 2, using prime factorization. | 6 |
360 | Find Greatest Common Divisor of 90 and 64, using prime factorization. | 6 |
361 | Find Greatest Common Divisor of 32 and 66, using prime factorization. | 6 |
362 | Find Greatest Common Divisor of 90 and 82, using prime factorization. | 6 |
363 | Find Greatest Common Divisor of 52 and 94, using prime factorization. | 6 |
364 | Find Greatest Common Divisor of 85 and 85, using prime factorization. | 6 |
365 | Find Greatest Common Divisor of 82 and 90, using prime factorization. | 6 |
366 | Find Greatest Common Divisor of 215 and 364, using prime factorization. | 6 |
367 | Find Greatest Common Divisor of 16146 and 299, using prime factorization. | 6 |
368 | Find Greatest Common Divisor of 36 and 54, using prime factorization. | 6 |
369 | Find Greatest Common Divisor of 504 and 385, using Euclidean algorithm. | 6 |
370 | Find Greatest Common Divisor of 3 and 7, using prime factorization. | 5 |
371 | Find Greatest Common Divisor of 2772 and 1912, using prime factorization. | 5 |
372 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, using prime factorization. | 5 |
373 | Find Greatest Common Divisor of 12378 and 3054, using Euclidean algorithm. | 5 |
374 | Find Greatest Common Divisor of 36 and 48, using prime factorization. | 5 |
375 | Find Greatest Common Divisor of 1771 and 179, using prime factorization. | 5 |
376 | Find Greatest Common Divisor of 111 and 11, using Euclidean algorithm. | 5 |
377 | Find Greatest Common Divisor of 1 and 3, using prime factorization. | 5 |
378 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using prime factorization. | 5 |
379 | Find Greatest Common Divisor of 101 and 126, using Euclidean algorithm. | 5 |
380 | Find Greatest Common Divisor of 1, 24, 1 and 6, by listing out the factors. | 5 |
381 | Find Greatest Common Divisor of 5 and 2, using prime factorization. | 5 |
382 | Find Greatest Common Divisor of 45 and 33, using prime factorization. | 5 |
383 | Find Greatest Common Divisor of 9 and 9, using prime factorization. | 5 |
384 | Find Greatest Common Divisor of 77 and 128, using prime factorization. | 5 |
385 | Find Greatest Common Divisor of 60 and 90, using prime factorization. | 5 |
386 | Find Greatest Common Divisor of 245 and 112, using Euclidean algorithm. | 5 |
387 | Find Greatest Common Divisor of 96, 112 and 144, by listing out the factors. | 5 |
388 | Find Greatest Common Divisor of 576 and 324, using prime factorization. | 5 |
389 | Find Greatest Common Divisor of 28. | 5 |
390 | Find Greatest Common Divisor of 12 and 1234, using Euclidean algorithm. | 5 |
391 | Find Greatest Common Divisor of 616 and 426, using Euclidean algorithm. | 5 |
392 | Find Greatest Common Divisor of 26 and 3, using prime factorization. | 5 |
393 | Find Greatest Common Divisor of 49, 210 and 350, using Euclidean algorithm. | 5 |
394 | Find Greatest Common Divisor of 58 and 32, using Euclidean algorithm. | 5 |
395 | Find Greatest Common Divisor of 160 and 7, using prime factorization. | 5 |
396 | Find Greatest Common Divisor of 527 and 765, using Euclidean algorithm. | 5 |
397 | Find Greatest Common Divisor of 17 and 3120, using prime factorization. | 5 |
398 | Find Greatest Common Divisor of 24 and 138, using Euclidean algorithm. | 5 |
399 | Find Greatest Common Divisor of 17 and 3120, using Euclidean algorithm. | 5 |
400 | Find Greatest Common Divisor of 8. | 5 |