GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4951 | Find Greatest Common Divisor of 52 and 18, using Euclidean algorithm. | 1 |
| 4952 | Find Greatest Common Divisor of 486 and 52, using Euclidean algorithm. | 1 |
| 4953 | Find Greatest Common Divisor of 928 and 1220, using repeated division. | 1 |
| 4954 | Find Greatest Common Divisor of 2520 and 154, using prime factorization. | 1 |
| 4955 | Find Greatest Common Divisor of 2520 and 154, using Euclidean algorithm. | 1 |
| 4956 | Find Greatest Common Divisor of 11 and 19, using prime factorization. | 1 |
| 4957 | Find Greatest Common Divisor of 350 and 5500, using prime factorization. | 1 |
| 4958 | Find Greatest Common Divisor of 563 and 1391, using prime factorization. | 1 |
| 4959 | Find Greatest Common Divisor of 563 and 1391, using Euclidean algorithm. | 1 |
| 4960 | Find Greatest Common Divisor of 108, 144 and 276, using prime factorization. | 1 |
| 4961 | Find Greatest Common Divisor of 44350 and 20785, using prime factorization. | 1 |
| 4962 | Find Greatest Common Divisor of 42, 70 and 56, using prime factorization. | 1 |
| 4963 | Find Greatest Common Divisor of 96, 64 and 80, using prime factorization. | 1 |
| 4964 | Find Greatest Common Divisor of 84, 12 and 40, using prime factorization. | 1 |
| 4965 | Find Greatest Common Divisor of 34, 54 and 64, using prime factorization. | 1 |
| 4966 | Find Greatest Common Divisor of 7429 and 33649, using Euclidean algorithm. | 1 |
| 4967 | Find Greatest Common Divisor of 30107 and 437, using Euclidean algorithm. | 1 |
| 4968 | Find Greatest Common Divisor of 81719, 52003, 33649 and 30107, using prime factorization. | 1 |
| 4969 | Find Greatest Common Divisor of 23 and 4, using prime factorization. | 1 |
| 4970 | Find Greatest Common Divisor of 100 and 40, using prime factorization. | 1 |
| 4971 | Find Greatest Common Divisor of 10, 14 and 22, using prime factorization. | 1 |
| 4972 | Find Greatest Common Divisor of 6, 27 and 64, using prime factorization. | 1 |
| 4973 | Find Greatest Common Divisor of 560. | 1 |
| 4974 | Find Greatest Common Divisor of 560 and 196, using prime factorization. | 1 |
| 4975 | Find Greatest Common Divisor of 13 and 15, using prime factorization. | 1 |
| 4976 | Find Greatest Common Divisor of 123456789 and 123456788, using Euclidean algorithm. | 1 |
| 4977 | Find Greatest Common Divisor of 165 and 78, using prime factorization. | 1 |
| 4978 | Find Greatest Common Divisor of 5092 and 2768, using prime factorization. | 1 |
| 4979 | Find Greatest Common Divisor of 3, 100, 1, 3, 100 and 1, using Euclidean algorithm. | 1 |
| 4980 | Find Greatest Common Divisor of 500000001 and 5000001, using Euclidean algorithm. | 1 |
| 4981 | Find Greatest Common Divisor of 2024 and 1446, using Euclidean algorithm. | 1 |
| 4982 | Find Greatest Common Divisor of 1003 and 821, using Euclidean algorithm. | 1 |
| 4983 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization. | 1 |
| 4984 | Find Greatest Common Divisor of 99999999999999999 and 12, using prime factorization. | 1 |
| 4985 | Find Greatest Common Divisor of 3205. | 1 |
| 4986 | Find Greatest Common Divisor of 104 and 130, using prime factorization. | 1 |
| 4987 | Find Greatest Common Divisor of 400, 125 and 172, using prime factorization. | 1 |
| 4988 | Find Greatest Common Divisor of 11476 and 683, using Euclidean algorithm. | 1 |
| 4989 | Find Greatest Common Divisor of 2561124 and 46064, using Euclidean algorithm. | 1 |
| 4990 | Find Greatest Common Divisor of 17601969 and 2364768, using Euclidean algorithm. | 1 |
| 4991 | Find Greatest Common Divisor of 350 and 45, using Euclidean algorithm. | 1 |
| 4992 | Find Greatest Common Divisor of 2030 and 756, using prime factorization. | 1 |
| 4993 | Find Greatest Common Divisor of 8. | 1 |
| 4994 | Find Greatest Common Divisor of 662 and 404, using Euclidean algorithm. | 1 |
| 4995 | Find Greatest Common Divisor of 2079 and 825, using Euclidean algorithm. | 1 |
| 4996 | Find Greatest Common Divisor of 248 and 108, using prime factorization. | 1 |
| 4997 | Find Greatest Common Divisor of 19683 and 84, using prime factorization. | 1 |
| 4998 | Find Greatest Common Divisor of 22 and 58, using prime factorization. | 1 |
| 4999 | Find Greatest Common Divisor of 1252, 570 and 616, using prime factorization. | 1 |
| 5000 | Find Greatest Common Divisor of 82933 and 145393, using Euclidean algorithm. | 1 |
