GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1051 | Find Greatest Common Divisor of 160485, 2, 127104 and 14, using prime factorization. | 2 |
1052 | Find Greatest Common Divisor of 14 and 42, using prime factorization. | 2 |
1053 | Find Greatest Common Divisor of 18 and 12, using prime factorization. | 2 |
1054 | Find Greatest Common Divisor of 221 and 45, using Euclidean algorithm. | 2 |
1055 | Find Greatest Common Divisor of 16128, 27216 and 25200, using prime factorization. | 2 |
1056 | Find Greatest Common Divisor of 203 and 833, using Euclidean algorithm. | 2 |
1057 | Find Greatest Common Divisor of 56 and 3, using Euclidean algorithm. | 2 |
1058 | Find Greatest Common Divisor of 87 and 94, using Euclidean algorithm. | 2 |
1059 | Find Greatest Common Divisor of 72 and 21, using prime factorization. | 2 |
1060 | Find Greatest Common Divisor of 36, 87, 90 and 120, using prime factorization. | 2 |
1061 | Find Greatest Common Divisor of 100 and 60, using prime factorization. | 2 |
1062 | Find Greatest Common Divisor of 72 and 252, using prime factorization. | 2 |
1063 | Find Greatest Common Divisor of 666 and 558, using prime factorization. | 2 |
1064 | Find Greatest Common Divisor of 47 and 89, using Euclidean algorithm. | 2 |
1065 | Find Greatest Common Divisor of 97 and 63, using Euclidean algorithm. | 2 |
1066 | Find Greatest Common Divisor of 1, 5, 3 and 10, using prime factorization. | 2 |
1067 | Find Greatest Common Divisor of 2. | 2 |
1068 | Find Greatest Common Divisor of 48, 72, 108, 120, 144, 180, 192, 216, 240 and 300, using prime factorization. | 2 |
1069 | Find Greatest Common Divisor of 40, 6, 43, 5, 42, 2, 6, 6, 12, 1, 1 and 1, using prime factorization. | 2 |
1070 | Find Greatest Common Divisor of 450, 600 and 750, using prime factorization. | 2 |
1071 | Find Greatest Common Divisor of 44 and 97, using Euclidean algorithm. | 2 |
1072 | Find Greatest Common Divisor of 214. | 2 |
1073 | Find Greatest Common Divisor of 214 and 210, using prime factorization. | 2 |
1074 | Find Greatest Common Divisor of 97 and 45, using Euclidean algorithm. | 2 |
1075 | Find Greatest Common Divisor of 27 and 79, using Euclidean algorithm. | 2 |
1076 | Find Greatest Common Divisor of 24 and 84, using prime factorization. | 2 |
1077 | Find Greatest Common Divisor of 12345. | 2 |
1078 | Find Greatest Common Divisor of 21 and 17, using prime factorization. | 2 |
1079 | Find Greatest Common Divisor of 524 and 148, using Euclidean algorithm. | 2 |
1080 | Find Greatest Common Divisor of 79 and 41, using prime factorization. | 2 |
1081 | Find Greatest Common Divisor of 341 and 2, using Euclidean algorithm. | 2 |
1082 | Find Greatest Common Divisor of 242, 484 and 363, using prime factorization. | 2 |
1083 | Find Greatest Common Divisor of 52 and 98, using Euclidean algorithm. | 2 |
1084 | Find Greatest Common Divisor of 59 and 64, using Euclidean algorithm. | 2 |
1085 | Find Greatest Common Divisor of 54 and 45, using prime factorization. | 2 |
1086 | Find Greatest Common Divisor of 12 and 18, using repeated division. | 2 |
1087 | Find Greatest Common Divisor of 44 and 91, using Euclidean algorithm. | 2 |
1088 | Find Greatest Common Divisor of 9801 and 1452891650, using Euclidean algorithm. | 2 |
1089 | Find Greatest Common Divisor of 20 and 32, using prime factorization. | 2 |
1090 | Find Greatest Common Divisor of 64 and 160, using Euclidean algorithm. | 2 |
1091 | Find Greatest Common Divisor of 54 and 45, using Euclidean algorithm. | 2 |
1092 | Find Greatest Common Divisor of 370 and 210, using prime factorization. | 2 |
1093 | Find Greatest Common Divisor of 23 and 3, using prime factorization. | 2 |
1094 | Find Greatest Common Divisor of 1666. | 2 |
1095 | Find Greatest Common Divisor of 63 and 16, using Euclidean algorithm. | 2 |
1096 | Find Greatest Common Divisor of 132 and 630, using Euclidean algorithm. | 2 |
1097 | Find Greatest Common Divisor of 20 and 216, using prime factorization. | 2 |
1098 | Find Greatest Common Divisor of 62 and 30, using Euclidean algorithm. | 2 |
1099 | Find Greatest Common Divisor of 5 and 67, using Euclidean algorithm. | 2 |
1100 | Find Greatest Common Divisor of 133 and 1729, using prime factorization. | 2 |