GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
7551	Find Greatest Common Divisor of 8 and 11, using Euclidean algorithm.	1
7552	Find Greatest Common Divisor of 899 and 1914, using Euclidean algorithm.	1
7553	Find Greatest Common Divisor of 1001 and 5, using prime factorization.	1
7554	Find Greatest Common Divisor of 1001 and 6, using prime factorization.	1
7555	Find Greatest Common Divisor of 1001 and 6, using Euclidean algorithm.	1
7556	Find Greatest Common Divisor of 39 and 149, using prime factorization.	1
7557	Find Greatest Common Divisor of 49 and 139, using repeated division.	1
7558	Find Greatest Common Divisor of 49 and 139, by listing out the factors.	1
7559	Find Greatest Common Divisor of 49 and 139, using Euclidean algorithm.	1
7560	Find Greatest Common Divisor of 76584 and 836, using Euclidean algorithm.	1
7561	Find Greatest Common Divisor of 765845 and 836, using Euclidean algorithm.	1
7562	Find Greatest Common Divisor of 56 and 78, using Euclidean algorithm.	1
7563	Find Greatest Common Divisor of 629 and 187, using Euclidean algorithm.	1
7564	Find Greatest Common Divisor of 19.	1
7565	Find Greatest Common Divisor of 750, 900 and 6, using repeated division.	1
7566	Find Greatest Common Divisor of 123 and 451, using Euclidean algorithm.	1
7567	Find Greatest Common Divisor of 294 and 343, using Euclidean algorithm.	1
7568	Find Greatest Common Divisor of 702 and 936, using Euclidean algorithm.	1
7569	Find Greatest Common Divisor of 972 and 1170, using Euclidean algorithm.	1
7570	Find Greatest Common Divisor of 3628802 and 39916808, using prime factorization.	1
7571	Find Greatest Common Divisor of 2863 and 1344, using prime factorization.	1
7572	Find Greatest Common Divisor of 880 and 21, using Euclidean algorithm.	1
7573	Find Greatest Common Divisor of 84.	1
7574	Find Greatest Common Divisor of 74021 and 552420, using prime factorization.	1
7575	Find Greatest Common Divisor of 1529 and 1039, using Euclidean algorithm.	1
7576	Find Greatest Common Divisor of 396 and 132, using prime factorization.	1
7577	Find Greatest Common Divisor of 1, 5 and 1, using prime factorization.	1
7578	Find Greatest Common Divisor of 1920 and 1080, using prime factorization.	1
7579	Find Greatest Common Divisor of 3840 and 2160, using prime factorization.	1
7580	Find Greatest Common Divisor of 52, 78 and 130, using prime factorization.	1
7581	Find Greatest Common Divisor of 118 and 117, using prime factorization.	1
7582	Find Greatest Common Divisor of 841 and 160, using prime factorization.	1
7583	Find Greatest Common Divisor of 841 and 160, using repeated division.	1
7584	Find Greatest Common Divisor of 336 and 445, using prime factorization.	1
7585	Find Greatest Common Divisor of 125 and 350, using prime factorization.	1
7586	Find Greatest Common Divisor of 477 and 990, using prime factorization.	1
7587	Find Greatest Common Divisor of 324000 and 48600, using Euclidean algorithm.	1
7588	Find Greatest Common Divisor of 40 and 20, using repeated division.	1
7589	Find Greatest Common Divisor of 384438501 and 3117761185, using prime factorization.	1
7590	Find Greatest Common Divisor of 1320 and 1872, using prime factorization.	1
7591	Find Greatest Common Divisor of 1 and 26, using prime factorization.	1
7592	Find Greatest Common Divisor of 77 and 43, using prime factorization.	1
7593	Find Greatest Common Divisor of 2, 3, 5 and 6, using prime factorization.	1
7594	Find Greatest Common Divisor of 54, 72, 72, 104 and 130, using prime factorization.	1
7595	Find Greatest Common Divisor of 662 and 710, by listing out the factors.	1
7596	Find Greatest Common Divisor of 141 and 19, using prime factorization.	1
7597	Find Greatest Common Divisor of 141 and 19, using Euclidean algorithm.	1
7598	Find Greatest Common Divisor of 30 and 42, using repeated division.	1
7599	Find Greatest Common Divisor of 750, 900 and 600, using prime factorization.	1
7600	Find Greatest Common Divisor of 2017 and 4001, using Euclidean algorithm.	1