GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
951 | Find Greatest Common Divisor of 19 and 99, by listing out the factors. | 3 |
952 | Find Greatest Common Divisor of 432, 576 and 1008, using Euclidean algorithm. | 3 |
953 | Find Greatest Common Divisor of 18 and 201, using repeated division. | 3 |
954 | Find Greatest Common Divisor of 735 and 1155, using prime factorization. | 3 |
955 | Find Greatest Common Divisor of 666, 888 and 1110, using prime factorization. | 3 |
956 | Find Greatest Common Divisor of 85 and 10, using Euclidean algorithm. | 3 |
957 | Find Greatest Common Divisor of 2. | 3 |
958 | Find Greatest Common Divisor of 16 and 28, using Euclidean algorithm. | 3 |
959 | Find Greatest Common Divisor of 442 and 1120, using Euclidean algorithm. | 2 |
960 | Find Greatest Common Divisor of 2 and 0, using repeated division. | 2 |
961 | Find Greatest Common Divisor of 7 and 4, using Euclidean algorithm. | 2 |
962 | Find Greatest Common Divisor of 79 and 41, using prime factorization. | 2 |
963 | Find Greatest Common Divisor of 218, 908, 36, 124, 144, 180, 49, 60, 150 and 4, using prime factorization. | 2 |
964 | Find Greatest Common Divisor of 126 and 147, by listing out the factors. | 2 |
965 | Find Greatest Common Divisor of 6638 and 22783, using Euclidean algorithm. | 2 |
966 | Find Greatest Common Divisor of 1001 and 910, using prime factorization. | 2 |
967 | Find Greatest Common Divisor of 16, 24, 36 and 48, by listing out the factors. | 2 |
968 | Find Greatest Common Divisor of 2, 5 and 7, using prime factorization. | 2 |
969 | Find Greatest Common Divisor of 22 and 45, using repeated division. | 2 |
970 | Find Greatest Common Divisor of 22 and 48, using repeated division. | 2 |
971 | Find Greatest Common Divisor of 24 and 48, using Euclidean algorithm. | 2 |
972 | Find Greatest Common Divisor of 24 and 49, by listing out the factors. | 2 |
973 | Find Greatest Common Divisor of 65537 and 899, using prime factorization. | 2 |
974 | Find Greatest Common Divisor of 197070 and 17739, using prime factorization. | 2 |
975 | Find Greatest Common Divisor of 2560 and 1440, using repeated division. | 2 |
976 | Find Greatest Common Divisor of 2560 and 1440, using Euclidean algorithm. | 2 |
977 | Find Greatest Common Divisor of 15, 50 and 46, using prime factorization. | 2 |
978 | Find Greatest Common Divisor of 507885 and 60808, using prime factorization. | 2 |
979 | Find Greatest Common Divisor of 175, 225 and 350, using prime factorization. | 2 |
980 | Find Greatest Common Divisor of 175, 225 and 350, using Euclidean algorithm. | 2 |
981 | Find Greatest Common Divisor of 1874 and 602, using prime factorization. | 2 |
982 | Find Greatest Common Divisor of 1874 and 602, using Euclidean algorithm. | 2 |
983 | Find Greatest Common Divisor of 36 and 233, using Euclidean algorithm. | 2 |
984 | Find Greatest Common Divisor of 941688 and 133980, using prime factorization. | 2 |
985 | Find Greatest Common Divisor of 941688 and 133980, using Euclidean algorithm. | 2 |
986 | Find Greatest Common Divisor of 40 and 3, using prime factorization. | 2 |
987 | Find Greatest Common Divisor of 42, 105 and 91, using Euclidean algorithm. | 2 |
988 | Find Greatest Common Divisor of 0 and 2, using prime factorization. | 2 |
989 | Find Greatest Common Divisor of 1023 and 217, using prime factorization. | 2 |
990 | Find Greatest Common Divisor of 3 and 12, using Euclidean algorithm. | 2 |
991 | Find Greatest Common Divisor of 98 and 24, using Euclidean algorithm. | 2 |
992 | Find Greatest Common Divisor of 48030. | 2 |
993 | Find Greatest Common Divisor of 48, 30 and 9, using prime factorization. | 2 |
994 | Find Greatest Common Divisor of 47 and 11, using Euclidean algorithm. | 2 |
995 | Find Greatest Common Divisor of 1975231 and 1936877, using prime factorization. | 2 |
996 | Find Greatest Common Divisor of 72 and 52, using repeated division. | 2 |
997 | Find Greatest Common Divisor of 784 and 1400, using prime factorization. | 2 |
998 | Find Greatest Common Divisor of 42, 78 and 96, using prime factorization. | 2 |
999 | Find Greatest Common Divisor of 1666. | 2 |
1000 | Find Greatest Common Divisor of 341 and 88, using Euclidean algorithm. | 2 |