GCD – Solved Problems Database

All the problems and solutions shown below were generated using the GCD Calculator.

Change category

ID	Problem	Count
1151	Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using Euclidean algorithm.	2
1152	Find Greatest Common Divisor of 156 and 25824, using prime factorization.	2
1153	Find Greatest Common Divisor of 784 and 1400, using prime factorization.	2
1154	Find Greatest Common Divisor of 49 and 156, using Euclidean algorithm.	2
1155	Find Greatest Common Divisor of 73556 and 3444, using repeated division.	2
1156	Find Greatest Common Divisor of 13 and 41, using Euclidean algorithm.	2
1157	Find Greatest Common Divisor of 270 and 358, using prime factorization.	2
1158	Find Greatest Common Divisor of 13 and 120, using prime factorization.	2
1159	Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using prime factorization.	2
1160	Find Greatest Common Divisor of 99 and 59, using Euclidean algorithm.	2
1161	Find Greatest Common Divisor of 35 and 81, using Euclidean algorithm.	2
1162	Find Greatest Common Divisor of 333 and 583, using prime factorization.	2
1163	Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using repeated division.	2
1164	Find Greatest Common Divisor of 391, 667513, 1134 and 1215, using repeated division.	2
1165	Find Greatest Common Divisor of 82 and 70, using Euclidean algorithm.	2
1166	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using prime factorization.	2
1167	Find Greatest Common Divisor of 378 and 140, using Euclidean algorithm.	2
1168	Find Greatest Common Divisor of 1, 12, 9 and 14, using prime factorization.	2
1169	Find Greatest Common Divisor of 333 and 583, using repeated division.	2
1170	Find Greatest Common Divisor of 85 and 5, using prime factorization.	2
1171	Find Greatest Common Divisor of 5, 7 and 12, using prime factorization.	2
1172	Find Greatest Common Divisor of 300 and 110, using Euclidean algorithm.	2
1173	Find Greatest Common Divisor of 180, 396 and 468, using Euclidean algorithm.	2
1174	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, by listing out the factors.	2
1175	Find Greatest Common Divisor of 78 and 66, using repeated division.	2
1176	Find Greatest Common Divisor of 30 and 45, using prime factorization.	2
1177	Find Greatest Common Divisor of 5, 7 and 12, using repeated division.	2
1178	Find Greatest Common Divisor of 15 and 75, using Euclidean algorithm.	2
1179	Find Greatest Common Divisor of 42, 78 and 96, using prime factorization.	2
1180	Find Greatest Common Divisor of 15 and 22, using prime factorization.	2
1181	Find Greatest Common Divisor of 720 and 588, using Euclidean algorithm.	2
1182	Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using repeated division.	2
1183	Find Greatest Common Divisor of 78 and 66, by listing out the factors.	2
1184	Find Greatest Common Divisor of 37 and 3120, using Euclidean algorithm.	2
1185	Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, by listing out the factors.	2
1186	Find Greatest Common Divisor of 7 and 12, using repeated division.	2
1187	Find Greatest Common Divisor of 48 and 54, using prime factorization.	2
1188	Find Greatest Common Divisor of 311 and 28, using repeated division.	2
1189	Find Greatest Common Divisor of 9 and 30, using Euclidean algorithm.	2
1190	Find Greatest Common Divisor of 30 and 8, using prime factorization.	2
1191	Find Greatest Common Divisor of 333 and 963, by listing out the factors.	2
1192	Find Greatest Common Divisor of 23 and 1200, using Euclidean algorithm.	2
1193	Find Greatest Common Divisor of 89 and 79, using Euclidean algorithm.	2
1194	Find Greatest Common Divisor of 60 and 24, using prime factorization.	2
1195	Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization.	2
1196	Find Greatest Common Divisor of 356 and 140, using prime factorization.	2
1197	Find Greatest Common Divisor of 78 and 66, using Euclidean algorithm.	2
1198	Find Greatest Common Divisor of 39 and 65, by listing out the factors.	2
1199	Find Greatest Common Divisor of 20 and 15, using Euclidean algorithm.	2
1200	Find Greatest Common Divisor of 15265.	2