GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
2501	Find Greatest Common Divisor of 60 and 136, using repeated division.	2
2502	Find Greatest Common Divisor of 14039 and 1529, using Euclidean algorithm.	2
2503	Find Greatest Common Divisor of 6773760 and 12902400, using Euclidean algorithm.	2
2504	Find Greatest Common Divisor of 40 and 158, using prime factorization.	2
2505	Find Greatest Common Divisor of 40 and 150, using prime factorization.	2
2506	Find Greatest Common Divisor of 60 and 136, using prime factorization.	2
2507	Find Greatest Common Divisor of 27972.	2
2508	Find Greatest Common Divisor of 728 and 10780, using prime factorization.	2
2509	Find Greatest Common Divisor of 3768 and 1701, using repeated division.	2
2510	Find Greatest Common Divisor of 9, 12 and 21, using Euclidean algorithm.	2
2511	Find Greatest Common Divisor of 2, 4, 6 and 10, using prime factorization.	2
2512	Find Greatest Common Divisor of 2, 4, 6 and 10, using Euclidean algorithm.	2
2513	Find Greatest Common Divisor of 21, 45, 9 and 81, using Euclidean algorithm.	2
2514	Find Greatest Common Divisor of 21, 45, 9 and 81, by listing out the factors.	2
2515	Find Greatest Common Divisor of 377 and 610, using Euclidean algorithm.	2
2516	Find Greatest Common Divisor of 123456789 and 987654321, using Euclidean algorithm.	2
2517	Find Greatest Common Divisor of 8, 12 and 24, by listing out the factors.	2
2518	Find Greatest Common Divisor of 8, 12 and 24, using Euclidean algorithm.	2
2519	Find Greatest Common Divisor of 391, 667513, 1134 and 1215, using repeated division.	2
2520	Find Greatest Common Divisor of 391 and 667, using repeated division.	2
2521	Find Greatest Common Divisor of 36, 48, 84 and 140, using prime factorization.	2
2522	Find Greatest Common Divisor of 530778276 and 999983, using Euclidean algorithm.	2
2523	Find Greatest Common Divisor of 63, 105 and 210, using repeated division.	2
2524	Find Greatest Common Divisor of 63, 105 and 210, using prime factorization.	2
2525	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
2526	Find Greatest Common Divisor of 15265.	2
2527	Find Greatest Common Divisor of 33 and 150, using Euclidean algorithm.	2
2528	Find Greatest Common Divisor of 10692 and 25, using Euclidean algorithm.	2
2529	Find Greatest Common Divisor of 528 and 72, using prime factorization.	2
2530	Find Greatest Common Divisor of 456 and 72, using prime factorization.	2
2531	Find Greatest Common Divisor of 44208 and 88456, using Euclidean algorithm.	2
2532	Find Greatest Common Divisor of 530778276 and 30841329, using prime factorization.	2
2533	Find Greatest Common Divisor of 530778276 and 999983, using prime factorization.	2
2534	Find Greatest Common Divisor of 96, 84 and 60, using prime factorization.	2
2535	Find Greatest Common Divisor of 54, 72 and 90, using prime factorization.	2
2536	Find Greatest Common Divisor of 100 and 5, using repeated division.	2
2537	Find Greatest Common Divisor of 36, 54 and 120, using prime factorization.	2
2538	Find Greatest Common Divisor of 90, 126 and 210, using prime factorization.	2
2539	Find Greatest Common Divisor of 90, 126 and 210, using Euclidean algorithm.	2
2540	Find Greatest Common Divisor of 792 and 55, using Euclidean algorithm.	2
2541	Find Greatest Common Divisor of 187 and 61, using prime factorization.	2
2542	Find Greatest Common Divisor of 81 and 122, using prime factorization.	2
2543	Find Greatest Common Divisor of 15 and 72, using prime factorization.	2
2544	Find Greatest Common Divisor of 30, 45 and 75, using prime factorization.	2
2545	Find Greatest Common Divisor of 54 and 306, using prime factorization.	2
2546	Find Greatest Common Divisor of 192 and 264, using Euclidean algorithm.	2
2547	Find Greatest Common Divisor of 520 and 314, using Euclidean algorithm.	2
2548	Find Greatest Common Divisor of 731 and 952, using Euclidean algorithm.	2
2549	Find Greatest Common Divisor of 4453 and 5767, using Euclidean algorithm.	2
2550	Find Greatest Common Divisor of 138 and 24, using Euclidean algorithm.	2