GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
351 | Find Greatest Common Divisor of 52 and 94, using prime factorization. | 7 |
352 | Find Greatest Common Divisor of 0, 30, 0, 45, 0 and 60, using prime factorization. | 7 |
353 | Find Greatest Common Divisor of 86 and 180, using prime factorization. | 7 |
354 | Find Greatest Common Divisor of 102 and 351, using prime factorization. | 7 |
355 | Find Greatest Common Divisor of 43650 and 4980, using Euclidean algorithm. | 7 |
356 | Find Greatest Common Divisor of 1 and 0, using prime factorization. | 7 |
357 | Find Greatest Common Divisor of 25 and 75, using prime factorization. | 7 |
358 | Find Greatest Common Divisor of 26 and 68, using prime factorization. | 6 |
359 | Find Greatest Common Divisor of 12 and 2, using prime factorization. | 6 |
360 | Find Greatest Common Divisor of 7 and 12, using prime factorization. | 6 |
361 | Find Greatest Common Divisor of 54 and 39, using prime factorization. | 6 |
362 | Find Greatest Common Divisor of 15 and 42, using prime factorization. | 6 |
363 | Find Greatest Common Divisor of 459 and 122, using prime factorization. | 6 |
364 | Find Greatest Common Divisor of 90 and 64, using prime factorization. | 6 |
365 | Find Greatest Common Divisor of 32 and 66, using prime factorization. | 6 |
366 | Find Greatest Common Divisor of 90 and 82, using prime factorization. | 6 |
367 | Find Greatest Common Divisor of 11 and 55, using prime factorization. | 6 |
368 | Find Greatest Common Divisor of 120 and 360, using prime factorization. | 6 |
369 | Find Greatest Common Divisor of 82 and 90, using prime factorization. | 6 |
370 | Find Greatest Common Divisor of 64 and 60, using prime factorization. | 6 |
371 | Find Greatest Common Divisor of 174 and 8, using prime factorization. | 6 |
372 | Find Greatest Common Divisor of 63777 and 9, using prime factorization. | 6 |
373 | Find Greatest Common Divisor of 150, 360 and 900, using prime factorization. | 6 |
374 | Find Greatest Common Divisor of 20 and 4, using prime factorization. | 6 |
375 | Find Greatest Common Divisor of 1 and 2, using prime factorization. | 6 |
376 | Find Greatest Common Divisor of 24 and 76, using prime factorization. | 6 |
377 | Find Greatest Common Divisor of 414 and 662, using prime factorization. | 6 |
378 | Find Greatest Common Divisor of 17 and 33, using Euclidean algorithm. | 6 |
379 | Find Greatest Common Divisor of 60 and 225, using prime factorization. | 6 |
380 | Find Greatest Common Divisor of 96 and 80, using prime factorization. | 6 |
381 | Find Greatest Common Divisor of 10 and 16, using prime factorization. | 6 |
382 | Find Greatest Common Divisor of 15 and 9, using prime factorization. | 6 |
383 | Find Greatest Common Divisor of 1315 and 572, using Euclidean algorithm. | 6 |
384 | Find Greatest Common Divisor of 8 and 24, using prime factorization. | 6 |
385 | Find Greatest Common Divisor of 32 and 20, using prime factorization. | 6 |
386 | Find Greatest Common Divisor of 45 and 24, using prime factorization. | 6 |
387 | Find Greatest Common Divisor of 123456 and 789, using prime factorization. | 6 |
388 | Find Greatest Common Divisor of 16 and 24, using prime factorization. | 6 |
389 | Find Greatest Common Divisor of 1000 and 5040, using Euclidean algorithm. | 6 |
390 | Find Greatest Common Divisor of 292 and 36, using prime factorization. | 6 |
391 | Find Greatest Common Divisor of 2486625522 and 41582215163, using prime factorization. | 6 |
392 | Find Greatest Common Divisor of 84 and 75, using prime factorization. | 6 |
393 | Find Greatest Common Divisor of 38 and 6, using prime factorization. | 6 |
394 | Find Greatest Common Divisor of 30 and 45, using prime factorization. | 6 |
395 | Find Greatest Common Divisor of 54 and 36, using prime factorization. | 6 |
396 | Find Greatest Common Divisor of 19 and 160, using prime factorization. | 6 |
397 | Find Greatest Common Divisor of 1430, 650 and 910, using prime factorization. | 6 |
398 | Find Greatest Common Divisor of 973 and 301, using prime factorization. | 6 |
399 | Find Greatest Common Divisor of 291 and 252, using prime factorization. | 6 |
400 | Find Greatest Common Divisor of 11111 and 111111, using Euclidean algorithm. | 6 |