GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 5851 | Find Greatest Common Divisor of 14 and 35, using Euclidean algorithm. | 1 |
| 5852 | Find Greatest Common Divisor of 25 and 40, using Euclidean algorithm. | 1 |
| 5853 | Find Greatest Common Divisor of 81 and 37, using Euclidean algorithm. | 1 |
| 5854 | Find Greatest Common Divisor of 452 and 6004, using prime factorization. | 1 |
| 5855 | Find Greatest Common Divisor of 270 and 292, using prime factorization. | 1 |
| 5856 | Find Greatest Common Divisor of 111111 and 11111, using prime factorization. | 1 |
| 5857 | Find Greatest Common Divisor of 504 and 7, using prime factorization. | 1 |
| 5858 | Find Greatest Common Divisor of 56 and 9, using prime factorization. | 1 |
| 5859 | Find Greatest Common Divisor of 504 and 5, using prime factorization. | 1 |
| 5860 | Find Greatest Common Divisor of 2520 and 499, using prime factorization. | 1 |
| 5861 | Find Greatest Common Divisor of 684 and 28, using Euclidean algorithm. | 1 |
| 5862 | Find Greatest Common Divisor of 224 and 44, using Euclidean algorithm. | 1 |
| 5863 | Find Greatest Common Divisor of 228 and 44, using Euclidean algorithm. | 1 |
| 5864 | Find Greatest Common Divisor of 18 and 35, using prime factorization. | 1 |
| 5865 | Find Greatest Common Divisor of 18 and 35, using repeated division. | 1 |
| 5866 | Find Greatest Common Divisor of 30 and 35, using repeated division. | 1 |
| 5867 | Find Greatest Common Divisor of 30 and 35, using Euclidean algorithm. | 1 |
| 5868 | Find Greatest Common Divisor of 18 and 35, using Euclidean algorithm. | 1 |
| 5869 | Find Greatest Common Divisor of 76290 and 26880, using prime factorization. | 1 |
| 5870 | Find Greatest Common Divisor of 2023. | 1 |
| 5871 | Find Greatest Common Divisor of 2023 and 4046, using prime factorization. | 1 |
| 5872 | Find Greatest Common Divisor of 1003 and 2006, using prime factorization. | 1 |
| 5873 | Find Greatest Common Divisor of 12 and 28, using Euclidean algorithm. | 1 |
| 5874 | Find Greatest Common Divisor of 224 and 256, using Euclidean algorithm. | 1 |
| 5875 | Find Greatest Common Divisor of 580 and 252, using prime factorization. | 1 |
| 5876 | Find Greatest Common Divisor of 2603 and 2423, using prime factorization. | 1 |
| 5877 | Find Greatest Common Divisor of 2036 and 2423, using prime factorization. | 1 |
| 5878 | Find Greatest Common Divisor of 3062 and 2423, using prime factorization. | 1 |
| 5879 | Find Greatest Common Divisor of 3026 and 243, using prime factorization. | 1 |
| 5880 | Find Greatest Common Divisor of 679 and 2019, using prime factorization. | 1 |
| 5881 | Find Greatest Common Divisor of 673 and 2019, using prime factorization. | 1 |
| 5882 | Find Greatest Common Divisor of 2025 and 1588, using Euclidean algorithm. | 1 |
| 5883 | Find Greatest Common Divisor of 8456 and 448, using prime factorization. | 1 |
| 5884 | Find Greatest Common Divisor of 3026 and 258, using Euclidean algorithm. | 1 |
| 5885 | Find Greatest Common Divisor of 4879465 and 894563, using prime factorization. | 1 |
| 5886 | Find Greatest Common Divisor of 4879464 and 894562, using prime factorization. | 1 |
| 5887 | Find Greatest Common Divisor of 4879464 and 894544, using prime factorization. | 1 |
| 5888 | Find Greatest Common Divisor of 84 and 24, using Euclidean algorithm. | 1 |
| 5889 | Find Greatest Common Divisor of 78 and 117, using prime factorization. | 1 |
| 5890 | Find Greatest Common Divisor of 64 and 864, using prime factorization. | 1 |
| 5891 | Find Greatest Common Divisor of 75 and 126, using prime factorization. | 1 |
| 5892 | Find Greatest Common Divisor of 192 and 26, using prime factorization. | 1 |
| 5893 | Find Greatest Common Divisor of 132223 and 11011, using Euclidean algorithm. | 1 |
| 5894 | Find Greatest Common Divisor of 192 and 24, using prime factorization. | 1 |
| 5895 | Find Greatest Common Divisor of 52920 and 66528, using prime factorization. | 1 |
| 5896 | Find Greatest Common Divisor of 70 and 56, using prime factorization. | 1 |
| 5897 | Find Greatest Common Divisor of 130 and 26, using Euclidean algorithm. | 1 |
| 5898 | Find Greatest Common Divisor of 822 and 436, using prime factorization. | 1 |
| 5899 | Find Greatest Common Divisor of 1123 and 932, using prime factorization. | 1 |
| 5900 | Find Greatest Common Divisor of 1174 and 559, using prime factorization. | 1 |