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 3, 184, 4, 776, 7 and 960, using prime factorization. | 1 |
| 5902 | Find Greatest Common Divisor of 283 and 172, using prime factorization. | 1 |
| 5903 | Find Greatest Common Divisor of 283 and 172, using Euclidean algorithm. | 1 |
| 5904 | Find Greatest Common Divisor of 2026 and 251, using Euclidean algorithm. | 1 |
| 5905 | Find Greatest Common Divisor of 2064 and 251, using Euclidean algorithm. | 1 |
| 5906 | Find Greatest Common Divisor of 251 and 73, using Euclidean algorithm. | 1 |
| 5907 | Find Greatest Common Divisor of 251 and 75, using Euclidean algorithm. | 1 |
| 5908 | Find Greatest Common Divisor of 461 and 57, using Euclidean algorithm. | 1 |
| 5909 | Find Greatest Common Divisor of 462 and 58, using Euclidean algorithm. | 1 |
| 5910 | Find Greatest Common Divisor of 394 and 58, using Euclidean algorithm. | 1 |
| 5911 | Find Greatest Common Divisor of 399 and 58, using Euclidean algorithm. | 1 |
| 5912 | Find Greatest Common Divisor of 399 and 57, using Euclidean algorithm. | 1 |
| 5913 | Find Greatest Common Divisor of 613 and 97, using Euclidean algorithm. | 1 |
| 5914 | Find Greatest Common Divisor of 513 and 81, using Euclidean algorithm. | 1 |
| 5915 | Find Greatest Common Divisor of 513 and 83, using Euclidean algorithm. | 1 |
| 5916 | Find Greatest Common Divisor of 519 and 83, using Euclidean algorithm. | 1 |
| 5917 | Find Greatest Common Divisor of 581 and 26, using Euclidean algorithm. | 1 |
| 5918 | Find Greatest Common Divisor of 581 and 29, using Euclidean algorithm. | 1 |
| 5919 | Find Greatest Common Divisor of 581 and 57, using Euclidean algorithm. | 1 |
| 5920 | Find Greatest Common Divisor of 581 and 47, using Euclidean algorithm. | 1 |
| 5921 | Find Greatest Common Divisor of 581 and 97, using Euclidean algorithm. | 1 |
| 5922 | Find Greatest Common Divisor of 588 and 92, using Euclidean algorithm. | 1 |
| 5923 | Find Greatest Common Divisor of 418 and 92, using Euclidean algorithm. | 1 |
| 5924 | Find Greatest Common Divisor of 416 and 92, using Euclidean algorithm. | 1 |
| 5925 | Find Greatest Common Divisor of 516 and 94, using Euclidean algorithm. | 1 |
| 5926 | Find Greatest Common Divisor of 518 and 194, using Euclidean algorithm. | 1 |
| 5927 | Find Greatest Common Divisor of 518 and 172, using Euclidean algorithm. | 1 |
| 5928 | Find Greatest Common Divisor of 598 and 172, using Euclidean algorithm. | 1 |
| 5929 | Find Greatest Common Divisor of 1071 and 577, using Euclidean algorithm. | 1 |
| 5930 | Find Greatest Common Divisor of 1071 and 588, using Euclidean algorithm. | 1 |
| 5931 | Find Greatest Common Divisor of 128 and 34, using prime factorization. | 1 |
| 5932 | Find Greatest Common Divisor of 128 and 54, using Euclidean algorithm. | 1 |
| 5933 | Find Greatest Common Divisor of 875 and 288, using prime factorization. | 1 |
| 5934 | Find Greatest Common Divisor of 345 and 234, using repeated division. | 1 |
| 5935 | Find Greatest Common Divisor of 8466 and 7684, using prime factorization. | 1 |
| 5936 | Find Greatest Common Divisor of 1 and 26, using Euclidean algorithm. | 1 |
| 5937 | Find Greatest Common Divisor of 18769 and 327, using prime factorization. | 1 |
| 5938 | Find Greatest Common Divisor of 5264 and 15472, using repeated division. | 1 |
| 5939 | Find Greatest Common Divisor of 5264 and 15472, using Euclidean algorithm. | 1 |
| 5940 | Find Greatest Common Divisor of 7 and 120, using Euclidean algorithm. | 1 |
| 5941 | Find Greatest Common Divisor of 7 and 120, using repeated division. | 1 |
| 5942 | Find Greatest Common Divisor of 65537. | 1 |
| 5943 | Find Greatest Common Divisor of 24, 26 and 50, using prime factorization. | 1 |
| 5944 | Find Greatest Common Divisor of 24, 26 and 50, by listing out the factors. | 1 |
| 5945 | Find Greatest Common Divisor of 201, 27 and 90, by listing out the factors. | 1 |
| 5946 | Find Greatest Common Divisor of 2, 6, 5351, 0, 5, 0, 71627, 7171, 5351, 5351, 1, 0, 716, 717071, 9738 and 9738, using prime factorization. | 1 |
| 5947 | Find Greatest Common Divisor of 2, 6, 5351, 0, 5, 0, 71627, 7171, 5351, 5351, 1, 0, 716, 717071, 5168 and 5168, using prime factorization. | 1 |
| 5948 | Find Greatest Common Divisor of 2, 6, 0, 71627, 7171, 4121, 4121, 1, 0, 716, 717071, 4121, 1213 and 1213, using prime factorization. | 1 |
| 5949 | Find Greatest Common Divisor of 2, 6, 0, 71627, 7171, 4121, 4121, 1, 0, 716, 717071, 4121, 3523 and 3523, using prime factorization. | 1 |
| 5950 | Find Greatest Common Divisor of 2, 6, 4962, 113, 98, 122, 113, 113, 4962, 4962, 49, 48, 113, 106, 113, 112, 113, 5453 and 5453, using prime factorization. | 1 |
