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 16261 and 85652, by listing out the factors.	2
4802	Find Greatest Common Divisor of 139024789 and 93278890, using prime factorization.	2
4803	Find Greatest Common Divisor of 10 and 20, using repeated division.	2
4804	Find Greatest Common Divisor of 36 and 4509, using prime factorization.	2
4805	Find Greatest Common Divisor of 5264 and 15472, using prime factorization.	2
4806	Find Greatest Common Divisor of 24, 25 and 50, using prime factorization.	2
4807	Find Greatest Common Divisor of 2, 6, 4962, 113, 98, 122, 113, 113, 4962, 4962, 49, 48, 113, 106, 113, 112 and 113, using prime factorization.	2
4808	Find Greatest Common Divisor of 215 and 180, using prime factorization.	2
4809	Find Greatest Common Divisor of 25, 65 and 80, using prime factorization.	2
4810	Find Greatest Common Divisor of 6 and 54, using prime factorization.	2
4811	Find Greatest Common Divisor of 25 and 7, using prime factorization.	2
4812	Find Greatest Common Divisor of 100 and 6, using prime factorization.	2
4813	Find Greatest Common Divisor of 81 and 9, using prime factorization.	2
4814	Find Greatest Common Divisor of 300 and 10, using prime factorization.	2
4815	Find Greatest Common Divisor of 150 and 5, using prime factorization.	2
4816	Find Greatest Common Divisor of 3120.	2
4817	Find Greatest Common Divisor of 4410 and 15450, using prime factorization.	2
4818	Find Greatest Common Divisor of 56 and 42, using repeated division.	2
4819	Find Greatest Common Divisor of 973 and 301, using Euclidean algorithm.	2
4820	Find Greatest Common Divisor of 12 and 67, using Euclidean algorithm.	2
4821	Find Greatest Common Divisor of 90 and 56, using prime factorization.	2
4822	Find Greatest Common Divisor of 84, 126 and 21, using prime factorization.	2
4823	Find Greatest Common Divisor of 35831808 and 33, using prime factorization.	2
4824	Find Greatest Common Divisor of 160 and 5, using prime factorization.	2
4825	Find Greatest Common Divisor of 65025 and 16, using prime factorization.	2
4826	Find Greatest Common Divisor of 65025 and 16, by listing out the factors.	2
4827	Find Greatest Common Divisor of 698 and 8, using prime factorization.	2
4828	Find Greatest Common Divisor of 838.	2
4829	Find Greatest Common Divisor of 206 and 16, using prime factorization.	2
4830	Find Greatest Common Divisor of 225324 and 202851, using Euclidean algorithm.	2
4831	Find Greatest Common Divisor of 55 and 100, using prime factorization.	2
4832	Find Greatest Common Divisor of 18 and 96, using prime factorization.	2
4833	Find Greatest Common Divisor of 3 and 13, using prime factorization.	2
4834	Find Greatest Common Divisor of 48 and 44, using repeated division.	1
4835	Find Greatest Common Divisor of 48 and 44, using Euclidean algorithm.	1
4836	Find Greatest Common Divisor of 53540 and 11553, using Euclidean algorithm.	1
4837	Find Greatest Common Divisor of 89 and 144, using prime factorization.	1
4838	Find Greatest Common Divisor of 89 and 144, using Euclidean algorithm.	1
4839	Find Greatest Common Divisor of 99 and 144, using Euclidean algorithm.	1
4840	Find Greatest Common Divisor of 12, 16 and 18, using prime factorization.	1
4841	Find Greatest Common Divisor of 357 and 234, using prime factorization.	1
4842	Find Greatest Common Divisor of 364 and 431, using prime factorization.	1
4843	Find Greatest Common Divisor of 88 and 58, using repeated division.	1
4844	Find Greatest Common Divisor of 150 and 100, by listing out the factors.	1
4845	Find Greatest Common Divisor of 36 and 24, by listing out the factors.	1
4846	Find Greatest Common Divisor of 33 and 21, using prime factorization.	1
4847	Find Greatest Common Divisor of 30 and 70, using prime factorization.	1
4848	Find Greatest Common Divisor of 30 and 70, using Euclidean algorithm.	1
4849	Find Greatest Common Divisor of 6, 8 and 12, using prime factorization.	1
4850	Find Greatest Common Divisor of 26 and 44, using prime factorization.	1