GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 2801 | Find Greatest Common Divisor of 2907 and 105, using prime factorization. | 2 |
| 2802 | Find Greatest Common Divisor of 1330 and 42, using Euclidean algorithm. | 2 |
| 2803 | Find Greatest Common Divisor of 24, 12 and 36, using prime factorization. | 2 |
| 2804 | Find Greatest Common Divisor of 12327 and 2409, using Euclidean algorithm. | 2 |
| 2805 | Find Greatest Common Divisor of 2486625522 and 41582215163, by listing out the factors. | 2 |
| 2806 | Find Greatest Common Divisor of 492, 1353 and 615, using prime factorization. | 2 |
| 2807 | Find Greatest Common Divisor of 5400 and 2412, using Euclidean algorithm. | 2 |
| 2808 | Find Greatest Common Divisor of 6789, 1356 and 2460, using prime factorization. | 2 |
| 2809 | Find Greatest Common Divisor of 1342 and 5733, using prime factorization. | 2 |
| 2810 | Find Greatest Common Divisor of 75 and 240, using prime factorization. | 2 |
| 2811 | Find Greatest Common Divisor of 589432167. | 2 |
| 2812 | Find Greatest Common Divisor of 589432167. | 2 |
| 2813 | Find Greatest Common Divisor of 7, 5 and 6, using prime factorization. | 2 |
| 2814 | Find Greatest Common Divisor of 520 and 660, using prime factorization. | 2 |
| 2815 | Find Greatest Common Divisor of 101 and 3267, using Euclidean algorithm. | 2 |
| 2816 | Find Greatest Common Divisor of 9357 and 5864, using prime factorization. | 2 |
| 2817 | Find Greatest Common Divisor of 1, 9, 2, 4, 4 and 30, using prime factorization. | 2 |
| 2818 | Find Greatest Common Divisor of 1235 and 765, using Euclidean algorithm. | 2 |
| 2819 | Find Greatest Common Divisor of 16 and 63, using prime factorization. | 2 |
| 2820 | Find Greatest Common Divisor of 112 and 128, using prime factorization. | 2 |
| 2821 | Find Greatest Common Divisor of 144 and 300, using prime factorization. | 2 |
| 2822 | Find Greatest Common Divisor of 4409 and 519, using prime factorization. | 2 |
| 2823 | Find Greatest Common Divisor of 459 and 663, using prime factorization. | 2 |
| 2824 | Find Greatest Common Divisor of 12, 8 and 6, using prime factorization. | 2 |
| 2825 | Find Greatest Common Divisor of 1999 and 1090909, using Euclidean algorithm. | 2 |
| 2826 | Find Greatest Common Divisor of 638 and 5002, using prime factorization. | 2 |
| 2827 | Find Greatest Common Divisor of 972 and 783, using Euclidean algorithm. | 2 |
| 2828 | Find Greatest Common Divisor of 48, 180 and 270, using Euclidean algorithm. | 2 |
| 2829 | Find Greatest Common Divisor of 2520 and 6300, using Euclidean algorithm. | 2 |
| 2830 | Find Greatest Common Divisor of 2516 and 1125, using prime factorization. | 2 |
| 2831 | Find Greatest Common Divisor of 2516 and 1125, using Euclidean algorithm. | 2 |
| 2832 | Find Greatest Common Divisor of 14860 and 4424, using Euclidean algorithm. | 2 |
| 2833 | Find Greatest Common Divisor of 84 and 68, using Euclidean algorithm. | 2 |
| 2834 | Find Greatest Common Divisor of 243 and 368, using prime factorization. | 2 |
| 2835 | Find Greatest Common Divisor of 512 and 384, using repeated division. | 2 |
| 2836 | Find Greatest Common Divisor of 6, 12 and 20, using prime factorization. | 2 |
| 2837 | Find Greatest Common Divisor of 3, 5, 7, 9 and 11, using Euclidean algorithm. | 2 |
| 2838 | Find Greatest Common Divisor of 3, 5, 7, 9 and 11, by listing out the factors. | 2 |
| 2839 | Find Greatest Common Divisor of 728. | 2 |
| 2840 | Find Greatest Common Divisor of 324, 756 and 480, using prime factorization. | 2 |
| 2841 | Find Greatest Common Divisor of 756, 324 and 540, using prime factorization. | 2 |
| 2842 | Find Greatest Common Divisor of 289 and 248, using prime factorization. | 2 |
| 2843 | Find Greatest Common Divisor of 65 and 50, using prime factorization. | 2 |
| 2844 | Find Greatest Common Divisor of 26 and 118, using Euclidean algorithm. | 2 |
| 2845 | Find Greatest Common Divisor of 1024 and 486, using Euclidean algorithm. | 2 |
| 2846 | Find Greatest Common Divisor of 486 and 18, using Euclidean algorithm. | 2 |
| 2847 | Find Greatest Common Divisor of 52 and 21, using Euclidean algorithm. | 2 |
| 2848 | Find Greatest Common Divisor of 50, 75 and 120, using prime factorization. | 2 |
| 2849 | Find Greatest Common Divisor of 4 and 39, using Euclidean algorithm. | 2 |
| 2850 | Find Greatest Common Divisor of 49 and 156, using Euclidean algorithm. | 2 |