GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
951 | Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, by listing out the factors. | 2 |
952 | Find Greatest Common Divisor of 56 and 25824, using prime factorization. | 2 |
953 | Find Greatest Common Divisor of 45 and 79, using Euclidean algorithm. | 2 |
954 | Find Greatest Common Divisor of 40 and 50, using Euclidean algorithm. | 2 |
955 | Find Greatest Common Divisor of 68, 12, 8, 4 and 0, by listing out the factors. | 2 |
956 | Find Greatest Common Divisor of 25 and 90, using Euclidean algorithm. | 2 |
957 | Find Greatest Common Divisor of 68, 12, 8, 4 and 0, using repeated division. | 2 |
958 | Find Greatest Common Divisor of 36 and 14, using prime factorization. | 2 |
959 | Find Greatest Common Divisor of 11 and 1680, using prime factorization. | 2 |
960 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using Euclidean algorithm. | 2 |
961 | Find Greatest Common Divisor of 5 and 11, using Euclidean algorithm. | 2 |
962 | Find Greatest Common Divisor of 3, 17, 29, 31, 33 and 11, using Euclidean algorithm. | 2 |
963 | Find Greatest Common Divisor of 156 and 25824, using prime factorization. | 2 |
964 | Find Greatest Common Divisor of 784 and 1400, using prime factorization. | 2 |
965 | Find Greatest Common Divisor of 73556 and 3444, using repeated division. | 2 |
966 | Find Greatest Common Divisor of 13 and 41, using Euclidean algorithm. | 2 |
967 | Find Greatest Common Divisor of 83 and 47, using prime factorization. | 2 |
968 | Find Greatest Common Divisor of 270 and 358, using prime factorization. | 2 |
969 | Find Greatest Common Divisor of 13 and 120, using prime factorization. | 2 |
970 | Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using prime factorization. | 2 |
971 | Find Greatest Common Divisor of 99 and 59, using Euclidean algorithm. | 2 |
972 | Find Greatest Common Divisor of 333 and 583, using prime factorization. | 2 |
973 | Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, using repeated division. | 2 |
974 | Find Greatest Common Divisor of 82 and 70, using Euclidean algorithm. | 2 |
975 | Find Greatest Common Divisor of 5 and 6, using prime factorization. | 2 |
976 | Find Greatest Common Divisor of 60 and 90, using prime factorization. | 2 |
977 | Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using prime factorization. | 2 |
978 | Find Greatest Common Divisor of 378 and 140, using Euclidean algorithm. | 2 |
979 | Find Greatest Common Divisor of 1, 12, 9 and 14, using prime factorization. | 2 |
980 | Find Greatest Common Divisor of 333 and 583, using repeated division. | 2 |
981 | Find Greatest Common Divisor of 5, 7 and 12, using prime factorization. | 2 |
982 | Find Greatest Common Divisor of 300 and 110, using Euclidean algorithm. | 2 |
983 | Find Greatest Common Divisor of 180, 396 and 468, using Euclidean algorithm. | 2 |
984 | Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, by listing out the factors. | 2 |
985 | Find Greatest Common Divisor of 78 and 66, using repeated division. | 2 |
986 | Find Greatest Common Divisor of 5, 7 and 12, using repeated division. | 2 |
987 | Find Greatest Common Divisor of 15 and 75, using Euclidean algorithm. | 2 |
988 | Find Greatest Common Divisor of 42, 78 and 96, using prime factorization. | 2 |
989 | Find Greatest Common Divisor of 15 and 22, using prime factorization. | 2 |
990 | Find Greatest Common Divisor of 720 and 588, using Euclidean algorithm. | 2 |
991 | Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using repeated division. | 2 |
992 | Find Greatest Common Divisor of 78 and 66, by listing out the factors. | 2 |
993 | Find Greatest Common Divisor of 37 and 3120, using Euclidean algorithm. | 2 |
994 | Find Greatest Common Divisor of 2, 3, 33, 39, 41 and 7, by listing out the factors. | 2 |
995 | Find Greatest Common Divisor of 7 and 12, using repeated division. | 2 |
996 | Find Greatest Common Divisor of 48 and 54, using prime factorization. | 2 |
997 | Find Greatest Common Divisor of 311 and 28, using repeated division. | 2 |
998 | Find Greatest Common Divisor of 9 and 30, using Euclidean algorithm. | 2 |
999 | Find Greatest Common Divisor of 333 and 963, by listing out the factors. | 2 |
1000 | Find Greatest Common Divisor of 23 and 1200, using Euclidean algorithm. | 2 |