GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
1001	Find Greatest Common Divisor of 124 and 148, using prime factorization.	2
1002	Find Greatest Common Divisor of 456, 788 and 782, using prime factorization.	2
1003	Find Greatest Common Divisor of 35 and 65, using prime factorization.	2
1004	Find Greatest Common Divisor of 65 and 115, using prime factorization.	2
1005	Find Greatest Common Divisor of 456 and 444, using prime factorization.	2
1006	Find Greatest Common Divisor of 668 and 122, using prime factorization.	2
1007	Find Greatest Common Divisor of 442 and 64, using prime factorization.	2
1008	Find Greatest Common Divisor of 77 and 312, using repeated division.	2
1009	Find Greatest Common Divisor of 114 and 312, using Euclidean algorithm.	2
1010	Find Greatest Common Divisor of 195 and 45, using Euclidean algorithm.	2
1011	Find Greatest Common Divisor of 7 and 1680, using prime factorization.	2
1012	Find Greatest Common Divisor of 11 and 1680, using prime factorization.	2
1013	Find Greatest Common Divisor of 2 and 3016, using prime factorization.	2
1014	Find Greatest Common Divisor of 7 and 3016, using prime factorization.	2
1015	Find Greatest Common Divisor of 518 and 1064, using Euclidean algorithm.	2
1016	Find Greatest Common Divisor of 6272 and 704, using prime factorization.	2
1017	Find Greatest Common Divisor of 1172 and 88, using prime factorization.	2
1018	Find Greatest Common Divisor of 425 and 85, using repeated division.	2
1019	Find Greatest Common Divisor of 2725 and 1370, using prime factorization.	2
1020	Find Greatest Common Divisor of 145 and 15, using Euclidean algorithm.	2
1021	Find Greatest Common Divisor of 145, 15 and 5, using Euclidean algorithm.	2
1022	Find Greatest Common Divisor of 311 and 28, using repeated division.	2
1023	Find Greatest Common Divisor of 143, 110 and 11, using prime factorization.	2
1024	Find Greatest Common Divisor of 1032 and 780, using Euclidean algorithm.	2
1025	Find Greatest Common Divisor of 61, 610, 1, 61, 671 and 1, using prime factorization.	2
1026	Find Greatest Common Divisor of 18 and 32, using Euclidean algorithm.	2
1027	Find Greatest Common Divisor of 135165.	2
1028	Find Greatest Common Divisor of 135 and 165, using Euclidean algorithm.	2
1029	Find Greatest Common Divisor of 115, 230 and 345, using repeated division.	2
1030	Find Greatest Common Divisor of 1001 and 100001, using Euclidean algorithm.	2
1031	Find Greatest Common Divisor of 55 and 33, using repeated division.	2
1032	Find Greatest Common Divisor of 67945906928237 and 158551974451753, using prime factorization.	2
1033	Find Greatest Common Divisor of 39 and 56, using Euclidean algorithm.	2
1034	Find Greatest Common Divisor of 14 and 9, using Euclidean algorithm.	2
1035	Find Greatest Common Divisor of 6897 and 11857, using Euclidean algorithm.	2
1036	Find Greatest Common Divisor of 6897 and 9481, using Euclidean algorithm.	2
1037	Find Greatest Common Divisor of 85 and 901, using prime factorization.	2
1038	Find Greatest Common Divisor of 78 and 741, using prime factorization.	2
1039	Find Greatest Common Divisor of 65 and 39, using prime factorization.	2
1040	Find Greatest Common Divisor of 42 and 70, using prime factorization.	2
1041	Find Greatest Common Divisor of 66 and 286, using prime factorization.	2
1042	Find Greatest Common Divisor of 9223372036854775807 and 9223372036854775807, using prime factorization.	2
1043	Find Greatest Common Divisor of 133 and 38, using Euclidean algorithm.	2
1044	Find Greatest Common Divisor of 97 and 1045, using Euclidean algorithm.	2
1045	Find Greatest Common Divisor of 2378 and 1764, using Euclidean algorithm.	2
1046	Find Greatest Common Divisor of 43.	2
1047	Find Greatest Common Divisor of 48 and 60, using prime factorization.	2
1048	Find Greatest Common Divisor of 9888 and 6060, using prime factorization.	2
1049	Find Greatest Common Divisor of 2517 and 2370, using prime factorization.	2
1050	Find Greatest Common Divisor of 24 and 80, using prime factorization.	2