GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
6501	Find Greatest Common Divisor of 2 and 3, using Euclidean algorithm.	1
6502	Find Greatest Common Divisor of 2 and 48, using Euclidean algorithm.	1
6503	Find Greatest Common Divisor of 2 and 17, using prime factorization.	1
6504	Find Greatest Common Divisor of 2 and 17, using Euclidean algorithm.	1
6505	Find Greatest Common Divisor of 144 and 233, using Euclidean algorithm.	1
6506	Find Greatest Common Divisor of 91 and 63, using Euclidean algorithm.	1
6507	Find Greatest Common Divisor of 91 and 63, using prime factorization.	1
6508	Find Greatest Common Divisor of 91 and 63, using repeated division.	1
6509	Find Greatest Common Divisor of 91 and 63, by listing out the factors.	1
6510	Find Greatest Common Divisor of 16 and 24, using repeated division.	1
6511	Find Greatest Common Divisor of 3036.	1
6512	Find Greatest Common Divisor of 32768 and 272, using Euclidean algorithm.	1
6513	Find Greatest Common Divisor of 900 and 201, using prime factorization.	1
6514	Find Greatest Common Divisor of 84 and 12, using prime factorization.	1
6515	Find Greatest Common Divisor of 360 and 420, using prime factorization.	1
6516	Find Greatest Common Divisor of 32 and 24, using prime factorization.	1
6517	Find Greatest Common Divisor of 675 and 99, using prime factorization.	1
6518	Find Greatest Common Divisor of 34496 and 1936, using prime factorization.	1
6519	Find Greatest Common Divisor of 999 and 998, using Euclidean algorithm.	1
6520	Find Greatest Common Divisor of 12075 and 4655, using repeated division.	1
6521	Find Greatest Common Divisor of 43336 and 332, using repeated division.	1
6522	Find Greatest Common Divisor of 14 and 17, using prime factorization.	1
6523	Find Greatest Common Divisor of 297 and 100, using Euclidean algorithm.	1
6524	Find Greatest Common Divisor of 735 and 225, using Euclidean algorithm.	1
6525	Find Greatest Common Divisor of 49 and 15, using prime factorization.	1
6526	Find Greatest Common Divisor of 42432 and 42334, using Euclidean algorithm.	1
6527	Find Greatest Common Divisor of 349 and 1758, using prime factorization.	1
6528	Find Greatest Common Divisor of 2587 and 4345, using prime factorization.	1
6529	Find Greatest Common Divisor of 756 and 2587, using prime factorization.	1
6530	Find Greatest Common Divisor of 13.	1
6531	Find Greatest Common Divisor of 234 and 156, using repeated division.	1
6532	Find Greatest Common Divisor of 960 and 9000, using prime factorization.	1
6533	Find Greatest Common Divisor of 72 and 333, using Euclidean algorithm.	1
6534	Find Greatest Common Divisor of 102 and 785, using Euclidean algorithm.	1
6535	Find Greatest Common Divisor of 96, 2, 11, 29, 39 and 49, using Euclidean algorithm.	1
6536	Find Greatest Common Divisor of 43 and 57, using Euclidean algorithm.	1
6537	Find Greatest Common Divisor of 7, 4 and 6, using prime factorization.	1
6538	Find Greatest Common Divisor of 480 and 512, using prime factorization.	1
6539	Find Greatest Common Divisor of 7 and 2, using prime factorization.	1
6540	Find Greatest Common Divisor of 40375 and 240000, using prime factorization.	1
6541	Find Greatest Common Divisor of 71250 and 240000, using prime factorization.	1
6542	Find Greatest Common Divisor of 111555 and 555111, using prime factorization.	1
6543	Find Greatest Common Divisor of 7 and 3, using prime factorization.	1
6544	Find Greatest Common Divisor of 12 and 697, using Euclidean algorithm.	1
6545	Find Greatest Common Divisor of 287 and 2009, using prime factorization.	1
6546	Find Greatest Common Divisor of 889 and 2009, using prime factorization.	1
6547	Find Greatest Common Divisor of 899 and 2009, using prime factorization.	1
6548	Find Greatest Common Divisor of 7469 and 2464, using repeated division.	1
6549	Find Greatest Common Divisor of 7469 and 2464, by listing out the factors.	1
6550	Find Greatest Common Divisor of 3234, 2541 and 6006, using prime factorization.	1