GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
6101	Find Greatest Common Divisor of 21 and 39, using prime factorization.	1
6102	Find Greatest Common Divisor of 13 and 63, using prime factorization.	1
6103	Find Greatest Common Divisor of 50 and 23, using prime factorization.	1
6104	Find Greatest Common Divisor of 50 and 23, using repeated division.	1
6105	Find Greatest Common Divisor of 50 and 23, by listing out the factors.	1
6106	Find Greatest Common Divisor of 28 and 48, using Euclidean algorithm.	1
6107	Find Greatest Common Divisor of 36 and 60, using Euclidean algorithm.	1
6108	Find Greatest Common Divisor of 35 and 70, using prime factorization.	1
6109	Find Greatest Common Divisor of 6588 and 90, using prime factorization.	1
6110	Find Greatest Common Divisor of 32.	1
6111	Find Greatest Common Divisor of 813.	1
6112		1
6113	Find Greatest Common Divisor of 210 and 243, using prime factorization.	1
6114	Find Greatest Common Divisor of 728 and 78, using prime factorization.	1
6115	Find Greatest Common Divisor of 84 and 120, using prime factorization.	1
6116	Find Greatest Common Divisor of 24 and 13, using Euclidean algorithm.	1
6117	Find Greatest Common Divisor of 4321 and 1234, using Euclidean algorithm.	1
6118	Find Greatest Common Divisor of 54 and 90, using prime factorization.	1
6119	Find Greatest Common Divisor of 1955 and 2025, using Euclidean algorithm.	1
6120	Find Greatest Common Divisor of 602 and 1505, using prime factorization.	1
6121	Find Greatest Common Divisor of 814 and 4078, using repeated division.	1
6122	Find Greatest Common Divisor of 26.	1
6123	Find Greatest Common Divisor of 56.	1
6124	Find Greatest Common Divisor of 1296 and 384, using prime factorization.	1
6125	Find Greatest Common Divisor of 1296 and 384, using Euclidean algorithm.	1
6126	Find Greatest Common Divisor of 136 and 170, using Euclidean algorithm.	1
6127	Find Greatest Common Divisor of 900 and 270, using prime factorization.	1
6128	Find Greatest Common Divisor of 441, 567 and 693, using prime factorization.	1
6129	Find Greatest Common Divisor of 136, 170 and 255, using prime factorization.	1
6130	Find Greatest Common Divisor of 900 and 27, using prime factorization.	1
6131	Find Greatest Common Divisor of 11033442 and 1102246, using Euclidean algorithm.	1
6132	Find Greatest Common Divisor of 513 and 99, using prime factorization.	1
6133	Find Greatest Common Divisor of 84 and 338, using prime factorization.	1
6134	Find Greatest Common Divisor of 1 and 0, using repeated division.	1
6135	Find Greatest Common Divisor of 9 and 8, using Euclidean algorithm.	1
6136	Find Greatest Common Divisor of 5 and 5, using Euclidean algorithm.	1
6137	Find Greatest Common Divisor of 2 and 47, using Euclidean algorithm.	1
6138	Find Greatest Common Divisor of 5 and 1, using Euclidean algorithm.	1
6139	Find Greatest Common Divisor of 10 and 16, using Euclidean algorithm.	1
6140	Find Greatest Common Divisor of 14 and 35, using Euclidean algorithm.	1
6141	Find Greatest Common Divisor of 25 and 40, using Euclidean algorithm.	1
6142	Find Greatest Common Divisor of 81 and 37, using Euclidean algorithm.	1
6143	Find Greatest Common Divisor of 452 and 6004, using prime factorization.	1
6144	Find Greatest Common Divisor of 270 and 292, using prime factorization.	1
6145	Find Greatest Common Divisor of 111111 and 11111, using prime factorization.	1
6146	Find Greatest Common Divisor of 504 and 7, using prime factorization.	1
6147	Find Greatest Common Divisor of 56 and 9, using prime factorization.	1
6148	Find Greatest Common Divisor of 504 and 5, using prime factorization.	1
6149	Find Greatest Common Divisor of 2520 and 499, using prime factorization.	1
6150	Find Greatest Common Divisor of 684 and 28, using Euclidean algorithm.	1