GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6801 | Find Greatest Common Divisor of 12 and 140, using repeated division. | 1 |
| 6802 | Find Greatest Common Divisor of 12 and 140, using prime factorization. | 1 |
| 6803 | Find Greatest Common Divisor of 73 and 245, using prime factorization. | 1 |
| 6804 | Find Greatest Common Divisor of 9 and 17, using prime factorization. | 1 |
| 6805 | Find Greatest Common Divisor of 21 and 7, using repeated division. | 1 |
| 6806 | Find Greatest Common Divisor of 222 and 54, using prime factorization. | 1 |
| 6807 | Find Greatest Common Divisor of 8, 14 and 16, using repeated division. | 1 |
| 6808 | Find Greatest Common Divisor of 72 and 108, using repeated division. | 1 |
| 6809 | Find Greatest Common Divisor of 6, 30 and 42, using repeated division. | 1 |
| 6810 | Find Greatest Common Divisor of 1400 and 600, using repeated division. | 1 |
| 6811 | Find Greatest Common Divisor of 39, 26, 52 and 24, using repeated division. | 1 |
| 6812 | Find Greatest Common Divisor of 25, 26, 27 and 30, using repeated division. | 1 |
| 6813 | Find Greatest Common Divisor of 350 and 123, using Euclidean algorithm. | 1 |
| 6814 | Find Greatest Common Divisor of 72 and 6, using prime factorization. | 1 |
| 6815 | Find Greatest Common Divisor of 72 and 7, using prime factorization. | 1 |
| 6816 | Find Greatest Common Divisor of 23 and 79, using prime factorization. | 1 |
| 6817 | Find Greatest Common Divisor of 3 and 8, by listing out the factors. | 1 |
| 6818 | Find Greatest Common Divisor of 902 and 412, using prime factorization. | 1 |
| 6819 | Find Greatest Common Divisor of 3192 and 2025, using prime factorization. | 1 |
| 6820 | Find Greatest Common Divisor of 1, 4 and 0, using prime factorization. | 1 |
| 6821 | Find Greatest Common Divisor of 2022 and 272, using prime factorization. | 1 |
| 6822 | Find Greatest Common Divisor of 13 and 60, using prime factorization. | 1 |
| 6823 | Find Greatest Common Divisor of 9 and 60, using prime factorization. | 1 |
| 6824 | Find Greatest Common Divisor of 24843 and 38675, using prime factorization. | 1 |
| 6825 | Find Greatest Common Divisor of 24843 and 38675, using Euclidean algorithm. | 1 |
| 6826 | Find Greatest Common Divisor of 667 and 29000, using prime factorization. | 1 |
| 6827 | Find Greatest Common Divisor of 16, 20 and 42, using prime factorization. | 1 |
| 6828 | Find Greatest Common Divisor of 131718 and 7241, using prime factorization. | 1 |
| 6829 | Find Greatest Common Divisor of 80045 and 5302, using Euclidean algorithm. | 1 |
| 6830 | Find Greatest Common Divisor of 912 and 1946, using Euclidean algorithm. | 1 |
| 6831 | Find Greatest Common Divisor of 1946 and 912, using Euclidean algorithm. | 1 |
| 6832 | Find Greatest Common Divisor of 1920 and 10, by listing out the factors. | 1 |
| 6833 | Find Greatest Common Divisor of 141 and 91, using Euclidean algorithm. | 1 |
| 6834 | Find Greatest Common Divisor of 12 and 34, using Euclidean algorithm. | 1 |
| 6835 | Find Greatest Common Divisor of 5388 and 5645, using prime factorization. | 1 |
| 6836 | Find Greatest Common Divisor of 352 and 528, using repeated division. | 1 |
| 6837 | Find Greatest Common Divisor of 24 and 42, using prime factorization. | 1 |
| 6838 | Find Greatest Common Divisor of 24 and 42, using Euclidean algorithm. | 1 |
| 6839 | Find Greatest Common Divisor of 98 and 140, using prime factorization. | 1 |
| 6840 | Find Greatest Common Divisor of 25 and 360, using prime factorization. | 1 |
| 6841 | Find Greatest Common Divisor of 18 and 75, using Euclidean algorithm. | 1 |
| 6842 | Find Greatest Common Divisor of 10642 and 3006, using Euclidean algorithm. | 1 |
| 6843 | Find Greatest Common Divisor of 1078 and 672, using prime factorization. | 1 |
| 6844 | Find Greatest Common Divisor of 1078 and 672, using Euclidean algorithm. | 1 |
| 6845 | Find Greatest Common Divisor of 2121567. | 1 |
| 6846 | Find Greatest Common Divisor of 2121 and 567, using Euclidean algorithm. | 1 |
| 6847 | Find Greatest Common Divisor of 68 and 23, using Euclidean algorithm. | 1 |
| 6848 | Find Greatest Common Divisor of 708 and 813, using Euclidean algorithm. | 1 |
| 6849 | Find Greatest Common Divisor of 140 and 72, using prime factorization. | 1 |
| 6850 | Find Greatest Common Divisor of 6, 7 and 9, using prime factorization. | 1 |