GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4651	Find Greatest Common Divisor of 39 and 162, using Euclidean algorithm.	2
4652	Find Greatest Common Divisor of 6120 and 3000, using Euclidean algorithm.	2
4653	Find Greatest Common Divisor of 725 and 236, using Euclidean algorithm.	2
4654	Find Greatest Common Divisor of 3578 and 9512, using repeated division.	2
4655	Find Greatest Common Divisor of 366 and 36, using prime factorization.	2
4656	Find Greatest Common Divisor of 366 and 36, using Euclidean algorithm.	2
4657	Find Greatest Common Divisor of 100 and 321, using prime factorization.	2
4658	Find Greatest Common Divisor of 27 and 100, using prime factorization.	2
4659	Find Greatest Common Divisor of 1007 and 97000000, using prime factorization.	2
4660	Find Greatest Common Divisor of 5140998993 and 97000000, using prime factorization.	2
4661	Find Greatest Common Divisor of 70 and 120, using prime factorization.	2
4662	Find Greatest Common Divisor of 70 and 120, using repeated division.	2
4663	Find Greatest Common Divisor of 168 and 504, using repeated division.	2
4664	Find Greatest Common Divisor of 180 and 600, using Euclidean algorithm.	2
4665	Find Greatest Common Divisor of 60 and 84, using Euclidean algorithm.	2
4666	Find Greatest Common Divisor of 234 and 470, using Euclidean algorithm.	2
4667	Find Greatest Common Divisor of 84 and 180, using Euclidean algorithm.	2
4668	Find Greatest Common Divisor of 64 and 160, using Euclidean algorithm.	2
4669	Find Greatest Common Divisor of 308 and 504, using Euclidean algorithm.	2
4670	Find Greatest Common Divisor of 1890 and 45, using Euclidean algorithm.	2
4671	Find Greatest Common Divisor of 1890 and 450, using Euclidean algorithm.	2
4672	Find Greatest Common Divisor of 696 and 432, using Euclidean algorithm.	2
4673	Find Greatest Common Divisor of 105 and 231, using Euclidean algorithm.	2
4674	Find Greatest Common Divisor of 273 and 595, using Euclidean algorithm.	2
4675	Find Greatest Common Divisor of 18 and 50, using prime factorization.	2
4676	Find Greatest Common Divisor of 93 and 22, using prime factorization.	2
4677	Find Greatest Common Divisor of 39 and 22, using prime factorization.	2
4678	Find Greatest Common Divisor of 99 and 40, using prime factorization.	2
4679	Find Greatest Common Divisor of 6, 9 and 12, using prime factorization.	2
4680	Find Greatest Common Divisor of 14400 and 5040, using prime factorization.	2
4681	Find Greatest Common Divisor of 54321 and 12345, using prime factorization.	2
4682	Find Greatest Common Divisor of 54321 and 12345, using Euclidean algorithm.	2
4683	Find Greatest Common Divisor of 5, 6 and 92, using prime factorization.	2
4684	Find Greatest Common Divisor of 398 and 294, using prime factorization.	2
4685	Find Greatest Common Divisor of 398 and 294, using Euclidean algorithm.	2
4686	Find Greatest Common Divisor of 976 and 174, using prime factorization.	2
4687	Find Greatest Common Divisor of 4655 and 12075, using prime factorization.	2
4688	Find Greatest Common Divisor of 4655 and 12075, using repeated division.	2
4689	Find Greatest Common Divisor of 4, 21 and 60, using prime factorization.	2
4690	Find Greatest Common Divisor of 15 and 22, using prime factorization.	2
4691	Find Greatest Common Divisor of 20, 15 and 5, using prime factorization.	2
4692	Find Greatest Common Divisor of 3, 6 and 7, using prime factorization.	2
4693	Find Greatest Common Divisor of 345 and 369, using prime factorization.	2
4694	Find Greatest Common Divisor of 369 and 345, using repeated division.	2
4695	Find Greatest Common Divisor of 369 and 345, using Euclidean algorithm.	2
4696	Find Greatest Common Divisor of 1 and 100, using Euclidean algorithm.	2
4697	Find Greatest Common Divisor of 9, 15 and 12, using prime factorization.	2
4698	Find Greatest Common Divisor of 8217949832 and 8181353375, using prime factorization.	2
4699	Find Greatest Common Divisor of 290184 and 351, using prime factorization.	2
4700	Find Greatest Common Divisor of 1111 and 11, using Euclidean algorithm.	2