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 3 and 5, using Euclidean algorithm. | 1 |
| 4852 | Find Greatest Common Divisor of 2015, 3, 2018 and 3, using prime factorization. | 1 |
| 4853 | Find Greatest Common Divisor of 40, 102 and 112, using prime factorization. | 1 |
| 4854 | Find Greatest Common Divisor of 6, 9 and 12, by listing out the factors. | 1 |
| 4855 | Find Greatest Common Divisor of 3578 and 9512, using prime factorization. | 1 |
| 4856 | Find Greatest Common Divisor of 976 and 174, using Euclidean algorithm. | 1 |
| 4857 | Find Greatest Common Divisor of 654 and 254, using prime factorization. | 1 |
| 4858 | Find Greatest Common Divisor of 2, 12 and 24, using prime factorization. | 1 |
| 4859 | Find Greatest Common Divisor of 5, 15 and 60, using prime factorization. | 1 |
| 4860 | Find Greatest Common Divisor of 200, 50 and 24, using prime factorization. | 1 |
| 4861 | Find Greatest Common Divisor of 7, 21 and 81, using prime factorization. | 1 |
| 4862 | Find Greatest Common Divisor of 1594 and 0, using Euclidean algorithm. | 1 |
| 4863 | Find Greatest Common Divisor of 81 and 256, using Euclidean algorithm. | 1 |
| 4864 | Find Greatest Common Divisor of 262 and 851, using Euclidean algorithm. | 1 |
| 4865 | Find Greatest Common Divisor of 1267 and 35, using Euclidean algorithm. | 1 |
| 4866 | Find Greatest Common Divisor of 1176 and 1492, using prime factorization. | 1 |
| 4867 | Find Greatest Common Divisor of 2453 and 2007, using prime factorization. | 1 |
| 4868 | Find Greatest Common Divisor of 2376 and 702, using prime factorization. | 1 |
| 4869 | Find Greatest Common Divisor of 420 and 200, using Euclidean algorithm. | 1 |
| 4870 | Find Greatest Common Divisor of 54 and 15, using prime factorization. | 1 |
| 4871 | Find Greatest Common Divisor of 18, 45 and 72, using prime factorization. | 1 |
| 4872 | Find Greatest Common Divisor of 48, 72 and 120, using prime factorization. | 1 |
| 4873 | Find Greatest Common Divisor of 32, 80 and 192, using prime factorization. | 1 |
| 4874 | Find Greatest Common Divisor of 269 and 179, using prime factorization. | 1 |
| 4875 | Find Greatest Common Divisor of 269 and 179, using Euclidean algorithm. | 1 |
| 4876 | Find Greatest Common Divisor of 1770 and 6897, using prime factorization. | 1 |
| 4877 | Find Greatest Common Divisor of 235, 95 and 145, using prime factorization. | 1 |
| 4878 | Find Greatest Common Divisor of 6952 and 7189, using prime factorization. | 1 |
| 4879 | Find Greatest Common Divisor of 6952 and 7189, using Euclidean algorithm. | 1 |
| 4880 | Find Greatest Common Divisor of 15, 25, 40 and 75, using prime factorization. | 1 |
| 4881 | Find Greatest Common Divisor of 17 and 22, using prime factorization. | 1 |
| 4882 | Find Greatest Common Divisor of 81, 729, 108, 153 and 193, using prime factorization. | 1 |
| 4883 | Find Greatest Common Divisor of 512, 128, 64, 256 and 1024, using prime factorization. | 1 |
| 4884 | Find Greatest Common Divisor of 81, 729, 108, 153 and 198, using prime factorization. | 1 |
| 4885 | Find Greatest Common Divisor of 81, 243 and 739, using prime factorization. | 1 |
| 4886 | Find Greatest Common Divisor of 2 and 21, using prime factorization. | 1 |
| 4887 | Find Greatest Common Divisor of 0 and 21, using prime factorization. | 1 |
| 4888 | Find Greatest Common Divisor of 21 and 48, using prime factorization. | 1 |
| 4889 | Find Greatest Common Divisor of 522 and 213, using prime factorization. | 1 |
| 4890 | Find Greatest Common Divisor of 522 and 213, using repeated division. | 1 |
| 4891 | Find Greatest Common Divisor of 522 and 213, by listing out the factors. | 1 |
| 4892 | Find Greatest Common Divisor of 522 and 213, using Euclidean algorithm. | 1 |
| 4893 | Find Greatest Common Divisor of 336 and 126, using Euclidean algorithm. | 1 |
| 4894 | Find Greatest Common Divisor of 336 and 162, using Euclidean algorithm. | 1 |
| 4895 | Find Greatest Common Divisor of 478 and 256, using Euclidean algorithm. | 1 |
| 4896 | Find Greatest Common Divisor of 2048 and 100124, using prime factorization. | 1 |
| 4897 | Find Greatest Common Divisor of 560 and 913, using prime factorization. | 1 |
| 4898 | Find Greatest Common Divisor of 3 and 50, using prime factorization. | 1 |
| 4899 | Find Greatest Common Divisor of 3 and 50, using Euclidean algorithm. | 1 |
| 4900 | Find Greatest Common Divisor of 83159 and 69067, using prime factorization. | 1 |
