GCD – Solved Problems Database

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

Change category

ID	Problem	Count
851	Find Greatest Common Divisor of 220 and 400, using prime factorization.	2
852	Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm.	2
853	Find Greatest Common Divisor of 500 and 189, using prime factorization.	2
854	Find Greatest Common Divisor of 324, 756 and 480, using prime factorization.	2
855	Find Greatest Common Divisor of 196 and 340, using Euclidean algorithm.	2
856	Find Greatest Common Divisor of 31 and 31, using Euclidean algorithm.	2
857	Find Greatest Common Divisor of 16, 38, 16 and 38, using prime factorization.	2
858	Find Greatest Common Divisor of 588 and 90, using prime factorization.	2
859	Find Greatest Common Divisor of 25 and 16, using prime factorization.	2
860	Find Greatest Common Divisor of 40 and 158, using prime factorization.	2
861	Find Greatest Common Divisor of 19, 52 and 47, using prime factorization.	2
862	Find Greatest Common Divisor of 1299 and 1599, using Euclidean algorithm.	2
863	Find Greatest Common Divisor of 120 and 144, using prime factorization.	2
864	Find Greatest Common Divisor of 36 and 104, using prime factorization.	2
865	Find Greatest Common Divisor of 12, 14, 34, 41, 47 and 34, using prime factorization.	2
866	Find Greatest Common Divisor of 20 and 45, using prime factorization.	2
867	Find Greatest Common Divisor of 588 and 90, using repeated division.	2
868	Find Greatest Common Divisor of 196 and 249, using Euclidean algorithm.	2
869	Find Greatest Common Divisor of 10, 47 and 24, using prime factorization.	2
870	Find Greatest Common Divisor of 48 and 5, using prime factorization.	2
871	Find Greatest Common Divisor of 756, 324 and 540, using prime factorization.	2
872	Find Greatest Common Divisor of 9 and 54, using prime factorization.	2
873	Find Greatest Common Divisor of 6699 and 8265, using repeated division.	2
874	Find Greatest Common Divisor of 196 and 250, using Euclidean algorithm.	2
875	Find Greatest Common Divisor of 8 and 24, using prime factorization.	2
876	Find Greatest Common Divisor of 14, 49 and 7, using prime factorization.	2
877	Find Greatest Common Divisor of 23, 23 and 32, using prime factorization.	2
878	Find Greatest Common Divisor of 1, 28, 26, 8, 1, 79, 3, 52, 1 and 44, using prime factorization.	2
879	Find Greatest Common Divisor of 941688 and 133980, using prime factorization.	2
880	Find Greatest Common Divisor of 48 and 5, using Euclidean algorithm.	2
881	Find Greatest Common Divisor of 196 and 262, using Euclidean algorithm.	2
882	Find Greatest Common Divisor of 40 and 150, using prime factorization.	2
883	Find Greatest Common Divisor of 8 and 6, using Euclidean algorithm.	2
884	Find Greatest Common Divisor of 92, 32 and 68, using prime factorization.	2
885	Find Greatest Common Divisor of 225 and 135, using prime factorization.	2
886	Find Greatest Common Divisor of 28 and 5, using Euclidean algorithm.	2
887	Find Greatest Common Divisor of 941688 and 133980, using Euclidean algorithm.	2
888	Find Greatest Common Divisor of 65537 and 296208, using prime factorization.	2
889	Find Greatest Common Divisor of 99 and 81, using prime factorization.	2
890	Find Greatest Common Divisor of 210 and 23, using prime factorization.	2
891	Find Greatest Common Divisor of 32 and 108, using prime factorization.	2
892	Find Greatest Common Divisor of 4, 27 and 50, using prime factorization.	2
893	Find Greatest Common Divisor of 3289 and 2415, using Euclidean algorithm.	2
894	Find Greatest Common Divisor of 44 and 22, using Euclidean algorithm.	2
895	Find Greatest Common Divisor of 1, 4, 8, 6, 9, 4, 5, 25, 5 and 7, using prime factorization.	2
896	Find Greatest Common Divisor of 40 and 125, using prime factorization.	2
897	Find Greatest Common Divisor of 85 and 901, using prime factorization.	2
898	Find Greatest Common Divisor of 1333 and 455, using prime factorization.	2
899	Find Greatest Common Divisor of 210, 230, 250 and 270, using prime factorization.	2
900	Find Greatest Common Divisor of 81 and 122, using prime factorization.	2