GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 1151 | Find Greatest Common Divisor of 96, 144 and 192, using repeated division. | 9 |
| 1152 | Find Greatest Common Divisor of 687 and 24, using Euclidean algorithm. | 9 |
| 1153 | Find Greatest Common Divisor of 3120. | 9 |
| 1154 | Find Greatest Common Divisor of 457 and 378, using Euclidean algorithm. | 9 |
| 1155 | Find Greatest Common Divisor of 36, 54, 90 and 126, using Euclidean algorithm. | 8 |
| 1156 | Find Greatest Common Divisor of 28. | 8 |
| 1157 | Find Greatest Common Divisor of 44838 and 4830, using Euclidean algorithm. | 8 |
| 1158 | Find Greatest Common Divisor of 102 and 351, using prime factorization. | 8 |
| 1159 | Find Greatest Common Divisor of 12 and 18, using repeated division. | 8 |
| 1160 | Find Greatest Common Divisor of 25, 30 and 40, using prime factorization. | 8 |
| 1161 | Find Greatest Common Divisor of 4 and 50, using prime factorization. | 8 |
| 1162 | Find Greatest Common Divisor of 30 and 14, using prime factorization. | 8 |
| 1163 | Find Greatest Common Divisor of 52 and 24, using prime factorization. | 8 |
| 1164 | Find Greatest Common Divisor of 6 and 39, using prime factorization. | 8 |
| 1165 | Find Greatest Common Divisor of 88 and 16, using prime factorization. | 8 |
| 1166 | Find Greatest Common Divisor of 51 and 6, using prime factorization. | 8 |
| 1167 | Find Greatest Common Divisor of 6 and 90, using prime factorization. | 8 |
| 1168 | Find Greatest Common Divisor of 116 and 8, using prime factorization. | 8 |
| 1169 | Find Greatest Common Divisor of 64 and 2, using prime factorization. | 8 |
| 1170 | Find Greatest Common Divisor of 60207 and 7252, using prime factorization. | 8 |
| 1171 | Find Greatest Common Divisor of 35 and 95, using prime factorization. | 8 |
| 1172 | Find Greatest Common Divisor of 87 and 60, using prime factorization. | 8 |
| 1173 | Find Greatest Common Divisor of 98 and 30, using prime factorization. | 8 |
| 1174 | Find Greatest Common Divisor of 10 and 1500, using prime factorization. | 8 |
| 1175 | Find Greatest Common Divisor of 18 and 70, using prime factorization. | 8 |
| 1176 | Find Greatest Common Divisor of 1028 and 60, using prime factorization. | 8 |
| 1177 | Find Greatest Common Divisor of 1086 and 172, using prime factorization. | 8 |
| 1178 | Find Greatest Common Divisor of 51 and 51, using prime factorization. | 8 |
| 1179 | Find Greatest Common Divisor of 132 and 27, using prime factorization. | 8 |
| 1180 | Find Greatest Common Divisor of 33 and 6, using prime factorization. | 8 |
| 1181 | Find Greatest Common Divisor of 38 and 4, using prime factorization. | 8 |
| 1182 | Find Greatest Common Divisor of 20050 and 62, using prime factorization. | 8 |
| 1183 | Find Greatest Common Divisor of 3 and 150, using prime factorization. | 8 |
| 1184 | Find Greatest Common Divisor of 161 and 23, using prime factorization. | 8 |
| 1185 | Find Greatest Common Divisor of 15 and 60, using prime factorization. | 8 |
| 1186 | Find Greatest Common Divisor of 75 and 15, using prime factorization. | 8 |
| 1187 | Find Greatest Common Divisor of 36 and 24, using prime factorization. | 8 |
| 1188 | Find Greatest Common Divisor of 7961. | 8 |
| 1189 | Find Greatest Common Divisor of 70, 105 and 175, using prime factorization. | 8 |
| 1190 | Find Greatest Common Divisor of 1000 and 5040, using Euclidean algorithm. | 8 |
| 1191 | Find Greatest Common Divisor of 20 and 45, using prime factorization. | 8 |
| 1192 | Find Greatest Common Divisor of 18 and 7, using Euclidean algorithm. | 8 |
| 1193 | Find Greatest Common Divisor of 466 and 267, using Euclidean algorithm. | 8 |
| 1194 | Find Greatest Common Divisor of 525. | 8 |
| 1195 | Find Greatest Common Divisor of 186 and 15, using prime factorization. | 8 |
| 1196 | Find Greatest Common Divisor of 94 and 8, using prime factorization. | 8 |
| 1197 | Find Greatest Common Divisor of 160 and 7, using Euclidean algorithm. | 8 |
| 1198 | Find Greatest Common Divisor of 80 and 144, using prime factorization. | 8 |
| 1199 | Find Greatest Common Divisor of 16534528044 and 8332745927, using Euclidean algorithm. | 8 |
| 1200 | Find Greatest Common Divisor of 2. | 8 |