GCD – Solved Problems Database

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

Change category

ID	Problem	Count
1101	Find Greatest Common Divisor of 1, 2, 5 and 7, using prime factorization.	2
1102	Find Greatest Common Divisor of 8 and 4, using Euclidean algorithm.	2
1103	Find Greatest Common Divisor of 123 and 456, using prime factorization.	2
1104	Find Greatest Common Divisor of 17 and 8, using Euclidean algorithm.	2
1105	Find Greatest Common Divisor of 26, 46 and 48, using prime factorization.	2
1106	Find Greatest Common Divisor of 170 and 122, by listing out the factors.	2
1107	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, by listing out the factors.	2
1108	Find Greatest Common Divisor of 17 and 60, using Euclidean algorithm.	2
1109	Find Greatest Common Divisor of 3566 and 3444, using prime factorization.	2
1110	Find Greatest Common Divisor of 1, 24, 1 and 6, using prime factorization.	2
1111	Find Greatest Common Divisor of 32 and 936, using prime factorization.	2
1112	Find Greatest Common Divisor of 4, 21 and 60, using prime factorization.	2
1113	Find Greatest Common Divisor of 233 and 5880420, using prime factorization.	2
1114	Find Greatest Common Divisor of 1 and 1000, using prime factorization.	2
1115	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, using Euclidean algorithm.	2
1116	Find Greatest Common Divisor of 1540 and 10, using Euclidean algorithm.	2
1117	Find Greatest Common Divisor of 34 and 23, using prime factorization.	2
1118	Find Greatest Common Divisor of 83 and 99, using Euclidean algorithm.	2
1119	Find Greatest Common Divisor of 24 and 20, using Euclidean algorithm.	2
1120	Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, using prime factorization.	2
1121	Find Greatest Common Divisor of 504 and 980, using prime factorization.	2
1122	Find Greatest Common Divisor of 101 and 3267, using Euclidean algorithm.	2
1123	Find Greatest Common Divisor of 3556 and 3444, using prime factorization.	2
1124	Find Greatest Common Divisor of 0, 0, 68, 0, 328, 0, 68 and 328, using Euclidean algorithm.	2
1125	Find Greatest Common Divisor of 1001 and 910, using prime factorization.	2
1126	Find Greatest Common Divisor of 2 and 1001, using prime factorization.	2
1127	Find Greatest Common Divisor of 48 and 57, using prime factorization.	2
1128	Find Greatest Common Divisor of 4 and 39, using Euclidean algorithm.	2
1129	Find Greatest Common Divisor of 56 and 2582, using prime factorization.	2
1130	Find Greatest Common Divisor of 48 and 64, by listing out the factors.	2
1131	Find Greatest Common Divisor of 2, 5, 7 and 11, using prime factorization.	2
1132	Find Greatest Common Divisor of 2 and 1002, using prime factorization.	2
1133	Find Greatest Common Divisor of 48 and 57, using repeated division.	2
1134	Find Greatest Common Divisor of 750 and 5, using Euclidean algorithm.	2
1135	Find Greatest Common Divisor of 35 and 67, using Euclidean algorithm.	2
1136	Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using prime factorization.	2
1137	Find Greatest Common Divisor of 48030.	2
1138	Find Greatest Common Divisor of 154 and 7, using repeated division.	2
1139	Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, by listing out the factors.	2
1140	Find Greatest Common Divisor of 56 and 25824, using prime factorization.	2
1141	Find Greatest Common Divisor of 3915 and 825, using Euclidean algorithm.	2
1142	Find Greatest Common Divisor of 45 and 79, using Euclidean algorithm.	2
1143	Find Greatest Common Divisor of 40 and 50, using Euclidean algorithm.	2
1144	Find Greatest Common Divisor of 68, 12, 8, 4 and 0, by listing out the factors.	2
1145	Find Greatest Common Divisor of 25 and 90, using Euclidean algorithm.	2
1146	Find Greatest Common Divisor of 68, 12, 8, 4 and 0, using repeated division.	2
1147	Find Greatest Common Divisor of 36 and 14, using prime factorization.	2
1148	Find Greatest Common Divisor of 11 and 1680, using prime factorization.	2
1149	Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using Euclidean algorithm.	2
1150	Find Greatest Common Divisor of 5 and 11, using Euclidean algorithm.	2