GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1101	Find Greatest Common Divisor of 48 and 5, using prime factorization.	2
1102	Find Greatest Common Divisor of 48 and 5, using Euclidean algorithm.	2
1103	Find Greatest Common Divisor of 400.	2
1104	Find Greatest Common Divisor of 400.	2
1105	Find Greatest Common Divisor of 862.	2
1106	Find Greatest Common Divisor of 8440.	2
1107	Find Greatest Common Divisor of 13 and 120, using prime factorization.	2
1108	Find Greatest Common Divisor of 2, 5, 2, 4, 3, 2, 3, 3, 2, 5, 2, 4, 2, 3, 2, 2, 4 and 4, using prime factorization.	2
1109	Find Greatest Common Divisor of 12 and 40, using prime factorization.	2
1110	Find Greatest Common Divisor of 1, 5, 3 and 10, using prime factorization.	2
1111	Find Greatest Common Divisor of 1819 and 3587, using Euclidean algorithm.	2
1112	Find Greatest Common Divisor of 2447 and 3997, using prime factorization.	2
1113	Find Greatest Common Divisor of 1010 and 407, using Euclidean algorithm.	2
1114	Find Greatest Common Divisor of 44 and 91, using Euclidean algorithm.	2
1115	Find Greatest Common Divisor of 407 and 101, using prime factorization.	2
1116	Find Greatest Common Divisor of 407 and 101, using Euclidean algorithm.	2
1117	Find Greatest Common Divisor of 407 and 1010, using Euclidean algorithm.	2
1118	Find Greatest Common Divisor of 1000 and 400, using prime factorization.	2
1119	Find Greatest Common Divisor of 1000 and 400, using Euclidean algorithm.	2
1120	Find Greatest Common Divisor of 1000 and 400, by listing out the factors.	2
1121	Find Greatest Common Divisor of 301, 981, 449 and 573, using prime factorization.	2
1122	Find Greatest Common Divisor of 12 and 16, using repeated division.	2
1123	Find Greatest Common Divisor of 45 and 95, using prime factorization.	2
1124	Find Greatest Common Divisor of 125 and 728, using repeated division.	2
1125	Find Greatest Common Divisor of 125 and 728, using Euclidean algorithm.	2
1126	Find Greatest Common Divisor of 216 and 68, using Euclidean algorithm.	2
1127	Find Greatest Common Divisor of 390 and 1261, using prime factorization.	2
1128	Find Greatest Common Divisor of 1 and 64, using prime factorization.	2
1129	Find Greatest Common Divisor of 267, 445 and 712, using prime factorization.	2
1130	Find Greatest Common Divisor of 356 and 140, using prime factorization.	2
1131	Find Greatest Common Divisor of 280 and 117, using Euclidean algorithm.	2
1132	Find Greatest Common Divisor of 10 and 11, using Euclidean algorithm.	2
1133	Find Greatest Common Divisor of 5871420 and 299, using prime factorization.	2
1134	Find Greatest Common Divisor of 330 and 1140, using prime factorization.	2
1135	Find Greatest Common Divisor of 2701 and 2737, using Euclidean algorithm.	2
1136	Find Greatest Common Divisor of 64.	2
1137	Find Greatest Common Divisor of 56, 94 and 128, using prime factorization.	2
1138	Find Greatest Common Divisor of 56, 92 and 124, using repeated division.	2
1139	Find Greatest Common Divisor of 750 and 960, using repeated division.	2
1140	Find Greatest Common Divisor of 152 and 276, using prime factorization.	2
1141	Find Greatest Common Divisor of 332 and 128, using Euclidean algorithm.	2
1142	Find Greatest Common Divisor of 49, 210 and 350, using prime factorization.	2
1143	Find Greatest Common Divisor of 24, 138, 24 and 138, using prime factorization.	2
1144	Find Greatest Common Divisor of 512 and 186, using prime factorization.	2
1145	Find Greatest Common Divisor of 296, 703 and 814, using prime factorization.	2
1146	Find Greatest Common Divisor of 296, 703 and 814, by listing out the factors.	2
1147	Find Greatest Common Divisor of 231 and 7757, using prime factorization.	2
1148	Find Greatest Common Divisor of 5880420 and 229, using Euclidean algorithm.	2
1149	Find Greatest Common Divisor of 103 and 91, using Euclidean algorithm.	2
1150	Find Greatest Common Divisor of 4 and 5, using prime factorization.	2