GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3451	Find Greatest Common Divisor of 407 and 101, using Euclidean algorithm.	2
3452	Find Greatest Common Divisor of 407 and 1010, using Euclidean algorithm.	2
3453	Find Greatest Common Divisor of 1000 and 400, using prime factorization.	2
3454	Find Greatest Common Divisor of 1000 and 400, using Euclidean algorithm.	2
3455	Find Greatest Common Divisor of 1000 and 400, by listing out the factors.	2
3456	Find Greatest Common Divisor of 301, 981, 449 and 573, using prime factorization.	2
3457	Find Greatest Common Divisor of 12 and 16, using repeated division.	2
3458	Find Greatest Common Divisor of 45 and 95, using prime factorization.	2
3459	Find Greatest Common Divisor of 125 and 728, using repeated division.	2
3460	Find Greatest Common Divisor of 125 and 728, using Euclidean algorithm.	2
3461	Find Greatest Common Divisor of 216 and 68, using Euclidean algorithm.	2
3462	Find Greatest Common Divisor of 390 and 1261, using prime factorization.	2
3463	Find Greatest Common Divisor of 1 and 64, using prime factorization.	2
3464	Find Greatest Common Divisor of 267, 445 and 712, using prime factorization.	2
3465	Find Greatest Common Divisor of 356 and 140, using prime factorization.	2
3466	Find Greatest Common Divisor of 280 and 117, using Euclidean algorithm.	2
3467	Find Greatest Common Divisor of 10 and 11, using Euclidean algorithm.	2
3468	Find Greatest Common Divisor of 5871420 and 299, using prime factorization.	2
3469	Find Greatest Common Divisor of 330 and 1140, using prime factorization.	2
3470	Find Greatest Common Divisor of 2701 and 2737, using Euclidean algorithm.	2
3471	Find Greatest Common Divisor of 56, 94 and 128, using prime factorization.	2
3472	Find Greatest Common Divisor of 56, 92 and 124, using repeated division.	2
3473	Find Greatest Common Divisor of 750 and 960, using repeated division.	2
3474	Find Greatest Common Divisor of 152 and 276, using prime factorization.	2
3475	Find Greatest Common Divisor of 332 and 128, using Euclidean algorithm.	2
3476	Find Greatest Common Divisor of 49, 210 and 350, using prime factorization.	2
3477	Find Greatest Common Divisor of 24, 138, 24 and 138, using prime factorization.	2
3478	Find Greatest Common Divisor of 512 and 186, using prime factorization.	2
3479	Find Greatest Common Divisor of 296, 703 and 814, using prime factorization.	2
3480	Find Greatest Common Divisor of 296, 703 and 814, by listing out the factors.	2
3481	Find Greatest Common Divisor of 231 and 7757, using prime factorization.	2
3482	Find Greatest Common Divisor of 5880420 and 229, using Euclidean algorithm.	2
3483	Find Greatest Common Divisor of 103 and 91, using Euclidean algorithm.	2
3484	Find Greatest Common Divisor of 800 and 1025, using prime factorization.	2
3485	Find Greatest Common Divisor of 106 and 63, using prime factorization.	2
3486	Find Greatest Common Divisor of 4284 and 8219, using prime factorization.	2
3487	Find Greatest Common Divisor of 5786423.	2
3488	Find Greatest Common Divisor of 120.	2
3489	Find Greatest Common Divisor of 125 and 11, using prime factorization.	2
3490	Find Greatest Common Divisor of 125 and 11, using Euclidean algorithm.	2
3491	Find Greatest Common Divisor of 1632.	2
3492	Find Greatest Common Divisor of 93 and 42, using prime factorization.	2
3493	Find Greatest Common Divisor of 49 and 900, using prime factorization.	2
3494	Find Greatest Common Divisor of 123456 and 678, using Euclidean algorithm.	2
3495	Find Greatest Common Divisor of 951, 744, 516, 487, 808, 808, 676, 328, 940 and 470, using prime factorization.	2
3496	Find Greatest Common Divisor of 19 and 99, using prime factorization.	2
3497	Find Greatest Common Divisor of 912 and 1210, using prime factorization.	2
3498	Find Greatest Common Divisor of 1 and 1000, using prime factorization.	2
3499	Find Greatest Common Divisor of 2 and 1001, using prime factorization.	2
3500	Find Greatest Common Divisor of 2 and 1002, using prime factorization.	2