GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 701 | Find Greatest Common Divisor of 6, 11, 17, 22, 28, 33, 38, 44, 49 and 55, using prime factorization. | 3 |
| 702 | Find Greatest Common Divisor of 1020 and 1170, using repeated division. | 3 |
| 703 | Find Greatest Common Divisor of 108 and 144, by listing out the factors. | 3 |
| 704 | Find Greatest Common Divisor of 2. | 3 |
| 705 | Find Greatest Common Divisor of 115 and 184, using prime factorization. | 3 |
| 706 | Find Greatest Common Divisor of 2024 and 1058, using Euclidean algorithm. | 3 |
| 707 | Find Greatest Common Divisor of 3. | 3 |
| 708 | Find Greatest Common Divisor of 257, 234 and 185, using prime factorization. | 3 |
| 709 | Find Greatest Common Divisor of 211 and 575, using prime factorization. | 3 |
| 710 | Find Greatest Common Divisor of 16 and 64, using prime factorization. | 3 |
| 711 | Find Greatest Common Divisor of 54 and 72, by listing out the factors. | 3 |
| 712 | Find Greatest Common Divisor of 49152 and 81000, using prime factorization. | 3 |
| 713 | Find Greatest Common Divisor of 90, 36 and 54, using prime factorization. | 3 |
| 714 | Find Greatest Common Divisor of 26 and 76, using Euclidean algorithm. | 3 |
| 715 | Find Greatest Common Divisor of 24 and 18, using Euclidean algorithm. | 3 |
| 716 | Find Greatest Common Divisor of 18, 45 and 6, using prime factorization. | 3 |
| 717 | Find Greatest Common Divisor of 44 and 90, by listing out the factors. | 3 |
| 718 | Find Greatest Common Divisor of 60 and 25, using prime factorization. | 3 |
| 719 | Find Greatest Common Divisor of 36303, 3836 and 3827, using prime factorization. | 3 |
| 720 | Find Greatest Common Divisor of 232 and 562, using Euclidean algorithm. | 3 |
| 721 | Find Greatest Common Divisor of 315 and 441, using repeated division. | 3 |
| 722 | Find Greatest Common Divisor of 12 and 6, using prime factorization. | 3 |
| 723 | Find Greatest Common Divisor of 4, 11, 23, 33 and 49, by listing out the factors. | 3 |
| 724 | Find Greatest Common Divisor of 16 and 28, using Euclidean algorithm. | 3 |
| 725 | Find Greatest Common Divisor of 1432 and 156, using prime factorization. | 3 |
| 726 | Find Greatest Common Divisor of 6468 and 14300, using prime factorization. | 3 |
| 727 | Find Greatest Common Divisor of 2689 and 4001, using prime factorization. | 3 |
| 728 | Find Greatest Common Divisor of 36 and 90, using prime factorization. | 3 |
| 729 | Find Greatest Common Divisor of 419 and 105, using Euclidean algorithm. | 3 |
| 730 | Find Greatest Common Divisor of 52 and 39, using Euclidean algorithm. | 3 |
| 731 | Find Greatest Common Divisor of 576, 1152, 1280, 136 and 200, using prime factorization. | 3 |
| 732 | Find Greatest Common Divisor of 20 and 10, using repeated division. | 3 |
| 733 | Find Greatest Common Divisor of 20 and 7, using repeated division. | 3 |
| 734 | Find Greatest Common Divisor of 645 and 363, using Euclidean algorithm. | 3 |
| 735 | Find Greatest Common Divisor of 34709 and 100313, using Euclidean algorithm. | 3 |
| 736 | Find Greatest Common Divisor of 420 and 200, using prime factorization. | 3 |
| 737 | Find Greatest Common Divisor of 4 and 12, using prime factorization. | 3 |
| 738 | Find Greatest Common Divisor of 4, 11, 23, 33, 49 and 23, using prime factorization. | 3 |
| 739 | Find Greatest Common Divisor of 33 and 145, using prime factorization. | 3 |
| 740 | Find Greatest Common Divisor of 4, 11, 23, 33, 49 and 23, by listing out the factors. | 3 |
| 741 | Find Greatest Common Divisor of 8 and 9, using prime factorization. | 3 |
| 742 | Find Greatest Common Divisor of 289 and 377, using prime factorization. | 3 |
| 743 | Find Greatest Common Divisor of 27 and 45, using prime factorization. | 3 |
| 744 | Find Greatest Common Divisor of 18, 60 and 75, using prime factorization. | 3 |
| 745 | Find Greatest Common Divisor of 18 and 5, using Euclidean algorithm. | 3 |
| 746 | Find Greatest Common Divisor of 72 and 52, using Euclidean algorithm. | 3 |
| 747 | Find Greatest Common Divisor of 4001 and 2689, using Euclidean algorithm. | 3 |
| 748 | Find Greatest Common Divisor of 1024 and 2256, using Euclidean algorithm. | 3 |
| 749 | Find Greatest Common Divisor of 72 and 82, using Euclidean algorithm. | 3 |
| 750 | Find Greatest Common Divisor of 11520 and 5670, using prime factorization. | 3 |
