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 41, 80 and 16, using prime factorization. | 1 |
| 6902 | Find Greatest Common Divisor of 91, 65 and 80, using prime factorization. | 1 |
| 6903 | Find Greatest Common Divisor of 65, 16 and 69, using prime factorization. | 1 |
| 6904 | Find Greatest Common Divisor of 16, 10 and 62, using prime factorization. | 1 |
| 6905 | Find Greatest Common Divisor of 13, 94 and 56, using prime factorization. | 1 |
| 6906 | Find Greatest Common Divisor of 257590. | 1 |
| 6907 | Find Greatest Common Divisor of 29, 27 and 63, using prime factorization. | 1 |
| 6908 | Find Greatest Common Divisor of 75, 63 and 50, using prime factorization. | 1 |
| 6909 | Find Greatest Common Divisor of 45, 83 and 79, using repeated division. | 1 |
| 6910 | Find Greatest Common Divisor of 45, 83 and 79, by listing out the factors. | 1 |
| 6911 | Find Greatest Common Divisor of 75 and 50, using Euclidean algorithm. | 1 |
| 6912 | Find Greatest Common Divisor of 90 and 53, using Euclidean algorithm. | 1 |
| 6913 | Find Greatest Common Divisor of 82 and 72, using Euclidean algorithm. | 1 |
| 6914 | Find Greatest Common Divisor of 46 and 32, using Euclidean algorithm. | 1 |
| 6915 | Find Greatest Common Divisor of 52 and 83, using Euclidean algorithm. | 1 |
| 6916 | Find Greatest Common Divisor of 81 and 64, using Euclidean algorithm. | 1 |
| 6917 | Find Greatest Common Divisor of 2 and 67, using Euclidean algorithm. | 1 |
| 6918 | Find Greatest Common Divisor of 55 and 33, using Euclidean algorithm. | 1 |
| 6919 | Find Greatest Common Divisor of 59 and 27, using Euclidean algorithm. | 1 |
| 6920 | Find Greatest Common Divisor of 16 and 72, using Euclidean algorithm. | 1 |
| 6921 | Find Greatest Common Divisor of 72 and 51, using Euclidean algorithm. | 1 |
| 6922 | Find Greatest Common Divisor of 30 and 75, using Euclidean algorithm. | 1 |
| 6923 | Find Greatest Common Divisor of 73 and 60, using Euclidean algorithm. | 1 |
| 6924 | Find Greatest Common Divisor of 38 and 15, using Euclidean algorithm. | 1 |
| 6925 | Find Greatest Common Divisor of 24 and 44, using Euclidean algorithm. | 1 |
| 6926 | Find Greatest Common Divisor of 5344 and 14, using Euclidean algorithm. | 1 |
| 6927 | Find Greatest Common Divisor of 54 and 16, using Euclidean algorithm. | 1 |
| 6928 | Find Greatest Common Divisor of 46 and 35, using Euclidean algorithm. | 1 |
| 6929 | Find Greatest Common Divisor of 97 and 56, using Euclidean algorithm. | 1 |
| 6930 | Find Greatest Common Divisor of 13 and 51, using Euclidean algorithm. | 1 |
| 6931 | Find Greatest Common Divisor of 53 and 31, using Euclidean algorithm. | 1 |
| 6932 | Find Greatest Common Divisor of 51 and 40, using Euclidean algorithm. | 1 |
| 6933 | Find Greatest Common Divisor of 31 and 51, using Euclidean algorithm. | 1 |
| 6934 | Find Greatest Common Divisor of 83 and 39, using Euclidean algorithm. | 1 |
| 6935 | Find Greatest Common Divisor of 67 and 37, using Euclidean algorithm. | 1 |
| 6936 | Find Greatest Common Divisor of 90, 52 and 1, by listing out the factors. | 1 |
| 6937 | Find Greatest Common Divisor of 28 and 54, using Euclidean algorithm. | 1 |
| 6938 | Find Greatest Common Divisor of 22 and 46, using Euclidean algorithm. | 1 |
| 6939 | Find Greatest Common Divisor of 32 and 74, using Euclidean algorithm. | 1 |
| 6940 | Find Greatest Common Divisor of 98 and 62, using Euclidean algorithm. | 1 |
| 6941 | Find Greatest Common Divisor of 82 and 60, using Euclidean algorithm. | 1 |
| 6942 | Find Greatest Common Divisor of 96 and 62, using Euclidean algorithm. | 1 |
| 6943 | Find Greatest Common Divisor of 35 and 47, using Euclidean algorithm. | 1 |
| 6944 | Find Greatest Common Divisor of 72 and 44, using Euclidean algorithm. | 1 |
| 6945 | Find Greatest Common Divisor of 16 and 23, using Euclidean algorithm. | 1 |
| 6946 | Find Greatest Common Divisor of 14 and 60, using Euclidean algorithm. | 1 |
| 6947 | Find Greatest Common Divisor of 14 and 83, using Euclidean algorithm. | 1 |
| 6948 | Find Greatest Common Divisor of 301981 and 449573, using repeated division. | 1 |
| 6949 | Find Greatest Common Divisor of 393 and 655, using prime factorization. | 1 |
| 6950 | Find Greatest Common Divisor of 91 and 89, using Euclidean algorithm. | 1 |