GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 7901 | Find Greatest Common Divisor of 9 and 38, using prime factorization. | 1 |
| 7902 | Find Greatest Common Divisor of 153 and 114, using Euclidean algorithm. | 1 |
| 7903 | Find Greatest Common Divisor of 10236 and 244, using prime factorization. | 1 |
| 7904 | Find Greatest Common Divisor of 199 and 991, using prime factorization. | 1 |
| 7905 | Find Greatest Common Divisor of 62839955 and 500000, using Euclidean algorithm. | 1 |
| 7906 | Find Greatest Common Divisor of 875 and 1000, by listing out the factors. | 1 |
| 7907 | Find Greatest Common Divisor of 875 and 1000, using repeated division. | 1 |
| 7908 | Find Greatest Common Divisor of 850 and 1000, using repeated division. | 1 |
| 7909 | Find Greatest Common Divisor of 14828 and 24486, using Euclidean algorithm. | 1 |
| 7910 | Find Greatest Common Divisor of 69 and 115, using prime factorization. | 1 |
| 7911 | Find Greatest Common Divisor of 720 and 1280, using prime factorization. | 1 |
| 7912 | Find Greatest Common Divisor of 505 and 1815, using prime factorization. | 1 |
| 7913 | Find Greatest Common Divisor of 4393 and 4181, using prime factorization. | 1 |
| 7914 | Find Greatest Common Divisor of 2447 and 4181, using prime factorization. | 1 |
| 7915 | Find Greatest Common Divisor of 6641 and 4181, using prime factorization. | 1 |
| 7916 | Find Greatest Common Divisor of 397 and 4181, using prime factorization. | 1 |
| 7917 | Find Greatest Common Divisor of 148 and 59, using Euclidean algorithm. | 1 |
| 7918 | Find Greatest Common Divisor of 2970 and 1260, using prime factorization. | 1 |
| 7919 | Find Greatest Common Divisor of 176 and 20, using prime factorization. | 1 |
| 7920 | Find Greatest Common Divisor of 190 and 24, using prime factorization. | 1 |
| 7921 | Find Greatest Common Divisor of 29 and 80, using Euclidean algorithm. | 1 |
| 7922 | Find Greatest Common Divisor of 8935 and 15, by listing out the factors. | 1 |
| 7923 | Find Greatest Common Divisor of 192 and 8, using Euclidean algorithm. | 1 |
| 7924 | Find Greatest Common Divisor of 192 and 3, using Euclidean algorithm. | 1 |
| 7925 | Find Greatest Common Divisor of 192 and 9, using Euclidean algorithm. | 1 |
| 7926 | Find Greatest Common Divisor of 192 and 7, using prime factorization. | 1 |
| 7927 | Find Greatest Common Divisor of 192 and 11, using prime factorization. | 1 |
| 7928 | Find Greatest Common Divisor of 9223372036854775807. | 1 |
| 7929 | Find Greatest Common Divisor of 72 and 45, using prime factorization. | 1 |
| 7930 | Find Greatest Common Divisor of 252 and 291, using Euclidean algorithm. | 1 |
| 7931 | Find Greatest Common Divisor of 117 and 845, using Euclidean algorithm. | 1 |
| 7932 | Find Greatest Common Divisor of 5387 and 133, using prime factorization. | 1 |
| 7933 | Find Greatest Common Divisor of 5387 and 133, using Euclidean algorithm. | 1 |
| 7934 | Find Greatest Common Divisor of 17 and 11, using Euclidean algorithm. | 1 |
| 7935 | Find Greatest Common Divisor of 223 and 48, using prime factorization. | 1 |
| 7936 | Find Greatest Common Divisor of 111111 and 11111, using Euclidean algorithm. | 1 |
| 7937 | Find Greatest Common Divisor of 192 and 19, using Euclidean algorithm. | 1 |
| 7938 | Find Greatest Common Divisor of 32 and 623, using Euclidean algorithm. | 1 |
| 7939 | Find Greatest Common Divisor of 32 and 263, using Euclidean algorithm. | 1 |
| 7940 | Find Greatest Common Divisor of 446 and 269, using Euclidean algorithm. | 1 |
| 7941 | Find Greatest Common Divisor of 12211 and 10422, using Euclidean algorithm. | 1 |
| 7942 | Find Greatest Common Divisor of 786 and 123, using Euclidean algorithm. | 1 |
| 7943 | Find Greatest Common Divisor of 2, 4, 3, 2, 5, 2, 2, 3, 5 and 2, using prime factorization. | 1 |
| 7944 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using prime factorization. | 1 |
| 7945 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, by listing out the factors. | 1 |
| 7946 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using Euclidean algorithm. | 1 |
| 7947 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using repeated division. | 1 |
| 7948 | Find Greatest Common Divisor of 150 and 51, using prime factorization. | 1 |
| 7949 | Find Greatest Common Divisor of 44, 32 and 54, using prime factorization. | 1 |
| 7950 | Find Greatest Common Divisor of 32756, 32758 and 32760, using prime factorization. | 1 |
