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 1003 and 708, using prime factorization. | 2 |
| 4952 | Find Greatest Common Divisor of 1487 and 987, using prime factorization. | 2 |
| 4953 | Find Greatest Common Divisor of 1032 and 502, using prime factorization. | 2 |
| 4954 | Find Greatest Common Divisor of 1203 and 743, using prime factorization. | 2 |
| 4955 | Find Greatest Common Divisor of 1112 and 836, using prime factorization. | 2 |
| 4956 | Find Greatest Common Divisor of 1252 and 537, using prime factorization. | 2 |
| 4957 | Find Greatest Common Divisor of 1392 and 528, using prime factorization. | 2 |
| 4958 | Find Greatest Common Divisor of 1056 and 504, using prime factorization. | 2 |
| 4959 | Find Greatest Common Divisor of 1458 and 582, using prime factorization. | 2 |
| 4960 | Find Greatest Common Divisor of 1008 and 502, using prime factorization. | 2 |
| 4961 | Find Greatest Common Divisor of 12, 14 and 22, using repeated division. | 2 |
| 4962 | Find Greatest Common Divisor of 49, 21 and 72, using prime factorization. | 2 |
| 4963 | Find Greatest Common Divisor of 11 and 15, using prime factorization. | 2 |
| 4964 | Find Greatest Common Divisor of 14300 and 5915, using prime factorization. | 2 |
| 4965 | Find Greatest Common Divisor of 264 and 90, using prime factorization. | 2 |
| 4966 | Find Greatest Common Divisor of 25 and 150, using Euclidean algorithm. | 2 |
| 4967 | Find Greatest Common Divisor of 720 and 17, using prime factorization. | 2 |
| 4968 | Find Greatest Common Divisor of 720 and 17, using repeated division. | 2 |
| 4969 | Find Greatest Common Divisor of 13, 650 and 100, using prime factorization. | 2 |
| 4970 | Find Greatest Common Divisor of 3712 and 1472, using prime factorization. | 2 |
| 4971 | Find Greatest Common Divisor of 2 and 5, by listing out the factors. | 2 |
| 4972 | Find Greatest Common Divisor of 15 and 4, using Euclidean algorithm. | 2 |
| 4973 | Find Greatest Common Divisor of 98 and 49, using prime factorization. | 2 |
| 4974 | Find Greatest Common Divisor of 60 and 48, using prime factorization. | 2 |
| 4975 | Find Greatest Common Divisor of 3, 6 and 2, using prime factorization. | 2 |
| 4976 | Find Greatest Common Divisor of 270 and 450, using repeated division. | 2 |
| 4977 | Find Greatest Common Divisor of 850 and 35, using repeated division. | 2 |
| 4978 | Find Greatest Common Divisor of 17 and 60, by listing out the factors. | 2 |
| 4979 | Find Greatest Common Divisor of 168 and 378, using prime factorization. | 2 |
| 4980 | Find Greatest Common Divisor of 105 and 14, by listing out the factors. | 2 |
| 4981 | Find Greatest Common Divisor of 3962 and 1589, using Euclidean algorithm. | 2 |
| 4982 | Find Greatest Common Divisor of 3962 and 1859, using Euclidean algorithm. | 2 |
| 4983 | Find Greatest Common Divisor of 1 and 2, using repeated division. | 2 |
| 4984 | Find Greatest Common Divisor of 60 and 120, using repeated division. | 2 |
| 4985 | Find Greatest Common Divisor of 45, 80, 60, 35 and 20, using prime factorization. | 2 |
| 4986 | Find Greatest Common Divisor of 1071 and 482, using Euclidean algorithm. | 2 |
| 4987 | Find Greatest Common Divisor of 5445 and 2550, using Euclidean algorithm. | 2 |
| 4988 | Find Greatest Common Divisor of 3911 and 2999, using Euclidean algorithm. | 2 |
| 4989 | Find Greatest Common Divisor of 10256 and 5420, using Euclidean algorithm. | 2 |
| 4990 | Find Greatest Common Divisor of 1021 and 993121, using prime factorization. | 2 |
| 4991 | Find Greatest Common Divisor of 40 and 18, using prime factorization. | 2 |
| 4992 | Find Greatest Common Divisor of 9 and 49, using prime factorization. | 2 |
| 4993 | Find Greatest Common Divisor of 1236 and 30, by listing out the factors. | 2 |
| 4994 | Find Greatest Common Divisor of 40, 20 and 30, using repeated division. | 2 |
| 4995 | Find Greatest Common Divisor of 33 and 185, using prime factorization. | 2 |
| 4996 | Find Greatest Common Divisor of 825, 1245 and 0, using prime factorization. | 2 |
| 4997 | | 2 |
| 4998 | Find Greatest Common Divisor of 1190 and 1445, using prime factorization. | 2 |
| 4999 | Find Greatest Common Divisor of 78 and 117, using repeated division. | 2 |
| 5000 | Find Greatest Common Divisor of 225 and 90, using Euclidean algorithm. | 2 |