GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4801	Find Greatest Common Divisor of 26513 and 32321, using prime factorization.	2
4802	Find Greatest Common Divisor of 217 and 583, using Euclidean algorithm.	2
4803	Find Greatest Common Divisor of 15 and 2, using prime factorization.	2
4804	Find Greatest Common Divisor of 486 and 153, using Euclidean algorithm.	2
4805	Find Greatest Common Divisor of 238.	2
4806	Find Greatest Common Divisor of 12, 120, 30 and 42, using prime factorization.	2
4807	Find Greatest Common Divisor of 195 and 455, using prime factorization.	2
4808	Find Greatest Common Divisor of 155590302 and 4200021066, using Euclidean algorithm.	2
4809	Find Greatest Common Divisor of 5859 and 1232, using Euclidean algorithm.	2
4810	Find Greatest Common Divisor of 5859 and 1232, using prime factorization.	2
4811	Find Greatest Common Divisor of 1372 and 4536, using prime factorization.	2
4812	Find Greatest Common Divisor of 1372 and 4536, using Euclidean algorithm.	2
4813	Find Greatest Common Divisor of 4148 and 7684, using Euclidean algorithm.	2
4814	Find Greatest Common Divisor of 7293 and 3640, using Euclidean algorithm.	2
4815	Find Greatest Common Divisor of 27 and 36, using repeated division.	2
4816	Find Greatest Common Divisor of 55, 65, 201 and 3, using prime factorization.	2
4817	Find Greatest Common Divisor of 782221.	2
4818	Find Greatest Common Divisor of 800 and 72, using prime factorization.	2
4819	Find Greatest Common Divisor of 2025 and 1109, using Euclidean algorithm.	2
4820	Find Greatest Common Divisor of 212 and 338, using prime factorization.	2
4821	Find Greatest Common Divisor of 90 and 385, using prime factorization.	2
4822	Find Greatest Common Divisor of 82 and 76, using prime factorization.	2
4823	Find Greatest Common Divisor of 358 and 309, using repeated division.	2
4824	Find Greatest Common Divisor of 1812 and 2134, using prime factorization.	2
4825	Find Greatest Common Divisor of 142766 and 1729, using prime factorization.	2
4826	Find Greatest Common Divisor of 1638 and 4675, using prime factorization.	2
4827	Find Greatest Common Divisor of 4158 and 7056, using prime factorization.	2
4828	Find Greatest Common Divisor of 7394592 and 264817800, using prime factorization.	2
4829	Find Greatest Common Divisor of 1377, 1701 and 9477, using prime factorization.	2
4830	Find Greatest Common Divisor of 3963, 6933 and 9633, using prime factorization.	2
4831	Find Greatest Common Divisor of 111100 and 3, using prime factorization.	2
4832	Find Greatest Common Divisor of 344444 and 34444, using prime factorization.	2
4833	Find Greatest Common Divisor of 5436 and 675, using Euclidean algorithm.	2
4834	Find Greatest Common Divisor of 199 and 266, using Euclidean algorithm.	2
4835	Find Greatest Common Divisor of 1870 and 264, using Euclidean algorithm.	2
4836	Find Greatest Common Divisor of 1870 and 261, using Euclidean algorithm.	2
4837	Find Greatest Common Divisor of 1879 and 460, using Euclidean algorithm.	2
4838	Find Greatest Common Divisor of 1872 and 460, using Euclidean algorithm.	2
4839	Find Greatest Common Divisor of 1274 and 460, using Euclidean algorithm.	2
4840	Find Greatest Common Divisor of 1214 and 460, using Euclidean algorithm.	2
4841	Find Greatest Common Divisor of 200 and 1001, using prime factorization.	2
4842	Find Greatest Common Divisor of 17 and 26892, by listing out the factors.	2
4843	Find Greatest Common Divisor of 180 and 2100, using prime factorization.	2
4844	Find Greatest Common Divisor of 13860 and 727650, using prime factorization.	2
4845	Find Greatest Common Divisor of 64 and 21, using prime factorization.	2
4846	Find Greatest Common Divisor of 64 and 21, using repeated division.	2
4847	Find Greatest Common Divisor of 23 and 92, using prime factorization.	2
4848	Find Greatest Common Divisor of 4, 9 and 19, using prime factorization.	2
4849	Find Greatest Common Divisor of 21, 35 and 63, using prime factorization.	2
4850	Find Greatest Common Divisor of 36, 63 and 81, using prime factorization.	2