GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
5301	Find Greatest Common Divisor of 1920 and 10, by listing out the factors.	1
5302	Find Greatest Common Divisor of 141 and 91, using Euclidean algorithm.	1
5303	Find Greatest Common Divisor of 12 and 34, using Euclidean algorithm.	1
5304	Find Greatest Common Divisor of 5388 and 5645, using prime factorization.	1
5305	Find Greatest Common Divisor of 352 and 528, using repeated division.	1
5306	Find Greatest Common Divisor of 24 and 42, using prime factorization.	1
5307	Find Greatest Common Divisor of 24 and 42, using Euclidean algorithm.	1
5308	Find Greatest Common Divisor of 98 and 140, using prime factorization.	1
5309	Find Greatest Common Divisor of 25 and 360, using prime factorization.	1
5310	Find Greatest Common Divisor of 18 and 75, using Euclidean algorithm.	1
5311	Find Greatest Common Divisor of 10642 and 3006, using Euclidean algorithm.	1
5312	Find Greatest Common Divisor of 1078 and 672, using prime factorization.	1
5313	Find Greatest Common Divisor of 1078 and 672, using Euclidean algorithm.	1
5314	Find Greatest Common Divisor of 2121567.	1
5315	Find Greatest Common Divisor of 2121 and 567, using Euclidean algorithm.	1
5316	Find Greatest Common Divisor of 68 and 23, using Euclidean algorithm.	1
5317	Find Greatest Common Divisor of 708 and 813, using Euclidean algorithm.	1
5318	Find Greatest Common Divisor of 140 and 72, using prime factorization.	1
5319	Find Greatest Common Divisor of 6, 7 and 9, using prime factorization.	1
5320	Find Greatest Common Divisor of 256 and 729, using Euclidean algorithm.	1
5321	Find Greatest Common Divisor of 1001 and 210, using Euclidean algorithm.	1
5322	Find Greatest Common Divisor of 512 and 625, using Euclidean algorithm.	1
5323	Find Greatest Common Divisor of 17, 19 and 23, using prime factorization.	1
5324	Find Greatest Common Divisor of 1003 and 456, using Euclidean algorithm.	1
5325	Find Greatest Common Divisor of 305 and 120, using Euclidean algorithm.	1
5326	Find Greatest Common Divisor of 989 and 1482, using prime factorization.	1
5327	Find Greatest Common Divisor of 49 and 640, using prime factorization.	1
5328	Find Greatest Common Divisor of 100 and 35, using prime factorization.	1
5329	Find Greatest Common Divisor of 4635 and 8051, using Euclidean algorithm.	1
5330	Find Greatest Common Divisor of 43 and 22, using prime factorization.	1
5331	Find Greatest Common Divisor of 33 and 36, using prime factorization.	1
5332	Find Greatest Common Divisor of 21 and 39, using prime factorization.	1
5333	Find Greatest Common Divisor of 13 and 63, using prime factorization.	1
5334	Find Greatest Common Divisor of 50 and 23, using prime factorization.	1
5335	Find Greatest Common Divisor of 50 and 23, using repeated division.	1
5336	Find Greatest Common Divisor of 50 and 23, by listing out the factors.	1
5337	Find Greatest Common Divisor of 28 and 48, using Euclidean algorithm.	1
5338	Find Greatest Common Divisor of 36 and 60, using Euclidean algorithm.	1
5339	Find Greatest Common Divisor of 35 and 70, using prime factorization.	1
5340	Find Greatest Common Divisor of 6588 and 90, using prime factorization.	1
5341	Find Greatest Common Divisor of 32.	1
5342	Find Greatest Common Divisor of 813.	1
5343		1
5344	Find Greatest Common Divisor of 210 and 243, using prime factorization.	1
5345	Find Greatest Common Divisor of 728 and 78, using prime factorization.	1
5346	Find Greatest Common Divisor of 84 and 120, using prime factorization.	1
5347	Find Greatest Common Divisor of 24 and 13, using Euclidean algorithm.	1
5348	Find Greatest Common Divisor of 4321 and 1234, using Euclidean algorithm.	1
5349	Find Greatest Common Divisor of 54 and 90, using prime factorization.	1
5350	Find Greatest Common Divisor of 1955 and 2025, using Euclidean algorithm.	1