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 970 and 890, using prime factorization. | 1 |
| 5052 | Find Greatest Common Divisor of 2798 and 36812, using prime factorization. | 1 |
| 5053 | Find Greatest Common Divisor of 145 and 355, using prime factorization. | 1 |
| 5054 | Find Greatest Common Divisor of 118 and 936, using prime factorization. | 1 |
| 5055 | Find Greatest Common Divisor of 118 and 918, using prime factorization. | 1 |
| 5056 | Find Greatest Common Divisor of 120 and 918, using prime factorization. | 1 |
| 5057 | Find Greatest Common Divisor of 14, 18 and 12, using prime factorization. | 1 |
| 5058 | Find Greatest Common Divisor of 999 and 19, using prime factorization. | 1 |
| 5059 | Find Greatest Common Divisor of 81, 36 and 48, using prime factorization. | 1 |
| 5060 | Find Greatest Common Divisor of 70, 190 and 350, using prime factorization. | 1 |
| 5061 | Find Greatest Common Divisor of 70, 600 and 350, using prime factorization. | 1 |
| 5062 | Find Greatest Common Divisor of 243, 729 and 270, using prime factorization. | 1 |
| 5063 | Find Greatest Common Divisor of 364 and 765, using prime factorization. | 1 |
| 5064 | Find Greatest Common Divisor of 6 and 35, using Euclidean algorithm. | 1 |
| 5065 | Find Greatest Common Divisor of 3572 and 838, using prime factorization. | 1 |
| 5066 | Find Greatest Common Divisor of 3572 and 838, using Euclidean algorithm. | 1 |
| 5067 | Find Greatest Common Divisor of 3543 and 92, using Euclidean algorithm. | 1 |
| 5068 | Find Greatest Common Divisor of 282 and 2332, using prime factorization. | 1 |
| 5069 | Find Greatest Common Divisor of 1223 and 195, using Euclidean algorithm. | 1 |
| 5070 | Find Greatest Common Divisor of 3401 and 542, using Euclidean algorithm. | 1 |
| 5071 | Find Greatest Common Divisor of 3572 and 211, using Euclidean algorithm. | 1 |
| 5072 | Find Greatest Common Divisor of 2871 and 169, using Euclidean algorithm. | 1 |
| 5073 | Find Greatest Common Divisor of 143 and 35, using Euclidean algorithm. | 1 |
| 5074 | Find Greatest Common Divisor of 385 and 35, using Euclidean algorithm. | 1 |
| 5075 | Find Greatest Common Divisor of 336 and 1120, using prime factorization. | 1 |
| 5076 | Find Greatest Common Divisor of 216 and 111, using Euclidean algorithm. | 1 |
| 5077 | Find Greatest Common Divisor of 5168 and 663, using Euclidean algorithm. | 1 |
| 5078 | Find Greatest Common Divisor of 7 and 84, using prime factorization. | 1 |
| 5079 | Find Greatest Common Divisor of 40 and 56, using prime factorization. | 1 |
| 5080 | Find Greatest Common Divisor of 5270, 6460 and 7480, using repeated division. | 1 |
| 5081 | Find Greatest Common Divisor of 16 and 620, using prime factorization. | 1 |
| 5082 | Find Greatest Common Divisor of 504 and 525, using prime factorization. | 1 |
| 5083 | Find Greatest Common Divisor of 844 and 444, using prime factorization. | 1 |
| 5084 | Find Greatest Common Divisor of 575 and 9, using prime factorization. | 1 |
| 5085 | Find Greatest Common Divisor of 6 and 15, using prime factorization. | 1 |
| 5086 | Find Greatest Common Divisor of 34 and 21, using Euclidean algorithm. | 1 |
| 5087 | Find Greatest Common Divisor of 17 and 31, using Euclidean algorithm. | 1 |
| 5088 | Find Greatest Common Divisor of 595 and 1463, using Euclidean algorithm. | 1 |
| 5089 | Find Greatest Common Divisor of 121 and 122, using prime factorization. | 1 |
| 5090 | Find Greatest Common Divisor of 4 and 13, using Euclidean algorithm. | 1 |
| 5091 | Find Greatest Common Divisor of 4 and 14, using Euclidean algorithm. | 1 |
| 5092 | Find Greatest Common Divisor of 42 and 126, using Euclidean algorithm. | 1 |
| 5093 | Find Greatest Common Divisor of 140, 350 and 1200, using prime factorization. | 1 |
| 5094 | Find Greatest Common Divisor of 140, 1200 and 350, using prime factorization. | 1 |
| 5095 | Find Greatest Common Divisor of 16, 36 and 24, using prime factorization. | 1 |
| 5096 | Find Greatest Common Divisor of 600, 980 and 2500, using prime factorization. | 1 |
| 5097 | Find Greatest Common Divisor of 78 and 32, using prime factorization. | 1 |
| 5098 | Find Greatest Common Divisor of 1261 and 611, using prime factorization. | 1 |
| 5099 | Find Greatest Common Divisor of 7939 and 437325, using repeated division. | 1 |
| 5100 | Find Greatest Common Divisor of 21250 and 16250, using prime factorization. | 1 |
