GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
401 | Find Greatest Common Divisor of 130 and 115, using prime factorization. | 4 |
402 | Find Greatest Common Divisor of 1 and 19, using prime factorization. | 4 |
403 | Find Greatest Common Divisor of 2028, 1 and 2029, by listing out the factors. | 4 |
404 | Find Greatest Common Divisor of 4 and 24, using prime factorization. | 4 |
405 | Find Greatest Common Divisor of 18, 24 and 12, using prime factorization. | 4 |
406 | Find Greatest Common Divisor of 10 and 6, using prime factorization. | 4 |
407 | Find Greatest Common Divisor of 87 and 48, using prime factorization. | 4 |
408 | Find Greatest Common Divisor of 17 and 3120, by listing out the factors. | 4 |
409 | Find Greatest Common Divisor of 2 and 10, using prime factorization. | 4 |
410 | Find Greatest Common Divisor of 26 and 338, using prime factorization. | 4 |
411 | Find Greatest Common Divisor of 18 and 24, by listing out the factors. | 4 |
412 | Find Greatest Common Divisor of 14 and 28, using prime factorization. | 4 |
413 | Find Greatest Common Divisor of 15 and 35, using Euclidean algorithm. | 4 |
414 | Find Greatest Common Divisor of 3, 5 and 7, using prime factorization. | 4 |
415 | Find Greatest Common Divisor of 22 and 33, using Euclidean algorithm. | 4 |
416 | Find Greatest Common Divisor of 48 and 96, using prime factorization. | 4 |
417 | Find Greatest Common Divisor of 48 and 88, using prime factorization. | 4 |
418 | Find Greatest Common Divisor of 54. | 4 |
419 | Find Greatest Common Divisor of 168 and 504, using Euclidean algorithm. | 4 |
420 | Find Greatest Common Divisor of 301981 and 449573, using prime factorization. | 4 |
421 | Find Greatest Common Divisor of 66 and 110, using prime factorization. | 4 |
422 | Find Greatest Common Divisor of 3 and 8, using repeated division. | 4 |
423 | Find Greatest Common Divisor of 306 and 657, using repeated division. | 4 |
424 | Find Greatest Common Divisor of 5000000000. | 4 |
425 | Find Greatest Common Divisor of 1315 and 572, using Euclidean algorithm. | 4 |
426 | Find Greatest Common Divisor of 1204 and 2400, using prime factorization. | 4 |
427 | Find Greatest Common Divisor of 11 and 20, using prime factorization. | 4 |
428 | Find Greatest Common Divisor of 96 and 80, using prime factorization. | 4 |
429 | Find Greatest Common Divisor of 521, 2 and 71, using Euclidean algorithm. | 4 |
430 | Find Greatest Common Divisor of 48 and 36, using repeated division. | 4 |
431 | Find Greatest Common Divisor of 17 and 6, using Euclidean algorithm. | 4 |
432 | Find Greatest Common Divisor of 9 and 91, using prime factorization. | 4 |
433 | Find Greatest Common Divisor of 224 and 336, using prime factorization. | 4 |
434 | Find Greatest Common Divisor of 244 and 292, using Euclidean algorithm. | 4 |
435 | Find Greatest Common Divisor of 12 and 12, using prime factorization. | 4 |
436 | Find Greatest Common Divisor of 35 and 25, using Euclidean algorithm. | 4 |
437 | Find Greatest Common Divisor of 24 and 48, by listing out the factors. | 4 |
438 | Find Greatest Common Divisor of 5, 70, 1 and 84, using repeated division. | 4 |
439 | Find Greatest Common Divisor of 77 and 30, using Euclidean algorithm. | 4 |
440 | Find Greatest Common Divisor of 2447 and 3997, using Euclidean algorithm. | 4 |
441 | Find Greatest Common Divisor of 5, 70, 1 and 84, using Euclidean algorithm. | 4 |
442 | Find Greatest Common Divisor of 77 and 110, using Euclidean algorithm. | 4 |
443 | Find Greatest Common Divisor of 63777 and 9, using prime factorization. | 4 |
444 | Find Greatest Common Divisor of 22 and 121, using prime factorization. | 4 |
445 | Find Greatest Common Divisor of 33 and 121, using prime factorization. | 4 |
446 | Find Greatest Common Divisor of 20 and 67, using Euclidean algorithm. | 4 |
447 | Find Greatest Common Divisor of 4. | 4 |
448 | Find Greatest Common Divisor of 2533 and 466, using Euclidean algorithm. | 4 |
449 | Find Greatest Common Divisor of 21, 28 and 49, using prime factorization. | 4 |
450 | Find Greatest Common Divisor of 300 and 42, using Euclidean algorithm. | 4 |