GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3951 | Find Greatest Common Divisor of 36, 64 and 72, using repeated division. | 2 |
| 3952 | Find Greatest Common Divisor of 36, 64 and 72, using prime factorization. | 2 |
| 3953 | Find Greatest Common Divisor of 78 and 99, using prime factorization. | 2 |
| 3954 | Find Greatest Common Divisor of 341 and 271, using repeated division. | 2 |
| 3955 | Find Greatest Common Divisor of 88 and 187, using repeated division. | 2 |
| 3956 | Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, using prime factorization. | 2 |
| 3957 | Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, using repeated division. | 2 |
| 3958 | Find Greatest Common Divisor of 22, 29, 33, 36, 40 and 15, by listing out the factors. | 2 |
| 3959 | Find Greatest Common Divisor of 197 and 144, using Euclidean algorithm. | 2 |
| 3960 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using repeated division. | 2 |
| 3961 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using Euclidean algorithm. | 2 |
| 3962 | Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using Euclidean algorithm. | 2 |
| 3963 | Find Greatest Common Divisor of 9801 and 1452891650, using Euclidean algorithm. | 2 |
| 3964 | Find Greatest Common Divisor of 35 and 192, by listing out the factors. | 2 |
| 3965 | Find Greatest Common Divisor of 605 and 210, using Euclidean algorithm. | 2 |
| 3966 | Find Greatest Common Divisor of 5 and 2772, using prime factorization. | 2 |
| 3967 | Find Greatest Common Divisor of 7 and 26, using Euclidean algorithm. | 2 |
| 3968 | Find Greatest Common Divisor of 9 and 40, using prime factorization. | 2 |
| 3969 | Find Greatest Common Divisor of 928 and 612, using prime factorization. | 2 |
| 3970 | Find Greatest Common Divisor of 6437 and 2393, using prime factorization. | 2 |
| 3971 | Find Greatest Common Divisor of 28, 38, 52, 54, 68 and 8, using prime factorization. | 2 |
| 3972 | Find Greatest Common Divisor of 32, 48 and 80, using prime factorization. | 2 |
| 3973 | Find Greatest Common Divisor of 1152 and 1728, using prime factorization. | 2 |
| 3974 | Find Greatest Common Divisor of 28, 38, 52, 54 and 68, using prime factorization. | 2 |
| 3975 | Find Greatest Common Divisor of 2000 and 1713, using Euclidean algorithm. | 2 |
| 3976 | Find Greatest Common Divisor of 2000 and 1713, using prime factorization. | 2 |
| 3977 | Find Greatest Common Divisor of 2000 and 1713, using repeated division. | 2 |
| 3978 | Find Greatest Common Divisor of 588 and 90, using prime factorization. | 2 |
| 3979 | Find Greatest Common Divisor of 588 and 90, using repeated division. | 2 |
| 3980 | Find Greatest Common Divisor of 1 and 8, using prime factorization. | 2 |
| 3981 | Find Greatest Common Divisor of 115 and 184, using Euclidean algorithm. | 2 |
| 3982 | Find Greatest Common Divisor of 115 and 184, by listing out the factors. | 2 |
| 3983 | Find Greatest Common Divisor of 8, 56 and 64, using prime factorization. | 2 |
| 3984 | Find Greatest Common Divisor of 91, 64 and 87, using prime factorization. | 2 |
| 3985 | Find Greatest Common Divisor of 38 and 52, using repeated division. | 2 |
| 3986 | Find Greatest Common Divisor of 28 and 52, using repeated division. | 2 |
| 3987 | Find Greatest Common Divisor of 52 and 54, using prime factorization. | 2 |
| 3988 | Find Greatest Common Divisor of 52 and 54, by listing out the factors. | 2 |
| 3989 | Find Greatest Common Divisor of 17 and 34, using prime factorization. | 2 |
| 3990 | Find Greatest Common Divisor of 17, 34, 56, 60 and 61, by listing out the factors. | 2 |
| 3991 | Find Greatest Common Divisor of 17 and 61, using Euclidean algorithm. | 2 |
| 3992 | Find Greatest Common Divisor of 17 and 60, using Euclidean algorithm. | 2 |
| 3993 | Find Greatest Common Divisor of 378 and 140, using Euclidean algorithm. | 2 |
| 3994 | Find Greatest Common Divisor of 66 and 35, using Euclidean algorithm. | 2 |
| 3995 | Find Greatest Common Divisor of 2282 and 420, using repeated division. | 2 |
| 3996 | Find Greatest Common Divisor of 2282 and 420, using Euclidean algorithm. | 2 |
| 3997 | Find Greatest Common Divisor of 3425 and 273, using prime factorization. | 2 |
| 3998 | Find Greatest Common Divisor of 26 and 19, using prime factorization. | 2 |
| 3999 | Find Greatest Common Divisor of 187 and 34, using prime factorization. | 2 |
| 4000 | Find Greatest Common Divisor of 24, 45 and 5, by listing out the factors. | 2 |