GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
1001 | Find Greatest Common Divisor of 57 and 77, using Euclidean algorithm. | 2 |
1002 | Find Greatest Common Divisor of 32 and 69, using Euclidean algorithm. | 2 |
1003 | Find Greatest Common Divisor of 77 and 25, using Euclidean algorithm. | 2 |
1004 | Find Greatest Common Divisor of 69 and 19, using Euclidean algorithm. | 2 |
1005 | Find Greatest Common Divisor of 37 and 18, using Euclidean algorithm. | 2 |
1006 | Find Greatest Common Divisor of 81 and 51, using Euclidean algorithm. | 2 |
1007 | Find Greatest Common Divisor of 18 and 60, using Euclidean algorithm. | 2 |
1008 | Find Greatest Common Divisor of 13 and 91, using Euclidean algorithm. | 2 |
1009 | Find Greatest Common Divisor of 32 and 46, using Euclidean algorithm. | 2 |
1010 | Find Greatest Common Divisor of 66 and 11, using Euclidean algorithm. | 2 |
1011 | Find Greatest Common Divisor of 44 and 92, using Euclidean algorithm. | 2 |
1012 | Find Greatest Common Divisor of 91 and 35, using Euclidean algorithm. | 2 |
1013 | Find Greatest Common Divisor of 13 and 72, using Euclidean algorithm. | 2 |
1014 | Find Greatest Common Divisor of 44 and 22, using Euclidean algorithm. | 2 |
1015 | Find Greatest Common Divisor of 64 and 21, using Euclidean algorithm. | 2 |
1016 | Find Greatest Common Divisor of 57 and 20, using Euclidean algorithm. | 2 |
1017 | Find Greatest Common Divisor of 23 and 85, using Euclidean algorithm. | 2 |
1018 | Find Greatest Common Divisor of 55 and 41, using Euclidean algorithm. | 2 |
1019 | Find Greatest Common Divisor of 78 and 14, using Euclidean algorithm. | 2 |
1020 | Find Greatest Common Divisor of 3, 5 and 4, using prime factorization. | 2 |
1021 | Find Greatest Common Divisor of 89 and 80, using Euclidean algorithm. | 2 |
1022 | Find Greatest Common Divisor of 72 and 63, using Euclidean algorithm. | 2 |
1023 | Find Greatest Common Divisor of 25 and 12, using Euclidean algorithm. | 2 |
1024 | Find Greatest Common Divisor of 1, 746, 28 and 324, using prime factorization. | 2 |
1025 | Find Greatest Common Divisor of 89 and 79, using Euclidean algorithm. | 2 |
1026 | Find Greatest Common Divisor of 156 and 54, using Euclidean algorithm. | 2 |
1027 | Find Greatest Common Divisor of 67 and 63, using Euclidean algorithm. | 2 |
1028 | Find Greatest Common Divisor of 5 and 67, using Euclidean algorithm. | 2 |
1029 | Find Greatest Common Divisor of 7 and 67, using Euclidean algorithm. | 2 |
1030 | Find Greatest Common Divisor of 76 and 70, using Euclidean algorithm. | 2 |
1031 | Find Greatest Common Divisor of 67 and 58, using Euclidean algorithm. | 2 |
1032 | Find Greatest Common Divisor of 19 and 36, using Euclidean algorithm. | 2 |
1033 | Find Greatest Common Divisor of 4 and 20, using Euclidean algorithm. | 2 |
1034 | Find Greatest Common Divisor of 86 and 40, using Euclidean algorithm. | 2 |
1035 | Find Greatest Common Divisor of 71 and 41, using Euclidean algorithm. | 2 |
1036 | Find Greatest Common Divisor of 12906 and 42905, using Euclidean algorithm. | 2 |
1037 | Find Greatest Common Divisor of 125 and 52, using Euclidean algorithm. | 2 |
1038 | Find Greatest Common Divisor of 300 and 110, using Euclidean algorithm. | 2 |
1039 | Find Greatest Common Divisor of 8 and 2, using Euclidean algorithm. | 2 |
1040 | Find Greatest Common Divisor of 1 and 99, using Euclidean algorithm. | 2 |
1041 | Find Greatest Common Divisor of 19 and 34, using Euclidean algorithm. | 2 |
1042 | Find Greatest Common Divisor of 35 and 82, using Euclidean algorithm. | 2 |
1043 | Find Greatest Common Divisor of 32 and 14, using Euclidean algorithm. | 2 |
1044 | Find Greatest Common Divisor of 73 and 91, using Euclidean algorithm. | 2 |
1045 | Find Greatest Common Divisor of 71 and 48, using Euclidean algorithm. | 2 |
1046 | Find Greatest Common Divisor of 30 and 18, using Euclidean algorithm. | 2 |
1047 | Find Greatest Common Divisor of 48 and 2, using Euclidean algorithm. | 2 |
1048 | Find Greatest Common Divisor of 48 and 22, using Euclidean algorithm. | 2 |
1049 | Find Greatest Common Divisor of 87 and 54, using Euclidean algorithm. | 2 |
1050 | Find Greatest Common Divisor of 28 and 95, using Euclidean algorithm. | 2 |