GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 3901 | Find Greatest Common Divisor of 43 and 41, using Euclidean algorithm. | 2 |
| 3902 | Find Greatest Common Divisor of 73 and 660, using Euclidean algorithm. | 2 |
| 3903 | Find Greatest Common Divisor of 30 and 107, using prime factorization. | 2 |
| 3904 | Find Greatest Common Divisor of 30 and 107, using repeated division. | 2 |
| 3905 | Find Greatest Common Divisor of 30 and 107, using Euclidean algorithm. | 2 |
| 3906 | Find Greatest Common Divisor of 3 and 448, using Euclidean algorithm. | 2 |
| 3907 | Find Greatest Common Divisor of 1573 and 2145, using prime factorization. | 2 |
| 3908 | Find Greatest Common Divisor of 65537 and 65539, using Euclidean algorithm. | 2 |
| 3909 | Find Greatest Common Divisor of 1188 and 385, using Euclidean algorithm. | 2 |
| 3910 | Find Greatest Common Divisor of 385 and 1188, using Euclidean algorithm. | 2 |
| 3911 | Find Greatest Common Divisor of 832 and 10933, using Euclidean algorithm. | 2 |
| 3912 | Find Greatest Common Divisor of 221 and 405, using prime factorization. | 2 |
| 3913 | Find Greatest Common Divisor of 500 and 189, using prime factorization. | 2 |
| 3914 | Find Greatest Common Divisor of 65537 and 296208, using prime factorization. | 2 |
| 3915 | Find Greatest Common Divisor of 1333 and 455, using prime factorization. | 2 |
| 3916 | Find Greatest Common Divisor of 9999 and 213, using prime factorization. | 2 |
| 3917 | Find Greatest Common Divisor of 11327 and 333, using prime factorization. | 2 |
| 3918 | Find Greatest Common Divisor of 200, 10, 120 and 11, using repeated division. | 2 |
| 3919 | Find Greatest Common Divisor of 221 and 45, using Euclidean algorithm. | 2 |
| 3920 | Find Greatest Common Divisor of 341 and 2, using Euclidean algorithm. | 2 |
| 3921 | Find Greatest Common Divisor of 197 and 7, using Euclidean algorithm. | 2 |
| 3922 | Find Greatest Common Divisor of 312 and 518, using Euclidean algorithm. | 2 |
| 3923 | Find Greatest Common Divisor of 312 and 528, using Euclidean algorithm. | 2 |
| 3924 | Find Greatest Common Divisor of 360 and 84, using Euclidean algorithm. | 2 |
| 3925 | Find Greatest Common Divisor of 982 and 224, using prime factorization. | 2 |
| 3926 | Find Greatest Common Divisor of 34 and 56, using Euclidean algorithm. | 2 |
| 3927 | Find Greatest Common Divisor of 56 and 60, using Euclidean algorithm. | 2 |
| 3928 | Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, by listing out the factors. | 2 |
| 3929 | Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, using Euclidean algorithm. | 2 |
| 3930 | Find Greatest Common Divisor of 12, 18, 48, 57, 62 and 4, using prime factorization. | 2 |
| 3931 | Find Greatest Common Divisor of 48 and 57, using prime factorization. | 2 |
| 3932 | Find Greatest Common Divisor of 48 and 57, using repeated division. | 2 |
| 3933 | Find Greatest Common Divisor of 17, 34, 56, 60, 61 and 9, using Euclidean algorithm. | 2 |
| 3934 | Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using prime factorization. | 2 |
| 3935 | Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, by listing out the factors. | 2 |
| 3936 | Find Greatest Common Divisor of 9, 30, 39, 49, 59 and 21, using repeated division. | 2 |
| 3937 | Find Greatest Common Divisor of 9 and 30, using Euclidean algorithm. | 2 |
| 3938 | Find Greatest Common Divisor of 509, 1 and 177, using Euclidean algorithm. | 2 |
| 3939 | Find Greatest Common Divisor of 5 and 192, using repeated division. | 2 |
| 3940 | Find Greatest Common Divisor of 10 and 65, using prime factorization. | 2 |
| 3941 | Find Greatest Common Divisor of 78 and 66, using repeated division. | 2 |
| 3942 | Find Greatest Common Divisor of 78 and 66, by listing out the factors. | 2 |
| 3943 | Find Greatest Common Divisor of 78 and 66, using Euclidean algorithm. | 2 |
| 3944 | Find Greatest Common Divisor of 17 and 264, using Euclidean algorithm. | 2 |
| 3945 | Find Greatest Common Divisor of 504 and 980, using prime factorization. | 2 |
| 3946 | Find Greatest Common Divisor of 1, 2, 3 and 4, using prime factorization. | 2 |
| 3947 | Find Greatest Common Divisor of 437 and 219, by listing out the factors. | 2 |
| 3948 | Find Greatest Common Divisor of 2, 1 and 2, using prime factorization. | 2 |
| 3949 | Find Greatest Common Divisor of 3375 and 1000, using repeated division. | 2 |
| 3950 | Find Greatest Common Divisor of 2625 and 1000, using repeated division. | 2 |