GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
5601	Find Greatest Common Divisor of 199 and 25, using Euclidean algorithm.	1
5602	Find Greatest Common Divisor of 199 and 17, using Euclidean algorithm.	1
5603	Find Greatest Common Divisor of 1870 and 266, using Euclidean algorithm.	1
5604	Find Greatest Common Divisor of 1870 and 263, using Euclidean algorithm.	1
5605	Find Greatest Common Divisor of 1870 and 260, using Euclidean algorithm.	1
5606	Find Greatest Common Divisor of 1870 and 361, using Euclidean algorithm.	1
5607	Find Greatest Common Divisor of 1870 and 366, using Euclidean algorithm.	1
5608	Find Greatest Common Divisor of 1870 and 460, using Euclidean algorithm.	1
5609	Find Greatest Common Divisor of 1874 and 460, using Euclidean algorithm.	1
5610	Find Greatest Common Divisor of 1203 and 460, using Euclidean algorithm.	1
5611	Find Greatest Common Divisor of 4121 and 460, using Euclidean algorithm.	1
5612	Find Greatest Common Divisor of 3921 and 460, using Euclidean algorithm.	1
5613	Find Greatest Common Divisor of 2921 and 460, using Euclidean algorithm.	1
5614	Find Greatest Common Divisor of 290 and 609, using prime factorization.	1
5615	Find Greatest Common Divisor of 17 and 26892, using prime factorization.	1
5616	Find Greatest Common Divisor of 742 and 836, using prime factorization.	1
5617	Find Greatest Common Divisor of 35 and 78, using Euclidean algorithm.	1
5618	Find Greatest Common Divisor of 21 and 64, using prime factorization.	1
5619	Find Greatest Common Divisor of 31 and 55, using prime factorization.	1
5620	Find Greatest Common Divisor of 2020 and 3201, using Euclidean algorithm.	1
5621	Find Greatest Common Divisor of 662.	1
5622	Find Greatest Common Divisor of 414.	1
5623	Find Greatest Common Divisor of 2 and 7, using prime factorization.	1
5624	Find Greatest Common Divisor of 13 and 78, using prime factorization.	1
5625	Find Greatest Common Divisor of 124523 and 526387932, using prime factorization.	1
5626	Find Greatest Common Divisor of 253704 and 22909068, using prime factorization.	1
5627	Find Greatest Common Divisor of 6850008 and 22909068, using prime factorization.	1
5628	Find Greatest Common Divisor of 0, 0 and 5, using prime factorization.	1
5629	Find Greatest Common Divisor of 1993.	1
5630	Find Greatest Common Divisor of 620 and 520, using prime factorization.	1
5631	Find Greatest Common Divisor of 640 and 49, using prime factorization.	1
5632	Find Greatest Common Divisor of 612 and 429, using prime factorization.	1
5633	Find Greatest Common Divisor of 612 and 429, using Euclidean algorithm.	1
5634	Find Greatest Common Divisor of 71 and 9, using repeated division.	1
5635	Find Greatest Common Divisor of 71 and 9, using prime factorization.	1
5636	Find Greatest Common Divisor of 123456789012345678 and 987654321098765432, using Euclidean algorithm.	1
5637	Find Greatest Common Divisor of 0 and 5713, using Euclidean algorithm.	1
5638	Find Greatest Common Divisor of 24 and 213, using prime factorization.	1
5639	Find Greatest Common Divisor of 2343452, 456 and 31, using repeated division.	1
5640	Find Greatest Common Divisor of 250 and 210, using prime factorization.	1
5641	Find Greatest Common Divisor of 710 and 310, using repeated division.	1
5642	Find Greatest Common Divisor of 270 and 172, using Euclidean algorithm.	1
5643	Find Greatest Common Divisor of 500 and 193, using Euclidean algorithm.	1
5644	Find Greatest Common Divisor of 8 and 144, using Euclidean algorithm.	1
5645	Find Greatest Common Divisor of 4246, 4120, 4142 and 4194, using Euclidean algorithm.	1
5646	Find Greatest Common Divisor of 4246, 4120, 4142 and 4194, using repeated division.	1
5647	Find Greatest Common Divisor of 100000 and 45000, using prime factorization.	1
5648	Find Greatest Common Divisor of 484 and 720, using prime factorization.	1
5649	Find Greatest Common Divisor of 198 and 72, using Euclidean algorithm.	1
5650	Find Greatest Common Divisor of 67 and 119, using Euclidean algorithm.	1