GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6901 | Find Greatest Common Divisor of 3, 2, 5 and 2, using prime factorization. | 1 |
| 6902 | Find Greatest Common Divisor of 664 and 220, using prime factorization. | 1 |
| 6903 | Find Greatest Common Divisor of 230 and 960, using prime factorization. | 1 |
| 6904 | Find Greatest Common Divisor of 5451 and 6059, using prime factorization. | 1 |
| 6905 | Find Greatest Common Divisor of 24 and 36, using repeated division. | 1 |
| 6906 | Find Greatest Common Divisor of 41387 and 22227, using prime factorization. | 1 |
| 6907 | Find Greatest Common Divisor of 33 and 55, using prime factorization. | 1 |
| 6908 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization. | 1 |
| 6909 | Find Greatest Common Divisor of 11111111 and 111111111, using prime factorization. | 1 |
| 6910 | Find Greatest Common Divisor of 11111111, 111111111, 1111111111 and 1111111111, using prime factorization. | 1 |
| 6911 | Find Greatest Common Divisor of 11111111, 111111111, 1111111111 and 11111111111, using prime factorization. | 1 |
| 6912 | Find Greatest Common Divisor of 1111111, 11111111, 111111111 and 1111111111, using prime factorization. | 1 |
| 6913 | Find Greatest Common Divisor of 292 and 385, using prime factorization. | 1 |
| 6914 | Find Greatest Common Divisor of 4697 and 2030, using prime factorization. | 1 |
| 6915 | Find Greatest Common Divisor of 81719 and 52003, using Euclidean algorithm. | 1 |
| 6916 | Find Greatest Common Divisor of 11 and 832, using Euclidean algorithm. | 1 |
| 6917 | Find Greatest Common Divisor of 11284 and 9765, using prime factorization. | 1 |
| 6918 | Find Greatest Common Divisor of 493 and 960, using prime factorization. | 1 |
| 6919 | Find Greatest Common Divisor of 1754 and 1275, using prime factorization. | 1 |
| 6920 | Find Greatest Common Divisor of 3, 2 and 7, using prime factorization. | 1 |
| 6921 | Find Greatest Common Divisor of 27, 18 and 54, using prime factorization. | 1 |
| 6922 | Find Greatest Common Divisor of 42 and 210, using Euclidean algorithm. | 1 |
| 6923 | Find Greatest Common Divisor of 42 and 210, using repeated division. | 1 |
| 6924 | Find Greatest Common Divisor of 210 and 42, using Euclidean algorithm. | 1 |
| 6925 | Find Greatest Common Divisor of 210 and 42, using prime factorization. | 1 |
| 6926 | Find Greatest Common Divisor of 3568 and 1601, using Euclidean algorithm. | 1 |
| 6927 | Find Greatest Common Divisor of 3568 and 1604, using Euclidean algorithm. | 1 |
| 6928 | Find Greatest Common Divisor of 800, 500, 300 and 1000, using Euclidean algorithm. | 1 |
| 6929 | Find Greatest Common Divisor of 840, 500, 310 and 1000, by listing out the factors. | 1 |
| 6930 | Find Greatest Common Divisor of 51 and 6, by listing out the factors. | 1 |
| 6931 | Find Greatest Common Divisor of 48 and 72, using repeated division. | 1 |
| 6932 | Find Greatest Common Divisor of 42 and 66, using repeated division. | 1 |
| 6933 | Find Greatest Common Divisor of 105 and 135, using repeated division. | 1 |
| 6934 | Find Greatest Common Divisor of 320 and 560, using repeated division. | 1 |
| 6935 | Find Greatest Common Divisor of 838 and 21, using prime factorization. | 1 |
| 6936 | Find Greatest Common Divisor of 838 and 24, using prime factorization. | 1 |
| 6937 | Find Greatest Common Divisor of 838 and 172, using prime factorization. | 1 |
| 6938 | Find Greatest Common Divisor of 831 and 178, using Euclidean algorithm. | 1 |
| 6939 | Find Greatest Common Divisor of 42 and 85, using repeated division. | 1 |
| 6940 | Find Greatest Common Divisor of 1234567 and 7654321, using prime factorization. | 1 |
| 6941 | Find Greatest Common Divisor of 1234567 and 7654321, by listing out the factors. | 1 |
| 6942 | Find Greatest Common Divisor of 183 and 34, using Euclidean algorithm. | 1 |
| 6943 | Find Greatest Common Divisor of 183 and 68, using Euclidean algorithm. | 1 |
| 6944 | Find Greatest Common Divisor of 288 and 39, using prime factorization. | 1 |
| 6945 | Find Greatest Common Divisor of 288 and 39, using Euclidean algorithm. | 1 |
| 6946 | Find Greatest Common Divisor of 288 and 39, using Euclidean algorithm. | 1 |
| 6947 | Find Greatest Common Divisor of 298 and 31, using Euclidean algorithm. | 1 |
| 6948 | Find Greatest Common Divisor of 298 and 37, using Euclidean algorithm. | 1 |
| 6949 | Find Greatest Common Divisor of 298 and 57, using Euclidean algorithm. | 1 |
| 6950 | Find Greatest Common Divisor of 298 and 74, using Euclidean algorithm. | 1 |
