GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
2601	Find Greatest Common Divisor of 123 and 456, using Euclidean algorithm.	3
2602	Find Greatest Common Divisor of 14 and 3, using prime factorization.	3
2603	Find Greatest Common Divisor of 16 and 24, by listing out the factors.	3
2604	Find Greatest Common Divisor of 45 and 75, using prime factorization.	3
2605	Find Greatest Common Divisor of 84 and 12, using repeated division.	3
2606	Find Greatest Common Divisor of 32 and 24, using prime factorization.	3
2607	Find Greatest Common Divisor of 21 and 29, using Euclidean algorithm.	3
2608	Find Greatest Common Divisor of 7 and 3, using Euclidean algorithm.	3
2609	Find Greatest Common Divisor of 7871850 and 21829500, using Euclidean algorithm.	3
2610	Find Greatest Common Divisor of 2579 and 2424, using Euclidean algorithm.	3
2611	Find Greatest Common Divisor of 161213367.	3
2612	Find Greatest Common Divisor of 25, 125, 1 and 2, using prime factorization.	3
2613	Find Greatest Common Divisor of 25, 125, 1 and 1, using prime factorization.	3
2614	Find Greatest Common Divisor of 6, 12 and 24, by listing out the factors.	3
2615	Find Greatest Common Divisor of 101 and 3234, using Euclidean algorithm.	3
2616	Find Greatest Common Divisor of 7 and 110, using prime factorization.	3
2617	Find Greatest Common Divisor of 3515956320 and 4294967297, using prime factorization.	3
2618	Find Greatest Common Divisor of 1340 and 1340, using prime factorization.	2
2619	Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm.	2
2620	Find Greatest Common Divisor of 84 and 96, using prime factorization.	2
2621	Find Greatest Common Divisor of 165, 45 and 5, using prime factorization.	2
2622	Find Greatest Common Divisor of 5 and 288, using prime factorization.	2
2623	Find Greatest Common Divisor of 250 and 134, using prime factorization.	2
2624	Find Greatest Common Divisor of 11, 17, 8, 9, 10 and 12, using Euclidean algorithm.	2
2625	Find Greatest Common Divisor of 889 and 246, using Euclidean algorithm.	2
2626	Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm.	2
2627	Find Greatest Common Divisor of 357 and 476, using prime factorization.	2
2628	Find Greatest Common Divisor of 585 and 169, using Euclidean algorithm.	2
2629	Find Greatest Common Divisor of 12 and 24, using Euclidean algorithm.	2
2630	Find Greatest Common Divisor of 1 and 7, using Euclidean algorithm.	2
2631	Find Greatest Common Divisor of 132 and 100, using prime factorization.	2
2632	Find Greatest Common Divisor of 720 and 588, using Euclidean algorithm.	2
2633	Find Greatest Common Divisor of 1513 and 120, using prime factorization.	2
2634	Find Greatest Common Divisor of 99 and 81, using prime factorization.	2
2635	Find Greatest Common Divisor of 5616 and 54756, using prime factorization.	2
2636	Find Greatest Common Divisor of 111 and 201, using Euclidean algorithm.	2
2637	Find Greatest Common Divisor of 3, 1 and 1, using Euclidean algorithm.	2
2638	Find Greatest Common Divisor of 16 and 35, using Euclidean algorithm.	2
2639	Find Greatest Common Divisor of 32, 56 and 78, using repeated division.	2
2640	Find Greatest Common Divisor of 2907 and 105, using prime factorization.	2
2641	Find Greatest Common Divisor of 1330 and 42, using Euclidean algorithm.	2
2642	Find Greatest Common Divisor of 24, 12 and 36, using prime factorization.	2
2643	Find Greatest Common Divisor of 12327 and 2409, using Euclidean algorithm.	2
2644	Find Greatest Common Divisor of 2486625522 and 41582215163, by listing out the factors.	2
2645	Find Greatest Common Divisor of 492, 1353 and 615, using prime factorization.	2
2646	Find Greatest Common Divisor of 5400 and 2412, using Euclidean algorithm.	2
2647	Find Greatest Common Divisor of 6789, 1356 and 2460, using prime factorization.	2
2648	Find Greatest Common Divisor of 1342 and 5733, using prime factorization.	2
2649	Find Greatest Common Divisor of 75 and 240, using prime factorization.	2
2650	Find Greatest Common Divisor of 589432167.	2