GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2101 | Find Greatest Common Divisor of 3532 and 3288, using Euclidean algorithm. | 4 |
| 2102 | Find Greatest Common Divisor of 18, 24 and 12, using prime factorization. | 4 |
| 2103 | Find Greatest Common Divisor of 504 and 385, using prime factorization. | 4 |
| 2104 | Find Greatest Common Divisor of 1001 and 1331, using prime factorization. | 4 |
| 2105 | Find Greatest Common Divisor of 9888 and 6060, using prime factorization. | 4 |
| 2106 | Find Greatest Common Divisor of 12 and 15, by listing out the factors. | 4 |
| 2107 | Find Greatest Common Divisor of 91 and 287, using Euclidean algorithm. | 4 |
| 2108 | Find Greatest Common Divisor of 12 and 88, using Euclidean algorithm. | 4 |
| 2109 | Find Greatest Common Divisor of 15 and 88, using Euclidean algorithm. | 4 |
| 2110 | Find Greatest Common Divisor of 1529 and 14038, using Euclidean algorithm. | 4 |
| 2111 | Find Greatest Common Divisor of 11 and 72, using prime factorization. | 4 |
| 2112 | Find Greatest Common Divisor of 1022 and 400, using prime factorization. | 4 |
| 2113 | Find Greatest Common Divisor of 1 and 91, using prime factorization. | 4 |
| 2114 | Find Greatest Common Divisor of 48 and 88, using prime factorization. | 4 |
| 2115 | Find Greatest Common Divisor of 7, 62, 8 and 52, using prime factorization. | 4 |
| 2116 | Find Greatest Common Divisor of 2447 and 3997, using Euclidean algorithm. | 4 |
| 2117 | Find Greatest Common Divisor of 35 and 14, using Euclidean algorithm. | 4 |
| 2118 | Find Greatest Common Divisor of 483 and 360, using Euclidean algorithm. | 4 |
| 2119 | Find Greatest Common Divisor of 301981 and 449573, using prime factorization. | 4 |
| 2120 | Find Greatest Common Divisor of 7 and 8, using prime factorization. | 4 |
| 2121 | Find Greatest Common Divisor of 64. | 4 |
| 2122 | Find Greatest Common Divisor of 4 and 9, using prime factorization. | 4 |
| 2123 | Find Greatest Common Divisor of 63 and 77, using prime factorization. | 4 |
| 2124 | Find Greatest Common Divisor of 1000 and 750, using prime factorization. | 4 |
| 2125 | Find Greatest Common Divisor of 5. | 4 |
| 2126 | Find Greatest Common Divisor of 17 and 3120, by listing out the factors. | 4 |
| 2127 | Find Greatest Common Divisor of 17 and 34, using Euclidean algorithm. | 4 |
| 2128 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, by listing out the factors. | 4 |
| 2129 | Find Greatest Common Divisor of 0 and 8, using prime factorization. | 4 |
| 2130 | Find Greatest Common Divisor of 24, 45 and 5, using prime factorization. | 4 |
| 2131 | Find Greatest Common Divisor of 628 and 2260, using prime factorization. | 4 |
| 2132 | Find Greatest Common Divisor of 20240605010775. | 4 |
| 2133 | Find Greatest Common Divisor of 5, 70, 1 and 84, using repeated division. | 4 |
| 2134 | Find Greatest Common Divisor of 5, 70, 1 and 84, using Euclidean algorithm. | 4 |
| 2135 | Find Greatest Common Divisor of 11 and 20, using prime factorization. | 4 |
| 2136 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, using prime factorization. | 4 |
| 2137 | Find Greatest Common Divisor of 24140 and 16762, using prime factorization. | 4 |
| 2138 | Find Greatest Common Divisor of 216, 900, 36, 120, 144, 108, 49, 60, 150 and 25, using prime factorization. | 4 |
| 2139 | Find Greatest Common Divisor of 6 and 10, using Euclidean algorithm. | 4 |
| 2140 | Find Greatest Common Divisor of 521, 2 and 71, using Euclidean algorithm. | 4 |
| 2141 | Find Greatest Common Divisor of 48 and 36, using repeated division. | 4 |
| 2142 | Find Greatest Common Divisor of 2028, 1 and 2029, by listing out the factors. | 4 |
| 2143 | Find Greatest Common Divisor of 306 and 657, using repeated division. | 4 |
| 2144 | Find Greatest Common Divisor of 258 and 518, using prime factorization. | 4 |
| 2145 | Find Greatest Common Divisor of 258 and 518, using repeated division. | 4 |
| 2146 | Find Greatest Common Divisor of 618, 1030 and 1442, using prime factorization. | 4 |
| 2147 | Find Greatest Common Divisor of 21, 28 and 49, using prime factorization. | 4 |
| 2148 | Find Greatest Common Divisor of 21, 28 and 49, using Euclidean algorithm. | 4 |
| 2149 | Find Greatest Common Divisor of 432, 576 and 1008, using prime factorization. | 4 |
| 2150 | Find Greatest Common Divisor of 432, 576 and 1008, by listing out the factors. | 4 |
