GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
3001	Find Greatest Common Divisor of 120 and 88, using prime factorization.	2
3002	Find Greatest Common Divisor of 314 and 520, using prime factorization.	2
3003	Find Greatest Common Divisor of 315 and 55, using prime factorization.	2
3004	Find Greatest Common Divisor of 2437 and 653, using Euclidean algorithm.	2
3005	Find Greatest Common Divisor of 1024 and 18, using repeated division.	2
3006	Find Greatest Common Divisor of 1024 and 18, using Euclidean algorithm.	2
3007	Find Greatest Common Divisor of 8, 5 and 7, using prime factorization.	2
3008	Find Greatest Common Divisor of 10 and 1000, by listing out the factors.	2
3009	Find Greatest Common Divisor of 525, 619 and 1766, using prime factorization.	2
3010	Find Greatest Common Divisor of 8071 and 4655, using Euclidean algorithm.	2
3011	Find Greatest Common Divisor of 3 and 7, by listing out the factors.	2
3012	Find Greatest Common Divisor of 35 and 11, using Euclidean algorithm.	2
3013	Find Greatest Common Divisor of 19 and 192, using Euclidean algorithm.	2
3014	Find Greatest Common Divisor of 2584 and 377, using prime factorization.	2
3015	Find Greatest Common Divisor of 625 and 9, using prime factorization.	2
3016	Find Greatest Common Divisor of 352 and 31, using Euclidean algorithm.	2
3017	Find Greatest Common Divisor of 255, 165 and 195, using prime factorization.	2
3018	Find Greatest Common Divisor of 39840, 5439 and 5440, using prime factorization.	2
3019	Find Greatest Common Divisor of 14560 and 8250, using Euclidean algorithm.	2
3020	Find Greatest Common Divisor of 14973 and 4746, using Euclidean algorithm.	2
3021	Find Greatest Common Divisor of 368 and 437, using prime factorization.	2
3022	Find Greatest Common Divisor of 482 and 142, using repeated division.	2
3023	Find Greatest Common Divisor of 13572 and 4147, using Euclidean algorithm.	2
3024	Find Greatest Common Divisor of 123 and 456, using prime factorization.	2
3025	Find Greatest Common Divisor of 10, 13, 16 and 19, using prime factorization.	2
3026	Find Greatest Common Divisor of 11 and 15984, using prime factorization.	2
3027	Find Greatest Common Divisor of 117 and 189, using Euclidean algorithm.	2
3028	Find Greatest Common Divisor of 40 and 1, by listing out the factors.	2
3029	Find Greatest Common Divisor of 4999 and 1109, using repeated division.	2
3030	Find Greatest Common Divisor of 3 and 28, using prime factorization.	2
3031	Find Greatest Common Divisor of 32 and 48, using prime factorization.	2
3032	Find Greatest Common Divisor of 578 and 489, using prime factorization.	2
3033	Find Greatest Common Divisor of 578 and 489, using Euclidean algorithm.	2
3034	Find Greatest Common Divisor of 8 and 6, using Euclidean algorithm.	2
3035	Find Greatest Common Divisor of 5 and 6, using Euclidean algorithm.	2
3036	Find Greatest Common Divisor of 70 and 52, using Euclidean algorithm.	2
3037	Find Greatest Common Divisor of 48 and 72, using Euclidean algorithm.	2
3038	Find Greatest Common Divisor of 48 and 64, by listing out the factors.	2
3039	Find Greatest Common Divisor of 360 and 420, using Euclidean algorithm.	2
3040	Find Greatest Common Divisor of 864 and 924, using prime factorization.	2
3041	Find Greatest Common Divisor of 165375 and 900, using prime factorization.	2
3042	Find Greatest Common Divisor of 27 and 35, using Euclidean algorithm.	2
3043	Find Greatest Common Divisor of 1, 34, 1 and 74, using prime factorization.	2
3044	Find Greatest Common Divisor of 43336 and 332, using Euclidean algorithm.	2
3045	Find Greatest Common Divisor of 49 and 15, using Euclidean algorithm.	2
3046	Find Greatest Common Divisor of 1758 and 4345, using prime factorization.	2
3047	Find Greatest Common Divisor of 349 and 4345, using prime factorization.	2
3048	Find Greatest Common Divisor of 3584 and 798, using Euclidean algorithm.	2
3049	Find Greatest Common Divisor of 5 and 286, using prime factorization.	2
3050	Find Greatest Common Divisor of 57 and 60, using Euclidean algorithm.	2