GCD – Solved Problems Database

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

Change category

ID	Problem	Count
1051	Find Greatest Common Divisor of 75 and 21, using Euclidean algorithm.	2
1052	Find Greatest Common Divisor of 728, 1196 and 2132, using repeated division.	2
1053	Find Greatest Common Divisor of 44 and 70, using Euclidean algorithm.	2
1054	Find Greatest Common Divisor of 1970 and 1066, using Euclidean algorithm.	2
1055	Find Greatest Common Divisor of 244 and 117, using Euclidean algorithm.	2
1056	Find Greatest Common Divisor of 2 and 7, by listing out the factors.	2
1057	Find Greatest Common Divisor of 25, 75 and 90, using prime factorization.	2
1058	Find Greatest Common Divisor of 220 and 33, using Euclidean algorithm.	2
1059	Find Greatest Common Divisor of 2 and 48, using repeated division.	2
1060	Find Greatest Common Divisor of 405 and 945, using prime factorization.	2
1061	Find Greatest Common Divisor of 513 and 347, using Euclidean algorithm.	2
1062	Find Greatest Common Divisor of 6, 12 and 20, using prime factorization.	2
1063	Find Greatest Common Divisor of 90 and 6, using prime factorization.	2
1064	Find Greatest Common Divisor of 126 and 147, by listing out the factors.	2
1065	Find Greatest Common Divisor of 39 and 2535, using prime factorization.	2
1066	Find Greatest Common Divisor of 24 and 3, using repeated division.	2
1067	Find Greatest Common Divisor of 17 and 34, using prime factorization.	2
1068	Find Greatest Common Divisor of 10 and 1000, by listing out the factors.	2
1069	Find Greatest Common Divisor of 15, 29 and 75, using prime factorization.	2
1070	Find Greatest Common Divisor of 48, 54 and 84, using prime factorization.	2
1071	Find Greatest Common Divisor of 2560 and 1440, using repeated division.	2
1072	Find Greatest Common Divisor of 2600 and 5500, using Euclidean algorithm.	2
1073	Find Greatest Common Divisor of 871 and 27, using Euclidean algorithm.	2
1074	Find Greatest Common Divisor of 62 and 83, using Euclidean algorithm.	2
1075	Find Greatest Common Divisor of 396.	2
1076	Find Greatest Common Divisor of 84, 36 and 75, using prime factorization.	2
1077	Find Greatest Common Divisor of 2560 and 1440, using Euclidean algorithm.	2
1078	Find Greatest Common Divisor of 44289 and 38952, using Euclidean algorithm.	2
1079	Find Greatest Common Divisor of 390 and 1261, using prime factorization.	2
1080	Find Greatest Common Divisor of 16261 and 85652, using prime factorization.	2
1081	Find Greatest Common Divisor of 243 and 368, using prime factorization.	2
1082	Find Greatest Common Divisor of 45, 50 and 60, using prime factorization.	2
1083	Find Greatest Common Divisor of 4 and 69, using prime factorization.	2
1084	Find Greatest Common Divisor of 205800 and 6468, using prime factorization.	2
1085	Find Greatest Common Divisor of 84 and 1264, using Euclidean algorithm.	2
1086	Find Greatest Common Divisor of 49 and 168, using prime factorization.	2
1087	Find Greatest Common Divisor of 6638 and 22783, using Euclidean algorithm.	2
1088	Find Greatest Common Divisor of 170 and 122, using repeated division.	2
1089	Find Greatest Common Divisor of 120.	2
1090	Find Greatest Common Divisor of 17, 34, 56, 60 and 61, by listing out the factors.	2
1091	Find Greatest Common Divisor of 16 and 64, using Euclidean algorithm.	2
1092	Find Greatest Common Divisor of 69 and 372, using Euclidean algorithm.	2
1093	Find Greatest Common Divisor of 200, 10, 120 and 11, using repeated division.	2
1094	Find Greatest Common Divisor of 32, 56 and 78, using repeated division.	2
1095	Find Greatest Common Divisor of 154 and 7, using Euclidean algorithm.	2
1096	Find Greatest Common Divisor of 90, 50 and 53, using prime factorization.	2
1097	Find Greatest Common Divisor of 912 and 1210, using prime factorization.	2
1098	Find Greatest Common Divisor of 928 and 612, using prime factorization.	2
1099	Find Greatest Common Divisor of 17 and 61, using Euclidean algorithm.	2
1100	Find Greatest Common Divisor of 201 and 10, using Euclidean algorithm.	2