GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 6701 | Find Greatest Common Divisor of 148 and 59, using Euclidean algorithm. | 1 |
| 6702 | Find Greatest Common Divisor of 2970 and 1260, using prime factorization. | 1 |
| 6703 | Find Greatest Common Divisor of 176 and 20, using prime factorization. | 1 |
| 6704 | Find Greatest Common Divisor of 190 and 24, using prime factorization. | 1 |
| 6705 | Find Greatest Common Divisor of 29 and 80, using Euclidean algorithm. | 1 |
| 6706 | Find Greatest Common Divisor of 8935 and 15, by listing out the factors. | 1 |
| 6707 | Find Greatest Common Divisor of 192 and 8, using Euclidean algorithm. | 1 |
| 6708 | Find Greatest Common Divisor of 192 and 3, using Euclidean algorithm. | 1 |
| 6709 | Find Greatest Common Divisor of 192 and 9, using Euclidean algorithm. | 1 |
| 6710 | Find Greatest Common Divisor of 192 and 7, using prime factorization. | 1 |
| 6711 | Find Greatest Common Divisor of 192 and 11, using prime factorization. | 1 |
| 6712 | Find Greatest Common Divisor of 9223372036854775807. | 1 |
| 6713 | Find Greatest Common Divisor of 72 and 45, using prime factorization. | 1 |
| 6714 | Find Greatest Common Divisor of 252 and 291, using Euclidean algorithm. | 1 |
| 6715 | Find Greatest Common Divisor of 117 and 845, using Euclidean algorithm. | 1 |
| 6716 | Find Greatest Common Divisor of 5387 and 133, using prime factorization. | 1 |
| 6717 | Find Greatest Common Divisor of 5387 and 133, using Euclidean algorithm. | 1 |
| 6718 | Find Greatest Common Divisor of 17 and 11, using Euclidean algorithm. | 1 |
| 6719 | Find Greatest Common Divisor of 223 and 48, using prime factorization. | 1 |
| 6720 | Find Greatest Common Divisor of 111111 and 11111, using Euclidean algorithm. | 1 |
| 6721 | Find Greatest Common Divisor of 192 and 19, using Euclidean algorithm. | 1 |
| 6722 | Find Greatest Common Divisor of 32 and 623, using Euclidean algorithm. | 1 |
| 6723 | Find Greatest Common Divisor of 32 and 263, using Euclidean algorithm. | 1 |
| 6724 | Find Greatest Common Divisor of 446 and 269, using Euclidean algorithm. | 1 |
| 6725 | Find Greatest Common Divisor of 12211 and 10422, using Euclidean algorithm. | 1 |
| 6726 | Find Greatest Common Divisor of 786 and 123, using Euclidean algorithm. | 1 |
| 6727 | Find Greatest Common Divisor of 2, 4, 3, 2, 5, 2, 2, 3, 5 and 2, using prime factorization. | 1 |
| 6728 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using prime factorization. | 1 |
| 6729 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, by listing out the factors. | 1 |
| 6730 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using Euclidean algorithm. | 1 |
| 6731 | Find Greatest Common Divisor of 2, 8, 3, 5, 7, 11, 13, 2, 8, 3, 11, 13, 7 and 17, using repeated division. | 1 |
| 6732 | Find Greatest Common Divisor of 150 and 51, using prime factorization. | 1 |
| 6733 | Find Greatest Common Divisor of 44, 32 and 54, using prime factorization. | 1 |
| 6734 | Find Greatest Common Divisor of 32756, 32758 and 32760, using prime factorization. | 1 |
| 6735 | Find Greatest Common Divisor of 40293, 50193 and 59829, using prime factorization. | 1 |
| 6736 | Find Greatest Common Divisor of 216 and 106, using prime factorization. | 1 |
| 6737 | Find Greatest Common Divisor of 216 and 108, using prime factorization. | 1 |
| 6738 | Find Greatest Common Divisor of 28853, 684, 28892, 402, 32063 and 656, using prime factorization. | 1 |
| 6739 | Find Greatest Common Divisor of 84 and 140, using prime factorization. | 1 |
| 6740 | Find Greatest Common Divisor of 3 and 889079, using Euclidean algorithm. | 1 |
| 6741 | Find Greatest Common Divisor of 63 and 889079, using Euclidean algorithm. | 1 |
| 6742 | Find Greatest Common Divisor of 773794 and 889079, using Euclidean algorithm. | 1 |
| 6743 | Find Greatest Common Divisor of 798216 and 889079, using Euclidean algorithm. | 1 |
| 6744 | Find Greatest Common Divisor of 798215 and 889079, using Euclidean algorithm. | 1 |
| 6745 | Find Greatest Common Divisor of 192 and 108, using prime factorization. | 1 |
| 6746 | Find Greatest Common Divisor of 1238 and 800, using prime factorization. | 1 |
| 6747 | Find Greatest Common Divisor of 124. | 1 |
| 6748 | Find Greatest Common Divisor of 0. | 1 |
| 6749 | Find Greatest Common Divisor of 10. | 1 |
| 6750 | Find Greatest Common Divisor of 2200765035 and 2000, using Euclidean algorithm. | 1 |
