GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
6301	Find Greatest Common Divisor of 12, 5, 35 and 55, using prime factorization.	1
6302	Find Greatest Common Divisor of 97 and 126, using Euclidean algorithm.	1
6303	Find Greatest Common Divisor of 2 and 3, using Euclidean algorithm.	1
6304	Find Greatest Common Divisor of 2 and 48, using Euclidean algorithm.	1
6305	Find Greatest Common Divisor of 2 and 17, using prime factorization.	1
6306	Find Greatest Common Divisor of 2 and 17, using Euclidean algorithm.	1
6307	Find Greatest Common Divisor of 144 and 233, using Euclidean algorithm.	1
6308	Find Greatest Common Divisor of 91 and 63, using Euclidean algorithm.	1
6309	Find Greatest Common Divisor of 91 and 63, using prime factorization.	1
6310	Find Greatest Common Divisor of 91 and 63, using repeated division.	1
6311	Find Greatest Common Divisor of 91 and 63, by listing out the factors.	1
6312	Find Greatest Common Divisor of 16 and 24, using repeated division.	1
6313	Find Greatest Common Divisor of 3036.	1
6314	Find Greatest Common Divisor of 32768 and 272, using Euclidean algorithm.	1
6315	Find Greatest Common Divisor of 900 and 201, using prime factorization.	1
6316	Find Greatest Common Divisor of 84 and 12, using prime factorization.	1
6317	Find Greatest Common Divisor of 360 and 420, using prime factorization.	1
6318	Find Greatest Common Divisor of 675 and 99, using prime factorization.	1
6319	Find Greatest Common Divisor of 34496 and 1936, using prime factorization.	1
6320	Find Greatest Common Divisor of 999 and 998, using Euclidean algorithm.	1
6321	Find Greatest Common Divisor of 12075 and 4655, using repeated division.	1
6322	Find Greatest Common Divisor of 43336 and 332, using repeated division.	1
6323	Find Greatest Common Divisor of 14 and 17, using prime factorization.	1
6324	Find Greatest Common Divisor of 297 and 100, using Euclidean algorithm.	1
6325	Find Greatest Common Divisor of 735 and 225, using Euclidean algorithm.	1
6326	Find Greatest Common Divisor of 49 and 15, using prime factorization.	1
6327	Find Greatest Common Divisor of 42432 and 42334, using Euclidean algorithm.	1
6328	Find Greatest Common Divisor of 349 and 1758, using prime factorization.	1
6329	Find Greatest Common Divisor of 2587 and 4345, using prime factorization.	1
6330	Find Greatest Common Divisor of 756 and 2587, using prime factorization.	1
6331	Find Greatest Common Divisor of 13.	1
6332	Find Greatest Common Divisor of 234 and 156, using repeated division.	1
6333	Find Greatest Common Divisor of 960 and 9000, using prime factorization.	1
6334	Find Greatest Common Divisor of 72 and 333, using Euclidean algorithm.	1
6335	Find Greatest Common Divisor of 102 and 785, using Euclidean algorithm.	1
6336	Find Greatest Common Divisor of 96, 2, 11, 29, 39 and 49, using Euclidean algorithm.	1
6337	Find Greatest Common Divisor of 43 and 57, using Euclidean algorithm.	1
6338	Find Greatest Common Divisor of 7, 4 and 6, using prime factorization.	1
6339	Find Greatest Common Divisor of 480 and 512, using prime factorization.	1
6340	Find Greatest Common Divisor of 7 and 2, using prime factorization.	1
6341	Find Greatest Common Divisor of 40375 and 240000, using prime factorization.	1
6342	Find Greatest Common Divisor of 71250 and 240000, using prime factorization.	1
6343	Find Greatest Common Divisor of 111555 and 555111, using prime factorization.	1
6344	Find Greatest Common Divisor of 7 and 3, using prime factorization.	1
6345	Find Greatest Common Divisor of 12 and 697, using Euclidean algorithm.	1
6346	Find Greatest Common Divisor of 287 and 2009, using prime factorization.	1
6347	Find Greatest Common Divisor of 889 and 2009, using prime factorization.	1
6348	Find Greatest Common Divisor of 899 and 2009, using prime factorization.	1
6349	Find Greatest Common Divisor of 7469 and 2464, using repeated division.	1
6350	Find Greatest Common Divisor of 7469 and 2464, by listing out the factors.	1