GCD – Solved Problems Database

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

Change category

ID	Problem	Count
1001	Find Greatest Common Divisor of 4453 and 5767, using Euclidean algorithm.	2
1002	Find Greatest Common Divisor of 60800 and 60200, using Euclidean algorithm.	2
1003	Find Greatest Common Divisor of 484 and 398, using prime factorization.	2
1004	Find Greatest Common Divisor of 17 and 26, using prime factorization.	2
1005	Find Greatest Common Divisor of 1547 and 1440, using prime factorization.	2
1006	Find Greatest Common Divisor of 19, 37, 40, 63, 69 and 17, using prime factorization.	2
1007	Find Greatest Common Divisor of 2613 and 2171, using prime factorization.	2
1008	Find Greatest Common Divisor of 28 and 35, using prime factorization.	2
1009	Find Greatest Common Divisor of 231 and 7757, using prime factorization.	2
1010	Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm.	2
1011	Find Greatest Common Divisor of 79981981272 and 8023, using repeated division.	2
1012	Find Greatest Common Divisor of 73, 56 and 44, using prime factorization.	2
1013	Find Greatest Common Divisor of 1, 746, 28 and 324, using prime factorization.	2
1014	Find Greatest Common Divisor of 275 and 435, using prime factorization.	2
1015	Find Greatest Common Divisor of 56 and 60, using Euclidean algorithm.	2
1016	Find Greatest Common Divisor of 19, 37, 40, 63, 69 and 17, by listing out the factors.	2
1017	Find Greatest Common Divisor of 7, 12 and 14, using prime factorization.	2
1018	Find Greatest Common Divisor of 45 and 18, using repeated division.	2
1019	Find Greatest Common Divisor of 43.	2
1020	Find Greatest Common Divisor of 862.	2
1021	Find Greatest Common Divisor of 28 and 52, using repeated division.	2
1022	Find Greatest Common Divisor of 7, 12 and 14, using repeated division.	2
1023	Find Greatest Common Divisor of 85672 and 242040, using Euclidean algorithm.	2
1024	Find Greatest Common Divisor of 2 and 62, using Euclidean algorithm.	2
1025	Find Greatest Common Divisor of 471 and 9231, using Euclidean algorithm.	2
1026	Find Greatest Common Divisor of 321 and 100, using prime factorization.	2
1027	Find Greatest Common Divisor of 56 and 60, using prime factorization.	2
1028	Find Greatest Common Divisor of 1975231 and 1936877, using prime factorization.	2
1029	Find Greatest Common Divisor of 19 and 45, using Euclidean algorithm.	2
1030	Find Greatest Common Divisor of 60 and 136, using prime factorization.	2
1031	Find Greatest Common Divisor of 446492299 and 186378511, using prime factorization.	2
1032	Find Greatest Common Divisor of 27 and 5, using prime factorization.	2
1033	Find Greatest Common Divisor of 1914 and 899, using prime factorization.	2
1034	Find Greatest Common Divisor of 8440.	2
1035	Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using repeated division.	2
1036	Find Greatest Common Divisor of 48 and 72, using Euclidean algorithm.	2
1037	Find Greatest Common Divisor of 33 and 45, using Euclidean algorithm.	2
1038	Find Greatest Common Divisor of 0 and 5, using repeated division.	2
1039	Find Greatest Common Divisor of 210, 60 and 45, using prime factorization.	2
1040	Find Greatest Common Divisor of 1, 24, 34, 35 and 36, using Euclidean algorithm.	2
1041	Find Greatest Common Divisor of 2, 48, 2, 88, 3 and 6, using prime factorization.	2
1042	Find Greatest Common Divisor of 406 and 945, using prime factorization.	2
1043	Find Greatest Common Divisor of 13, 16, 31, 34 and 43, using Euclidean algorithm.	2
1044	Find Greatest Common Divisor of 7, 5 and 6, using prime factorization.	2
1045	Find Greatest Common Divisor of 52 and 54, using prime factorization.	2
1046	Find Greatest Common Divisor of 123456 and 789, using repeated division.	2
1047	Find Greatest Common Divisor of 0 and 0, using prime factorization.	2
1048	Find Greatest Common Divisor of 44 and 95, using Euclidean algorithm.	2
1049	Find Greatest Common Divisor of 6 and 5, using repeated division.	2
1050	Find Greatest Common Divisor of 52 and 54, by listing out the factors.	2