GCD – Solved Problems Database
All the problems and solutions shown below were generated using the GCD Calculator.
ID |
Problem |
Count |
801 | Find Greatest Common Divisor of 99, 11 and 17, using prime factorization. | 2 |
802 | Find Greatest Common Divisor of 400. | 2 |
803 | Find Greatest Common Divisor of 5786423. | 2 |
804 | Find Greatest Common Divisor of 7 and 40, using prime factorization. | 2 |
805 | Find Greatest Common Divisor of 100, 150 and 200, using prime factorization. | 2 |
806 | Find Greatest Common Divisor of 216 and 324, using prime factorization. | 2 |
807 | Find Greatest Common Divisor of 400 and 600, using prime factorization. | 2 |
808 | Find Greatest Common Divisor of 1500 and 200, using prime factorization. | 2 |
809 | Find Greatest Common Divisor of 184 and 460, using prime factorization. | 2 |
810 | Find Greatest Common Divisor of 20 and 35, using prime factorization. | 2 |
811 | Find Greatest Common Divisor of 25, 30 and 40, using prime factorization. | 2 |
812 | Find Greatest Common Divisor of 400. | 2 |
813 | Find Greatest Common Divisor of 332 and 128, using Euclidean algorithm. | 2 |
814 | Find Greatest Common Divisor of 48 and 18, using Euclidean algorithm. | 2 |
815 | Find Greatest Common Divisor of 78 and 14, using Euclidean algorithm. | 2 |
816 | Find Greatest Common Divisor of 81 and 2, using Euclidean algorithm. | 2 |
817 | Find Greatest Common Divisor of 25, 30 and 40, using Euclidean algorithm. | 2 |
818 | Find Greatest Common Divisor of 1320 and 1065, using prime factorization. | 2 |
819 | Find Greatest Common Divisor of 34336550 and 120400, using Euclidean algorithm. | 2 |
820 | Find Greatest Common Divisor of 11 and 150, using prime factorization. | 2 |
821 | Find Greatest Common Divisor of 7 and 1680, using prime factorization. | 2 |
822 | Find Greatest Common Divisor of 34 and 56, using Euclidean algorithm. | 2 |
823 | Find Greatest Common Divisor of 40, 30, 23, 16, 4 and 20, by listing out the factors. | 2 |
824 | Find Greatest Common Divisor of 16, 32 and 94, using prime factorization. | 2 |
825 | Find Greatest Common Divisor of 60 and 70, using prime factorization. | 2 |
826 | Find Greatest Common Divisor of 60800 and 60200, using repeated division. | 2 |
827 | Find Greatest Common Divisor of 4736 and 8, using prime factorization. | 2 |
828 | Find Greatest Common Divisor of 28 and 52, using prime factorization. | 2 |
829 | Find Greatest Common Divisor of 60800 and 60200, using Euclidean algorithm. | 2 |
830 | Find Greatest Common Divisor of 484 and 398, using prime factorization. | 2 |
831 | Find Greatest Common Divisor of 17 and 26, using prime factorization. | 2 |
832 | Find Greatest Common Divisor of 1547 and 1440, using prime factorization. | 2 |
833 | Find Greatest Common Divisor of 19, 37, 40, 63, 69 and 17, using prime factorization. | 2 |
834 | Find Greatest Common Divisor of 2613 and 2171, using prime factorization. | 2 |
835 | Find Greatest Common Divisor of 231 and 7757, using prime factorization. | 2 |
836 | Find Greatest Common Divisor of 200000001 and 200000003, using Euclidean algorithm. | 2 |
837 | Find Greatest Common Divisor of 73, 56 and 44, using prime factorization. | 2 |
838 | Find Greatest Common Divisor of 1, 746, 28 and 324, using prime factorization. | 2 |
839 | Find Greatest Common Divisor of 275 and 435, using prime factorization. | 2 |
840 | Find Greatest Common Divisor of 56 and 60, using Euclidean algorithm. | 2 |
841 | Find Greatest Common Divisor of 19, 37, 40, 63, 69 and 17, by listing out the factors. | 2 |
842 | Find Greatest Common Divisor of 7, 12 and 14, using prime factorization. | 2 |
843 | Find Greatest Common Divisor of 43. | 2 |
844 | Find Greatest Common Divisor of 862. | 2 |
845 | Find Greatest Common Divisor of 28 and 52, using repeated division. | 2 |
846 | Find Greatest Common Divisor of 7, 12 and 14, using repeated division. | 2 |
847 | Find Greatest Common Divisor of 2 and 62, using Euclidean algorithm. | 2 |
848 | Find Greatest Common Divisor of 471 and 9231, using Euclidean algorithm. | 2 |
849 | Find Greatest Common Divisor of 321 and 100, using prime factorization. | 2 |
850 | Find Greatest Common Divisor of 56 and 60, using prime factorization. | 2 |