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 256 and 81, using prime factorization. | 1 |
| 5152 | Find Greatest Common Divisor of 540 and 720, using prime factorization. | 1 |
| 5153 | Find Greatest Common Divisor of 1900 and 172, using prime factorization. | 1 |
| 5154 | Find Greatest Common Divisor of 970 and 899, using prime factorization. | 1 |
| 5155 | Find Greatest Common Divisor of 970 and 890, using prime factorization. | 1 |
| 5156 | Find Greatest Common Divisor of 2798 and 36812, using prime factorization. | 1 |
| 5157 | Find Greatest Common Divisor of 145 and 355, using prime factorization. | 1 |
| 5158 | Find Greatest Common Divisor of 118 and 936, using prime factorization. | 1 |
| 5159 | Find Greatest Common Divisor of 118 and 918, using prime factorization. | 1 |
| 5160 | Find Greatest Common Divisor of 120 and 918, using prime factorization. | 1 |
| 5161 | Find Greatest Common Divisor of 14, 18 and 12, using prime factorization. | 1 |
| 5162 | Find Greatest Common Divisor of 999 and 19, using prime factorization. | 1 |
| 5163 | Find Greatest Common Divisor of 81, 36 and 48, using prime factorization. | 1 |
| 5164 | Find Greatest Common Divisor of 70, 190 and 350, using prime factorization. | 1 |
| 5165 | Find Greatest Common Divisor of 70, 600 and 350, using prime factorization. | 1 |
| 5166 | Find Greatest Common Divisor of 243, 729 and 270, using prime factorization. | 1 |
| 5167 | Find Greatest Common Divisor of 364 and 765, using prime factorization. | 1 |
| 5168 | Find Greatest Common Divisor of 6 and 35, using Euclidean algorithm. | 1 |
| 5169 | Find Greatest Common Divisor of 3572 and 838, using prime factorization. | 1 |
| 5170 | Find Greatest Common Divisor of 3572 and 838, using Euclidean algorithm. | 1 |
| 5171 | Find Greatest Common Divisor of 3543 and 92, using Euclidean algorithm. | 1 |
| 5172 | Find Greatest Common Divisor of 282 and 2332, using prime factorization. | 1 |
| 5173 | Find Greatest Common Divisor of 1223 and 195, using Euclidean algorithm. | 1 |
| 5174 | Find Greatest Common Divisor of 3401 and 542, using Euclidean algorithm. | 1 |
| 5175 | Find Greatest Common Divisor of 3572 and 211, using Euclidean algorithm. | 1 |
| 5176 | Find Greatest Common Divisor of 2871 and 169, using Euclidean algorithm. | 1 |
| 5177 | Find Greatest Common Divisor of 143 and 35, using Euclidean algorithm. | 1 |
| 5178 | Find Greatest Common Divisor of 385 and 35, using Euclidean algorithm. | 1 |
| 5179 | Find Greatest Common Divisor of 336 and 1120, using prime factorization. | 1 |
| 5180 | Find Greatest Common Divisor of 216 and 111, using Euclidean algorithm. | 1 |
| 5181 | Find Greatest Common Divisor of 5168 and 663, using Euclidean algorithm. | 1 |
| 5182 | Find Greatest Common Divisor of 7 and 84, using prime factorization. | 1 |
| 5183 | Find Greatest Common Divisor of 40 and 56, using prime factorization. | 1 |
| 5184 | Find Greatest Common Divisor of 5270, 6460 and 7480, using repeated division. | 1 |
| 5185 | Find Greatest Common Divisor of 16 and 620, using prime factorization. | 1 |
| 5186 | Find Greatest Common Divisor of 504 and 525, using prime factorization. | 1 |
| 5187 | Find Greatest Common Divisor of 844 and 444, using prime factorization. | 1 |
| 5188 | Find Greatest Common Divisor of 575 and 9, using prime factorization. | 1 |
| 5189 | Find Greatest Common Divisor of 6 and 15, using prime factorization. | 1 |
| 5190 | Find Greatest Common Divisor of 34 and 21, using Euclidean algorithm. | 1 |
| 5191 | Find Greatest Common Divisor of 17 and 31, using Euclidean algorithm. | 1 |
| 5192 | Find Greatest Common Divisor of 595 and 1463, using Euclidean algorithm. | 1 |
| 5193 | Find Greatest Common Divisor of 121 and 122, using prime factorization. | 1 |
| 5194 | Find Greatest Common Divisor of 4 and 13, using Euclidean algorithm. | 1 |
| 5195 | Find Greatest Common Divisor of 4 and 14, using Euclidean algorithm. | 1 |
| 5196 | Find Greatest Common Divisor of 42 and 126, using Euclidean algorithm. | 1 |
| 5197 | Find Greatest Common Divisor of 140, 350 and 1200, using prime factorization. | 1 |
| 5198 | Find Greatest Common Divisor of 140, 1200 and 350, using prime factorization. | 1 |
| 5199 | Find Greatest Common Divisor of 16, 36 and 24, using prime factorization. | 1 |
| 5200 | Find Greatest Common Divisor of 600, 980 and 2500, using prime factorization. | 1 |
