GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
4401	Find Greatest Common Divisor of 792 and 275, using prime factorization.	2
4402	Find Greatest Common Divisor of 39 and 2535, using prime factorization.	2
4403	Find Greatest Common Divisor of 54 and 888, using Euclidean algorithm.	2
4404	Find Greatest Common Divisor of 25 and 29, using prime factorization.	2
4405	Find Greatest Common Divisor of 5245 and 930, using prime factorization.	2
4406	Find Greatest Common Divisor of 4076 and 2076, using prime factorization.	2
4407	Find Greatest Common Divisor of 457 and 378, using prime factorization.	2
4408	Find Greatest Common Divisor of 780 and 224, using repeated division.	2
4409	Find Greatest Common Divisor of 25, 30 and 40, using Euclidean algorithm.	2
4410	Find Greatest Common Divisor of 26513 and 32321, using Euclidean algorithm.	2
4411	Find Greatest Common Divisor of 415 and 142, using Euclidean algorithm.	2
4412	Find Greatest Common Divisor of 471 and 562, using Euclidean algorithm.	2
4413	Find Greatest Common Divisor of 295 and 504, using Euclidean algorithm.	2
4414	Find Greatest Common Divisor of 387 and 129, using Euclidean algorithm.	2
4415	Find Greatest Common Divisor of 359 and 125, using prime factorization.	2
4416	Find Greatest Common Divisor of 1320 and 1065, using prime factorization.	2
4417	Find Greatest Common Divisor of 24 and 15, using Euclidean algorithm.	2
4418	Find Greatest Common Divisor of 17 and 11, using prime factorization.	2
4419	Find Greatest Common Divisor of 147 and 288, using prime factorization.	2
4420	Find Greatest Common Divisor of 147 and 288, using repeated division.	2
4421	Find Greatest Common Divisor of 689 and 489, using prime factorization.	2
4422	Find Greatest Common Divisor of 249 and 147, using prime factorization.	2
4423	Find Greatest Common Divisor of 39 and 162, using prime factorization.	2
4424	Find Greatest Common Divisor of 39 and 162, using Euclidean algorithm.	2
4425	Find Greatest Common Divisor of 6120 and 3000, using Euclidean algorithm.	2
4426	Find Greatest Common Divisor of 725 and 236, using Euclidean algorithm.	2
4427	Find Greatest Common Divisor of 3578 and 9512, using repeated division.	2
4428	Find Greatest Common Divisor of 366 and 36, using prime factorization.	2
4429	Find Greatest Common Divisor of 366 and 36, using Euclidean algorithm.	2
4430	Find Greatest Common Divisor of 100 and 321, using prime factorization.	2
4431	Find Greatest Common Divisor of 27 and 100, using prime factorization.	2
4432	Find Greatest Common Divisor of 1007 and 97000000, using prime factorization.	2
4433	Find Greatest Common Divisor of 5140998993 and 97000000, using prime factorization.	2
4434	Find Greatest Common Divisor of 70 and 120, using prime factorization.	2
4435	Find Greatest Common Divisor of 70 and 120, using repeated division.	2
4436	Find Greatest Common Divisor of 168 and 504, using repeated division.	2
4437	Find Greatest Common Divisor of 180 and 600, using Euclidean algorithm.	2
4438	Find Greatest Common Divisor of 60 and 84, using Euclidean algorithm.	2
4439	Find Greatest Common Divisor of 234 and 470, using Euclidean algorithm.	2
4440	Find Greatest Common Divisor of 84 and 180, using Euclidean algorithm.	2
4441	Find Greatest Common Divisor of 64 and 160, using Euclidean algorithm.	2
4442	Find Greatest Common Divisor of 308 and 504, using Euclidean algorithm.	2
4443	Find Greatest Common Divisor of 1890 and 45, using Euclidean algorithm.	2
4444	Find Greatest Common Divisor of 1890 and 450, using Euclidean algorithm.	2
4445	Find Greatest Common Divisor of 696 and 432, using Euclidean algorithm.	2
4446	Find Greatest Common Divisor of 105 and 231, using Euclidean algorithm.	2
4447	Find Greatest Common Divisor of 273 and 595, using Euclidean algorithm.	2
4448	Find Greatest Common Divisor of 18 and 50, using prime factorization.	2
4449	Find Greatest Common Divisor of 93 and 22, using prime factorization.	2
4450	Find Greatest Common Divisor of 39 and 22, using prime factorization.	2