GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3351 | Find Greatest Common Divisor of 180 and 2100, using prime factorization. | 2 |
| 3352 | Find Greatest Common Divisor of 13860 and 727650, using prime factorization. | 2 |
| 3353 | Find Greatest Common Divisor of 64 and 21, using prime factorization. | 2 |
| 3354 | Find Greatest Common Divisor of 64 and 21, using repeated division. | 2 |
| 3355 | Find Greatest Common Divisor of 23 and 92, using prime factorization. | 2 |
| 3356 | Find Greatest Common Divisor of 4, 9 and 19, using prime factorization. | 2 |
| 3357 | Find Greatest Common Divisor of 21, 35 and 63, using prime factorization. | 2 |
| 3358 | Find Greatest Common Divisor of 36, 63 and 81, using prime factorization. | 2 |
| 3359 | Find Greatest Common Divisor of 19242530496. | 2 |
| 3360 | Find Greatest Common Divisor of 2030. | 2 |
| 3361 | Find Greatest Common Divisor of 19242530906. | 2 |
| 3362 | Find Greatest Common Divisor of 1024. | 2 |
| 3363 | Find Greatest Common Divisor of 662. | 2 |
| 3364 | Find Greatest Common Divisor of 662. | 2 |
| 3365 | Find Greatest Common Divisor of 1561 and 3409, using prime factorization. | 2 |
| 3366 | Find Greatest Common Divisor of 13 and 75, using prime factorization. | 2 |
| 3367 | Find Greatest Common Divisor of 13 and 80, using prime factorization. | 2 |
| 3368 | Find Greatest Common Divisor of 10 and 75, using Euclidean algorithm. | 2 |
| 3369 | Find Greatest Common Divisor of 48 and 360, using Euclidean algorithm. | 2 |
| 3370 | Find Greatest Common Divisor of 1362 and 2785, using Euclidean algorithm. | 2 |
| 3371 | Find Greatest Common Divisor of 428 and 633, using prime factorization. | 2 |
| 3372 | Find Greatest Common Divisor of 520 and 858, using prime factorization. | 2 |
| 3373 | Find Greatest Common Divisor of 11 and 1800, using prime factorization. | 2 |
| 3374 | Find Greatest Common Divisor of 20119 and 34782, using Euclidean algorithm. | 2 |
| 3375 | Find Greatest Common Divisor of 5 and 3432, using prime factorization. | 2 |
| 3376 | Find Greatest Common Divisor of 180, 540 and 240, using prime factorization. | 2 |
| 3377 | Find Greatest Common Divisor of 6 and 12, using Euclidean algorithm. | 2 |
| 3378 | Find Greatest Common Divisor of 490 and 2013, using prime factorization. | 2 |
| 3379 | Find Greatest Common Divisor of 32321 and 36513, using prime factorization. | 2 |
| 3380 | Find Greatest Common Divisor of 32321 and 26513, using prime factorization. | 2 |
| 3381 | Find Greatest Common Divisor of 230 and 960, by listing out the factors. | 2 |
| 3382 | Find Greatest Common Divisor of 90, 105 and 120, using prime factorization. | 2 |
| 3383 | Find Greatest Common Divisor of 378 and 441, using prime factorization. | 2 |
| 3384 | Find Greatest Common Divisor of 6810000 and 491, using prime factorization. | 2 |
| 3385 | Find Greatest Common Divisor of 71 and 120, using prime factorization. | 2 |
| 3386 | Find Greatest Common Divisor of 10 and 1, using prime factorization. | 2 |
| 3387 | Find Greatest Common Divisor of 10 and 7, using prime factorization. | 2 |
| 3388 | Find Greatest Common Divisor of 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111 and 1111111111, using prime factorization. | 2 |
| 3389 | Find Greatest Common Divisor of 385 and 165, using prime factorization. | 2 |
| 3390 | Find Greatest Common Divisor of 55 and 96, using prime factorization. | 2 |
| 3391 | Find Greatest Common Divisor of 1163 and 248, using prime factorization. | 2 |
| 3392 | Find Greatest Common Divisor of 42 and 210, using prime factorization. | 2 |
| 3393 | Find Greatest Common Divisor of 42 and 210, by listing out the factors. | 2 |
| 3394 | Find Greatest Common Divisor of 210 and 42, using repeated division. | 2 |
| 3395 | Find Greatest Common Divisor of 3568 and 1004, using Euclidean algorithm. | 2 |
| 3396 | Find Greatest Common Divisor of 17 and 9, using Euclidean algorithm. | 2 |
| 3397 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using repeated division. | 2 |
| 3398 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using prime factorization. | 2 |
| 3399 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using Euclidean algorithm. | 2 |
| 3400 | Find Greatest Common Divisor of 84 and 120, using Euclidean algorithm. | 2 |