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 12409 and 23883, using Euclidean algorithm. | 1 |
| 3952 | Find Greatest Common Divisor of 49, 15 and 132, using prime factorization. | 1 |
| 3953 | Find Greatest Common Divisor of 47 and 97, using prime factorization. | 1 |
| 3954 | Find Greatest Common Divisor of 6, 45 and 109, using prime factorization. | 1 |
| 3955 | Find Greatest Common Divisor of 11 and 14, using prime factorization. | 1 |
| 3956 | Find Greatest Common Divisor of 242, 363 and 484, using prime factorization. | 1 |
| 3957 | Find Greatest Common Divisor of 950, 2090 and 1330, using prime factorization. | 1 |
| 3958 | Find Greatest Common Divisor of 34 and 935, using repeated division. | 1 |
| 3959 | Find Greatest Common Divisor of 609 and 1566, using prime factorization. | 1 |
| 3960 | Find Greatest Common Divisor of 112 and 144, using repeated division. | 1 |
| 3961 | Find Greatest Common Divisor of 112 and 144, using Euclidean algorithm. | 1 |
| 3962 | Find Greatest Common Divisor of 112 and 144, by listing out the factors. | 1 |
| 3963 | Find Greatest Common Divisor of 80 and 144, by listing out the factors. | 1 |
| 3964 | Find Greatest Common Divisor of 85 and 6, using Euclidean algorithm. | 1 |
| 3965 | Find Greatest Common Divisor of 361 and 580, using prime factorization. | 1 |
| 3966 | Find Greatest Common Divisor of 30 and 160, using prime factorization. | 1 |
| 3967 | Find Greatest Common Divisor of 31 and 160, using prime factorization. | 1 |
| 3968 | Find Greatest Common Divisor of 7 and 160, using prime factorization. | 1 |
| 3969 | Find Greatest Common Divisor of 500 and 1000, using prime factorization. | 1 |
| 3970 | Find Greatest Common Divisor of 16 and 20, using repeated division. | 1 |
| 3971 | Find Greatest Common Divisor of 48 and 31, using Euclidean algorithm. | 1 |
| 3972 | Find Greatest Common Divisor of 121 and 7, using Euclidean algorithm. | 1 |
| 3973 | Find Greatest Common Divisor of 2160 and 2204, using Euclidean algorithm. | 1 |
| 3974 | Find Greatest Common Divisor of 231 and 1000, using Euclidean algorithm. | 1 |
| 3975 | Find Greatest Common Divisor of 12, 24, 42 and 60, using prime factorization. | 1 |
| 3976 | Find Greatest Common Divisor of 84, 36 and 75, using repeated division. | 1 |
| 3977 | Find Greatest Common Divisor of 12 and 15, using repeated division. | 1 |
| 3978 | Find Greatest Common Divisor of 213 and 466, using Euclidean algorithm. | 1 |
| 3979 | Find Greatest Common Divisor of 26453952 and 19, by listing out the factors. | 1 |
| 3980 | Find Greatest Common Divisor of 26453952 and 19, using Euclidean algorithm. | 1 |
| 3981 | Find Greatest Common Divisor of 91 and 26, using Euclidean algorithm. | 1 |
| 3982 | Find Greatest Common Divisor of 840. | 1 |
| 3983 | Find Greatest Common Divisor of 868 and 378, using Euclidean algorithm. | 1 |
| 3984 | Find Greatest Common Divisor of 160 and 200, using prime factorization. | 1 |
| 3985 | Find Greatest Common Divisor of 3, 4, 7 and 2, using Euclidean algorithm. | 1 |
| 3986 | Find Greatest Common Divisor of 16, 28, 32, 37, 45, 1 and 11, using prime factorization. | 1 |
| 3987 | Find Greatest Common Divisor of 16 and 32, using Euclidean algorithm. | 1 |
| 3988 | Find Greatest Common Divisor of 16 and 37, using Euclidean algorithm. | 1 |
| 3989 | Find Greatest Common Divisor of 16 and 45, using Euclidean algorithm. | 1 |
| 3990 | Find Greatest Common Divisor of 16 and 1, using Euclidean algorithm. | 1 |
| 3991 | Find Greatest Common Divisor of 16 and 11, using Euclidean algorithm. | 1 |
| 3992 | Find Greatest Common Divisor of 15 and 20, using Euclidean algorithm. | 1 |
| 3993 | Find Greatest Common Divisor of 15 and 33, using Euclidean algorithm. | 1 |
| 3994 | Find Greatest Common Divisor of 15 and 36, using Euclidean algorithm. | 1 |
| 3995 | Find Greatest Common Divisor of 15 and 46, using Euclidean algorithm. | 1 |
| 3996 | Find Greatest Common Divisor of 15 and 8, using Euclidean algorithm. | 1 |
| 3997 | Find Greatest Common Divisor of 15 and 12, using Euclidean algorithm. | 1 |
| 3998 | Find Greatest Common Divisor of 15 and 22, using Euclidean algorithm. | 1 |
| 3999 | Find Greatest Common Divisor of 15 and 23, using Euclidean algorithm. | 1 |
| 4000 | Find Greatest Common Divisor of 15 and 24, using Euclidean algorithm. | 1 |
