GCD

(the database of solved problems)

All the problems and solutions shown below were generated using the GCD Calculator.

Select category

ID	Problem	Count
6851	Find Greatest Common Divisor of 256 and 729, using Euclidean algorithm.	1
6852	Find Greatest Common Divisor of 1001 and 210, using Euclidean algorithm.	1
6853	Find Greatest Common Divisor of 512 and 625, using Euclidean algorithm.	1
6854	Find Greatest Common Divisor of 17, 19 and 23, using prime factorization.	1
6855	Find Greatest Common Divisor of 1003 and 456, using Euclidean algorithm.	1
6856	Find Greatest Common Divisor of 305 and 120, using Euclidean algorithm.	1
6857	Find Greatest Common Divisor of 989 and 1482, using prime factorization.	1
6858	Find Greatest Common Divisor of 49 and 640, using prime factorization.	1
6859	Find Greatest Common Divisor of 100 and 35, using prime factorization.	1
6860	Find Greatest Common Divisor of 4635 and 8051, using Euclidean algorithm.	1
6861	Find Greatest Common Divisor of 43 and 22, using prime factorization.	1
6862	Find Greatest Common Divisor of 33 and 36, using prime factorization.	1
6863	Find Greatest Common Divisor of 21 and 39, using prime factorization.	1
6864	Find Greatest Common Divisor of 13 and 63, using prime factorization.	1
6865	Find Greatest Common Divisor of 50 and 23, using prime factorization.	1
6866	Find Greatest Common Divisor of 50 and 23, using repeated division.	1
6867	Find Greatest Common Divisor of 50 and 23, by listing out the factors.	1
6868	Find Greatest Common Divisor of 28 and 48, using Euclidean algorithm.	1
6869	Find Greatest Common Divisor of 36 and 60, using Euclidean algorithm.	1
6870	Find Greatest Common Divisor of 35 and 70, using prime factorization.	1
6871	Find Greatest Common Divisor of 6588 and 90, using prime factorization.	1
6872	Find Greatest Common Divisor of 32.	1
6873	Find Greatest Common Divisor of 813.	1
6874		1
6875	Find Greatest Common Divisor of 210 and 243, using prime factorization.	1
6876	Find Greatest Common Divisor of 728 and 78, using prime factorization.	1
6877	Find Greatest Common Divisor of 84 and 120, using prime factorization.	1
6878	Find Greatest Common Divisor of 24 and 13, using Euclidean algorithm.	1
6879	Find Greatest Common Divisor of 4321 and 1234, using Euclidean algorithm.	1
6880	Find Greatest Common Divisor of 54 and 90, using prime factorization.	1
6881	Find Greatest Common Divisor of 1955 and 2025, using Euclidean algorithm.	1
6882	Find Greatest Common Divisor of 602 and 1505, using prime factorization.	1
6883	Find Greatest Common Divisor of 26.	1
6884	Find Greatest Common Divisor of 56.	1
6885	Find Greatest Common Divisor of 1296 and 384, using prime factorization.	1
6886	Find Greatest Common Divisor of 1296 and 384, using Euclidean algorithm.	1
6887	Find Greatest Common Divisor of 136 and 170, using Euclidean algorithm.	1
6888	Find Greatest Common Divisor of 900 and 270, using prime factorization.	1
6889	Find Greatest Common Divisor of 441, 567 and 693, using prime factorization.	1
6890	Find Greatest Common Divisor of 136, 170 and 255, using prime factorization.	1
6891	Find Greatest Common Divisor of 900 and 27, using prime factorization.	1
6892	Find Greatest Common Divisor of 11033442 and 1102246, using Euclidean algorithm.	1
6893	Find Greatest Common Divisor of 513 and 99, using prime factorization.	1
6894	Find Greatest Common Divisor of 84 and 338, using prime factorization.	1
6895	Find Greatest Common Divisor of 1 and 0, using repeated division.	1
6896	Find Greatest Common Divisor of 9 and 8, using Euclidean algorithm.	1
6897	Find Greatest Common Divisor of 5 and 5, using Euclidean algorithm.	1
6898	Find Greatest Common Divisor of 2 and 47, using Euclidean algorithm.	1
6899	Find Greatest Common Divisor of 5 and 1, using Euclidean algorithm.	1
6900	Find Greatest Common Divisor of 10 and 16, using Euclidean algorithm.	1