GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4751	Find Greatest Common Divisor of 215 and 89, using Euclidean algorithm.	2
4752	Find Greatest Common Divisor of 215 and 93, using Euclidean algorithm.	2
4753	Find Greatest Common Divisor of 215 and 94, using Euclidean algorithm.	2
4754	Find Greatest Common Divisor of 143 and 1941, using prime factorization.	2
4755	Find Greatest Common Divisor of 96, 60 and 144, using prime factorization.	2
4756	Find Greatest Common Divisor of 12, 42 and 36, using prime factorization.	2
4757	Find Greatest Common Divisor of 30, 36 and 24, using prime factorization.	2
4758	Find Greatest Common Divisor of 11 and 18, using prime factorization.	2
4759	Find Greatest Common Divisor of 52 and 24, using Euclidean algorithm.	2
4760	Find Greatest Common Divisor of 18 and 12345, using Euclidean algorithm.	2
4761	Find Greatest Common Divisor of 180 and 9, using prime factorization.	2
4762	Find Greatest Common Divisor of 232 and 8, using prime factorization.	2
4763	Find Greatest Common Divisor of 535 and 65, using prime factorization.	2
4764	Find Greatest Common Divisor of 36 and 12, using prime factorization.	2
4765	Find Greatest Common Divisor of 22 and 22, using prime factorization.	2
4766	Find Greatest Common Divisor of 56, 68 and 128, using prime factorization.	2
4767	Find Greatest Common Divisor of 5010 and 8016, using prime factorization.	2
4768	Find Greatest Common Divisor of 42 and 50, using prime factorization.	2
4769	Find Greatest Common Divisor of 77 and 22, using prime factorization.	2
4770	Find Greatest Common Divisor of 122 and 2, using prime factorization.	2
4771	Find Greatest Common Divisor of 84 and 8, using prime factorization.	2
4772	Find Greatest Common Divisor of 283 and 177, using Euclidean algorithm.	2
4773	Find Greatest Common Divisor of 283 and 76, using Euclidean algorithm.	2
4774	Find Greatest Common Divisor of 461 and 58, using Euclidean algorithm.	2
4775	Find Greatest Common Divisor of 390 and 58, using Euclidean algorithm.	2
4776	Find Greatest Common Divisor of 398 and 57, using Euclidean algorithm.	2
4777	Find Greatest Common Divisor of 398 and 79, using Euclidean algorithm.	2
4778	Find Greatest Common Divisor of 613 and 74, using Euclidean algorithm.	2
4779	Find Greatest Common Divisor of 613 and 76, using Euclidean algorithm.	2
4780	Find Greatest Common Divisor of 517 and 83, using Euclidean algorithm.	2
4781	Find Greatest Common Divisor of 581 and 83, using Euclidean algorithm.	2
4782	Find Greatest Common Divisor of 581 and 197, using Euclidean algorithm.	2
4783	Find Greatest Common Divisor of 581 and 397, using Euclidean algorithm.	2
4784	Find Greatest Common Divisor of 588 and 392, using Euclidean algorithm.	2
4785	Find Greatest Common Divisor of 588 and 292, using Euclidean algorithm.	2
4786	Find Greatest Common Divisor of 416 and 94, using Euclidean algorithm.	2
4787	Find Greatest Common Divisor of 518 and 94, using Euclidean algorithm.	2
4788	Find Greatest Common Divisor of 518 and 193, using Euclidean algorithm.	2
4789	Find Greatest Common Divisor of 518 and 126, using Euclidean algorithm.	2
4790	Find Greatest Common Divisor of 588 and 120, using Euclidean algorithm.	2
4791	Find Greatest Common Divisor of 588 and 126, using Euclidean algorithm.	2
4792	Find Greatest Common Divisor of 588 and 231, using Euclidean algorithm.	2
4793	Find Greatest Common Divisor of 330 and 165, using Euclidean algorithm.	2
4794	Find Greatest Common Divisor of 375 and 45, using Euclidean algorithm.	2
4795	Find Greatest Common Divisor of 6 and 0, using prime factorization.	2
4796	Find Greatest Common Divisor of 130963810 and 8201782117, using Euclidean algorithm.	2
4797	Find Greatest Common Divisor of 128 and 34, using Euclidean algorithm.	2
4798	Find Greatest Common Divisor of 128 and 64, using Euclidean algorithm.	2
4799	Find Greatest Common Divisor of 128 and 24, using Euclidean algorithm.	2
4800	Find Greatest Common Divisor of 128 and 44, using Euclidean algorithm.	2