GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
701 | Find Greatest Common Divisor of 0, 132 and 763, using prime factorization. | 2 |
702 | Find Greatest Common Divisor of 87, 11 and 31, using prime factorization. | 2 |
703 | Find Greatest Common Divisor of 120 and 122, using prime factorization. | 2 |
704 | Find Greatest Common Divisor of 75 and 100, using repeated division. | 2 |
705 | Find Greatest Common Divisor of 220 and 400, using prime factorization. | 2 |
706 | Find Greatest Common Divisor of 561 and 84, using Euclidean algorithm. | 2 |
707 | Find Greatest Common Divisor of 500 and 189, using prime factorization. | 2 |
708 | Find Greatest Common Divisor of 196 and 340, using Euclidean algorithm. | 2 |
709 | Find Greatest Common Divisor of 31 and 31, using Euclidean algorithm. | 2 |
710 | Find Greatest Common Divisor of 16, 38, 16 and 38, using prime factorization. | 2 |
711 | Find Greatest Common Divisor of 588 and 90, using prime factorization. | 2 |
712 | Find Greatest Common Divisor of 19, 52 and 47, using prime factorization. | 2 |
713 | Find Greatest Common Divisor of 1299 and 1599, using Euclidean algorithm. | 2 |
714 | Find Greatest Common Divisor of 120 and 144, using prime factorization. | 2 |
715 | Find Greatest Common Divisor of 36 and 104, using prime factorization. | 2 |
716 | Find Greatest Common Divisor of 12, 14, 34, 41, 47 and 34, using prime factorization. | 2 |
717 | Find Greatest Common Divisor of 20 and 45, using prime factorization. | 2 |
718 | Find Greatest Common Divisor of 588 and 90, using repeated division. | 2 |
719 | Find Greatest Common Divisor of 196 and 249, using Euclidean algorithm. | 2 |
720 | Find Greatest Common Divisor of 10, 47 and 24, using prime factorization. | 2 |
721 | Find Greatest Common Divisor of 48 and 5, using prime factorization. | 2 |
722 | Find Greatest Common Divisor of 196 and 250, using Euclidean algorithm. | 2 |
723 | Find Greatest Common Divisor of 14, 49 and 7, using prime factorization. | 2 |
724 | Find Greatest Common Divisor of 23, 23 and 32, using prime factorization. | 2 |
725 | Find Greatest Common Divisor of 72, 108 and 2100, using prime factorization. | 2 |
726 | Find Greatest Common Divisor of 1, 28, 26, 8, 1, 79, 3, 52, 1 and 44, using prime factorization. | 2 |
727 | Find Greatest Common Divisor of 941688 and 133980, using prime factorization. | 2 |
728 | Find Greatest Common Divisor of 48 and 5, using Euclidean algorithm. | 2 |
729 | Find Greatest Common Divisor of 196 and 262, using Euclidean algorithm. | 2 |
730 | Find Greatest Common Divisor of 92, 32 and 68, using prime factorization. | 2 |
731 | Find Greatest Common Divisor of 225 and 135, using prime factorization. | 2 |
732 | Find Greatest Common Divisor of 28 and 5, using Euclidean algorithm. | 2 |
733 | Find Greatest Common Divisor of 941688 and 133980, using Euclidean algorithm. | 2 |
734 | Find Greatest Common Divisor of 65537 and 296208, using prime factorization. | 2 |
735 | Find Greatest Common Divisor of 99 and 81, using prime factorization. | 2 |
736 | Find Greatest Common Divisor of 210 and 23, using prime factorization. | 2 |
737 | Find Greatest Common Divisor of 32 and 108, using prime factorization. | 2 |
738 | Find Greatest Common Divisor of 4, 27 and 50, using prime factorization. | 2 |
739 | Find Greatest Common Divisor of 3289 and 2415, using Euclidean algorithm. | 2 |
740 | Find Greatest Common Divisor of 44 and 22, using Euclidean algorithm. | 2 |
741 | Find Greatest Common Divisor of 1, 4, 8, 6, 9, 4, 5, 25, 5 and 7, using prime factorization. | 2 |
742 | Find Greatest Common Divisor of 40 and 125, using prime factorization. | 2 |
743 | Find Greatest Common Divisor of 85 and 901, using prime factorization. | 2 |
744 | Find Greatest Common Divisor of 1333 and 455, using prime factorization. | 2 |
745 | Find Greatest Common Divisor of 210, 230, 250 and 270, using prime factorization. | 2 |
746 | Find Greatest Common Divisor of 96 and 46, using Euclidean algorithm. | 2 |
747 | Find Greatest Common Divisor of 5 and 92, using prime factorization. | 2 |
748 | Find Greatest Common Divisor of 34 and 14, using prime factorization. | 2 |
749 | Find Greatest Common Divisor of 1147 and 899, using Euclidean algorithm. | 2 |
750 | Find Greatest Common Divisor of 560, 224 and 336, using prime factorization. | 2 |