GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3601	Find Greatest Common Divisor of 21, 32, 43, 54 and 65, using prime factorization.	2
3602	Find Greatest Common Divisor of 45 and 18, using repeated division.	2
3603	Find Greatest Common Divisor of 2 and 7, by listing out the factors.	2
3604	Find Greatest Common Divisor of 25012.	2
3605	Find Greatest Common Divisor of 25012.	2
3606	Find Greatest Common Divisor of 60 and 136, using Euclidean algorithm.	2
3607	Find Greatest Common Divisor of 60 and 136, using repeated division.	2
3608	Find Greatest Common Divisor of 14039 and 1529, using Euclidean algorithm.	2
3609	Find Greatest Common Divisor of 6773760 and 12902400, using Euclidean algorithm.	2
3610	Find Greatest Common Divisor of 40 and 158, using prime factorization.	2
3611	Find Greatest Common Divisor of 40 and 150, using prime factorization.	2
3612	Find Greatest Common Divisor of 60 and 136, using prime factorization.	2
3613	Find Greatest Common Divisor of 27972.	2
3614	Find Greatest Common Divisor of 728 and 10780, using prime factorization.	2
3615	Find Greatest Common Divisor of 3768 and 1701, using repeated division.	2
3616	Find Greatest Common Divisor of 9, 12 and 21, using Euclidean algorithm.	2
3617	Find Greatest Common Divisor of 2, 4, 6 and 10, using prime factorization.	2
3618	Find Greatest Common Divisor of 2, 4, 6 and 10, using Euclidean algorithm.	2
3619	Find Greatest Common Divisor of 21, 45, 9 and 81, using Euclidean algorithm.	2
3620	Find Greatest Common Divisor of 21, 45, 9 and 81, by listing out the factors.	2
3621	Find Greatest Common Divisor of 377 and 610, using Euclidean algorithm.	2
3622	Find Greatest Common Divisor of 123456789 and 987654321, using Euclidean algorithm.	2
3623	Find Greatest Common Divisor of 8, 12 and 24, by listing out the factors.	2
3624	Find Greatest Common Divisor of 8, 12 and 24, using Euclidean algorithm.	2
3625	Find Greatest Common Divisor of 391, 667513, 1134 and 1215, using repeated division.	2
3626	Find Greatest Common Divisor of 391 and 667, using repeated division.	2
3627	Find Greatest Common Divisor of 36, 48, 84 and 140, using prime factorization.	2
3628	Find Greatest Common Divisor of 530778276 and 999983, using Euclidean algorithm.	2
3629	Find Greatest Common Divisor of 63, 105 and 210, using repeated division.	2
3630	Find Greatest Common Divisor of 63, 105 and 210, using prime factorization.	2
3631	Find Greatest Common Divisor of 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 and 17, using prime factorization.	2
3632	Find Greatest Common Divisor of 15265.	2
3633	Find Greatest Common Divisor of 33 and 150, using Euclidean algorithm.	2
3634	Find Greatest Common Divisor of 10692 and 25, using Euclidean algorithm.	2
3635	Find Greatest Common Divisor of 528 and 72, using prime factorization.	2
3636	Find Greatest Common Divisor of 456 and 72, using prime factorization.	2
3637	Find Greatest Common Divisor of 44208 and 88456, using Euclidean algorithm.	2
3638	Find Greatest Common Divisor of 530778276 and 30841329, using prime factorization.	2
3639	Find Greatest Common Divisor of 530778276 and 999983, using prime factorization.	2
3640	Find Greatest Common Divisor of 96, 84 and 60, using prime factorization.	2
3641	Find Greatest Common Divisor of 54, 72 and 90, using prime factorization.	2
3642	Find Greatest Common Divisor of 100 and 5, using repeated division.	2
3643	Find Greatest Common Divisor of 36, 54 and 120, using prime factorization.	2
3644	Find Greatest Common Divisor of 90, 126 and 210, using prime factorization.	2
3645	Find Greatest Common Divisor of 90, 126 and 210, using Euclidean algorithm.	2
3646	Find Greatest Common Divisor of 792 and 55, using Euclidean algorithm.	2
3647	Find Greatest Common Divisor of 187 and 61, using prime factorization.	2
3648	Find Greatest Common Divisor of 81 and 122, using prime factorization.	2
3649	Find Greatest Common Divisor of 15 and 72, using prime factorization.	2
3650	Find Greatest Common Divisor of 30, 45 and 75, using prime factorization.	2