GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
401 | Find Greatest Common Divisor of 784 and 336, using Euclidean algorithm. | 5 |
402 | Find Greatest Common Divisor of 16 and 35, using prime factorization. | 5 |
403 | Find Greatest Common Divisor of 2772 and 1912, using prime factorization. | 5 |
404 | Find Greatest Common Divisor of 128 and 423, using prime factorization. | 5 |
405 | Find Greatest Common Divisor of 616 and 426, using Euclidean algorithm. | 5 |
406 | Find Greatest Common Divisor of 1220 and 288, using Euclidean algorithm. | 5 |
407 | Find Greatest Common Divisor of 245 and 112, using Euclidean algorithm. | 5 |
408 | Find Greatest Common Divisor of 1771 and 179, using prime factorization. | 5 |
409 | Find Greatest Common Divisor of 9 and 9, using prime factorization. | 5 |
410 | Find Greatest Common Divisor of 101 and 126, using Euclidean algorithm. | 5 |
411 | Find Greatest Common Divisor of 58 and 32, using Euclidean algorithm. | 5 |
412 | Find Greatest Common Divisor of 36 and 48, using prime factorization. | 5 |
413 | Find Greatest Common Divisor of 11 and 55, using prime factorization. | 5 |
414 | Find Greatest Common Divisor of 2 and 82, using prime factorization. | 5 |
415 | Find Greatest Common Divisor of 3587 and 1819, using prime factorization. | 5 |
416 | Find Greatest Common Divisor of 576 and 324, using prime factorization. | 5 |
417 | Find Greatest Common Divisor of 816 and 1071, using Euclidean algorithm. | 5 |
418 | Find Greatest Common Divisor of 26 and 3, using prime factorization. | 5 |
419 | Find Greatest Common Divisor of 8. | 5 |
420 | Find Greatest Common Divisor of 28. | 5 |
421 | Find Greatest Common Divisor of 6 and 36, using prime factorization. | 5 |
422 | Find Greatest Common Divisor of 35 and 25, using Euclidean algorithm. | 5 |
423 | Find Greatest Common Divisor of 527 and 765, using Euclidean algorithm. | 5 |
424 | Find Greatest Common Divisor of 12378 and 3054, using Euclidean algorithm. | 5 |
425 | Find Greatest Common Divisor of 111 and 11, using Euclidean algorithm. | 5 |
426 | Find Greatest Common Divisor of 96 and 34, using prime factorization. | 5 |
427 | Find Greatest Common Divisor of 24 and 36, using prime factorization. | 5 |
428 | Find Greatest Common Divisor of 60 and 90, using prime factorization. | 5 |
429 | Find Greatest Common Divisor of 2533 and 466, using Euclidean algorithm. | 4 |
430 | Find Greatest Common Divisor of 56 and 98, using prime factorization. | 4 |
431 | Find Greatest Common Divisor of 5 and 25, using prime factorization. | 4 |
432 | Find Greatest Common Divisor of 356 and 25824, using prime factorization. | 4 |
433 | Find Greatest Common Divisor of 685, 192 and 189, using prime factorization. | 4 |
434 | Find Greatest Common Divisor of 45 and 60, using prime factorization. | 4 |
435 | Find Greatest Common Divisor of 31415 and 14142, using repeated division. | 4 |
436 | Find Greatest Common Divisor of 7 and 12, using prime factorization. | 4 |
437 | Find Greatest Common Divisor of 54. | 4 |
438 | Find Greatest Common Divisor of 244 and 292, using Euclidean algorithm. | 4 |
439 | Find Greatest Common Divisor of 168 and 504, using Euclidean algorithm. | 4 |
440 | Find Greatest Common Divisor of 120 and 360, using prime factorization. | 4 |
441 | Find Greatest Common Divisor of 792 and 275, using Euclidean algorithm. | 4 |
442 | Find Greatest Common Divisor of 66 and 150, using prime factorization. | 4 |
443 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, using prime factorization. | 4 |
444 | Find Greatest Common Divisor of 4, 3 and 49, using prime factorization. | 4 |
445 | Find Greatest Common Divisor of 77 and 30, using Euclidean algorithm. | 4 |
446 | Find Greatest Common Divisor of 54, 60 and 45, using Euclidean algorithm. | 4 |
447 | Find Greatest Common Divisor of 83 and 47, using prime factorization. | 4 |
448 | Find Greatest Common Divisor of 427 and 321, using prime factorization. | 4 |
449 | Find Greatest Common Divisor of 45, 83 and 79, using prime factorization. | 4 |
450 | Find Greatest Common Divisor of 130 and 115, using prime factorization. | 4 |