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 4 and 9, using prime factorization. | 2 |
1152 | Find Greatest Common Divisor of 800 and 1025, using prime factorization. | 2 |
1153 | Find Greatest Common Divisor of 106 and 63, using prime factorization. | 2 |
1154 | Find Greatest Common Divisor of 4284 and 8219, using prime factorization. | 2 |
1155 | Find Greatest Common Divisor of 5786423. | 2 |
1156 | Find Greatest Common Divisor of 120. | 2 |
1157 | Find Greatest Common Divisor of 125 and 11, using prime factorization. | 2 |
1158 | Find Greatest Common Divisor of 125 and 11, using Euclidean algorithm. | 2 |
1159 | Find Greatest Common Divisor of 1632. | 2 |
1160 | Find Greatest Common Divisor of 16 and 32, using prime factorization. | 2 |
1161 | Find Greatest Common Divisor of 93 and 42, using prime factorization. | 2 |
1162 | Find Greatest Common Divisor of 49 and 900, using prime factorization. | 2 |
1163 | Find Greatest Common Divisor of 123456 and 678, using Euclidean algorithm. | 2 |
1164 | Find Greatest Common Divisor of 951, 744, 516, 487, 808, 808, 676, 328, 940 and 470, using prime factorization. | 2 |
1165 | Find Greatest Common Divisor of 19 and 99, using prime factorization. | 2 |
1166 | Find Greatest Common Divisor of 912 and 1210, using prime factorization. | 2 |
1167 | Find Greatest Common Divisor of 1 and 1000, using prime factorization. | 2 |
1168 | Find Greatest Common Divisor of 2 and 1001, using prime factorization. | 2 |
1169 | Find Greatest Common Divisor of 2 and 1002, using prime factorization. | 2 |
1170 | Find Greatest Common Divisor of 18 and 12, using prime factorization. | 2 |
1171 | Find Greatest Common Divisor of 61730. | 2 |
1172 | Find Greatest Common Divisor of 147 and 630, using repeated division. | 2 |
1173 | Find Greatest Common Divisor of 6, 55 and 128, using prime factorization. | 2 |
1174 | Find Greatest Common Divisor of 24, 30 and 36, using prime factorization. | 2 |
1175 | Find Greatest Common Divisor of 24 and 69, using repeated division. | 2 |
1176 | Find Greatest Common Divisor of 652 and 32, using Euclidean algorithm. | 2 |
1177 | Find Greatest Common Divisor of 160 and 3, using prime factorization. | 2 |
1178 | Find Greatest Common Divisor of 42 and 65, using prime factorization. | 2 |
1179 | Find Greatest Common Divisor of 54 and 144, using prime factorization. | 2 |
1180 | Find Greatest Common Divisor of 8, 16 and 20, using prime factorization. | 2 |
1181 | Find Greatest Common Divisor of 12, 18 and 21, using prime factorization. | 2 |
1182 | Find Greatest Common Divisor of 180, 2 and 210, using prime factorization. | 2 |
1183 | Find Greatest Common Divisor of 3, 2, 2 and 2, using prime factorization. | 2 |
1184 | Find Greatest Common Divisor of 0 and 43, using prime factorization. | 2 |
1185 | Find Greatest Common Divisor of 34336550 and 120400, using Euclidean algorithm. | 2 |
1186 | Find Greatest Common Divisor of 44 and 85, using Euclidean algorithm. | 2 |
1187 | Find Greatest Common Divisor of 19 and 45, using Euclidean algorithm. | 2 |
1188 | Find Greatest Common Divisor of 43 and 41, using Euclidean algorithm. | 2 |
1189 | Find Greatest Common Divisor of 73 and 660, using Euclidean algorithm. | 2 |
1190 | Find Greatest Common Divisor of 30 and 107, using prime factorization. | 2 |
1191 | Find Greatest Common Divisor of 30 and 107, using repeated division. | 2 |
1192 | Find Greatest Common Divisor of 30 and 107, using Euclidean algorithm. | 2 |
1193 | Find Greatest Common Divisor of 3 and 448, using Euclidean algorithm. | 2 |
1194 | Find Greatest Common Divisor of 1573 and 2145, using prime factorization. | 2 |
1195 | Find Greatest Common Divisor of 65537 and 65539, using Euclidean algorithm. | 2 |
1196 | Find Greatest Common Divisor of 1188 and 385, using Euclidean algorithm. | 2 |
1197 | Find Greatest Common Divisor of 385 and 1188, using Euclidean algorithm. | 2 |
1198 | Find Greatest Common Divisor of 832 and 10933, using Euclidean algorithm. | 2 |
1199 | Find Greatest Common Divisor of 4131 and 2431, using Euclidean algorithm. | 2 |
1200 | Find Greatest Common Divisor of 221 and 405, using prime factorization. | 2 |