GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 8101 | Find Greatest Common Divisor of 350 and 230, using prime factorization. | 1 |
| 8102 | Find Greatest Common Divisor of 198, 19 and 4, using prime factorization. | 1 |
| 8103 | Find Greatest Common Divisor of 48, 72 and 96, using prime factorization. | 1 |
| 8104 | Find Greatest Common Divisor of 2358 and 2025, using prime factorization. | 1 |
| 8105 | Find Greatest Common Divisor of 627 and 1611, using Euclidean algorithm. | 1 |
| 8106 | Find Greatest Common Divisor of 135 and 25, using repeated division. | 1 |
| 8107 | Find Greatest Common Divisor of 135 and 25, using Euclidean algorithm. | 1 |
| 8108 | Find Greatest Common Divisor of 1001 and 3101, using prime factorization. | 1 |
| 8109 | Find Greatest Common Divisor of 35 and 6, using prime factorization. | 1 |
| 8110 | Find Greatest Common Divisor of 171, 399 and 741, using prime factorization. | 1 |
| 8111 | Find Greatest Common Divisor of 8, 14, 18, 26 and 30, using prime factorization. | 1 |
| 8112 | Find Greatest Common Divisor of 1078 and 25480, using prime factorization. | 1 |
| 8113 | Find Greatest Common Divisor of 8 and 45, using prime factorization. | 1 |
| 8114 | Find Greatest Common Divisor of 43336 and 332, by listing out the factors. | 1 |
| 8115 | Find Greatest Common Divisor of 47. | 1 |
| 8116 | Find Greatest Common Divisor of 535 and 635, using prime factorization. | 1 |
| 8117 | Find Greatest Common Divisor of 15 and 0, using prime factorization. | 1 |
| 8118 | Find Greatest Common Divisor of 15 and 0, using Euclidean algorithm. | 1 |
| 8119 | Find Greatest Common Divisor of 3911481 and 37, using prime factorization. | 1 |
| 8120 | Find Greatest Common Divisor of 0 and 102890, using prime factorization. | 1 |
| 8121 | Find Greatest Common Divisor of 102890 and 102890, using prime factorization. | 1 |
| 8122 | Find Greatest Common Divisor of 1 and 102890, using prime factorization. | 1 |
| 8123 | Find Greatest Common Divisor of 102891 and 102890, using prime factorization. | 1 |
| 8124 | Find Greatest Common Divisor of 39 and 63, using prime factorization. | 1 |
| 8125 | Find Greatest Common Divisor of 65 and 85, using prime factorization. | 1 |
| 8126 | Find Greatest Common Divisor of 336 and 504, using prime factorization. | 1 |
| 8127 | Find Greatest Common Divisor of 336 and 240, using prime factorization. | 1 |
| 8128 | Find Greatest Common Divisor of 12954 and 12954, using prime factorization. | 1 |
| 8129 | Find Greatest Common Divisor of 6326 and 0, using prime factorization. | 1 |
| 8130 | Find Greatest Common Divisor of 65 and 75, using prime factorization. | 1 |
| 8131 | Find Greatest Common Divisor of 184 and 72, using prime factorization. | 1 |
| 8132 | Find Greatest Common Divisor of 936 and 72, using prime factorization. | 1 |
| 8133 | Find Greatest Common Divisor of 167 and 72, using prime factorization. | 1 |
| 8134 | Find Greatest Common Divisor of 88 and 72, using prime factorization. | 1 |
| 8135 | Find Greatest Common Divisor of 24, 36 and 60, using prime factorization. | 1 |
| 8136 | Find Greatest Common Divisor of 20, 36 and 11, using prime factorization. | 1 |
| 8137 | Find Greatest Common Divisor of 144, 258 and 312, using prime factorization. | 1 |
| 8138 | Find Greatest Common Divisor of 10181, 21021 and 37037, using prime factorization. | 1 |
| 8139 | Find Greatest Common Divisor of 400 and 500, using prime factorization. | 1 |
| 8140 | Find Greatest Common Divisor of 90 and 54, using Euclidean algorithm. | 1 |
| 8141 | Find Greatest Common Divisor of 12, 20 and 14, using prime factorization. | 1 |
| 8142 | Find Greatest Common Divisor of 133, 55 and 39, using prime factorization. | 1 |
| 8143 | Find Greatest Common Divisor of 91, 209 and 10, using prime factorization. | 1 |
| 8144 | Find Greatest Common Divisor of 210 and 495, using prime factorization. | 1 |
| 8145 | Find Greatest Common Divisor of 9 and 38, using prime factorization. | 1 |
| 8146 | Find Greatest Common Divisor of 153 and 114, using Euclidean algorithm. | 1 |
| 8147 | Find Greatest Common Divisor of 10236 and 244, using prime factorization. | 1 |
| 8148 | Find Greatest Common Divisor of 199 and 991, using prime factorization. | 1 |
| 8149 | Find Greatest Common Divisor of 62839955 and 500000, using Euclidean algorithm. | 1 |
| 8150 | Find Greatest Common Divisor of 875 and 1000, by listing out the factors. | 1 |
