GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5151 | Find Greatest Common Divisor of 123 and 315, using repeated division. | 1 |
| 5152 | Find Greatest Common Divisor of 32 and 21, using prime factorization. | 1 |
| 5153 | Find Greatest Common Divisor of 85907 and 2048, using prime factorization. | 1 |
| 5154 | Find Greatest Common Divisor of 3367 and 3219, using Euclidean algorithm. | 1 |
| 5155 | Find Greatest Common Divisor of 6540 and 1206, using prime factorization. | 1 |
| 5156 | Find Greatest Common Divisor of 12 and 20, using repeated division. | 1 |
| 5157 | Find Greatest Common Divisor of 375 and 1000, using prime factorization. | 1 |
| 5158 | Find Greatest Common Divisor of 7 and 26, using repeated division. | 1 |
| 5159 | Find Greatest Common Divisor of 2945 and 15635, using Euclidean algorithm. | 1 |
| 5160 | Find Greatest Common Divisor of 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10, using prime factorization. | 1 |
| 5161 | Find Greatest Common Divisor of 192 and 264, using prime factorization. | 1 |
| 5162 | Find Greatest Common Divisor of 264 and 192, using Euclidean algorithm. | 1 |
| 5163 | Find Greatest Common Divisor of 314 and 520, using Euclidean algorithm. | 1 |
| 5164 | Find Greatest Common Divisor of 155 and 9, using Euclidean algorithm. | 1 |
| 5165 | Find Greatest Common Divisor of 220 and 558, using Euclidean algorithm. | 1 |
| 5166 | Find Greatest Common Divisor of 10 and 11, using prime factorization. | 1 |
| 5167 | Find Greatest Common Divisor of 123 and 36, using Euclidean algorithm. | 1 |
| 5168 | Find Greatest Common Divisor of 9 and 40, using Euclidean algorithm. | 1 |
| 5169 | Find Greatest Common Divisor of 14953 and 1774, using Euclidean algorithm. | 1 |
| 5170 | Find Greatest Common Divisor of 45 and 210, using Euclidean algorithm. | 1 |
| 5171 | Find Greatest Common Divisor of 1746 and 28324, using prime factorization. | 1 |
| 5172 | Find Greatest Common Divisor of 30, 40 and 75, using prime factorization. | 1 |
| 5173 | Find Greatest Common Divisor of 19, 45 and 70, using prime factorization. | 1 |
| 5174 | Find Greatest Common Divisor of 293, 7298 and 19229, using prime factorization. | 1 |
| 5175 | Find Greatest Common Divisor of 3927473, 82709 and 1210121, using prime factorization. | 1 |
| 5176 | Find Greatest Common Divisor of 1771 and 179, using Euclidean algorithm. | 1 |
| 5177 | Find Greatest Common Divisor of 129 and 171, using Euclidean algorithm. | 1 |
| 5178 | Find Greatest Common Divisor of 5 and 192, using Euclidean algorithm. | 1 |
| 5179 | Find Greatest Common Divisor of 144 and 33, using prime factorization. | 1 |
| 5180 | Find Greatest Common Divisor of 18, 45 and 72, using repeated division. | 1 |
| 5181 | Find Greatest Common Divisor of 4, 5 and 3, using prime factorization. | 1 |
| 5182 | Find Greatest Common Divisor of 35 and 11, using prime factorization. | 1 |
| 5183 | Find Greatest Common Divisor of 5591 and 3122251, using prime factorization. | 1 |
| 5184 | Find Greatest Common Divisor of 800, 74 and 450, using prime factorization. | 1 |
| 5185 | Find Greatest Common Divisor of 528 and 756, using prime factorization. | 1 |
| 5186 | Find Greatest Common Divisor of 528 and 756, using Euclidean algorithm. | 1 |
| 5187 | Find Greatest Common Divisor of 35, 50, 56, 70 and 175, using prime factorization. | 1 |
| 5188 | Find Greatest Common Divisor of 403 and 676, using Euclidean algorithm. | 1 |
| 5189 | Find Greatest Common Divisor of 217 and 345, using Euclidean algorithm. | 1 |
| 5190 | Find Greatest Common Divisor of 1071 and 462, using prime factorization. | 1 |
| 5191 | Find Greatest Common Divisor of 12345. | 1 |
| 5192 | Find Greatest Common Divisor of 780 and 150, using Euclidean algorithm. | 1 |
| 5193 | Find Greatest Common Divisor of 23 and 15984, using prime factorization. | 1 |
| 5194 | Find Greatest Common Divisor of 270 and 75, using prime factorization. | 1 |
| 5195 | Find Greatest Common Divisor of 8 and 2, using Euclidean algorithm. | 1 |
| 5196 | Find Greatest Common Divisor of 40 and 1, using prime factorization. | 1 |
| 5197 | Find Greatest Common Divisor of 2016 and 217, using Euclidean algorithm. | 1 |
| 5198 | Find Greatest Common Divisor of 2016 and 927, using prime factorization. | 1 |
| 5199 | Find Greatest Common Divisor of 2016 and 927, using Euclidean algorithm. | 1 |
| 5200 | Find Greatest Common Divisor of 4999 and 1109, by listing out the factors. | 1 |
