GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5401 | Find Greatest Common Divisor of 8400 and 6816, using repeated division. | 1 |
| 5402 | Find Greatest Common Divisor of 1547 and 560, using Euclidean algorithm. | 1 |
| 5403 | Find Greatest Common Divisor of 120 and 22, using prime factorization. | 1 |
| 5404 | Find Greatest Common Divisor of 18, 19 and 22, using prime factorization. | 1 |
| 5405 | Find Greatest Common Divisor of 9, 12 and 21, using prime factorization. | 1 |
| 5406 | Find Greatest Common Divisor of 4480 and 1000, using prime factorization. | 1 |
| 5407 | Find Greatest Common Divisor of 36, 72 and 102, using prime factorization. | 1 |
| 5408 | Find Greatest Common Divisor of 503, 1101 and 2002, using prime factorization. | 1 |
| 5409 | Find Greatest Common Divisor of 544 and 212, using Euclidean algorithm. | 1 |
| 5410 | Find Greatest Common Divisor of 4 and 1, using Euclidean algorithm. | 1 |
| 5411 | Find Greatest Common Divisor of 4480 and 1000, by listing out the factors. | 1 |
| 5412 | Find Greatest Common Divisor of 4, 3, 8, 2, 20, 24, 2, 3, 18, 2, 46 and 30, using prime factorization. | 1 |
| 5413 | Find Greatest Common Divisor of 49 and 620, using Euclidean algorithm. | 1 |
| 5414 | Find Greatest Common Divisor of 91 and 267, using Euclidean algorithm. | 1 |
| 5415 | Find Greatest Common Divisor of 18, 12 and 24, using prime factorization. | 1 |
| 5416 | Find Greatest Common Divisor of 3 and 26, using Euclidean algorithm. | 1 |
| 5417 | Find Greatest Common Divisor of 60 and 17, using Euclidean algorithm. | 1 |
| 5418 | Find Greatest Common Divisor of 23 and 18, using prime factorization. | 1 |
| 5419 | Find Greatest Common Divisor of 8496 and 5234, using Euclidean algorithm. | 1 |
| 5420 | Find Greatest Common Divisor of 239 and 5, using Euclidean algorithm. | 1 |
| 5421 | Find Greatest Common Divisor of 3567986 and 61063, using prime factorization. | 1 |
| 5422 | Find Greatest Common Divisor of 30 and 8, using Euclidean algorithm. | 1 |
| 5423 | Find Greatest Common Divisor of 311 and 1679, using prime factorization. | 1 |
| 5424 | Find Greatest Common Divisor of 97 and 256, using prime factorization. | 1 |
| 5425 | Find Greatest Common Divisor of 10, 20, 6 and 30, using prime factorization. | 1 |
| 5426 | Find Greatest Common Divisor of 2024 and 1054, using prime factorization. | 1 |
| 5427 | Find Greatest Common Divisor of 2024 and 1054, using Euclidean algorithm. | 1 |
| 5428 | Find Greatest Common Divisor of 252 and 356, using Euclidean algorithm. | 1 |
| 5429 | Find Greatest Common Divisor of 1219936 and 642401, using prime factorization. | 1 |
| 5430 | Find Greatest Common Divisor of 2, 100, 1, 2, 91 and 1, using Euclidean algorithm. | 1 |
| 5431 | Find Greatest Common Divisor of 56 and 7, using prime factorization. | 1 |
| 5432 | Find Greatest Common Divisor of 32 and 72, using repeated division. | 1 |
| 5433 | Find Greatest Common Divisor of 24, 60 and 45, using prime factorization. | 1 |
| 5434 | Find Greatest Common Divisor of 17 and 3233, using Euclidean algorithm. | 1 |
| 5435 | Find Greatest Common Divisor of 360 and 48, using Euclidean algorithm. | 1 |
| 5436 | Find Greatest Common Divisor of 360 and 483, using Euclidean algorithm. | 1 |
| 5437 | Find Greatest Common Divisor of 1258 and 527, using Euclidean algorithm. | 1 |
| 5438 | Find Greatest Common Divisor of 3. | 1 |
| 5439 | Find Greatest Common Divisor of 8, 5, 16, 706456 and 8, using Euclidean algorithm. | 1 |
| 5440 | Find Greatest Common Divisor of 19. | 1 |
| 5441 | Find Greatest Common Divisor of 223. | 1 |
| 5442 | Find Greatest Common Divisor of 1 and 47, using prime factorization. | 1 |
| 5443 | Find Greatest Common Divisor of 185, 111111 and 111111111111, using prime factorization. | 1 |
| 5444 | Find Greatest Common Divisor of 16 and 3, using prime factorization. | 1 |
| 5445 | Find Greatest Common Divisor of 12 and 120, using prime factorization. | 1 |
| 5446 | Find Greatest Common Divisor of 13 and 2760, using Euclidean algorithm. | 1 |
| 5447 | Find Greatest Common Divisor of 13 and 2760, using prime factorization. | 1 |
| 5448 | Find Greatest Common Divisor of 357 and 221, using Euclidean algorithm. | 1 |
| 5449 | Find Greatest Common Divisor of 143 and 374, using Euclidean algorithm. | 1 |
| 5450 | Find Greatest Common Divisor of 6 and 33, using Euclidean algorithm. | 1 |
