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 8935 and 15, by listing out the factors. | 1 |
| 5852 | Find Greatest Common Divisor of 192 and 8, using Euclidean algorithm. | 1 |
| 5853 | Find Greatest Common Divisor of 192 and 3, using Euclidean algorithm. | 1 |
| 5854 | Find Greatest Common Divisor of 192 and 9, using Euclidean algorithm. | 1 |
| 5855 | Find Greatest Common Divisor of 192 and 7, using prime factorization. | 1 |
| 5856 | Find Greatest Common Divisor of 192 and 11, using prime factorization. | 1 |
| 5857 | Find Greatest Common Divisor of 9223372036854775807. | 1 |
| 5858 | Find Greatest Common Divisor of 72 and 45, using prime factorization. | 1 |
| 5859 | Find Greatest Common Divisor of 252 and 291, using Euclidean algorithm. | 1 |
| 5860 | Find Greatest Common Divisor of 117 and 845, using Euclidean algorithm. | 1 |
| 5861 | Find Greatest Common Divisor of 5387 and 133, using prime factorization. | 1 |
| 5862 | Find Greatest Common Divisor of 5387 and 133, using Euclidean algorithm. | 1 |
| 5863 | Find Greatest Common Divisor of 17 and 11, using Euclidean algorithm. | 1 |
| 5864 | Find Greatest Common Divisor of 223 and 48, using prime factorization. | 1 |
| 5865 | Find Greatest Common Divisor of 111111 and 11111, using Euclidean algorithm. | 1 |
| 5866 | Find Greatest Common Divisor of 192 and 19, using Euclidean algorithm. | 1 |
| 5867 | Find Greatest Common Divisor of 32 and 623, using Euclidean algorithm. | 1 |
| 5868 | Find Greatest Common Divisor of 32 and 263, using Euclidean algorithm. | 1 |
| 5869 | Find Greatest Common Divisor of 446 and 269, using Euclidean algorithm. | 1 |
| 5870 | Find Greatest Common Divisor of 12211 and 10422, using Euclidean algorithm. | 1 |
| 5871 | Find Greatest Common Divisor of 786 and 123, using Euclidean algorithm. | 1 |
| 5872 | Find Greatest Common Divisor of 2, 4, 3, 2, 5, 2, 2, 3, 5 and 2, using prime factorization. | 1 |
| 5873 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using prime factorization. | 1 |
| 5874 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, by listing out the factors. | 1 |
| 5875 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using Euclidean algorithm. | 1 |
| 5876 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using repeated division. | 1 |
| 5877 | Find Greatest Common Divisor of 150 and 51, using prime factorization. | 1 |
| 5878 | Find Greatest Common Divisor of 44, 32 and 54, using prime factorization. | 1 |
| 5879 | Find Greatest Common Divisor of 32756, 32758 and 32760, using prime factorization. | 1 |
| 5880 | Find Greatest Common Divisor of 40293, 50193 and 59829, using prime factorization. | 1 |
| 5881 | Find Greatest Common Divisor of 216 and 106, using prime factorization. | 1 |
| 5882 | Find Greatest Common Divisor of 216 and 108, using prime factorization. | 1 |
| 5883 | Find Greatest Common Divisor of 28853, 684, 28892, 402, 32063 and 656, using prime factorization. | 1 |
| 5884 | Find Greatest Common Divisor of 84 and 140, using prime factorization. | 1 |
| 5885 | Find Greatest Common Divisor of 3 and 889079, using Euclidean algorithm. | 1 |
| 5886 | Find Greatest Common Divisor of 63 and 889079, using Euclidean algorithm. | 1 |
| 5887 | Find Greatest Common Divisor of 773794 and 889079, using Euclidean algorithm. | 1 |
| 5888 | Find Greatest Common Divisor of 798216 and 889079, using Euclidean algorithm. | 1 |
| 5889 | Find Greatest Common Divisor of 798215 and 889079, using Euclidean algorithm. | 1 |
| 5890 | Find Greatest Common Divisor of 192 and 108, using prime factorization. | 1 |
| 5891 | Find Greatest Common Divisor of 1238 and 800, using prime factorization. | 1 |
| 5892 | Find Greatest Common Divisor of 124. | 1 |
| 5893 | Find Greatest Common Divisor of 0. | 1 |
| 5894 | Find Greatest Common Divisor of 10. | 1 |
| 5895 | Find Greatest Common Divisor of 2200765035 and 2000, using Euclidean algorithm. | 1 |
| 5896 | Find Greatest Common Divisor of 3587 and 54, using prime factorization. | 1 |
| 5897 | Find Greatest Common Divisor of 3587 and 594, using prime factorization. | 1 |
| 5898 | Find Greatest Common Divisor of 3587 and 694, using prime factorization. | 1 |
| 5899 | Find Greatest Common Divisor of 3593 and 697, using prime factorization. | 1 |
| 5900 | Find Greatest Common Divisor of 3594 and 697, using prime factorization. | 1 |
