GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5051 | Find Greatest Common Divisor of 18170 and 13170, using Euclidean algorithm. | 1 |
| 5052 | Find Greatest Common Divisor of 18230 and 13230, using Euclidean algorithm. | 1 |
| 5053 | Find Greatest Common Divisor of 18250 and 13250, using Euclidean algorithm. | 1 |
| 5054 | Find Greatest Common Divisor of 18270 and 13270, using Euclidean algorithm. | 1 |
| 5055 | Find Greatest Common Divisor of 18310 and 13310, using Euclidean algorithm. | 1 |
| 5056 | Find Greatest Common Divisor of 18330 and 13330, using Euclidean algorithm. | 1 |
| 5057 | Find Greatest Common Divisor of 18370 and 13370, using Euclidean algorithm. | 1 |
| 5058 | Find Greatest Common Divisor of 18390 and 13390, using Euclidean algorithm. | 1 |
| 5059 | Find Greatest Common Divisor of 36, 144 and 200, using prime factorization. | 1 |
| 5060 | Find Greatest Common Divisor of 18430 and 13430, using Euclidean algorithm. | 1 |
| 5061 | Find Greatest Common Divisor of 18450 and 13450, using Euclidean algorithm. | 1 |
| 5062 | Find Greatest Common Divisor of 1152 and 1664, using prime factorization. | 1 |
| 5063 | Find Greatest Common Divisor of 315 and 270, using prime factorization. | 1 |
| 5064 | Find Greatest Common Divisor of 35 and 49, using prime factorization. | 1 |
| 5065 | Find Greatest Common Divisor of 35 and 49, by listing out the factors. | 1 |
| 5066 | Find Greatest Common Divisor of 35 and 49, using Euclidean algorithm. | 1 |
| 5067 | Find Greatest Common Divisor of 2 and 2, using Euclidean algorithm. | 1 |
| 5068 | Find Greatest Common Divisor of 63 and 735, using prime factorization. | 1 |
| 5069 | Find Greatest Common Divisor of 1029428750000 and 376476800, using prime factorization. | 1 |
| 5070 | Find Greatest Common Divisor of 9999 and 11111, using prime factorization. | 1 |
| 5071 | Find Greatest Common Divisor of 1276 and 873, using Euclidean algorithm. | 1 |
| 5072 | Find Greatest Common Divisor of 25. | 1 |
| 5073 | Find Greatest Common Divisor of 2071 and 206, using Euclidean algorithm. | 1 |
| 5074 | Find Greatest Common Divisor of 5, 965 and 1445, using prime factorization. | 1 |
| 5075 | Find Greatest Common Divisor of 192 and 5, using Euclidean algorithm. | 1 |
| 5076 | Find Greatest Common Divisor of 4788 and 31256, using prime factorization. | 1 |
| 5077 | Find Greatest Common Divisor of 8 and 98, using prime factorization. | 1 |
| 5078 | Find Greatest Common Divisor of 8 and 98, using repeated division. | 1 |
| 5079 | Find Greatest Common Divisor of 8 and 98, using Euclidean algorithm. | 1 |
| 5080 | Find Greatest Common Divisor of 8 and 98, by listing out the factors. | 1 |
| 5081 | Find Greatest Common Divisor of 8, 18 and 32, using repeated division. | 1 |
| 5082 | Find Greatest Common Divisor of 8, 18 and 32, using Euclidean algorithm. | 1 |
| 5083 | Find Greatest Common Divisor of 8, 18 and 32, by listing out the factors. | 1 |
| 5084 | Find Greatest Common Divisor of 7, 18 and 14, using prime factorization. | 1 |
| 5085 | Find Greatest Common Divisor of 50 and 60, using prime factorization. | 1 |
| 5086 | Find Greatest Common Divisor of 50 and 60, using Euclidean algorithm. | 1 |
| 5087 | Find Greatest Common Divisor of 43 and 17, using Euclidean algorithm. | 1 |
| 5088 | Find Greatest Common Divisor of 124 and 56, using Euclidean algorithm. | 1 |
| 5089 | Find Greatest Common Divisor of 144227 and 58483, using Euclidean algorithm. | 1 |
| 5090 | Find Greatest Common Divisor of 2017 and 1949, using prime factorization. | 1 |
| 5091 | Find Greatest Common Divisor of 1134 and 154, using Euclidean algorithm. | 1 |
| 5092 | Find Greatest Common Divisor of 2025 and 20025, using Euclidean algorithm. | 1 |
| 5093 | Find Greatest Common Divisor of 20025 and 200025, using Euclidean algorithm. | 1 |
| 5094 | Find Greatest Common Divisor of 146742024 and 46957680, using Euclidean algorithm. | 1 |
| 5095 | Find Greatest Common Divisor of 216 and 5, using Euclidean algorithm. | 1 |
| 5096 | Find Greatest Common Divisor of 779086434385541 and 91442056588823, using Euclidean algorithm. | 1 |
| 5097 | Find Greatest Common Divisor of 2576 and 943, using Euclidean algorithm. | 1 |
| 5098 | Find Greatest Common Divisor of 893 and 2432, using Euclidean algorithm. | 1 |
| 5099 | Find Greatest Common Divisor of 140 and 48, using Euclidean algorithm. | 1 |
| 5100 | Find Greatest Common Divisor of 229 and 7577561480, using Euclidean algorithm. | 1 |
