GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5901 | Find Greatest Common Divisor of 3499 and 697, using prime factorization. | 1 |
| 5902 | Find Greatest Common Divisor of 5981 and 731, using Euclidean algorithm. | 1 |
| 5903 | Find Greatest Common Divisor of 5981 and 735, using Euclidean algorithm. | 1 |
| 5904 | Find Greatest Common Divisor of 5981 and 739, using Euclidean algorithm. | 1 |
| 5905 | Find Greatest Common Divisor of 5981 and 734, using Euclidean algorithm. | 1 |
| 5906 | Find Greatest Common Divisor of 3028 and 1518, using Euclidean algorithm. | 1 |
| 5907 | Find Greatest Common Divisor of 753 and 33, using prime factorization. | 1 |
| 5908 | Find Greatest Common Divisor of 753 and 33, using Euclidean algorithm. | 1 |
| 5909 | Find Greatest Common Divisor of 10 and 5, using Euclidean algorithm. | 1 |
| 5910 | Find Greatest Common Divisor of 7 and 2, using prime factorization. | 1 |
| 5911 | Find Greatest Common Divisor of 58 and 52, using prime factorization. | 1 |
| 5912 | Find Greatest Common Divisor of 1029 and 588, using prime factorization. | 1 |
| 5913 | Find Greatest Common Divisor of 44 and 26, using Euclidean algorithm. | 1 |
| 5914 | Find Greatest Common Divisor of 3123 and 64312, using prime factorization. | 1 |
| 5915 | Find Greatest Common Divisor of 32242 and 42, using prime factorization. | 1 |
| 5916 | Find Greatest Common Divisor of 1133904600 and 4294967297, using prime factorization. | 1 |
| 5917 | Find Greatest Common Divisor of 1133870630 and 4294967297, using prime factorization. | 1 |
| 5918 | Find Greatest Common Divisor of 59292 and 4294967297, using prime factorization. | 1 |
| 5919 | Find Greatest Common Divisor of 3515897028 and 4294967297, using prime factorization. | 1 |
| 5920 | Find Greatest Common Divisor of 1114067885 and 4294967297, using prime factorization. | 1 |
| 5921 | Find Greatest Common Divisor of 1114067645 and 4294967297, using prime factorization. | 1 |
| 5922 | Find Greatest Common Divisor of 1114008593 and 4294967297, using prime factorization. | 1 |
| 5923 | Find Greatest Common Divisor of 48 and 44, using repeated division. | 1 |
| 5924 | Find Greatest Common Divisor of 48 and 44, using Euclidean algorithm. | 1 |
| 5925 | Find Greatest Common Divisor of 53540 and 11553, using Euclidean algorithm. | 1 |
| 5926 | Find Greatest Common Divisor of 89 and 144, using prime factorization. | 1 |
| 5927 | Find Greatest Common Divisor of 89 and 144, using Euclidean algorithm. | 1 |
| 5928 | Find Greatest Common Divisor of 99 and 144, using Euclidean algorithm. | 1 |
| 5929 | Find Greatest Common Divisor of 12, 16 and 18, using prime factorization. | 1 |
| 5930 | Find Greatest Common Divisor of 357 and 234, using prime factorization. | 1 |
| 5931 | Find Greatest Common Divisor of 364 and 431, using prime factorization. | 1 |
| 5932 | Find Greatest Common Divisor of 88 and 58, using repeated division. | 1 |
| 5933 | Find Greatest Common Divisor of 150 and 100, by listing out the factors. | 1 |
| 5934 | Find Greatest Common Divisor of 36 and 24, by listing out the factors. | 1 |
| 5935 | Find Greatest Common Divisor of 33 and 21, using prime factorization. | 1 |
| 5936 | Find Greatest Common Divisor of 30 and 70, using prime factorization. | 1 |
| 5937 | Find Greatest Common Divisor of 30 and 70, using Euclidean algorithm. | 1 |
| 5938 | Find Greatest Common Divisor of 6, 8 and 12, using prime factorization. | 1 |
| 5939 | Find Greatest Common Divisor of 26 and 44, using prime factorization. | 1 |
| 5940 | Find Greatest Common Divisor of 48 and 56, using repeated division. | 1 |
| 5941 | Find Greatest Common Divisor of 16 and 10, by listing out the factors. | 1 |
| 5942 | Find Greatest Common Divisor of 45 and 54, by listing out the factors. | 1 |
| 5943 | Find Greatest Common Divisor of 45 and 54, using prime factorization. | 1 |
| 5944 | Find Greatest Common Divisor of 54 and 45, using repeated division. | 1 |
| 5945 | Find Greatest Common Divisor of 3, 8, 6 and 2, using prime factorization. | 1 |
| 5946 | Find Greatest Common Divisor of 3, 8, 6 and 2, using repeated division. | 1 |
| 5947 | Find Greatest Common Divisor of 3, 8, 6 and 2, using Euclidean algorithm. | 1 |
| 5948 | Find Greatest Common Divisor of 3, 8, 6 and 2, by listing out the factors. | 1 |
| 5949 | Find Greatest Common Divisor of 2, 9, 5 and 6, by listing out the factors. | 1 |
| 5950 | Find Greatest Common Divisor of 7 and 135, using prime factorization. | 1 |
