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 160 and 7, using Euclidean algorithm. | 4 |
352 | Find Greatest Common Divisor of 4 and 58, using prime factorization. | 4 |
353 | Find Greatest Common Divisor of 15 and 42, using prime factorization. | 4 |
354 | Find Greatest Common Divisor of 258 and 518, using prime factorization. | 4 |
355 | Find Greatest Common Divisor of 11 and 33, using prime factorization. | 4 |
356 | Find Greatest Common Divisor of 258 and 518, using repeated division. | 4 |
357 | Find Greatest Common Divisor of 623 and 935, using prime factorization. | 4 |
358 | Find Greatest Common Divisor of 42 and 9, using prime factorization. | 4 |
359 | Find Greatest Common Divisor of 18 and 81, using prime factorization. | 4 |
360 | Find Greatest Common Divisor of 1 and 91, using prime factorization. | 4 |
361 | Find Greatest Common Divisor of 1000 and 750, using prime factorization. | 4 |
362 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, by listing out the factors. | 4 |
363 | Find Greatest Common Divisor of 24 and 16, using prime factorization. | 4 |
364 | Find Greatest Common Divisor of 12 and 88, using Euclidean algorithm. | 4 |
365 | Find Greatest Common Divisor of 12. | 4 |
366 | Find Greatest Common Divisor of 45, 83 and 79, using prime factorization. | 4 |
367 | Find Greatest Common Divisor of 685, 192 and 189, using prime factorization. | 4 |
368 | Find Greatest Common Divisor of 9 and 1680, using prime factorization. | 4 |
369 | Find Greatest Common Divisor of 15 and 88, using Euclidean algorithm. | 4 |
370 | Find Greatest Common Divisor of 49 and 21, using prime factorization. | 4 |
371 | Find Greatest Common Divisor of 356 and 25824, using prime factorization. | 4 |
372 | Find Greatest Common Divisor of 5 and 75, using Euclidean algorithm. | 4 |
373 | Find Greatest Common Divisor of 7, 62, 8 and 52, using prime factorization. | 4 |
374 | Find Greatest Common Divisor of 33728 and 26880, using prime factorization. | 4 |
375 | Find Greatest Common Divisor of 10 and 3, using Euclidean algorithm. | 4 |
376 | Find Greatest Common Divisor of 64 and 60, using prime factorization. | 4 |
377 | Find Greatest Common Divisor of 414 and 662, by listing out the factors. | 4 |
378 | Find Greatest Common Divisor of 618, 1030 and 1442, using prime factorization. | 4 |
379 | Find Greatest Common Divisor of 20 and 144, using prime factorization. | 4 |
380 | Find Greatest Common Divisor of 427 and 321, using prime factorization. | 4 |
381 | Find Greatest Common Divisor of 3532 and 3288, using Euclidean algorithm. | 4 |
382 | Find Greatest Common Divisor of 54, 60 and 45, using Euclidean algorithm. | 4 |
383 | Find Greatest Common Divisor of 6 and 10, using Euclidean algorithm. | 4 |
384 | Find Greatest Common Divisor of 26 and 3, using prime factorization. | 4 |
385 | Find Greatest Common Divisor of 150, 360 and 900, using prime factorization. | 4 |
386 | Find Greatest Common Divisor of 25 and 49, using prime factorization. | 4 |
387 | Find Greatest Common Divisor of 792 and 275, using Euclidean algorithm. | 4 |
388 | Find Greatest Common Divisor of 15 and 30, using prime factorization. | 4 |
389 | Find Greatest Common Divisor of 12 and 8, using prime factorization. | 4 |
390 | Find Greatest Common Divisor of 1000 and 5040, using Euclidean algorithm. | 4 |
391 | Find Greatest Common Divisor of 13, 3, 3, 2 and 1, using prime factorization. | 4 |
392 | Find Greatest Common Divisor of 414 and 1035, using prime factorization. | 4 |
393 | Find Greatest Common Divisor of 377 and 238, using prime factorization. | 4 |
394 | Find Greatest Common Divisor of 1000, 500, 0, 500 and 1000, using prime factorization. | 4 |
395 | Find Greatest Common Divisor of 4, 3 and 49, using prime factorization. | 4 |
396 | Find Greatest Common Divisor of 38661640 and 333290000, using prime factorization. | 4 |
397 | Find Greatest Common Divisor of 21 and 9, using prime factorization. | 4 |
398 | Find Greatest Common Divisor of 20240605010775. | 4 |
399 | Find Greatest Common Divisor of 130 and 115, using prime factorization. | 4 |
400 | Find Greatest Common Divisor of 1 and 19, using prime factorization. | 4 |