GCD
(the database of solved problems)
All the problems and solutions shown below were generated using the GCD Calculator.
| ID |
Problem |
Count |
| 4701 | Find Greatest Common Divisor of 10 and 1, using prime factorization. | 2 |
| 4702 | Find Greatest Common Divisor of 10 and 7, using prime factorization. | 2 |
| 4703 | Find Greatest Common Divisor of 1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111 and 1111111111, using prime factorization. | 2 |
| 4704 | Find Greatest Common Divisor of 385 and 165, using prime factorization. | 2 |
| 4705 | Find Greatest Common Divisor of 55 and 96, using prime factorization. | 2 |
| 4706 | Find Greatest Common Divisor of 66 and 4, using prime factorization. | 2 |
| 4707 | Find Greatest Common Divisor of 1163 and 248, using prime factorization. | 2 |
| 4708 | Find Greatest Common Divisor of 42 and 210, using prime factorization. | 2 |
| 4709 | Find Greatest Common Divisor of 42 and 210, by listing out the factors. | 2 |
| 4710 | Find Greatest Common Divisor of 210 and 42, using repeated division. | 2 |
| 4711 | Find Greatest Common Divisor of 3568 and 1004, using Euclidean algorithm. | 2 |
| 4712 | Find Greatest Common Divisor of 17 and 9, using Euclidean algorithm. | 2 |
| 4713 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using repeated division. | 2 |
| 4714 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using prime factorization. | 2 |
| 4715 | Find Greatest Common Divisor of 0, 10001819279341198, 0, 1000438873696712, 0, 10001554452368218, 0, 10000032598894402, 0, 1000041606194469, 0 and 10002627353295188, using Euclidean algorithm. | 2 |
| 4716 | Find Greatest Common Divisor of 84 and 120, using Euclidean algorithm. | 2 |
| 4717 | Find Greatest Common Divisor of 84 and 25, using Euclidean algorithm. | 2 |
| 4718 | Find Greatest Common Divisor of 840, 500, 310 and 1000, using Euclidean algorithm. | 2 |
| 4719 | Find Greatest Common Divisor of 13 and 369, by listing out the factors. | 2 |
| 4720 | Find Greatest Common Divisor of 68 and 9, by listing out the factors. | 2 |
| 4721 | Find Greatest Common Divisor of 36 and 84, using prime factorization. | 2 |
| 4722 | Find Greatest Common Divisor of 36 and 84, using repeated division. | 2 |
| 4723 | Find Greatest Common Divisor of 143 and 187, using repeated division. | 2 |
| 4724 | Find Greatest Common Divisor of 56 and 96, using repeated division. | 2 |
| 4725 | Find Greatest Common Divisor of 144, 1008 and 432, using repeated division. | 2 |
| 4726 | Find Greatest Common Divisor of 838 and 17, using prime factorization. | 2 |
| 4727 | Find Greatest Common Divisor of 831 and 172, using prime factorization. | 2 |
| 4728 | Find Greatest Common Divisor of 831 and 172, using Euclidean algorithm. | 2 |
| 4729 | Find Greatest Common Divisor of 831 and 171, using Euclidean algorithm. | 2 |
| 4730 | Find Greatest Common Divisor of 750 and 46, using Euclidean algorithm. | 2 |
| 4731 | Find Greatest Common Divisor of 42 and 84, using repeated division. | 2 |
| 4732 | Find Greatest Common Divisor of 183 and 45, using Euclidean algorithm. | 2 |
| 4733 | Find Greatest Common Divisor of 183 and 35, using Euclidean algorithm. | 2 |
| 4734 | Find Greatest Common Divisor of 183 and 37, using Euclidean algorithm. | 2 |
| 4735 | Find Greatest Common Divisor of 183 and 64, using Euclidean algorithm. | 2 |
| 4736 | Find Greatest Common Divisor of 183 and 63, using Euclidean algorithm. | 2 |
| 4737 | Find Greatest Common Divisor of 183 and 61, using Euclidean algorithm. | 2 |
| 4738 | Find Greatest Common Divisor of 183 and 92, using Euclidean algorithm. | 2 |
| 4739 | Find Greatest Common Divisor of 183 and 27, using Euclidean algorithm. | 2 |
| 4740 | Find Greatest Common Divisor of 298 and 32, using Euclidean algorithm. | 2 |
| 4741 | Find Greatest Common Divisor of 298 and 73, using Euclidean algorithm. | 2 |
| 4742 | Find Greatest Common Divisor of 119 and 35, using Euclidean algorithm. | 2 |
| 4743 | Find Greatest Common Divisor of 109 and 61, using Euclidean algorithm. | 2 |
| 4744 | Find Greatest Common Divisor of 109 and 65, using Euclidean algorithm. | 2 |
| 4745 | Find Greatest Common Divisor of 109 and 78, using Euclidean algorithm. | 2 |
| 4746 | Find Greatest Common Divisor of 213 and 75, using Euclidean algorithm. | 2 |
| 4747 | Find Greatest Common Divisor of 213 and 74, using Euclidean algorithm. | 2 |
| 4748 | Find Greatest Common Divisor of 215 and 18, using Euclidean algorithm. | 2 |
| 4749 | Find Greatest Common Divisor of 215 and 78, using Euclidean algorithm. | 2 |
| 4750 | Find Greatest Common Divisor of 215 and 79, using Euclidean algorithm. | 2 |