GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3751 | Find Greatest Common Divisor of 180 and 600, using Euclidean algorithm. | 2 |
| 3752 | Find Greatest Common Divisor of 60 and 84, using Euclidean algorithm. | 2 |
| 3753 | Find Greatest Common Divisor of 234 and 470, using Euclidean algorithm. | 2 |
| 3754 | Find Greatest Common Divisor of 84 and 180, using Euclidean algorithm. | 2 |
| 3755 | Find Greatest Common Divisor of 64 and 160, using Euclidean algorithm. | 2 |
| 3756 | Find Greatest Common Divisor of 308 and 504, using Euclidean algorithm. | 2 |
| 3757 | Find Greatest Common Divisor of 1890 and 45, using Euclidean algorithm. | 2 |
| 3758 | Find Greatest Common Divisor of 1890 and 450, using Euclidean algorithm. | 2 |
| 3759 | Find Greatest Common Divisor of 696 and 432, using Euclidean algorithm. | 2 |
| 3760 | Find Greatest Common Divisor of 105 and 231, using Euclidean algorithm. | 2 |
| 3761 | Find Greatest Common Divisor of 273 and 595, using Euclidean algorithm. | 2 |
| 3762 | Find Greatest Common Divisor of 18 and 50, using prime factorization. | 2 |
| 3763 | Find Greatest Common Divisor of 93 and 22, using prime factorization. | 2 |
| 3764 | Find Greatest Common Divisor of 39 and 22, using prime factorization. | 2 |
| 3765 | Find Greatest Common Divisor of 99 and 40, using prime factorization. | 2 |
| 3766 | Find Greatest Common Divisor of 6, 9 and 12, using prime factorization. | 2 |
| 3767 | Find Greatest Common Divisor of 14400 and 5040, using prime factorization. | 2 |
| 3768 | Find Greatest Common Divisor of 54321 and 12345, using prime factorization. | 2 |
| 3769 | Find Greatest Common Divisor of 54321 and 12345, using Euclidean algorithm. | 2 |
| 3770 | Find Greatest Common Divisor of 5, 6 and 92, using prime factorization. | 2 |
| 3771 | Find Greatest Common Divisor of 398 and 294, using prime factorization. | 2 |
| 3772 | Find Greatest Common Divisor of 398 and 294, using Euclidean algorithm. | 2 |
| 3773 | Find Greatest Common Divisor of 976 and 174, using prime factorization. | 2 |
| 3774 | Find Greatest Common Divisor of 4655 and 12075, using prime factorization. | 2 |
| 3775 | Find Greatest Common Divisor of 4655 and 12075, using repeated division. | 2 |
| 3776 | Find Greatest Common Divisor of 4, 21 and 60, using prime factorization. | 2 |
| 3777 | Find Greatest Common Divisor of 15 and 22, using prime factorization. | 2 |
| 3778 | Find Greatest Common Divisor of 20, 15 and 5, using prime factorization. | 2 |
| 3779 | Find Greatest Common Divisor of 3, 6 and 7, using prime factorization. | 2 |
| 3780 | Find Greatest Common Divisor of 345 and 369, using prime factorization. | 2 |
| 3781 | Find Greatest Common Divisor of 369 and 345, using repeated division. | 2 |
| 3782 | Find Greatest Common Divisor of 369 and 345, using Euclidean algorithm. | 2 |
| 3783 | Find Greatest Common Divisor of 1 and 100, using Euclidean algorithm. | 2 |
| 3784 | Find Greatest Common Divisor of 9, 15 and 12, using prime factorization. | 2 |
| 3785 | Find Greatest Common Divisor of 8217949832 and 8181353375, using prime factorization. | 2 |
| 3786 | Find Greatest Common Divisor of 290184 and 351, using prime factorization. | 2 |
| 3787 | Find Greatest Common Divisor of 1111 and 11, using Euclidean algorithm. | 2 |
| 3788 | Find Greatest Common Divisor of 12, 116, 56 and 764, using prime factorization. | 2 |
| 3789 | Find Greatest Common Divisor of 13, 7 and 72, using prime factorization. | 2 |
| 3790 | Find Greatest Common Divisor of 442 and 1120, using Euclidean algorithm. | 2 |
| 3791 | Find Greatest Common Divisor of 2 and 0, using repeated division. | 2 |
| 3792 | Find Greatest Common Divisor of 7 and 4, using Euclidean algorithm. | 2 |
| 3793 | Find Greatest Common Divisor of 79 and 41, using Euclidean algorithm. | 2 |
| 3794 | Find Greatest Common Divisor of 218, 908, 36, 124, 144, 180, 49, 60, 150 and 4, using prime factorization. | 2 |
| 3795 | Find Greatest Common Divisor of 126 and 147, by listing out the factors. | 2 |
| 3796 | Find Greatest Common Divisor of 6638 and 22783, using Euclidean algorithm. | 2 |
| 3797 | Find Greatest Common Divisor of 1001 and 910, using prime factorization. | 2 |
| 3798 | Find Greatest Common Divisor of 16, 24, 36 and 48, by listing out the factors. | 2 |
| 3799 | Find Greatest Common Divisor of 22 and 45, using repeated division. | 2 |
| 3800 | Find Greatest Common Divisor of 22 and 48, using repeated division. | 2 |