GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
8051	Find Greatest Common Divisor of 47 and 94, using prime factorization.	1
8052	Find Greatest Common Divisor of 882 and 33, by listing out the factors.	1
8053	Find Greatest Common Divisor of 33 and 98, using prime factorization.	1
8054		1
8055	Find Greatest Common Divisor of 635 and 200, using prime factorization.	1
8056	Find Greatest Common Divisor of 7, 5, 22 and 5, using prime factorization.	1
8057	Find Greatest Common Divisor of 1364 and 1573, using repeated division.	1
8058	Find Greatest Common Divisor of 585 and 1031, using prime factorization.	1
8059	Find Greatest Common Divisor of 585 and 1030, using prime factorization.	1
8060	Find Greatest Common Divisor of 277 and 1030, using prime factorization.	1
8061	Find Greatest Common Divisor of 684.	1
8062	Find Greatest Common Divisor of 684.	1
8063	Find Greatest Common Divisor of 654 and 8051, using prime factorization.	1
8064	Find Greatest Common Divisor of 654 and 8051, using repeated division.	1
8065	Find Greatest Common Divisor of 1 and 2, using Euclidean algorithm.	1
8066	Find Greatest Common Divisor of 30 and 7, using prime factorization.	1
8067	Find Greatest Common Divisor of 784 and 224, using prime factorization.	1
8068	Find Greatest Common Divisor of 20 and 900, using prime factorization.	1
8069	Find Greatest Common Divisor of 105 and 252, using prime factorization.	1
8070	Find Greatest Common Divisor of 93149832 and 73482, using prime factorization.	1
8071	Find Greatest Common Divisor of 3 and 280, using Euclidean algorithm.	1
8072	Find Greatest Common Divisor of 3 and 15, by listing out the factors.	1
8073	Find Greatest Common Divisor of 294 and 14, using prime factorization.	1
8074	Find Greatest Common Divisor of 2560 and 1600, using prime factorization.	1
8075	Find Greatest Common Divisor of 121 and 169, using prime factorization.	1
8076	Find Greatest Common Divisor of 27 and 56, using prime factorization.	1
8077	Find Greatest Common Divisor of 9 and 56, using prime factorization.	1
8078	Find Greatest Common Divisor of 42 and 28, using repeated division.	1
8079	Find Greatest Common Divisor of 42 and 28, using prime factorization.	1
8080	Find Greatest Common Divisor of 100 and 12, using repeated division.	1
8081	Find Greatest Common Divisor of 1021763679 and 519424709, using prime factorization.	1
8082	Find Greatest Common Divisor of 1021763679 and 519424709, using Euclidean algorithm.	1
8083	Find Greatest Common Divisor of 180 and 6750, using prime factorization.	1
8084	Find Greatest Common Divisor of 10 and 121, using Euclidean algorithm.	1
8085	Find Greatest Common Divisor of 2040 and 1024, using prime factorization.	1
8086	Find Greatest Common Divisor of 987 and 610, using prime factorization.	1
8087	Find Greatest Common Divisor of 35 and 63, using prime factorization.	1
8088	Find Greatest Common Divisor of 9 and 11, using prime factorization.	1
8089	Find Greatest Common Divisor of 7469 and 2469, using Euclidean algorithm.	1
8090	Find Greatest Common Divisor of 2260 and 816, using Euclidean algorithm.	1
8091	Find Greatest Common Divisor of 70 and 9, using prime factorization.	1
8092	Find Greatest Common Divisor of 51 and 10, using prime factorization.	1
8093	Find Greatest Common Divisor of 424 and 82, by listing out the factors.	1
8094	Find Greatest Common Divisor of 2 and 10000000, using prime factorization.	1
8095	Find Greatest Common Divisor of 2 and 10000000, using Euclidean algorithm.	1
8096	Find Greatest Common Divisor of 36, 54 and 126, using Euclidean algorithm.	1
8097	Find Greatest Common Divisor of 36, 54 and 126, using repeated division.	1
8098	Find Greatest Common Divisor of 2, 6, 12, 20 and 30, by listing out the factors.	1
8099	Find Greatest Common Divisor of 1149 and 201, using Euclidean algorithm.	1
8100	Find Greatest Common Divisor of 446 and 91, using Euclidean algorithm.	1