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 15310 and 10130, using Euclidean algorithm. | 1 |
| 5002 | Find Greatest Common Divisor of 1356 and 114, using prime factorization. | 1 |
| 5003 | Find Greatest Common Divisor of 1356 and 114, using Euclidean algorithm. | 1 |
| 5004 | Find Greatest Common Divisor of 3027 and 110, using Euclidean algorithm. | 1 |
| 5005 | Find Greatest Common Divisor of 3584 and 59, using Euclidean algorithm. | 1 |
| 5006 | Find Greatest Common Divisor of 160 and 43, using prime factorization. | 1 |
| 5007 | Find Greatest Common Divisor of 9223372036854775807 and 44892811, using prime factorization. | 1 |
| 5008 | Find Greatest Common Divisor of 5784 and 280, using repeated division. | 1 |
| 5009 | Find Greatest Common Divisor of 5784 and 280, using prime factorization. | 1 |
| 5010 | Find Greatest Common Divisor of 5784 and 280, using Euclidean algorithm. | 1 |
| 5011 | Find Greatest Common Divisor of 22 and 18, using Euclidean algorithm. | 1 |
| 5012 | Find Greatest Common Divisor of 15210 and 10210, using prime factorization. | 1 |
| 5013 | Find Greatest Common Divisor of 234 and 531, using prime factorization. | 1 |
| 5014 | Find Greatest Common Divisor of 234 and 531, using repeated division. | 1 |
| 5015 | Find Greatest Common Divisor of 234 and 531, by listing out the factors. | 1 |
| 5016 | Find Greatest Common Divisor of 23 and 531, using Euclidean algorithm. | 1 |
| 5017 | Find Greatest Common Divisor of 50 and 74, using Euclidean algorithm. | 1 |
| 5018 | Find Greatest Common Divisor of 92 and 111, using Euclidean algorithm. | 1 |
| 5019 | Find Greatest Common Divisor of 20 and 4, using Euclidean algorithm. | 1 |
| 5020 | Find Greatest Common Divisor of 20 and 5, using Euclidean algorithm. | 1 |
| 5021 | Find Greatest Common Divisor of 3125 and 21, using Euclidean algorithm. | 1 |
| 5022 | Find Greatest Common Divisor of 640 and 49, using Euclidean algorithm. | 1 |
| 5023 | Find Greatest Common Divisor of 22086 and 9990, using repeated division. | 1 |
| 5024 | Find Greatest Common Divisor of 22086 and 9990, using Euclidean algorithm. | 1 |
| 5025 | Find Greatest Common Divisor of 90581 and 17993, using prime factorization. | 1 |
| 5026 | Find Greatest Common Divisor of 1552303 and 233927, using Euclidean algorithm. | 1 |
| 5027 | Find Greatest Common Divisor of 168 and 9723, using Euclidean algorithm. | 1 |
| 5028 | Find Greatest Common Divisor of 26 and 37, using Euclidean algorithm. | 1 |
| 5029 | Find Greatest Common Divisor of 84 and 385, using Euclidean algorithm. | 1 |
| 5030 | Find Greatest Common Divisor of 342 and 344, using Euclidean algorithm. | 1 |
| 5031 | Find Greatest Common Divisor of 256 and 81, using prime factorization. | 1 |
| 5032 | Find Greatest Common Divisor of 540 and 720, using prime factorization. | 1 |
| 5033 | Find Greatest Common Divisor of 1900 and 172, using prime factorization. | 1 |
| 5034 | Find Greatest Common Divisor of 970 and 899, using prime factorization. | 1 |
| 5035 | Find Greatest Common Divisor of 970 and 890, using prime factorization. | 1 |
| 5036 | Find Greatest Common Divisor of 2798 and 36812, using prime factorization. | 1 |
| 5037 | Find Greatest Common Divisor of 145 and 355, using prime factorization. | 1 |
| 5038 | Find Greatest Common Divisor of 118 and 936, using prime factorization. | 1 |
| 5039 | Find Greatest Common Divisor of 118 and 918, using prime factorization. | 1 |
| 5040 | Find Greatest Common Divisor of 120 and 918, using prime factorization. | 1 |
| 5041 | Find Greatest Common Divisor of 14, 18 and 12, using prime factorization. | 1 |
| 5042 | Find Greatest Common Divisor of 999 and 19, using prime factorization. | 1 |
| 5043 | Find Greatest Common Divisor of 81, 36 and 48, using prime factorization. | 1 |
| 5044 | Find Greatest Common Divisor of 70, 190 and 350, using prime factorization. | 1 |
| 5045 | Find Greatest Common Divisor of 70, 600 and 350, using prime factorization. | 1 |
| 5046 | Find Greatest Common Divisor of 243, 729 and 270, using prime factorization. | 1 |
| 5047 | Find Greatest Common Divisor of 364 and 765, using prime factorization. | 1 |
| 5048 | Find Greatest Common Divisor of 6 and 35, using Euclidean algorithm. | 1 |
| 5049 | Find Greatest Common Divisor of 3572 and 838, using prime factorization. | 1 |
| 5050 | Find Greatest Common Divisor of 3572 and 838, using Euclidean algorithm. | 1 |
