GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6651 | Find Greatest Common Divisor of 21 and 64, using prime factorization. | 1 |
| 6652 | Find Greatest Common Divisor of 31 and 55, using prime factorization. | 1 |
| 6653 | Find Greatest Common Divisor of 2020 and 3201, using Euclidean algorithm. | 1 |
| 6654 | Find Greatest Common Divisor of 662. | 1 |
| 6655 | Find Greatest Common Divisor of 414. | 1 |
| 6656 | Find Greatest Common Divisor of 12 and 232, using prime factorization. | 1 |
| 6657 | Find Greatest Common Divisor of 9436 and 100, using prime factorization. | 1 |
| 6658 | Find Greatest Common Divisor of 5 and 95, using prime factorization. | 1 |
| 6659 | Find Greatest Common Divisor of 2 and 7, using prime factorization. | 1 |
| 6660 | Find Greatest Common Divisor of 252 and 8, using prime factorization. | 1 |
| 6661 | Find Greatest Common Divisor of 13 and 78, using prime factorization. | 1 |
| 6662 | Find Greatest Common Divisor of 9 and 81, using prime factorization. | 1 |
| 6663 | Find Greatest Common Divisor of 154 and 8, using prime factorization. | 1 |
| 6664 | Find Greatest Common Divisor of 124523 and 526387932, using prime factorization. | 1 |
| 6665 | Find Greatest Common Divisor of 253704 and 22909068, using prime factorization. | 1 |
| 6666 | Find Greatest Common Divisor of 6850008 and 22909068, using prime factorization. | 1 |
| 6667 | Find Greatest Common Divisor of 0, 0 and 5, using prime factorization. | 1 |
| 6668 | Find Greatest Common Divisor of 1993. | 1 |
| 6669 | Find Greatest Common Divisor of 21 and 140, using prime factorization. | 1 |
| 6670 | Find Greatest Common Divisor of 620 and 520, using prime factorization. | 1 |
| 6671 | Find Greatest Common Divisor of 640 and 49, using prime factorization. | 1 |
| 6672 | Find Greatest Common Divisor of 612 and 429, using prime factorization. | 1 |
| 6673 | Find Greatest Common Divisor of 612 and 429, using Euclidean algorithm. | 1 |
| 6674 | Find Greatest Common Divisor of 71 and 9, using repeated division. | 1 |
| 6675 | Find Greatest Common Divisor of 71 and 9, using prime factorization. | 1 |
| 6676 | Find Greatest Common Divisor of 123456789012345678 and 987654321098765432, using Euclidean algorithm. | 1 |
| 6677 | Find Greatest Common Divisor of 339 and 60, using prime factorization. | 1 |
| 6678 | Find Greatest Common Divisor of 0 and 5713, using Euclidean algorithm. | 1 |
| 6679 | Find Greatest Common Divisor of 24 and 213, using prime factorization. | 1 |
| 6680 | Find Greatest Common Divisor of 2343452, 456 and 31, using repeated division. | 1 |
| 6681 | Find Greatest Common Divisor of 250 and 210, using prime factorization. | 1 |
| 6682 | Find Greatest Common Divisor of 710 and 310, using repeated division. | 1 |
| 6683 | Find Greatest Common Divisor of 270 and 172, using Euclidean algorithm. | 1 |
| 6684 | Find Greatest Common Divisor of 500 and 193, using Euclidean algorithm. | 1 |
| 6685 | Find Greatest Common Divisor of 8 and 144, using Euclidean algorithm. | 1 |
| 6686 | Find Greatest Common Divisor of 4246, 4120, 4142 and 4194, using Euclidean algorithm. | 1 |
| 6687 | Find Greatest Common Divisor of 4246, 4120, 4142 and 4194, using repeated division. | 1 |
| 6688 | Find Greatest Common Divisor of 100000 and 45000, using prime factorization. | 1 |
| 6689 | Find Greatest Common Divisor of 484 and 720, using prime factorization. | 1 |
| 6690 | Find Greatest Common Divisor of 198 and 72, using Euclidean algorithm. | 1 |
| 6691 | Find Greatest Common Divisor of 86 and 120, using prime factorization. | 1 |
| 6692 | Find Greatest Common Divisor of 67 and 119, using Euclidean algorithm. | 1 |
