GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2501 | Find Greatest Common Divisor of 113 and 114, using Euclidean algorithm. | 3 |
| 2502 | Find Greatest Common Divisor of 1250 and 900, using prime factorization. | 3 |
| 2503 | Find Greatest Common Divisor of 26250 and 21250, using Euclidean algorithm. | 3 |
| 2504 | Find Greatest Common Divisor of 28750 and 23750, using Euclidean algorithm. | 3 |
| 2505 | Find Greatest Common Divisor of 40 and 1777, using prime factorization. | 3 |
| 2506 | Find Greatest Common Divisor of 6123 and 2913, using Euclidean algorithm. | 3 |
| 2507 | Find Greatest Common Divisor of 32 and 48, using repeated division. | 3 |
| 2508 | Find Greatest Common Divisor of 9964, 7058 and 4427, using Euclidean algorithm. | 3 |
| 2509 | Find Greatest Common Divisor of 121 and 123, using prime factorization. | 3 |
| 2510 | Find Greatest Common Divisor of 96256 and 432, using prime factorization. | 3 |
| 2511 | Find Greatest Common Divisor of 108 and 243, using prime factorization. | 3 |
| 2512 | Find Greatest Common Divisor of 162 and 234, using Euclidean algorithm. | 3 |
| 2513 | Find Greatest Common Divisor of 349 and 493, using repeated division. | 3 |
| 2514 | Find Greatest Common Divisor of 254 and 100, using Euclidean algorithm. | 3 |
| 2515 | Find Greatest Common Divisor of 623 and 79, using Euclidean algorithm. | 3 |
| 2516 | Find Greatest Common Divisor of 252 and 378, using prime factorization. | 3 |
| 2517 | Find Greatest Common Divisor of 72 and 164, using Euclidean algorithm. | 3 |
| 2518 | Find Greatest Common Divisor of 3 and 8, using Euclidean algorithm. | 3 |
| 2519 | Find Greatest Common Divisor of 3 and 26, using prime factorization. | 3 |
| 2520 | Find Greatest Common Divisor of 1, 4, 1 and 2, using prime factorization. | 3 |
| 2521 | Find Greatest Common Divisor of 1, 4, 1 and 1, using prime factorization. | 3 |
| 2522 | Find Greatest Common Divisor of 351 and 527, using repeated division. | 3 |
| 2523 | Find Greatest Common Divisor of 55 and 7, using Euclidean algorithm. | 3 |
| 2524 | Find Greatest Common Divisor of 77, 105 and 143, using prime factorization. | 3 |
| 2525 | Find Greatest Common Divisor of 406 and 555, using Euclidean algorithm. | 3 |
| 2526 | Find Greatest Common Divisor of 98 and 21, using Euclidean algorithm. | 3 |
| 2527 | Find Greatest Common Divisor of 4 and 32, using Euclidean algorithm. | 3 |
| 2528 | Find Greatest Common Divisor of 441 and 567, using Euclidean algorithm. | 3 |
| 2529 | Find Greatest Common Divisor of 384 and 1296, using Euclidean algorithm. | 3 |
| 2530 | Find Greatest Common Divisor of 7 and 352, using prime factorization. | 3 |
| 2531 | Find Greatest Common Divisor of 1248. | 3 |
| 2532 | Find Greatest Common Divisor of 3026 and 258, using prime factorization. | 3 |
| 2533 | Find Greatest Common Divisor of 28 and 42, using prime factorization. | 3 |
| 2534 | Find Greatest Common Divisor of 1497 and 721, using prime factorization. | 3 |
| 2535 | Find Greatest Common Divisor of 2. | 3 |
| 2536 | Find Greatest Common Divisor of 165, 231 and 385, using prime factorization. | 3 |
| 2537 | Find Greatest Common Divisor of 250000000 and 500000000, using prime factorization. | 3 |
| 2538 | Find Greatest Common Divisor of 19, 31 and 1, using Euclidean algorithm. | 3 |
| 2539 | Find Greatest Common Divisor of 28 and 24, using prime factorization. | 3 |
| 2540 | Find Greatest Common Divisor of 42, 84 and 73080, using prime factorization. | 3 |
| 2541 | Find Greatest Common Divisor of 128 and 1001, using prime factorization. | 3 |
| 2542 | Find Greatest Common Divisor of 84 and 196, using prime factorization. | 3 |
| 2543 | Find Greatest Common Divisor of 3126 and 1386, using Euclidean algorithm. | 3 |
| 2544 | Find Greatest Common Divisor of 504 and 2940, using prime factorization. | 3 |
| 2545 | Find Greatest Common Divisor of 656 and 208, using Euclidean algorithm. | 3 |
| 2546 | Find Greatest Common Divisor of 33 and 12, by listing out the factors. | 3 |
| 2547 | Find Greatest Common Divisor of 2025 and 271, using Euclidean algorithm. | 3 |
| 2548 | Find Greatest Common Divisor of 25 and 50, using repeated division. | 3 |
| 2549 | Find Greatest Common Divisor of 225 and 90, using prime factorization. | 3 |
| 2550 | Find Greatest Common Divisor of 20, 28 and 38, using prime factorization. | 3 |
