GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4851 | Find Greatest Common Divisor of 19242530496. | 2 |
| 4852 | Find Greatest Common Divisor of 2030. | 2 |
| 4853 | Find Greatest Common Divisor of 19242530906. | 2 |
| 4854 | Find Greatest Common Divisor of 1024. | 2 |
| 4855 | Find Greatest Common Divisor of 662. | 2 |
| 4856 | Find Greatest Common Divisor of 662. | 2 |
| 4857 | Find Greatest Common Divisor of 1561 and 3409, using prime factorization. | 2 |
| 4858 | Find Greatest Common Divisor of 13 and 75, using prime factorization. | 2 |
| 4859 | Find Greatest Common Divisor of 13 and 80, using prime factorization. | 2 |
| 4860 | Find Greatest Common Divisor of 10 and 75, using Euclidean algorithm. | 2 |
| 4861 | Find Greatest Common Divisor of 48 and 360, using Euclidean algorithm. | 2 |
| 4862 | Find Greatest Common Divisor of 1362 and 2785, using Euclidean algorithm. | 2 |
| 4863 | Find Greatest Common Divisor of 428 and 633, using prime factorization. | 2 |
| 4864 | Find Greatest Common Divisor of 520 and 858, using prime factorization. | 2 |
| 4865 | Find Greatest Common Divisor of 11 and 1800, using prime factorization. | 2 |
| 4866 | Find Greatest Common Divisor of 20119 and 34782, using Euclidean algorithm. | 2 |
| 4867 | Find Greatest Common Divisor of 5 and 3432, using prime factorization. | 2 |
| 4868 | Find Greatest Common Divisor of 180, 540 and 240, using prime factorization. | 2 |
| 4869 | Find Greatest Common Divisor of 6 and 12, using Euclidean algorithm. | 2 |
| 4870 | Find Greatest Common Divisor of 490 and 2013, using prime factorization. | 2 |
| 4871 | Find Greatest Common Divisor of 32321 and 36513, using prime factorization. | 2 |
| 4872 | Find Greatest Common Divisor of 32321 and 26513, using prime factorization. | 2 |
| 4873 | Find Greatest Common Divisor of 230 and 960, by listing out the factors. | 2 |
| 4874 | Find Greatest Common Divisor of 90, 105 and 120, using prime factorization. | 2 |
| 4875 | Find Greatest Common Divisor of 378 and 441, using prime factorization. | 2 |
| 4876 | Find Greatest Common Divisor of 6810000 and 491, using prime factorization. | 2 |
| 4877 | Find Greatest Common Divisor of 71 and 120, using prime factorization. | 2 |
| 4878 | Find Greatest Common Divisor of 10 and 1, using prime factorization. | 2 |
| 4879 | Find Greatest Common Divisor of 10 and 7, using prime factorization. | 2 |
| 4880 | Find Greatest Common Divisor of 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111 and 1111111111, using prime factorization. | 2 |
| 4881 | Find Greatest Common Divisor of 385 and 165, using prime factorization. | 2 |
| 4882 | Find Greatest Common Divisor of 55 and 96, using prime factorization. | 2 |
| 4883 | Find Greatest Common Divisor of 1163 and 248, using prime factorization. | 2 |
| 4884 | Find Greatest Common Divisor of 42 and 210, using prime factorization. | 2 |
| 4885 | Find Greatest Common Divisor of 42 and 210, by listing out the factors. | 2 |
| 4886 | Find Greatest Common Divisor of 210 and 42, using repeated division. | 2 |
| 4887 | Find Greatest Common Divisor of 3568 and 1004, using Euclidean algorithm. | 2 |
| 4888 | Find Greatest Common Divisor of 17 and 9, using Euclidean algorithm. | 2 |
| 4889 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using repeated division. | 2 |
| 4890 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using prime factorization. | 2 |
| 4891 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using Euclidean algorithm. | 2 |
| 4892 | Find Greatest Common Divisor of 84 and 120, using Euclidean algorithm. | 2 |
| 4893 | Find Greatest Common Divisor of 84 and 25, using Euclidean algorithm. | 2 |
| 4894 | Find Greatest Common Divisor of 840, 500, 310 and 1000, using Euclidean algorithm. | 2 |
| 4895 | Find Greatest Common Divisor of 13 and 369, by listing out the factors. | 2 |
| 4896 | Find Greatest Common Divisor of 68 and 9, by listing out the factors. | 2 |
| 4897 | Find Greatest Common Divisor of 36 and 84, using prime factorization. | 2 |
| 4898 | Find Greatest Common Divisor of 36 and 84, using repeated division. | 2 |
| 4899 | Find Greatest Common Divisor of 143 and 187, using repeated division. | 2 |
| 4900 | Find Greatest Common Divisor of 56 and 96, using repeated division. | 2 |