GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
951	Find Greatest Common Divisor of 25, 16 and 10, using prime factorization.	2
952	Find Greatest Common Divisor of 88, 37 and 21, using prime factorization.	2
953	Find Greatest Common Divisor of 72, 60 and 56, using prime factorization.	2
954	Find Greatest Common Divisor of 25, 10 and 92, using prime factorization.	2
955	Find Greatest Common Divisor of 56, 91 and 3, using prime factorization.	2
956	Find Greatest Common Divisor of 19, 35 and 34, using prime factorization.	2
957	Find Greatest Common Divisor of 87, 11 and 31, using prime factorization.	2
958	Find Greatest Common Divisor of 19, 52 and 47, using prime factorization.	2
959	Find Greatest Common Divisor of 10, 47 and 24, using prime factorization.	2
960	Find Greatest Common Divisor of 23, 23 and 32, using prime factorization.	2
961	Find Greatest Common Divisor of 92, 32 and 68, using prime factorization.	2
962	Find Greatest Common Divisor of 93, 73 and 54, using prime factorization.	2
963	Find Greatest Common Divisor of 3, 16 and 13, using prime factorization.	2
964	Find Greatest Common Divisor of 16, 32 and 94, using prime factorization.	2
965	Find Greatest Common Divisor of 73, 56 and 44, using prime factorization.	2
966	Find Greatest Common Divisor of 25, 75 and 90, using prime factorization.	2
967	Find Greatest Common Divisor of 15, 29 and 75, using prime factorization.	2
968	Find Greatest Common Divisor of 90, 50 and 53, using prime factorization.	2
969	Find Greatest Common Divisor of 45 and 79, using Euclidean algorithm.	2
970	Find Greatest Common Divisor of 25 and 90, using Euclidean algorithm.	2
971	Find Greatest Common Divisor of 82 and 70, using Euclidean algorithm.	2
972	Find Greatest Common Divisor of 15 and 75, using Euclidean algorithm.	2
973	Find Greatest Common Divisor of 83 and 49, using Euclidean algorithm.	2
974	Find Greatest Common Divisor of 27 and 37, using Euclidean algorithm.	2
975	Find Greatest Common Divisor of 72 and 47, using Euclidean algorithm.	2
976	Find Greatest Common Divisor of 32 and 4, using Euclidean algorithm.	2
977	Find Greatest Common Divisor of 32 and 4, using Euclidean algorithm.	2
978	Find Greatest Common Divisor of 8 and 52, using Euclidean algorithm.	2
979	Find Greatest Common Divisor of 58 and 40, using Euclidean algorithm.	2
980	Find Greatest Common Divisor of 56 and 3, using Euclidean algorithm.	2
981	Find Greatest Common Divisor of 44 and 97, using Euclidean algorithm.	2
982	Find Greatest Common Divisor of 97 and 45, using Euclidean algorithm.	2
983	Find Greatest Common Divisor of 52 and 98, using Euclidean algorithm.	2
984	Find Greatest Common Divisor of 62 and 30, using Euclidean algorithm.	2
985	Find Greatest Common Divisor of 30 and 14, using Euclidean algorithm.	2
986	Find Greatest Common Divisor of 42 and 95, using Euclidean algorithm.	2
987	Find Greatest Common Divisor of 53 and 14, using Euclidean algorithm.	2
988	Find Greatest Common Divisor of 44 and 48, using Euclidean algorithm.	2
989	Find Greatest Common Divisor of 69 and 97, using Euclidean algorithm.	2
990	Find Greatest Common Divisor of 90 and 13, using Euclidean algorithm.	2
991	Find Greatest Common Divisor of 76 and 53, using Euclidean algorithm.	2
992	Find Greatest Common Divisor of 56 and 98, using Euclidean algorithm.	2
993	Find Greatest Common Divisor of 33 and 70, using Euclidean algorithm.	2
994	Find Greatest Common Divisor of 53 and 28, using Euclidean algorithm.	2
995	Find Greatest Common Divisor of 8 and 73, using Euclidean algorithm.	2
996	Find Greatest Common Divisor of 90 and 67, using Euclidean algorithm.	2
997	Find Greatest Common Divisor of 44 and 90, using Euclidean algorithm.	2
998	Find Greatest Common Divisor of 44, 26 and 90, by listing out the factors.	2
999	Find Greatest Common Divisor of 90 and 1, using Euclidean algorithm.	2
1000	Find Greatest Common Divisor of 78 and 32, using Euclidean algorithm.	2