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 47 and 4, using Euclidean algorithm. | 2 |
| 3802 | Find Greatest Common Divisor of 23 and 5, using Euclidean algorithm. | 2 |
| 3803 | Find Greatest Common Divisor of 24 and 48, using prime factorization. | 2 |
| 3804 | Find Greatest Common Divisor of 11 and 8, using Euclidean algorithm. | 2 |
| 3805 | Find Greatest Common Divisor of 19 and 8, using Euclidean algorithm. | 2 |
| 3806 | Find Greatest Common Divisor of 6435 and 768, using prime factorization. | 2 |
| 3807 | Find Greatest Common Divisor of 2, 4 and 8, using prime factorization. | 2 |
| 3808 | Find Greatest Common Divisor of 420 and 352, using prime factorization. | 2 |
| 3809 | Find Greatest Common Divisor of 16 and 97, using prime factorization. | 2 |
| 3810 | Find Greatest Common Divisor of 180 and 80, using prime factorization. | 2 |
| 3811 | Find Greatest Common Divisor of 589 and 817, using prime factorization. | 2 |
| 3812 | Find Greatest Common Divisor of 20 and 115, using prime factorization. | 2 |
| 3813 | Find Greatest Common Divisor of 1001 and 11, using Euclidean algorithm. | 2 |
| 3814 | Find Greatest Common Divisor of 663 and 5168, using Euclidean algorithm. | 2 |
| 3815 | Find Greatest Common Divisor of 733103 and 91637, using Euclidean algorithm. | 2 |
| 3816 | Find Greatest Common Divisor of 513 and 347, using Euclidean algorithm. | 2 |
| 3817 | Find Greatest Common Divisor of 3 and 14, using Euclidean algorithm. | 2 |
| 3818 | Find Greatest Common Divisor of 44289 and 38952, using Euclidean algorithm. | 2 |
| 3819 | Find Greatest Common Divisor of 40, 6, 43, 5, 42, 2, 6, 6, 12, 1, 1 and 1, using prime factorization. | 2 |
| 3820 | Find Greatest Common Divisor of 18, 2436, 54, 90 and 126, using prime factorization. | 2 |
| 3821 | Find Greatest Common Divisor of 48 and 5, using prime factorization. | 2 |
| 3822 | Find Greatest Common Divisor of 48 and 5, using Euclidean algorithm. | 2 |
| 3823 | Find Greatest Common Divisor of 400. | 2 |
| 3824 | Find Greatest Common Divisor of 400. | 2 |
| 3825 | Find Greatest Common Divisor of 862. | 2 |
| 3826 | Find Greatest Common Divisor of 8440. | 2 |
| 3827 | Find Greatest Common Divisor of 13 and 120, using prime factorization. | 2 |
| 3828 | Find Greatest Common Divisor of 2, 5, 2, 4, 3, 2, 3, 3, 2, 5, 2, 4, 2, 3, 2, 2, 4 and 4, using prime factorization. | 2 |
| 3829 | Find Greatest Common Divisor of 1, 5, 3 and 10, using prime factorization. | 2 |
| 3830 | Find Greatest Common Divisor of 1819 and 3587, using Euclidean algorithm. | 2 |
| 3831 | Find Greatest Common Divisor of 2447 and 3997, using prime factorization. | 2 |
| 3832 | Find Greatest Common Divisor of 1010 and 407, using Euclidean algorithm. | 2 |
| 3833 | Find Greatest Common Divisor of 44 and 91, using Euclidean algorithm. | 2 |
| 3834 | Find Greatest Common Divisor of 407 and 101, using prime factorization. | 2 |
| 3835 | Find Greatest Common Divisor of 407 and 101, using Euclidean algorithm. | 2 |
| 3836 | Find Greatest Common Divisor of 407 and 1010, using Euclidean algorithm. | 2 |
| 3837 | Find Greatest Common Divisor of 1000 and 400, using prime factorization. | 2 |
| 3838 | Find Greatest Common Divisor of 1000 and 400, using Euclidean algorithm. | 2 |
| 3839 | Find Greatest Common Divisor of 1000 and 400, by listing out the factors. | 2 |
| 3840 | Find Greatest Common Divisor of 301, 981, 449 and 573, using prime factorization. | 2 |
| 3841 | Find Greatest Common Divisor of 12 and 16, using repeated division. | 2 |
| 3842 | Find Greatest Common Divisor of 45 and 95, using prime factorization. | 2 |
| 3843 | Find Greatest Common Divisor of 125 and 728, using repeated division. | 2 |
| 3844 | Find Greatest Common Divisor of 125 and 728, using Euclidean algorithm. | 2 |
| 3845 | Find Greatest Common Divisor of 216 and 68, using Euclidean algorithm. | 2 |
| 3846 | Find Greatest Common Divisor of 390 and 1261, using prime factorization. | 2 |
| 3847 | Find Greatest Common Divisor of 1 and 64, using prime factorization. | 2 |
| 3848 | Find Greatest Common Divisor of 267, 445 and 712, using prime factorization. | 2 |
| 3849 | Find Greatest Common Divisor of 356 and 140, using prime factorization. | 2 |
| 3850 | Find Greatest Common Divisor of 280 and 117, using Euclidean algorithm. | 2 |