GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3051 | Find Greatest Common Divisor of 11200 and 7, by listing out the factors. | 2 |
| 3052 | Find Greatest Common Divisor of 15, 69 and 25, using prime factorization. | 2 |
| 3053 | Find Greatest Common Divisor of 44, 62 and 69, using prime factorization. | 2 |
| 3054 | Find Greatest Common Divisor of 62, 2 and 86, using prime factorization. | 2 |
| 3055 | Find Greatest Common Divisor of 25, 16 and 10, using prime factorization. | 2 |
| 3056 | Find Greatest Common Divisor of 88, 37 and 21, using prime factorization. | 2 |
| 3057 | Find Greatest Common Divisor of 72, 60 and 56, using prime factorization. | 2 |
| 3058 | Find Greatest Common Divisor of 25, 10 and 92, using prime factorization. | 2 |
| 3059 | Find Greatest Common Divisor of 56, 91 and 3, using prime factorization. | 2 |
| 3060 | Find Greatest Common Divisor of 19, 35 and 34, using prime factorization. | 2 |
| 3061 | Find Greatest Common Divisor of 87, 11 and 31, using prime factorization. | 2 |
| 3062 | Find Greatest Common Divisor of 19, 52 and 47, using prime factorization. | 2 |
| 3063 | Find Greatest Common Divisor of 10, 47 and 24, using prime factorization. | 2 |
| 3064 | Find Greatest Common Divisor of 23, 23 and 32, using prime factorization. | 2 |
| 3065 | Find Greatest Common Divisor of 92, 32 and 68, using prime factorization. | 2 |
| 3066 | Find Greatest Common Divisor of 93, 73 and 54, using prime factorization. | 2 |
| 3067 | Find Greatest Common Divisor of 3, 16 and 13, using prime factorization. | 2 |
| 3068 | Find Greatest Common Divisor of 16, 32 and 94, using prime factorization. | 2 |
| 3069 | Find Greatest Common Divisor of 73, 56 and 44, using prime factorization. | 2 |
| 3070 | Find Greatest Common Divisor of 25, 75 and 90, using prime factorization. | 2 |
| 3071 | Find Greatest Common Divisor of 15, 29 and 75, using prime factorization. | 2 |
| 3072 | Find Greatest Common Divisor of 90, 50 and 53, using prime factorization. | 2 |
| 3073 | Find Greatest Common Divisor of 45 and 79, using Euclidean algorithm. | 2 |
| 3074 | Find Greatest Common Divisor of 25 and 90, using Euclidean algorithm. | 2 |
| 3075 | Find Greatest Common Divisor of 82 and 70, using Euclidean algorithm. | 2 |
| 3076 | Find Greatest Common Divisor of 15 and 75, using Euclidean algorithm. | 2 |
| 3077 | Find Greatest Common Divisor of 83 and 49, using Euclidean algorithm. | 2 |
| 3078 | Find Greatest Common Divisor of 27 and 37, using Euclidean algorithm. | 2 |
| 3079 | Find Greatest Common Divisor of 72 and 47, using Euclidean algorithm. | 2 |
| 3080 | Find Greatest Common Divisor of 32 and 4, using Euclidean algorithm. | 2 |
| 3081 | Find Greatest Common Divisor of 32 and 4, using Euclidean algorithm. | 2 |
| 3082 | Find Greatest Common Divisor of 8 and 52, using Euclidean algorithm. | 2 |
| 3083 | Find Greatest Common Divisor of 58 and 40, using Euclidean algorithm. | 2 |
| 3084 | Find Greatest Common Divisor of 56 and 3, using Euclidean algorithm. | 2 |
| 3085 | Find Greatest Common Divisor of 44 and 97, using Euclidean algorithm. | 2 |
| 3086 | Find Greatest Common Divisor of 97 and 45, using Euclidean algorithm. | 2 |
| 3087 | Find Greatest Common Divisor of 52 and 98, using Euclidean algorithm. | 2 |
| 3088 | Find Greatest Common Divisor of 62 and 30, using Euclidean algorithm. | 2 |
| 3089 | Find Greatest Common Divisor of 30 and 14, using Euclidean algorithm. | 2 |
| 3090 | Find Greatest Common Divisor of 42 and 95, using Euclidean algorithm. | 2 |
| 3091 | Find Greatest Common Divisor of 53 and 14, using Euclidean algorithm. | 2 |
| 3092 | Find Greatest Common Divisor of 44 and 48, using Euclidean algorithm. | 2 |
| 3093 | Find Greatest Common Divisor of 69 and 97, using Euclidean algorithm. | 2 |
| 3094 | Find Greatest Common Divisor of 90 and 13, using Euclidean algorithm. | 2 |
| 3095 | Find Greatest Common Divisor of 76 and 53, using Euclidean algorithm. | 2 |
| 3096 | Find Greatest Common Divisor of 56 and 98, using Euclidean algorithm. | 2 |
| 3097 | Find Greatest Common Divisor of 33 and 70, using Euclidean algorithm. | 2 |
| 3098 | Find Greatest Common Divisor of 53 and 28, using Euclidean algorithm. | 2 |
| 3099 | Find Greatest Common Divisor of 8 and 73, using Euclidean algorithm. | 2 |
| 3100 | Find Greatest Common Divisor of 90 and 67, using Euclidean algorithm. | 2 |