GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1051	Find Greatest Common Divisor of 25 and 12, using Euclidean algorithm.	2
1052	Find Greatest Common Divisor of 1, 746, 28 and 324, using prime factorization.	2
1053	Find Greatest Common Divisor of 89 and 79, using Euclidean algorithm.	2
1054	Find Greatest Common Divisor of 156 and 54, using Euclidean algorithm.	2
1055	Find Greatest Common Divisor of 67 and 63, using Euclidean algorithm.	2
1056	Find Greatest Common Divisor of 5 and 67, using Euclidean algorithm.	2
1057	Find Greatest Common Divisor of 7 and 67, using Euclidean algorithm.	2
1058	Find Greatest Common Divisor of 76 and 70, using Euclidean algorithm.	2
1059	Find Greatest Common Divisor of 67 and 58, using Euclidean algorithm.	2
1060	Find Greatest Common Divisor of 19 and 36, using Euclidean algorithm.	2
1061	Find Greatest Common Divisor of 4 and 20, using Euclidean algorithm.	2
1062	Find Greatest Common Divisor of 86 and 40, using Euclidean algorithm.	2
1063	Find Greatest Common Divisor of 71 and 41, using Euclidean algorithm.	2
1064	Find Greatest Common Divisor of 12906 and 42905, using Euclidean algorithm.	2
1065	Find Greatest Common Divisor of 125 and 52, using Euclidean algorithm.	2
1066	Find Greatest Common Divisor of 300 and 110, using Euclidean algorithm.	2
1067	Find Greatest Common Divisor of 8 and 2, using Euclidean algorithm.	2
1068	Find Greatest Common Divisor of 1 and 99, using Euclidean algorithm.	2
1069	Find Greatest Common Divisor of 19 and 34, using Euclidean algorithm.	2
1070	Find Greatest Common Divisor of 35 and 82, using Euclidean algorithm.	2
1071	Find Greatest Common Divisor of 32 and 14, using Euclidean algorithm.	2
1072	Find Greatest Common Divisor of 73 and 91, using Euclidean algorithm.	2
1073	Find Greatest Common Divisor of 71 and 48, using Euclidean algorithm.	2
1074	Find Greatest Common Divisor of 30 and 18, using Euclidean algorithm.	2
1075	Find Greatest Common Divisor of 48 and 2, using Euclidean algorithm.	2
1076	Find Greatest Common Divisor of 48 and 22, using Euclidean algorithm.	2
1077	Find Greatest Common Divisor of 87 and 54, using Euclidean algorithm.	2
1078	Find Greatest Common Divisor of 28 and 95, using Euclidean algorithm.	2
1079	Find Greatest Common Divisor of 33 and 84, using Euclidean algorithm.	2
1080	Find Greatest Common Divisor of 95 and 22, using Euclidean algorithm.	2
1081	Find Greatest Common Divisor of 80 and 24, using Euclidean algorithm.	2
1082	Find Greatest Common Divisor of 88 and 84, using Euclidean algorithm.	2
1083	Find Greatest Common Divisor of 76 and 84, using Euclidean algorithm.	2
1084	Find Greatest Common Divisor of 42 and 41, using Euclidean algorithm.	2
1085	Find Greatest Common Divisor of 34 and 57, using Euclidean algorithm.	2
1086	Find Greatest Common Divisor of 93 and 66, using Euclidean algorithm.	2
1087	Find Greatest Common Divisor of 57 and 78, using Euclidean algorithm.	2
1088	Find Greatest Common Divisor of 19 and 3, using Euclidean algorithm.	2
1089	Find Greatest Common Divisor of 13 and 93, using Euclidean algorithm.	2
1090	Find Greatest Common Divisor of 44 and 67, using Euclidean algorithm.	2
1091	Find Greatest Common Divisor of 23 and 88, using Euclidean algorithm.	2
1092	Find Greatest Common Divisor of 47 and 81, using Euclidean algorithm.	2
1093	Find Greatest Common Divisor of 64 and 2, using Euclidean algorithm.	2
1094	Find Greatest Common Divisor of 31 and 31, using Euclidean algorithm.	2
1095	Find Greatest Common Divisor of 96 and 46, using Euclidean algorithm.	2
1096	Find Greatest Common Divisor of 88 and 60, using Euclidean algorithm.	2
1097	Find Greatest Common Divisor of 81 and 2, using Euclidean algorithm.	2
1098	Find Greatest Common Divisor of 2 and 62, using Euclidean algorithm.	2
1099	Find Greatest Common Divisor of 446492299 and 186378511, using prime factorization.	2
1100	Find Greatest Common Divisor of 33 and 45, using Euclidean algorithm.	2