GCD – Solved Problems Database

All the problems and solutions shown below were generated using the GCD Calculator.

Change category

ID	Problem	Count
251	Find Greatest Common Divisor of 12 and 10, using prime factorization.	8
252	Find Greatest Common Divisor of 11 and 33, using prime factorization.	8
253	Find Greatest Common Divisor of 94 and 10, using prime factorization.	8
254	Find Greatest Common Divisor of 60 and 100, using prime factorization.	8
255	Find Greatest Common Divisor of 49 and 21, using prime factorization.	8
256	Find Greatest Common Divisor of 20 and 144, using prime factorization.	8
257	Find Greatest Common Divisor of 355 and 20, using prime factorization.	8
258	Find Greatest Common Divisor of 93 and 24, using prime factorization.	8
259	Find Greatest Common Divisor of 291 and 252, using Euclidean algorithm.	8
260	Find Greatest Common Divisor of 186 and 14, using prime factorization.	8
261	Find Greatest Common Divisor of 36, 54, 90 and 126, using prime factorization.	8
262	Find Greatest Common Divisor of 406 and 757, using prime factorization.	8
263	Find Greatest Common Divisor of 94 and 6, using prime factorization.	8
264	Find Greatest Common Divisor of 579 and 578, using prime factorization.	8
265	Find Greatest Common Divisor of 15 and 27, using prime factorization.	8
266	Find Greatest Common Divisor of 2 and 10, using prime factorization.	8
267	Find Greatest Common Divisor of 26 and 338, using prime factorization.	8
268	Find Greatest Common Divisor of 18 and 24, by listing out the factors.	8
269	Find Greatest Common Divisor of 13 and 13, using prime factorization.	8
270	Find Greatest Common Divisor of 20 and 30, using prime factorization.	8
271	Find Greatest Common Divisor of 9 and 100, using prime factorization.	8
272	Find Greatest Common Divisor of 2 and 16, using prime factorization.	8
273	Find Greatest Common Divisor of 168 and 10, using prime factorization.	8
274	Find Greatest Common Divisor of 466 and 267, using Euclidean algorithm.	8
275	Find Greatest Common Divisor of 18 and 7, using Euclidean algorithm.	8
276	Find Greatest Common Divisor of 3 and 8, using prime factorization.	8
277	Find Greatest Common Divisor of 62 and 227, using prime factorization.	8
278	Find Greatest Common Divisor of 68 and 70, using prime factorization.	8
279	Find Greatest Common Divisor of 1152 and 1664, using prime factorization.	8
280	Find Greatest Common Divisor of 224 and 336, using prime factorization.	8
281	Find Greatest Common Divisor of 14 and 49, using prime factorization.	8
282	Find Greatest Common Divisor of 33 and 121, using prime factorization.	8
283	Find Greatest Common Divisor of 20 and 7, using prime factorization.	8
284	Find Greatest Common Divisor of 96 and 4, using prime factorization.	8
285	Find Greatest Common Divisor of 44838 and 4830, using Euclidean algorithm.	8
286	Find Greatest Common Divisor of 54 and 60, using Euclidean algorithm.	7
287	Find Greatest Common Divisor of 6 and 2, using prime factorization.	7
288	Find Greatest Common Divisor of 84 and 2, using prime factorization.	7
289	Find Greatest Common Divisor of 71 and 71, using prime factorization.	7
290	Find Greatest Common Divisor of 26 and 10, using prime factorization.	7
291	Find Greatest Common Divisor of 42 and 12, using prime factorization.	7
292	Find Greatest Common Divisor of 4 and 58, using prime factorization.	7
293	Find Greatest Common Divisor of 0, 30, 0, 45, 0 and 60, using prime factorization.	7
294	Find Greatest Common Divisor of 42 and 9, using prime factorization.	7
295	Find Greatest Common Divisor of 18 and 81, using prime factorization.	7
296	Find Greatest Common Divisor of 50 and 10, using prime factorization.	7
297	Find Greatest Common Divisor of 24 and 16, using prime factorization.	7
298	Find Greatest Common Divisor of 102 and 351, using prime factorization.	7
299	Find Greatest Common Divisor of 18 and 56, using prime factorization.	7
300	Find Greatest Common Divisor of 98 and 273, using prime factorization.	7