GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6101 | Find Greatest Common Divisor of 60 and 100, using repeated division. | 1 |
| 6102 | Find Greatest Common Divisor of 627 and 19, using prime factorization. | 1 |
| 6103 | Find Greatest Common Divisor of 627 and 19, using Euclidean algorithm. | 1 |
| 6104 | Find Greatest Common Divisor of 133 and 38, using repeated division. | 1 |
| 6105 | Find Greatest Common Divisor of 133 and 28, using repeated division. | 1 |
| 6106 | Find Greatest Common Divisor of 18, 24 and 12, using repeated division. | 1 |
| 6107 | Find Greatest Common Divisor of 18, 24 and 12, using Euclidean algorithm. | 1 |
| 6108 | Find Greatest Common Divisor of 18, 24 and 12, by listing out the factors. | 1 |
| 6109 | Find Greatest Common Divisor of 5504 and 385, using Euclidean algorithm. | 1 |
| 6110 | Find Greatest Common Divisor of 45 and 33, using Euclidean algorithm. | 1 |
| 6111 | Find Greatest Common Divisor of 31 and 17, using Euclidean algorithm. | 1 |
| 6112 | Find Greatest Common Divisor of 401 and 700, using prime factorization. | 1 |
| 6113 | Find Greatest Common Divisor of 121 and 81, using Euclidean algorithm. | 1 |
| 6114 | Find Greatest Common Divisor of 121, 645, 100, 408, 832, 19, 2, 432, 902, 8, 176, 640 and 19, using prime factorization. | 1 |
| 6115 | Find Greatest Common Divisor of 121, 645, 100, 408, 832, 19, 2, 432, 902, 8, 176, 640 and 19, using Euclidean algorithm. | 1 |
| 6116 | Find Greatest Common Divisor of 121645100408832019 and 2432902008176640019, using Euclidean algorithm. | 1 |
| 6117 | Find Greatest Common Divisor of 119 and 43, using Euclidean algorithm. | 1 |
| 6118 | Find Greatest Common Divisor of 24 and 80, using Euclidean algorithm. | 1 |
| 6119 | Find Greatest Common Divisor of 2024 and 1277, using repeated division. | 1 |
| 6120 | Find Greatest Common Divisor of 36 and 121, using prime factorization. | 1 |
| 6121 | Find Greatest Common Divisor of 8400 and 6816, using repeated division. | 1 |
| 6122 | Find Greatest Common Divisor of 1547 and 560, using Euclidean algorithm. | 1 |
| 6123 | Find Greatest Common Divisor of 120 and 22, using prime factorization. | 1 |
| 6124 | Find Greatest Common Divisor of 18, 19 and 22, using prime factorization. | 1 |
| 6125 | Find Greatest Common Divisor of 9, 12 and 21, using prime factorization. | 1 |
| 6126 | Find Greatest Common Divisor of 4480 and 1000, using prime factorization. | 1 |
| 6127 | Find Greatest Common Divisor of 36, 72 and 102, using prime factorization. | 1 |
| 6128 | Find Greatest Common Divisor of 503, 1101 and 2002, using prime factorization. | 1 |
| 6129 | Find Greatest Common Divisor of 544 and 212, using Euclidean algorithm. | 1 |
| 6130 | Find Greatest Common Divisor of 4 and 1, using Euclidean algorithm. | 1 |
| 6131 | Find Greatest Common Divisor of 4480 and 1000, by listing out the factors. | 1 |
| 6132 | Find Greatest Common Divisor of 4, 3, 8, 2, 20, 24, 2, 3, 18, 2, 46 and 30, using prime factorization. | 1 |
| 6133 | Find Greatest Common Divisor of 49 and 620, using Euclidean algorithm. | 1 |
| 6134 | Find Greatest Common Divisor of 91 and 267, using Euclidean algorithm. | 1 |
| 6135 | Find Greatest Common Divisor of 18, 12 and 24, using prime factorization. | 1 |
| 6136 | Find Greatest Common Divisor of 3 and 26, using Euclidean algorithm. | 1 |
| 6137 | Find Greatest Common Divisor of 60 and 17, using Euclidean algorithm. | 1 |
| 6138 | Find Greatest Common Divisor of 23 and 18, using prime factorization. | 1 |
| 6139 | Find Greatest Common Divisor of 8496 and 5234, using Euclidean algorithm. | 1 |
| 6140 | Find Greatest Common Divisor of 239 and 5, using Euclidean algorithm. | 1 |
| 6141 | Find Greatest Common Divisor of 3567986 and 61063, using prime factorization. | 1 |
| 6142 | Find Greatest Common Divisor of 30 and 8, using Euclidean algorithm. | 1 |
| 6143 | Find Greatest Common Divisor of 311 and 1679, using prime factorization. | 1 |
| 6144 | Find Greatest Common Divisor of 97 and 256, using prime factorization. | 1 |
| 6145 | Find Greatest Common Divisor of 10, 20, 6 and 30, using prime factorization. | 1 |
| 6146 | Find Greatest Common Divisor of 2024 and 1054, using prime factorization. | 1 |
| 6147 | Find Greatest Common Divisor of 2024 and 1054, using Euclidean algorithm. | 1 |
| 6148 | Find Greatest Common Divisor of 252 and 356, using Euclidean algorithm. | 1 |
| 6149 | Find Greatest Common Divisor of 1219936 and 642401, using prime factorization. | 1 |
| 6150 | Find Greatest Common Divisor of 2, 100, 1, 2, 91 and 1, using Euclidean algorithm. | 1 |
