GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3751	Find Greatest Common Divisor of 18, 20 and 26, using prime factorization.	2
3752	Find Greatest Common Divisor of 18, 20 and 16, using prime factorization.	2
3753	Find Greatest Common Divisor of 32, 48 and 44, using prime factorization.	2
3754	Find Greatest Common Divisor of 34 and 68, using prime factorization.	2
3755	Find Greatest Common Divisor of 2771 and 206, using prime factorization.	2
3756	Find Greatest Common Divisor of 1, 8, 0, 36, 0 and 9, using prime factorization.	2
3757	Find Greatest Common Divisor of 12, 14, 34, 41, 47 and 34, using prime factorization.	2
3758	Find Greatest Common Divisor of 11 and 3, using Euclidean algorithm.	2
3759	Find Greatest Common Divisor of 1100 and 57330, using Euclidean algorithm.	2
3760	Find Greatest Common Divisor of 4113.	2
3761	Find Greatest Common Divisor of 117 and 4113, using prime factorization.	2
3762	Find Greatest Common Divisor of 457 and 13, using prime factorization.	2
3763	Find Greatest Common Divisor of 457 and 3250, using prime factorization.	2
3764	Find Greatest Common Divisor of 8, 12 and 30, using prime factorization.	2
3765	Find Greatest Common Divisor of 18, 16, 54 and 36, using prime factorization.	2
3766	Find Greatest Common Divisor of 14, 27 and 55, using prime factorization.	2
3767	Find Greatest Common Divisor of 20 and 9, using repeated division.	2
3768	Find Greatest Common Divisor of 260 and 628, using prime factorization.	2
3769	Find Greatest Common Divisor of 27 and 8, using prime factorization.	2
3770	Find Greatest Common Divisor of 406 and 945, using prime factorization.	2
3771	Find Greatest Common Divisor of 405 and 945, using prime factorization.	2
3772	Find Greatest Common Divisor of 132 and 630, using Euclidean algorithm.	2
3773	Find Greatest Common Divisor of 66 and 150, using repeated division.	2
3774	Find Greatest Common Divisor of 170 and 122, using repeated division.	2
3775	Find Greatest Common Divisor of 170 and 122, by listing out the factors.	2
3776	Find Greatest Common Divisor of 792 and 275, using prime factorization.	2
3777	Find Greatest Common Divisor of 39 and 2535, using prime factorization.	2
3778	Find Greatest Common Divisor of 54 and 888, using Euclidean algorithm.	2
3779	Find Greatest Common Divisor of 25 and 29, using prime factorization.	2
3780	Find Greatest Common Divisor of 5245 and 930, using prime factorization.	2
3781	Find Greatest Common Divisor of 4076 and 2076, using prime factorization.	2
3782	Find Greatest Common Divisor of 457 and 378, using prime factorization.	2
3783	Find Greatest Common Divisor of 780 and 224, using repeated division.	2
3784	Find Greatest Common Divisor of 25, 30 and 40, using Euclidean algorithm.	2
3785	Find Greatest Common Divisor of 26513 and 32321, using Euclidean algorithm.	2
3786	Find Greatest Common Divisor of 415 and 142, using Euclidean algorithm.	2
3787	Find Greatest Common Divisor of 471 and 562, using Euclidean algorithm.	2
3788	Find Greatest Common Divisor of 295 and 504, using Euclidean algorithm.	2
3789	Find Greatest Common Divisor of 387 and 129, using Euclidean algorithm.	2
3790	Find Greatest Common Divisor of 359 and 125, using prime factorization.	2
3791	Find Greatest Common Divisor of 1320 and 1065, using prime factorization.	2
3792	Find Greatest Common Divisor of 24 and 15, using Euclidean algorithm.	2
3793	Find Greatest Common Divisor of 17 and 11, using prime factorization.	2
3794	Find Greatest Common Divisor of 147 and 288, using prime factorization.	2
3795	Find Greatest Common Divisor of 147 and 288, using repeated division.	2
3796	Find Greatest Common Divisor of 689 and 489, using prime factorization.	2
3797	Find Greatest Common Divisor of 249 and 147, using prime factorization.	2
3798	Find Greatest Common Divisor of 39 and 162, using prime factorization.	2
3799	Find Greatest Common Divisor of 39 and 162, using Euclidean algorithm.	2
3800	Find Greatest Common Divisor of 6120 and 3000, using Euclidean algorithm.	2