GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3801 | Find Greatest Common Divisor of 46 and 108, using prime factorization. | 1 |
| 3802 | Find Greatest Common Divisor of 2165 and 1287, using Euclidean algorithm. | 1 |
| 3803 | Find Greatest Common Divisor of 4, 7, 7 and 9, using prime factorization. | 1 |
| 3804 | Find Greatest Common Divisor of 40902 and 24240, using prime factorization. | 1 |
| 3805 | Find Greatest Common Divisor of 3 and 616, using repeated division. | 1 |
| 3806 | Find Greatest Common Divisor of 3 and 616, using prime factorization. | 1 |
| 3807 | Find Greatest Common Divisor of 3 and 616, using Euclidean algorithm. | 1 |
| 3808 | Find Greatest Common Divisor of 1, 24, 34, 35 and 36, by listing out the factors. | 1 |
| 3809 | Find Greatest Common Divisor of 84 and 33, using prime factorization. | 1 |
| 3810 | Find Greatest Common Divisor of 449598240 and 11, using prime factorization. | 1 |
| 3811 | Find Greatest Common Divisor of 449598240 and 11, using Euclidean algorithm. | 1 |
| 3812 | Find Greatest Common Divisor of 203 and 833, using prime factorization. | 1 |
| 3813 | Find Greatest Common Divisor of 45 and 4, using Euclidean algorithm. | 1 |
| 3814 | Find Greatest Common Divisor of 31, 32 and 341, using prime factorization. | 1 |
| 3815 | Find Greatest Common Divisor of 69 and 34, using prime factorization. | 1 |
| 3816 | Find Greatest Common Divisor of 69 and 34, using Euclidean algorithm. | 1 |
| 3817 | Find Greatest Common Divisor of 60 and 30, using Euclidean algorithm. | 1 |
| 3818 | Find Greatest Common Divisor of 50 and 15, using Euclidean algorithm. | 1 |
| 3819 | Find Greatest Common Divisor of 99 and 18, using Euclidean algorithm. | 1 |
| 3820 | Find Greatest Common Divisor of 88 and 9, using Euclidean algorithm. | 1 |
| 3821 | Find Greatest Common Divisor of 88 and 18, using Euclidean algorithm. | 1 |
| 3822 | Find Greatest Common Divisor of 3 and 48, using prime factorization. | 1 |
| 3823 | Find Greatest Common Divisor of 6437 and 2393, using Euclidean algorithm. | 1 |
| 3824 | Find Greatest Common Divisor of 51 and 93, using prime factorization. | 1 |
| 3825 | Find Greatest Common Divisor of 51 and 93, using repeated division. | 1 |
| 3826 | Find Greatest Common Divisor of 51 and 93, using Euclidean algorithm. | 1 |
| 3827 | Find Greatest Common Divisor of 1586 and 899, using Euclidean algorithm. | 1 |
| 3828 | Find Greatest Common Divisor of 46 and 64, using prime factorization. | 1 |
| 3829 | Find Greatest Common Divisor of 890 and 525, using prime factorization. | 1 |
| 3830 | Find Greatest Common Divisor of 18 and 22, using prime factorization. | 1 |
| 3831 | Find Greatest Common Divisor of 105 and 120, using prime factorization. | 1 |
| 3832 | Find Greatest Common Divisor of 1 and 8, using repeated division. | 1 |
| 3833 | Find Greatest Common Divisor of 115 and 184, using repeated division. | 1 |
| 3834 | Find Greatest Common Divisor of 165 and 285, using prime factorization. | 1 |
| 3835 | Find Greatest Common Divisor of 165 and 285, using Euclidean algorithm. | 1 |
| 3836 | Find Greatest Common Divisor of 91, 64 and 87, using repeated division. | 1 |
| 3837 | Find Greatest Common Divisor of 28 and 38, using prime factorization. | 1 |
| 3838 | Find Greatest Common Divisor of 28 and 38, using repeated division. | 1 |
| 3839 | Find Greatest Common Divisor of 28 and 38, using Euclidean algorithm. | 1 |
| 3840 | Find Greatest Common Divisor of 54 and 68, using prime factorization. | 1 |
| 3841 | Find Greatest Common Divisor of 2000 and 3000, using prime factorization. | 1 |
| 3842 | Find Greatest Common Divisor of 34 and 18, using prime factorization. | 1 |
| 3843 | Find Greatest Common Divisor of 378 and 140, using prime factorization. | 1 |
| 3844 | Find Greatest Common Divisor of 378 and 140, using repeated division. | 1 |
| 3845 | Find Greatest Common Divisor of 31 and 12, using prime factorization. | 1 |
| 3846 | Find Greatest Common Divisor of 10 and 30, using Euclidean algorithm. | 1 |
| 3847 | Find Greatest Common Divisor of 42 and 18, using Euclidean algorithm. | 1 |
| 3848 | Find Greatest Common Divisor of 110 and 2511, by listing out the factors. | 1 |
| 3849 | Find Greatest Common Divisor of 4, 11, 23, 33 and 49, using prime factorization. | 1 |
| 3850 | Find Greatest Common Divisor of 616 and 32, using prime factorization. | 1 |
