GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5001 | Find Greatest Common Divisor of 17 and 22, using prime factorization. | 1 |
| 5002 | Find Greatest Common Divisor of 81, 729, 108, 153 and 193, using prime factorization. | 1 |
| 5003 | Find Greatest Common Divisor of 512, 128, 64, 256 and 1024, using prime factorization. | 1 |
| 5004 | Find Greatest Common Divisor of 81, 729, 108, 153 and 198, using prime factorization. | 1 |
| 5005 | Find Greatest Common Divisor of 81, 243 and 739, using prime factorization. | 1 |
| 5006 | Find Greatest Common Divisor of 2 and 21, using prime factorization. | 1 |
| 5007 | Find Greatest Common Divisor of 0 and 21, using prime factorization. | 1 |
| 5008 | Find Greatest Common Divisor of 21 and 48, using prime factorization. | 1 |
| 5009 | Find Greatest Common Divisor of 522 and 213, using prime factorization. | 1 |
| 5010 | Find Greatest Common Divisor of 522 and 213, using repeated division. | 1 |
| 5011 | Find Greatest Common Divisor of 522 and 213, by listing out the factors. | 1 |
| 5012 | Find Greatest Common Divisor of 522 and 213, using Euclidean algorithm. | 1 |
| 5013 | Find Greatest Common Divisor of 336 and 126, using Euclidean algorithm. | 1 |
| 5014 | Find Greatest Common Divisor of 336 and 162, using Euclidean algorithm. | 1 |
| 5015 | Find Greatest Common Divisor of 478 and 256, using Euclidean algorithm. | 1 |
| 5016 | Find Greatest Common Divisor of 2048 and 100124, using prime factorization. | 1 |
| 5017 | Find Greatest Common Divisor of 560 and 913, using prime factorization. | 1 |
| 5018 | Find Greatest Common Divisor of 3 and 50, using prime factorization. | 1 |
| 5019 | Find Greatest Common Divisor of 3 and 50, using Euclidean algorithm. | 1 |
| 5020 | Find Greatest Common Divisor of 83159 and 69067, using prime factorization. | 1 |
| 5021 | Find Greatest Common Divisor of 78912 and 83159, using prime factorization. | 1 |
| 5022 | Find Greatest Common Divisor of 78912 and 83159, using Euclidean algorithm. | 1 |
| 5023 | Find Greatest Common Divisor of 78910 and 83159, using Euclidean algorithm. | 1 |
| 5024 | Find Greatest Common Divisor of 1, 2 and 3, using prime factorization. | 1 |
| 5025 | Find Greatest Common Divisor of 1, 2 and 3, using repeated division. | 1 |
| 5026 | Find Greatest Common Divisor of 1, 2 and 3, by listing out the factors. | 1 |
| 5027 | Find Greatest Common Divisor of 1, 2, 3, 4 and 2, by listing out the factors. | 1 |
| 5028 | Find Greatest Common Divisor of 12 and 18, using Euclidean algorithm. | 1 |
| 5029 | Find Greatest Common Divisor of 60 and 54, using prime factorization. | 1 |
| 5030 | Find Greatest Common Divisor of 96, 144 and 192, using prime factorization. | 1 |
| 5031 | Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using Euclidean algorithm. | 1 |
| 5032 | | 1 |
| 5033 | Find Greatest Common Divisor of 5397 and 133, using Euclidean algorithm. | 1 |
| 5034 | Find Greatest Common Divisor of 1468 and 40, using Euclidean algorithm. | 1 |
| 5035 | Find Greatest Common Divisor of 14355 and 150, using Euclidean algorithm. | 1 |
| 5036 | Find Greatest Common Divisor of 1356 and 828, using Euclidean algorithm. | 1 |
| 5037 | Find Greatest Common Divisor of 546 and 1357, using prime factorization. | 1 |
| 5038 | Find Greatest Common Divisor of 546 and 1357, using Euclidean algorithm. | 1 |
| 5039 | Find Greatest Common Divisor of 5874 and 1277, using Euclidean algorithm. | 1 |
| 5040 | Find Greatest Common Divisor of 22, 33 and 66, using prime factorization. | 1 |
| 5041 | Find Greatest Common Divisor of 180 and 192, using prime factorization. | 1 |
| 5042 | Find Greatest Common Divisor of 78125. | 1 |
| 5043 | Find Greatest Common Divisor of 95 and 168, using prime factorization. | 1 |
| 5044 | Find Greatest Common Divisor of 17610 and 12610, using Euclidean algorithm. | 1 |
| 5045 | Find Greatest Common Divisor of 17750 and 12750, using Euclidean algorithm. | 1 |
| 5046 | Find Greatest Common Divisor of 17790 and 12790, using Euclidean algorithm. | 1 |
| 5047 | Find Greatest Common Divisor of 17830 and 12830, using Euclidean algorithm. | 1 |
| 5048 | Find Greatest Common Divisor of 17850 and 12850, using Euclidean algorithm. | 1 |
| 5049 | Find Greatest Common Divisor of 17990 and 12990, using Euclidean algorithm. | 1 |
| 5050 | Find Greatest Common Divisor of 18070 and 13070, using Euclidean algorithm. | 1 |
