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 3 and 6, using prime factorization. | 1 |
| 5102 | Find Greatest Common Divisor of 900, 666 and 198, using prime factorization. | 1 |
| 5103 | Find Greatest Common Divisor of 600, 288 and 132, using prime factorization. | 1 |
| 5104 | Find Greatest Common Divisor of 696, 148 and 199, using prime factorization. | 1 |
| 5105 | Find Greatest Common Divisor of 696, 148 and 198, using prime factorization. | 1 |
| 5106 | Find Greatest Common Divisor of 696, 148 and 196, using prime factorization. | 1 |
| 5107 | Find Greatest Common Divisor of 694, 148 and 196, using prime factorization. | 1 |
| 5108 | Find Greatest Common Divisor of 112, 270 and 252, using prime factorization. | 1 |
| 5109 | Find Greatest Common Divisor of 112, 189 and 252, using prime factorization. | 1 |
| 5110 | Find Greatest Common Divisor of 112, 378 and 252, using prime factorization. | 1 |
| 5111 | Find Greatest Common Divisor of 336, 378 and 252, using prime factorization. | 1 |
| 5112 | Find Greatest Common Divisor of 17 and 84, using prime factorization. | 1 |
| 5113 | Find Greatest Common Divisor of 17 and 84, using Euclidean algorithm. | 1 |
| 5114 | Find Greatest Common Divisor of 2025 and 1089, using repeated division. | 1 |
| 5115 | Find Greatest Common Divisor of 36 and 144, using prime factorization. | 1 |
| 5116 | Find Greatest Common Divisor of 2022 and 2, using prime factorization. | 1 |
| 5117 | Find Greatest Common Divisor of 250484713 and 250421789, using prime factorization. | 1 |
| 5118 | Find Greatest Common Divisor of 891 and 41, using Euclidean algorithm. | 1 |
| 5119 | Find Greatest Common Divisor of 5865 and 20, using Euclidean algorithm. | 1 |
| 5120 | Find Greatest Common Divisor of 108 and 12, using Euclidean algorithm. | 1 |
| 5121 | Find Greatest Common Divisor of 273 and 15, using Euclidean algorithm. | 1 |
| 5122 | Find Greatest Common Divisor of 1500 and 50, using prime factorization. | 1 |
| 5123 | Find Greatest Common Divisor of 400 and 85, using prime factorization. | 1 |
| 5124 | Find Greatest Common Divisor of 50, 180 and 168, using prime factorization. | 1 |
| 5125 | Find Greatest Common Divisor of 22 and 9615, using prime factorization. | 1 |
| 5126 | Find Greatest Common Divisor of 47 and 59, using Euclidean algorithm. | 1 |
| 5127 | Find Greatest Common Divisor of 8051 and 4040, by listing out the factors. | 1 |
| 5128 | Find Greatest Common Divisor of 168, 420 and 588, using Euclidean algorithm. | 1 |
| 5129 | Find Greatest Common Divisor of 924 and 252, using prime factorization. | 1 |
| 5130 | Find Greatest Common Divisor of 183 and 279, using repeated division. | 1 |
| 5131 | Find Greatest Common Divisor of 192 and 288, using repeated division. | 1 |
| 5132 | Find Greatest Common Divisor of 1134 and 1386, using repeated division. | 1 |
| 5133 | Find Greatest Common Divisor of 5 and 23, using prime factorization. | 1 |
| 5134 | Find Greatest Common Divisor of 252 and 432, using repeated division. | 1 |
| 5135 | Find Greatest Common Divisor of 144, 216 and 360, using repeated division. | 1 |
| 5136 | Find Greatest Common Divisor of 980 and 1876, using repeated division. | 1 |
| 5137 | Find Greatest Common Divisor of 177 and 163, using prime factorization. | 1 |
| 5138 | Find Greatest Common Divisor of 30, 36 and 45, using repeated division. | 1 |
| 5139 | Find Greatest Common Divisor of 0 and 13, using prime factorization. | 1 |
| 5140 | Find Greatest Common Divisor of 629 and 335, using Euclidean algorithm. | 1 |
| 5141 | Find Greatest Common Divisor of 101, 103, 100 and 102, using prime factorization. | 1 |
| 5142 | Find Greatest Common Divisor of 14 and 56, using prime factorization. | 1 |
| 5143 | Find Greatest Common Divisor of 408 and 672, using Euclidean algorithm. | 1 |
| 5144 | Find Greatest Common Divisor of 647 and 924, using Euclidean algorithm. | 1 |
| 5145 | Find Greatest Common Divisor of 432 and 1800, using prime factorization. | 1 |
| 5146 | Find Greatest Common Divisor of 200 and 31, using Euclidean algorithm. | 1 |
| 5147 | Find Greatest Common Divisor of 3921 and 638, using Euclidean algorithm. | 1 |
| 5148 | Find Greatest Common Divisor of 623 and 89, using Euclidean algorithm. | 1 |
| 5149 | Find Greatest Common Divisor of 317. | 1 |
| 5150 | Find Greatest Common Divisor of 317. | 1 |
