GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5001 | Find Greatest Common Divisor of 1112 and 1544, using Euclidean algorithm. | 1 |
| 5002 | Find Greatest Common Divisor of 45 and 36, using prime factorization. | 1 |
| 5003 | Find Greatest Common Divisor of 45 and 36, using repeated division. | 1 |
| 5004 | Find Greatest Common Divisor of 2, 25, 2 and 16, using prime factorization. | 1 |
| 5005 | Find Greatest Common Divisor of 48, 64 and 100, using prime factorization. | 1 |
| 5006 | Find Greatest Common Divisor of 790 and 169, using prime factorization. | 1 |
| 5007 | Find Greatest Common Divisor of 324 and 68, using Euclidean algorithm. | 1 |
| 5008 | Find Greatest Common Divisor of 12345 and 5040, using Euclidean algorithm. | 1 |
| 5009 | Find Greatest Common Divisor of 85672, 242 and 40, using Euclidean algorithm. | 1 |
| 5010 | Find Greatest Common Divisor of 750 and 900, using prime factorization. | 1 |
| 5011 | Find Greatest Common Divisor of 750 and 900, using Euclidean algorithm. | 1 |
| 5012 | Find Greatest Common Divisor of 4294 and 8023, using prime factorization. | 1 |
| 5013 | Find Greatest Common Divisor of 765 and 364, using Euclidean algorithm. | 1 |
| 5014 | Find Greatest Common Divisor of 888 and 11, using Euclidean algorithm. | 1 |
| 5015 | Find Greatest Common Divisor of 240 and 108, using prime factorization. | 1 |
| 5016 | Find Greatest Common Divisor of 1492 and 1066, using prime factorization. | 1 |
| 5017 | Find Greatest Common Divisor of 4999 and 1109, using Euclidean algorithm. | 1 |
| 5018 | Find Greatest Common Divisor of 83 and 47, using Euclidean algorithm. | 1 |
| 5019 | Find Greatest Common Divisor of 1732 and 5733, using prime factorization. | 1 |
| 5020 | Find Greatest Common Divisor of 17 and 220, using Euclidean algorithm. | 1 |
| 5021 | Find Greatest Common Divisor of 59840 and 85327, using prime factorization. | 1 |
| 5022 | Find Greatest Common Divisor of 85327 and 59840, using repeated division. | 1 |
| 5023 | Find Greatest Common Divisor of 240 and 180, using prime factorization. | 1 |
| 5024 | Find Greatest Common Divisor of 240 and 180, using repeated division. | 1 |
| 5025 | Find Greatest Common Divisor of 99, 198, 288 and 512, using repeated division. | 1 |
| 5026 | Find Greatest Common Divisor of 86 and 192, using prime factorization. | 1 |
| 5027 | Find Greatest Common Divisor of 7 and 5561, using Euclidean algorithm. | 1 |
| 5028 | Find Greatest Common Divisor of 81, 12 and 42, using prime factorization. | 1 |
| 5029 | Find Greatest Common Divisor of 7, 16 and 25, using prime factorization. | 1 |
| 5030 | Find Greatest Common Divisor of 6, 12 and 13, using prime factorization. | 1 |
| 5031 | Find Greatest Common Divisor of 10, 23 and 58, using prime factorization. | 1 |
| 5032 | Find Greatest Common Divisor of 27 and 15, using Euclidean algorithm. | 1 |
| 5033 | Find Greatest Common Divisor of 220 and 231, using prime factorization. | 1 |
| 5034 | Find Greatest Common Divisor of 16 and 56, using prime factorization. | 1 |
| 5035 | Find Greatest Common Divisor of 79981981272 and 8023, using Euclidean algorithm. | 1 |
| 5036 | Find Greatest Common Divisor of 2187 and 27, using prime factorization. | 1 |
| 5037 | Find Greatest Common Divisor of 15 and 11, using Euclidean algorithm. | 1 |
| 5038 | Find Greatest Common Divisor of 654160 and 51480, using prime factorization. | 1 |
| 5039 | Find Greatest Common Divisor of 60, 75 and 90, using repeated division. | 1 |
| 5040 | Find Greatest Common Divisor of 48, 92 and 140, using prime factorization. | 1 |
| 5041 | Find Greatest Common Divisor of 231 and 1575, using prime factorization. | 1 |
| 5042 | Find Greatest Common Divisor of 12344 and 15712, using Euclidean algorithm. | 1 |
| 5043 | Find Greatest Common Divisor of 28 and 35, by listing out the factors. | 1 |
| 5044 | Find Greatest Common Divisor of 216. | 1 |
| 5045 | Find Greatest Common Divisor of 60, 4 and 53, using prime factorization. | 1 |
| 5046 | Find Greatest Common Divisor of 120, 9 and 6, using prime factorization. | 1 |
| 5047 | Find Greatest Common Divisor of 256 and 248, using prime factorization. | 1 |
| 5048 | Find Greatest Common Divisor of 333 and 106, using Euclidean algorithm. | 1 |
| 5049 | Find Greatest Common Divisor of 233 and 144, using Euclidean algorithm. | 1 |
| 5050 | Find Greatest Common Divisor of 45 and 35, using Euclidean algorithm. | 1 |
