GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
301 | Find Greatest Common Divisor of 168 and 10, using prime factorization. | 5 |
302 | Find Greatest Common Divisor of 95 and 10, using prime factorization. | 5 |
303 | Find Greatest Common Divisor of 8 and 3, using prime factorization. | 5 |
304 | Find Greatest Common Divisor of 48 and 36, using Euclidean algorithm. | 5 |
305 | Find Greatest Common Divisor of 16534528044 and 8332745927, using Euclidean algorithm. | 5 |
306 | Find Greatest Common Divisor of 330 and 156, using Euclidean algorithm. | 5 |
307 | Find Greatest Common Divisor of 222 and 254, using prime factorization. | 5 |
308 | Find Greatest Common Divisor of 75 and 90, using prime factorization. | 5 |
309 | Find Greatest Common Divisor of 48, 36 and 124, by listing out the factors. | 5 |
310 | Find Greatest Common Divisor of 0 and 6, using prime factorization. | 5 |
311 | Find Greatest Common Divisor of 1152 and 1664, using prime factorization. | 5 |
312 | Find Greatest Common Divisor of 5 and 7, using prime factorization. | 5 |
313 | Find Greatest Common Divisor of 1008 and 2000, using prime factorization. | 5 |
314 | Find Greatest Common Divisor of 18 and 32, using prime factorization. | 5 |
315 | Find Greatest Common Divisor of 174 and 8, using prime factorization. | 5 |
316 | Find Greatest Common Divisor of 90 and 64, using prime factorization. | 5 |
317 | Find Greatest Common Divisor of 32 and 66, using prime factorization. | 5 |
318 | Find Greatest Common Divisor of 18 and 201, using prime factorization. | 5 |
319 | Find Greatest Common Divisor of 102, 170 and 255, using prime factorization. | 5 |
320 | Find Greatest Common Divisor of 18 and 201, by listing out the factors. | 5 |
321 | Find Greatest Common Divisor of 85 and 85, using prime factorization. | 5 |
322 | Find Greatest Common Divisor of 36 and 54, using prime factorization. | 5 |
323 | Find Greatest Common Divisor of 36 and 54, using Euclidean algorithm. | 5 |
324 | Find Greatest Common Divisor of 3587 and 1819, using prime factorization. | 5 |
325 | Find Greatest Common Divisor of 315 and 825, using prime factorization. | 5 |
326 | Find Greatest Common Divisor of 504 and 270, using Euclidean algorithm. | 5 |
327 | Find Greatest Common Divisor of 628 and 2260, using prime factorization. | 4 |
328 | Find Greatest Common Divisor of 216, 900, 36, 120, 144, 108, 49, 60, 150 and 25, using prime factorization. | 4 |
329 | Find Greatest Common Divisor of 941688 and 133980, by listing out the factors. | 4 |
330 | Find Greatest Common Divisor of 17 and 33, using Euclidean algorithm. | 4 |
331 | Find Greatest Common Divisor of 3 and 7, using prime factorization. | 4 |
332 | Find Greatest Common Divisor of 66 and 150, using prime factorization. | 4 |
333 | Find Greatest Common Divisor of 1001 and 1331, using prime factorization. | 4 |
334 | Find Greatest Common Divisor of 0 and 8, using prime factorization. | 4 |
335 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using prime factorization. | 4 |
336 | Find Greatest Common Divisor of 5 and 4, using prime factorization. | 4 |
337 | Find Greatest Common Divisor of 6 and 2, using prime factorization. | 4 |
338 | Find Greatest Common Divisor of 26 and 68, using prime factorization. | 4 |
339 | Find Greatest Common Divisor of 78 and 44, using prime factorization. | 4 |
340 | Find Greatest Common Divisor of 22 and 46, using prime factorization. | 4 |
341 | Find Greatest Common Divisor of 32 and 46, using prime factorization. | 4 |
342 | Find Greatest Common Divisor of 84 and 2, using prime factorization. | 4 |
343 | Find Greatest Common Divisor of 221 and 35, using Euclidean algorithm. | 4 |
344 | Find Greatest Common Divisor of 71 and 71, using prime factorization. | 4 |
345 | Find Greatest Common Divisor of 8976 and 345, using Euclidean algorithm. | 4 |
346 | Find Greatest Common Divisor of 36 and 48, using prime factorization. | 4 |
347 | Find Greatest Common Divisor of 17 and 34, using Euclidean algorithm. | 4 |
348 | Find Greatest Common Divisor of 54 and 39, using prime factorization. | 4 |
349 | Find Greatest Common Divisor of 42 and 12, using prime factorization. | 4 |
350 | Find Greatest Common Divisor of 160 and 7, using Euclidean algorithm. | 4 |