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 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111 and 1111111111, using prime factorization. | 2 |
| 2802 | Find Greatest Common Divisor of 385 and 165, using prime factorization. | 2 |
| 2803 | Find Greatest Common Divisor of 55 and 96, using prime factorization. | 2 |
| 2804 | Find Greatest Common Divisor of 66 and 4, using prime factorization. | 2 |
| 2805 | Find Greatest Common Divisor of 1163 and 248, using prime factorization. | 2 |
| 2806 | Find Greatest Common Divisor of 42 and 210, using prime factorization. | 2 |
| 2807 | Find Greatest Common Divisor of 42 and 210, by listing out the factors. | 2 |
| 2808 | Find Greatest Common Divisor of 210 and 42, using repeated division. | 2 |
| 2809 | Find Greatest Common Divisor of 3568 and 1004, using Euclidean algorithm. | 2 |
| 2810 | Find Greatest Common Divisor of 17 and 9, using Euclidean algorithm. | 2 |
| 2811 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using repeated division. | 2 |
| 2812 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using prime factorization. | 2 |
| 2813 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using Euclidean algorithm. | 2 |
| 2814 | Find Greatest Common Divisor of 84 and 120, using Euclidean algorithm. | 2 |
| 2815 | Find Greatest Common Divisor of 84 and 25, using Euclidean algorithm. | 2 |
| 2816 | Find Greatest Common Divisor of 840, 500, 310 and 1000, using Euclidean algorithm. | 2 |
| 2817 | Find Greatest Common Divisor of 13 and 369, by listing out the factors. | 2 |
| 2818 | Find Greatest Common Divisor of 68 and 9, by listing out the factors. | 2 |
| 2819 | Find Greatest Common Divisor of 36 and 84, using prime factorization. | 2 |
| 2820 | Find Greatest Common Divisor of 36 and 84, using repeated division. | 2 |
| 2821 | Find Greatest Common Divisor of 143 and 187, using repeated division. | 2 |
| 2822 | Find Greatest Common Divisor of 56 and 96, using repeated division. | 2 |
| 2823 | Find Greatest Common Divisor of 144, 1008 and 432, using repeated division. | 2 |
| 2824 | Find Greatest Common Divisor of 838 and 17, using prime factorization. | 2 |
| 2825 | Find Greatest Common Divisor of 831 and 172, using prime factorization. | 2 |
| 2826 | Find Greatest Common Divisor of 831 and 172, using Euclidean algorithm. | 2 |
| 2827 | Find Greatest Common Divisor of 831 and 171, using Euclidean algorithm. | 2 |
| 2828 | Find Greatest Common Divisor of 750 and 46, using Euclidean algorithm. | 2 |
| 2829 | Find Greatest Common Divisor of 42 and 84, using repeated division. | 2 |
| 2830 | Find Greatest Common Divisor of 183 and 45, using Euclidean algorithm. | 2 |
| 2831 | Find Greatest Common Divisor of 183 and 35, using Euclidean algorithm. | 2 |
| 2832 | Find Greatest Common Divisor of 183 and 37, using Euclidean algorithm. | 2 |
| 2833 | Find Greatest Common Divisor of 183 and 64, using Euclidean algorithm. | 2 |
| 2834 | Find Greatest Common Divisor of 183 and 63, using Euclidean algorithm. | 2 |
| 2835 | Find Greatest Common Divisor of 183 and 61, using Euclidean algorithm. | 2 |
| 2836 | Find Greatest Common Divisor of 183 and 92, using Euclidean algorithm. | 2 |
| 2837 | Find Greatest Common Divisor of 183 and 27, using Euclidean algorithm. | 2 |
| 2838 | Find Greatest Common Divisor of 298 and 32, using Euclidean algorithm. | 2 |
| 2839 | Find Greatest Common Divisor of 298 and 73, using Euclidean algorithm. | 2 |
| 2840 | Find Greatest Common Divisor of 119 and 35, using Euclidean algorithm. | 2 |
| 2841 | Find Greatest Common Divisor of 109 and 61, using Euclidean algorithm. | 2 |
| 2842 | Find Greatest Common Divisor of 109 and 65, using Euclidean algorithm. | 2 |
| 2843 | Find Greatest Common Divisor of 109 and 78, using Euclidean algorithm. | 2 |
| 2844 | Find Greatest Common Divisor of 213 and 75, using Euclidean algorithm. | 2 |
| 2845 | Find Greatest Common Divisor of 213 and 74, using Euclidean algorithm. | 2 |
| 2846 | Find Greatest Common Divisor of 215 and 18, using Euclidean algorithm. | 2 |
| 2847 | Find Greatest Common Divisor of 215 and 78, using Euclidean algorithm. | 2 |
| 2848 | Find Greatest Common Divisor of 215 and 79, using Euclidean algorithm. | 2 |
| 2849 | Find Greatest Common Divisor of 215 and 89, using Euclidean algorithm. | 2 |
| 2850 | Find Greatest Common Divisor of 215 and 93, using Euclidean algorithm. | 2 |