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 2520 and 154, using Euclidean algorithm. | 1 |
| 6102 | Find Greatest Common Divisor of 11 and 19, using prime factorization. | 1 |
| 6103 | Find Greatest Common Divisor of 350 and 5500, using prime factorization. | 1 |
| 6104 | Find Greatest Common Divisor of 563 and 1391, using prime factorization. | 1 |
| 6105 | Find Greatest Common Divisor of 563 and 1391, using Euclidean algorithm. | 1 |
| 6106 | Find Greatest Common Divisor of 108, 144 and 276, using prime factorization. | 1 |
| 6107 | Find Greatest Common Divisor of 44350 and 20785, using prime factorization. | 1 |
| 6108 | Find Greatest Common Divisor of 42, 70 and 56, using prime factorization. | 1 |
| 6109 | Find Greatest Common Divisor of 96, 64 and 80, using prime factorization. | 1 |
| 6110 | Find Greatest Common Divisor of 84, 12 and 40, using prime factorization. | 1 |
| 6111 | Find Greatest Common Divisor of 34, 54 and 64, using prime factorization. | 1 |
| 6112 | Find Greatest Common Divisor of 7429 and 33649, using Euclidean algorithm. | 1 |
| 6113 | Find Greatest Common Divisor of 30107 and 437, using Euclidean algorithm. | 1 |
| 6114 | Find Greatest Common Divisor of 81719, 52003, 33649 and 30107, using prime factorization. | 1 |
| 6115 | Find Greatest Common Divisor of 23 and 4, using prime factorization. | 1 |
| 6116 | Find Greatest Common Divisor of 100 and 40, using prime factorization. | 1 |
| 6117 | Find Greatest Common Divisor of 10, 14 and 22, using prime factorization. | 1 |
| 6118 | Find Greatest Common Divisor of 6, 27 and 64, using prime factorization. | 1 |
| 6119 | Find Greatest Common Divisor of 560. | 1 |
| 6120 | Find Greatest Common Divisor of 560 and 196, using prime factorization. | 1 |
| 6121 | Find Greatest Common Divisor of 13 and 15, using prime factorization. | 1 |
| 6122 | Find Greatest Common Divisor of 123456789 and 123456788, using Euclidean algorithm. | 1 |
| 6123 | Find Greatest Common Divisor of 165 and 78, using prime factorization. | 1 |
| 6124 | Find Greatest Common Divisor of 5092 and 2768, using prime factorization. | 1 |
| 6125 | Find Greatest Common Divisor of 3, 100, 1, 3, 100 and 1, using Euclidean algorithm. | 1 |
| 6126 | Find Greatest Common Divisor of 500000001 and 5000001, using Euclidean algorithm. | 1 |
| 6127 | Find Greatest Common Divisor of 2024 and 1446, using Euclidean algorithm. | 1 |
| 6128 | Find Greatest Common Divisor of 1003 and 821, using Euclidean algorithm. | 1 |
| 6129 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization. | 1 |
| 6130 | Find Greatest Common Divisor of 99999999999999999 and 12, using prime factorization. | 1 |
| 6131 | Find Greatest Common Divisor of 3205. | 1 |
| 6132 | Find Greatest Common Divisor of 104 and 130, using prime factorization. | 1 |
| 6133 | Find Greatest Common Divisor of 400, 125 and 172, using prime factorization. | 1 |
| 6134 | Find Greatest Common Divisor of 11476 and 683, using Euclidean algorithm. | 1 |
| 6135 | Find Greatest Common Divisor of 2561124 and 46064, using Euclidean algorithm. | 1 |
| 6136 | Find Greatest Common Divisor of 17601969 and 2364768, using Euclidean algorithm. | 1 |
| 6137 | Find Greatest Common Divisor of 350 and 45, using Euclidean algorithm. | 1 |
| 6138 | Find Greatest Common Divisor of 2030 and 756, using prime factorization. | 1 |
| 6139 | Find Greatest Common Divisor of 8. | 1 |
| 6140 | Find Greatest Common Divisor of 662 and 404, using Euclidean algorithm. | 1 |
| 6141 | Find Greatest Common Divisor of 2079 and 825, using Euclidean algorithm. | 1 |
| 6142 | Find Greatest Common Divisor of 248 and 108, using prime factorization. | 1 |
| 6143 | Find Greatest Common Divisor of 19683 and 84, using prime factorization. | 1 |
| 6144 | Find Greatest Common Divisor of 22 and 58, using prime factorization. | 1 |
| 6145 | Find Greatest Common Divisor of 1252, 570 and 616, using prime factorization. | 1 |
| 6146 | Find Greatest Common Divisor of 82933 and 145393, using Euclidean algorithm. | 1 |
| 6147 | Find Greatest Common Divisor of 1112 and 1544, using Euclidean algorithm. | 1 |
| 6148 | Find Greatest Common Divisor of 45 and 36, using prime factorization. | 1 |
| 6149 | Find Greatest Common Divisor of 45 and 36, using repeated division. | 1 |
| 6150 | Find Greatest Common Divisor of 2, 25, 2 and 16, using prime factorization. | 1 |
