GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 751 | Find Greatest Common Divisor of 75 and 253, using prime factorization. | 3 |
| 752 | Find Greatest Common Divisor of 34 and 120, using prime factorization. | 3 |
| 753 | Find Greatest Common Divisor of 160 and 9, using repeated division. | 3 |
| 754 | Find Greatest Common Divisor of 12 and 8, using repeated division. | 3 |
| 755 | Find Greatest Common Divisor of 3, 2 and 2, using prime factorization. | 3 |
| 756 | Find Greatest Common Divisor of 48 and 64, using prime factorization. | 3 |
| 757 | Find Greatest Common Divisor of 337 and 674, using prime factorization. | 3 |
| 758 | Find Greatest Common Divisor of 299 and 256, using repeated division. | 3 |
| 759 | Find Greatest Common Divisor of 11 and 25, using Euclidean algorithm. | 3 |
| 760 | Find Greatest Common Divisor of 252 and 105, using Euclidean algorithm. | 3 |
| 761 | Find Greatest Common Divisor of 14 and 3, using prime factorization. | 3 |
| 762 | Find Greatest Common Divisor of 396 and 792, by listing out the factors. | 3 |
| 763 | Find Greatest Common Divisor of 96 and 356, using Euclidean algorithm. | 3 |
| 764 | Find Greatest Common Divisor of 76 and 62, using Euclidean algorithm. | 3 |
| 765 | Find Greatest Common Divisor of 30 and 36, using prime factorization. | 3 |
| 766 | Find Greatest Common Divisor of 1769 and 2378, using Euclidean algorithm. | 3 |
| 767 | Find Greatest Common Divisor of 11607 and 3162, using Euclidean algorithm. | 3 |
| 768 | Find Greatest Common Divisor of 48 and 180, using prime factorization. | 3 |
| 769 | Find Greatest Common Divisor of 1858 and 342, using prime factorization. | 3 |
| 770 | Find Greatest Common Divisor of 2437 and 875, using prime factorization. | 3 |
| 771 | Find Greatest Common Divisor of 83 and 19, using prime factorization. | 3 |
| 772 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using prime factorization. | 3 |
| 773 | Find Greatest Common Divisor of 634 and 472, using Euclidean algorithm. | 3 |
| 774 | Find Greatest Common Divisor of 80 and 44, using Euclidean algorithm. | 3 |
| 775 | Find Greatest Common Divisor of 24 and 48, using repeated division. | 3 |
| 776 | Find Greatest Common Divisor of 114 and 312, using repeated division. | 3 |
| 777 | Find Greatest Common Divisor of 1024 and 486, using prime factorization. | 3 |
| 778 | Find Greatest Common Divisor of 85 and 28, using Euclidean algorithm. | 3 |
| 779 | Find Greatest Common Divisor of 153 and 119, using prime factorization. | 3 |
| 780 | Find Greatest Common Divisor of 486 and 18, using prime factorization. | 3 |
| 781 | Find Greatest Common Divisor of 2300 and 1180, using repeated division. | 3 |
| 782 | Find Greatest Common Divisor of 25 and 68, using Euclidean algorithm. | 3 |
| 783 | Find Greatest Common Divisor of 77 and 28, using prime factorization. | 3 |
| 784 | Find Greatest Common Divisor of 192, 256 and 304, using prime factorization. | 3 |
| 785 | Find Greatest Common Divisor of 4357 and 3754, using prime factorization. | 3 |
| 786 | Find Greatest Common Divisor of 85 and 10, using Euclidean algorithm. | 3 |
| 787 | Find Greatest Common Divisor of 26 and 7, using Euclidean algorithm. | 3 |
| 788 | Find Greatest Common Divisor of 91 and 32, using Euclidean algorithm. | 3 |
| 789 | Find Greatest Common Divisor of 36, 54, 90 and 126, using Euclidean algorithm. | 3 |
| 790 | Find Greatest Common Divisor of 19 and 99, by listing out the factors. | 3 |
| 791 | Find Greatest Common Divisor of 123456789 and 987654321, using prime factorization. | 3 |
| 792 | Find Greatest Common Divisor of 88 and 220, using Euclidean algorithm. | 3 |
| 793 | Find Greatest Common Divisor of 34 and 55, using Euclidean algorithm. | 3 |
| 794 | Find Greatest Common Divisor of 45 and 56, using prime factorization. | 3 |
| 795 | Find Greatest Common Divisor of 663 and 39, using prime factorization. | 3 |
| 796 | Find Greatest Common Divisor of 400 and 60, using Euclidean algorithm. | 3 |
| 797 | Find Greatest Common Divisor of 45 and 240, using prime factorization. | 3 |
| 798 | Find Greatest Common Divisor of 16 and 24, by listing out the factors. | 3 |
| 799 | Find Greatest Common Divisor of 97 and 29, using Euclidean algorithm. | 3 |
| 800 | Find Greatest Common Divisor of 123456 and 789, using Euclidean algorithm. | 3 |
