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 894 and 8888, using prime factorization. | 1 |
| 4852 | Find Greatest Common Divisor of 11, 17, 5 and 10, using prime factorization. | 1 |
| 4853 | Find Greatest Common Divisor of 790 and 380, using Euclidean algorithm. | 1 |
| 4854 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, by listing out the factors. | 1 |
| 4855 | Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using repeated division. | 1 |
| 4856 | Find Greatest Common Divisor of 334 and 233, using Euclidean algorithm. | 1 |
| 4857 | Find Greatest Common Divisor of 889 and 246, using repeated division. | 1 |
| 4858 | Find Greatest Common Divisor of 230 and 136, using Euclidean algorithm. | 1 |
| 4859 | Find Greatest Common Divisor of 279 and 250, using Euclidean algorithm. | 1 |
| 4860 | Find Greatest Common Divisor of 77 and 40, using prime factorization. | 1 |
| 4861 | Find Greatest Common Divisor of 1597 and 5702887, using Euclidean algorithm. | 1 |
| 4862 | Find Greatest Common Divisor of 30, 50 and 45, using prime factorization. | 1 |
| 4863 | Find Greatest Common Divisor of 495. | 1 |
| 4864 | Find Greatest Common Divisor of 10497600 and 4840, using prime factorization. | 1 |
| 4865 | Find Greatest Common Divisor of 587 and 345, using prime factorization. | 1 |
| 4866 | Find Greatest Common Divisor of 587 and 345, using Euclidean algorithm. | 1 |
| 4867 | Find Greatest Common Divisor of 288 and 29, using Euclidean algorithm. | 1 |
| 4868 | Find Greatest Common Divisor of 3672 and 595, using prime factorization. | 1 |
| 4869 | Find Greatest Common Divisor of 412 and 88, using prime factorization. | 1 |
| 4870 | Find Greatest Common Divisor of 1100 and 4231, using Euclidean algorithm. | 1 |
| 4871 | Find Greatest Common Divisor of 80 and 340, using prime factorization. | 1 |
| 4872 | Find Greatest Common Divisor of 5 and 12, using prime factorization. | 1 |
| 4873 | Find Greatest Common Divisor of 410, 1394 and 3034, using prime factorization. | 1 |
| 4874 | Find Greatest Common Divisor of 20 and 32, using Euclidean algorithm. | 1 |
| 4875 | Find Greatest Common Divisor of 16 and 35, using repeated division. | 1 |
| 4876 | Find Greatest Common Divisor of 16 and 35, by listing out the factors. | 1 |
| 4877 | Find Greatest Common Divisor of 114 and 522, using prime factorization. | 1 |
| 4878 | Find Greatest Common Divisor of 11, 7, 3 and 2, using prime factorization. | 1 |
| 4879 | Find Greatest Common Divisor of 10 and 2520, using Euclidean algorithm. | 1 |
| 4880 | Find Greatest Common Divisor of 8, 32 and 64, using prime factorization. | 1 |
| 4881 | Find Greatest Common Divisor of 8, 32 and 64, using repeated division. | 1 |
| 4882 | Find Greatest Common Divisor of 32, 56 and 78, using prime factorization. | 1 |
| 4883 | Find Greatest Common Divisor of 24, 12 and 36, using repeated division. | 1 |
| 4884 | Find Greatest Common Divisor of 334. | 1 |
| 4885 | Find Greatest Common Divisor of 12327 and 2409, using prime factorization. | 1 |
| 4886 | Find Greatest Common Divisor of 75 and 405, using prime factorization. | 1 |
| 4887 | Find Greatest Common Divisor of 7 and 16, using prime factorization. | 1 |
| 4888 | Find Greatest Common Divisor of 248625 and 415822, using prime factorization. | 1 |
| 4889 | Find Greatest Common Divisor of 295822 and 128625, using prime factorization. | 1 |
| 4890 | Find Greatest Common Divisor of 2486625522 and 41582215163, using Euclidean algorithm. | 1 |
| 4891 | Find Greatest Common Divisor of 248662 and 415822, by listing out the factors. | 1 |
| 4892 | Find Greatest Common Divisor of 248657 and 415822, using repeated division. | 1 |
| 4893 | Find Greatest Common Divisor of 2189 and 121, using Euclidean algorithm. | 1 |
| 4894 | Find Greatest Common Divisor of 1911 and 825, using Euclidean algorithm. | 1 |
| 4895 | Find Greatest Common Divisor of 1911 and 825, using prime factorization. | 1 |
| 4896 | Find Greatest Common Divisor of 4, 5, 7, 5, 11 and 25, using prime factorization. | 1 |
| 4897 | Find Greatest Common Divisor of 9 and 35000, using prime factorization. | 1 |
| 4898 | Find Greatest Common Divisor of 4, 0 and 808, using prime factorization. | 1 |
| 4899 | Find Greatest Common Divisor of 1760 and 2080, using prime factorization. | 1 |
| 4900 | Find Greatest Common Divisor of 10 and 4, using Euclidean algorithm. | 1 |
