GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4301 | Find Greatest Common Divisor of 42 and 67, using Euclidean algorithm. | 2 |
| 4302 | Find Greatest Common Divisor of 46 and 4, using prime factorization. | 2 |
| 4303 | Find Greatest Common Divisor of 54 and 49, using prime factorization. | 2 |
| 4304 | Find Greatest Common Divisor of 95 and 123, using Euclidean algorithm. | 2 |
| 4305 | Find Greatest Common Divisor of 14 and 968, using prime factorization. | 2 |
| 4306 | Find Greatest Common Divisor of 83456 and 2987426, using prime factorization. | 2 |
| 4307 | Find Greatest Common Divisor of 376 and 140, using prime factorization. | 2 |
| 4308 | Find Greatest Common Divisor of 18122790 and 6462784, using prime factorization. | 2 |
| 4309 | Find Greatest Common Divisor of 19388352 and 3363, using prime factorization. | 2 |
| 4310 | Find Greatest Common Divisor of 453069750 and 657575, using prime factorization. | 2 |
| 4311 | Find Greatest Common Divisor of 30 and 35, using prime factorization. | 2 |
| 4312 | Find Greatest Common Divisor of 138 and 12, using prime factorization. | 2 |
| 4313 | Find Greatest Common Divisor of 84 and 39, using prime factorization. | 2 |
| 4314 | Find Greatest Common Divisor of 54 and 6, using prime factorization. | 2 |
| 4315 | Find Greatest Common Divisor of 90 and 99, using prime factorization. | 2 |
| 4316 | Find Greatest Common Divisor of 56 and 63, using prime factorization. | 2 |
| 4317 | Find Greatest Common Divisor of 168 and 54, using prime factorization. | 2 |
| 4318 | Find Greatest Common Divisor of 780 and 351, using prime factorization. | 2 |
| 4319 | Find Greatest Common Divisor of 3000 and 5000, using Euclidean algorithm. | 2 |
| 4320 | Find Greatest Common Divisor of 16 and 29, using prime factorization. | 2 |
| 4321 | Find Greatest Common Divisor of 52, 32 and 5, using repeated division. | 2 |
| 4322 | Find Greatest Common Divisor of 52 and 32, using repeated division. | 2 |
| 4323 | Find Greatest Common Divisor of 12 and 28, using repeated division. | 2 |
| 4324 | Find Greatest Common Divisor of 20536 and 7826, using prime factorization. | 2 |
| 4325 | Find Greatest Common Divisor of 340. | 2 |
| 4326 | Find Greatest Common Divisor of 340 and 220, using Euclidean algorithm. | 2 |
| 4327 | Find Greatest Common Divisor of 24 and 50, using repeated division. | 2 |
| 4328 | Find Greatest Common Divisor of 105 and 816, using repeated division. | 2 |
| 4329 | Find Greatest Common Divisor of 462 and 1071, using prime factorization. | 2 |
| 4330 | Find Greatest Common Divisor of 640 and 32, using Euclidean algorithm. | 2 |
| 4331 | Find Greatest Common Divisor of 114 and 8, using prime factorization. | 2 |
| 4332 | Find Greatest Common Divisor of 46 and 12, using prime factorization. | 2 |
| 4333 | Find Greatest Common Divisor of 57 and 6, using prime factorization. | 2 |
| 4334 | Find Greatest Common Divisor of 875 and 100, using prime factorization. | 2 |
| 4335 | Find Greatest Common Divisor of 84 and 33, using Euclidean algorithm. | 2 |
| 4336 | Find Greatest Common Divisor of 1340 and 1340, using prime factorization. | 2 |
| 4337 | Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm. | 2 |
| 4338 | Find Greatest Common Divisor of 84 and 96, using prime factorization. | 2 |
| 4339 | Find Greatest Common Divisor of 165, 45 and 5, using prime factorization. | 2 |
| 4340 | Find Greatest Common Divisor of 5 and 288, using prime factorization. | 2 |
| 4341 | Find Greatest Common Divisor of 250 and 134, using prime factorization. | 2 |
| 4342 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using Euclidean algorithm. | 2 |
| 4343 | Find Greatest Common Divisor of 889 and 246, using Euclidean algorithm. | 2 |
| 4344 | Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm. | 2 |
| 4345 | Find Greatest Common Divisor of 357 and 476, using prime factorization. | 2 |
| 4346 | Find Greatest Common Divisor of 585 and 169, using Euclidean algorithm. | 2 |
| 4347 | Find Greatest Common Divisor of 12 and 24, using Euclidean algorithm. | 2 |
| 4348 | Find Greatest Common Divisor of 1 and 7, using Euclidean algorithm. | 2 |
| 4349 | Find Greatest Common Divisor of 132 and 100, using prime factorization. | 2 |
| 4350 | Find Greatest Common Divisor of 720 and 588, using Euclidean algorithm. | 2 |