GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
6201	Find Greatest Common Divisor of 1870 and 460, using Euclidean algorithm.	1
6202	Find Greatest Common Divisor of 1874 and 460, using Euclidean algorithm.	1
6203	Find Greatest Common Divisor of 1203 and 460, using Euclidean algorithm.	1
6204	Find Greatest Common Divisor of 4121 and 460, using Euclidean algorithm.	1
6205	Find Greatest Common Divisor of 3921 and 460, using Euclidean algorithm.	1
6206	Find Greatest Common Divisor of 2921 and 460, using Euclidean algorithm.	1
6207	Find Greatest Common Divisor of 290 and 609, using prime factorization.	1
6208	Find Greatest Common Divisor of 17 and 26892, using prime factorization.	1
6209	Find Greatest Common Divisor of 742 and 836, using prime factorization.	1
6210	Find Greatest Common Divisor of 35 and 78, using Euclidean algorithm.	1
6211	Find Greatest Common Divisor of 21 and 64, using prime factorization.	1
6212	Find Greatest Common Divisor of 31 and 55, using prime factorization.	1
6213	Find Greatest Common Divisor of 2020 and 3201, using Euclidean algorithm.	1
6214	Find Greatest Common Divisor of 662.	1
6215	Find Greatest Common Divisor of 414.	1
6216	Find Greatest Common Divisor of 2 and 7, using prime factorization.	1
6217	Find Greatest Common Divisor of 13 and 78, using prime factorization.	1
6218	Find Greatest Common Divisor of 124523 and 526387932, using prime factorization.	1
6219	Find Greatest Common Divisor of 253704 and 22909068, using prime factorization.	1
6220	Find Greatest Common Divisor of 6850008 and 22909068, using prime factorization.	1
6221	Find Greatest Common Divisor of 0, 0 and 5, using prime factorization.	1
6222	Find Greatest Common Divisor of 1993.	1
6223	Find Greatest Common Divisor of 620 and 520, using prime factorization.	1
6224	Find Greatest Common Divisor of 640 and 49, using prime factorization.	1
6225	Find Greatest Common Divisor of 612 and 429, using prime factorization.	1
6226	Find Greatest Common Divisor of 612 and 429, using Euclidean algorithm.	1
6227	Find Greatest Common Divisor of 71 and 9, using repeated division.	1
6228	Find Greatest Common Divisor of 71 and 9, using prime factorization.	1
6229	Find Greatest Common Divisor of 123456789012345678 and 987654321098765432, using Euclidean algorithm.	1
6230	Find Greatest Common Divisor of 0 and 5713, using Euclidean algorithm.	1
6231	Find Greatest Common Divisor of 24 and 213, using prime factorization.	1
6232	Find Greatest Common Divisor of 2343452, 456 and 31, using repeated division.	1
6233	Find Greatest Common Divisor of 250 and 210, using prime factorization.	1
6234	Find Greatest Common Divisor of 710 and 310, using repeated division.	1
6235	Find Greatest Common Divisor of 270 and 172, using Euclidean algorithm.	1
6236	Find Greatest Common Divisor of 500 and 193, using Euclidean algorithm.	1
6237	Find Greatest Common Divisor of 8 and 144, using Euclidean algorithm.	1
6238	Find Greatest Common Divisor of 4246, 4120, 4142 and 4194, using Euclidean algorithm.	1
6239	Find Greatest Common Divisor of 4246, 4120, 4142 and 4194, using repeated division.	1
6240	Find Greatest Common Divisor of 100000 and 45000, using prime factorization.	1
6241	Find Greatest Common Divisor of 484 and 720, using prime factorization.	1
6242	Find Greatest Common Divisor of 198 and 72, using Euclidean algorithm.	1
6243	Find Greatest Common Divisor of 67 and 119, using Euclidean algorithm.	1
6244	Find Greatest Common Divisor of 34 and 24, using prime factorization.	1
6245	Find Greatest Common Divisor of 14 and 14, using prime factorization.	1
6246	Find Greatest Common Divisor of 1344, 1856 and 2752, using repeated division.	1
6247	Find Greatest Common Divisor of 1344, 1856 and 2752, using prime factorization.	1
6248	Find Greatest Common Divisor of 33 and 72, using prime factorization.	1
6249	Find Greatest Common Divisor of 33 and 72, using Euclidean algorithm.	1
6250	Find Greatest Common Divisor of 33 and 72, by listing out the factors.	1