GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5101 | Find Greatest Common Divisor of 32 and 21, using prime factorization. | 1 |
| 5102 | Find Greatest Common Divisor of 85907 and 2048, using prime factorization. | 1 |
| 5103 | Find Greatest Common Divisor of 3367 and 3219, using Euclidean algorithm. | 1 |
| 5104 | Find Greatest Common Divisor of 6540 and 1206, using prime factorization. | 1 |
| 5105 | Find Greatest Common Divisor of 12 and 20, using repeated division. | 1 |
| 5106 | Find Greatest Common Divisor of 7 and 26, using repeated division. | 1 |
| 5107 | Find Greatest Common Divisor of 2945 and 15635, using Euclidean algorithm. | 1 |
| 5108 | Find Greatest Common Divisor of 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10, using prime factorization. | 1 |
| 5109 | Find Greatest Common Divisor of 192 and 264, using prime factorization. | 1 |
| 5110 | Find Greatest Common Divisor of 264 and 192, using Euclidean algorithm. | 1 |
| 5111 | Find Greatest Common Divisor of 314 and 520, using Euclidean algorithm. | 1 |
| 5112 | Find Greatest Common Divisor of 155 and 9, using Euclidean algorithm. | 1 |
| 5113 | Find Greatest Common Divisor of 220 and 558, using Euclidean algorithm. | 1 |
| 5114 | Find Greatest Common Divisor of 10 and 11, using prime factorization. | 1 |
| 5115 | Find Greatest Common Divisor of 123 and 36, using Euclidean algorithm. | 1 |
| 5116 | Find Greatest Common Divisor of 9 and 40, using Euclidean algorithm. | 1 |
| 5117 | Find Greatest Common Divisor of 14953 and 1774, using Euclidean algorithm. | 1 |
| 5118 | Find Greatest Common Divisor of 45 and 210, using Euclidean algorithm. | 1 |
| 5119 | Find Greatest Common Divisor of 1746 and 28324, using prime factorization. | 1 |
| 5120 | Find Greatest Common Divisor of 30, 40 and 75, using prime factorization. | 1 |
| 5121 | Find Greatest Common Divisor of 19, 45 and 70, using prime factorization. | 1 |
| 5122 | Find Greatest Common Divisor of 293, 7298 and 19229, using prime factorization. | 1 |
| 5123 | Find Greatest Common Divisor of 3927473, 82709 and 1210121, using prime factorization. | 1 |
| 5124 | Find Greatest Common Divisor of 1771 and 179, using Euclidean algorithm. | 1 |
| 5125 | Find Greatest Common Divisor of 129 and 171, using Euclidean algorithm. | 1 |
| 5126 | Find Greatest Common Divisor of 5 and 192, using Euclidean algorithm. | 1 |
| 5127 | Find Greatest Common Divisor of 144 and 33, using prime factorization. | 1 |
| 5128 | Find Greatest Common Divisor of 18, 45 and 72, using repeated division. | 1 |
| 5129 | Find Greatest Common Divisor of 4, 5 and 3, using prime factorization. | 1 |
| 5130 | Find Greatest Common Divisor of 35 and 11, using prime factorization. | 1 |
| 5131 | Find Greatest Common Divisor of 5591 and 3122251, using prime factorization. | 1 |
| 5132 | Find Greatest Common Divisor of 800, 74 and 450, using prime factorization. | 1 |
| 5133 | Find Greatest Common Divisor of 528 and 756, using prime factorization. | 1 |
| 5134 | Find Greatest Common Divisor of 528 and 756, using Euclidean algorithm. | 1 |
| 5135 | Find Greatest Common Divisor of 35, 50, 56, 70 and 175, using prime factorization. | 1 |
| 5136 | Find Greatest Common Divisor of 403 and 676, using Euclidean algorithm. | 1 |
| 5137 | Find Greatest Common Divisor of 217 and 345, using Euclidean algorithm. | 1 |
| 5138 | Find Greatest Common Divisor of 1071 and 462, using prime factorization. | 1 |
| 5139 | Find Greatest Common Divisor of 12345. | 1 |
| 5140 | Find Greatest Common Divisor of 780 and 150, using Euclidean algorithm. | 1 |
| 5141 | Find Greatest Common Divisor of 23 and 15984, using prime factorization. | 1 |
| 5142 | Find Greatest Common Divisor of 270 and 75, using prime factorization. | 1 |
| 5143 | Find Greatest Common Divisor of 8 and 2, using Euclidean algorithm. | 1 |
| 5144 | Find Greatest Common Divisor of 40 and 1, using prime factorization. | 1 |
| 5145 | Find Greatest Common Divisor of 2016 and 217, using Euclidean algorithm. | 1 |
| 5146 | Find Greatest Common Divisor of 2016 and 927, using prime factorization. | 1 |
| 5147 | Find Greatest Common Divisor of 2016 and 927, using Euclidean algorithm. | 1 |
| 5148 | Find Greatest Common Divisor of 4999 and 1109, by listing out the factors. | 1 |
| 5149 | Find Greatest Common Divisor of 28, 48 and 60, using prime factorization. | 1 |
| 5150 | Find Greatest Common Divisor of 33, 44 and 133, using prime factorization. | 1 |
