GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5801 | Find Greatest Common Divisor of 6850008 and 22909068, using prime factorization. | 1 |
| 5802 | Find Greatest Common Divisor of 0, 0 and 5, using prime factorization. | 1 |
| 5803 | Find Greatest Common Divisor of 1993. | 1 |
| 5804 | Find Greatest Common Divisor of 620 and 520, using prime factorization. | 1 |
| 5805 | Find Greatest Common Divisor of 640 and 49, using prime factorization. | 1 |
| 5806 | Find Greatest Common Divisor of 612 and 429, using prime factorization. | 1 |
| 5807 | Find Greatest Common Divisor of 612 and 429, using Euclidean algorithm. | 1 |
| 5808 | Find Greatest Common Divisor of 71 and 9, using repeated division. | 1 |
| 5809 | Find Greatest Common Divisor of 71 and 9, using prime factorization. | 1 |
| 5810 | Find Greatest Common Divisor of 123456789012345678 and 987654321098765432, using Euclidean algorithm. | 1 |
| 5811 | Find Greatest Common Divisor of 0 and 5713, using Euclidean algorithm. | 1 |
| 5812 | Find Greatest Common Divisor of 24 and 213, using prime factorization. | 1 |
| 5813 | Find Greatest Common Divisor of 2343452, 456 and 31, using repeated division. | 1 |
| 5814 | Find Greatest Common Divisor of 250 and 210, using prime factorization. | 1 |
| 5815 | Find Greatest Common Divisor of 710 and 310, using repeated division. | 1 |
| 5816 | Find Greatest Common Divisor of 270 and 172, using Euclidean algorithm. | 1 |
| 5817 | Find Greatest Common Divisor of 500 and 193, using Euclidean algorithm. | 1 |
| 5818 | Find Greatest Common Divisor of 8 and 144, using Euclidean algorithm. | 1 |
| 5819 | Find Greatest Common Divisor of 4246, 4120, 4142 and 4194, using Euclidean algorithm. | 1 |
| 5820 | Find Greatest Common Divisor of 4246, 4120, 4142 and 4194, using repeated division. | 1 |
| 5821 | Find Greatest Common Divisor of 100000 and 45000, using prime factorization. | 1 |
| 5822 | Find Greatest Common Divisor of 484 and 720, using prime factorization. | 1 |
| 5823 | Find Greatest Common Divisor of 198 and 72, using Euclidean algorithm. | 1 |
| 5824 | Find Greatest Common Divisor of 67 and 119, using Euclidean algorithm. | 1 |
| 5825 | Find Greatest Common Divisor of 34 and 24, using prime factorization. | 1 |
| 5826 | Find Greatest Common Divisor of 14 and 14, using prime factorization. | 1 |
| 5827 | Find Greatest Common Divisor of 1344, 1856 and 2752, using repeated division. | 1 |
| 5828 | Find Greatest Common Divisor of 1344, 1856 and 2752, using prime factorization. | 1 |
| 5829 | Find Greatest Common Divisor of 33 and 72, using prime factorization. | 1 |
| 5830 | Find Greatest Common Divisor of 33 and 72, using Euclidean algorithm. | 1 |
| 5831 | Find Greatest Common Divisor of 33 and 72, by listing out the factors. | 1 |
| 5832 | Find Greatest Common Divisor of 7 and 5, using prime factorization. | 1 |
| 5833 | Find Greatest Common Divisor of 3, 2, 5 and 2, using prime factorization. | 1 |
| 5834 | Find Greatest Common Divisor of 664 and 220, using prime factorization. | 1 |
| 5835 | Find Greatest Common Divisor of 230 and 960, using prime factorization. | 1 |
| 5836 | Find Greatest Common Divisor of 5451 and 6059, using prime factorization. | 1 |
| 5837 | Find Greatest Common Divisor of 24 and 36, using repeated division. | 1 |
| 5838 | Find Greatest Common Divisor of 41387 and 22227, using prime factorization. | 1 |
| 5839 | Find Greatest Common Divisor of 33 and 55, using prime factorization. | 1 |
| 5840 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization. | 1 |
| 5841 | Find Greatest Common Divisor of 11111111 and 111111111, using prime factorization. | 1 |
| 5842 | Find Greatest Common Divisor of 11111111, 111111111, 1111111111 and 1111111111, using prime factorization. | 1 |
| 5843 | Find Greatest Common Divisor of 11111111, 111111111, 1111111111 and 11111111111, using prime factorization. | 1 |
| 5844 | Find Greatest Common Divisor of 1111111, 11111111, 111111111 and 1111111111, using prime factorization. | 1 |
| 5845 | Find Greatest Common Divisor of 292 and 385, using prime factorization. | 1 |
| 5846 | Find Greatest Common Divisor of 4697 and 2030, using prime factorization. | 1 |
| 5847 | Find Greatest Common Divisor of 81719 and 52003, using Euclidean algorithm. | 1 |
| 5848 | Find Greatest Common Divisor of 11 and 832, using Euclidean algorithm. | 1 |
| 5849 | Find Greatest Common Divisor of 11284 and 9765, using prime factorization. | 1 |
| 5850 | Find Greatest Common Divisor of 493 and 960, using prime factorization. | 1 |
