GCD

(the database of solved problems)

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

Select category

ID	Problem	Count
7451	Find Greatest Common Divisor of 39 and 81, using Euclidean algorithm.	1
7452	Find Greatest Common Divisor of 54 and 98, using Euclidean algorithm.	1
7453	Find Greatest Common Divisor of 81 and 80, using Euclidean algorithm.	1
7454	Find Greatest Common Divisor of 63 and 90, using Euclidean algorithm.	1
7455	Find Greatest Common Divisor of 3, 3 and 3, using prime factorization.	1
7456	Find Greatest Common Divisor of 297804 and 5, using Euclidean algorithm.	1
7457	Find Greatest Common Divisor of 125 and 52, using prime factorization.	1
7458	Find Greatest Common Divisor of 151 and 352, using Euclidean algorithm.	1
7459	Find Greatest Common Divisor of 7 and 352, using Euclidean algorithm.	1
7460	Find Greatest Common Divisor of 2364 and 78, using Euclidean algorithm.	1
7461	Find Greatest Common Divisor of 547 and 189, using Euclidean algorithm.	1
7462	Find Greatest Common Divisor of 999 and 19, using Euclidean algorithm.	1
7463	Find Greatest Common Divisor of 98 and 126, using Euclidean algorithm.	1
7464	Find Greatest Common Divisor of 15, 3, 10, 2, 15, 2, 2, 10 and 3, using prime factorization.	1
7465	Find Greatest Common Divisor of 1875 and 135, using prime factorization.	1
7466	Find Greatest Common Divisor of 1875 and 135, using Euclidean algorithm.	1
7467	Find Greatest Common Divisor of 14 and 77, using prime factorization.	1
7468	Find Greatest Common Divisor of 1147 and 851, using Euclidean algorithm.	1
7469	Find Greatest Common Divisor of 296 and 259, using Euclidean algorithm.	1
7470	Find Greatest Common Divisor of 512 and 10900, using prime factorization.	1
7471	Find Greatest Common Divisor of 780, 477 and 140, using prime factorization.	1
7472	Find Greatest Common Divisor of 57888 and 57899, using Euclidean algorithm.	1
7473	Find Greatest Common Divisor of 140.	1
7474	Find Greatest Common Divisor of 112 and 60, using prime factorization.	1
7475	Find Greatest Common Divisor of 280 and 60, using prime factorization.	1
7476	Find Greatest Common Divisor of 280 and 36, using prime factorization.	1
7477	Find Greatest Common Divisor of 432 and 343, using prime factorization.	1
7478	Find Greatest Common Divisor of 753951 and 159753, using prime factorization.	1
7479	Find Greatest Common Divisor of 18, 20 and 28, using prime factorization.	1
7480	Find Greatest Common Divisor of 30 and 60, using repeated division.	1
7481	Find Greatest Common Divisor of 24 and 146, using repeated division.	1
7482	Find Greatest Common Divisor of 24 and 146, using Euclidean algorithm.	1
7483	Find Greatest Common Divisor of 125 and 45, using Euclidean algorithm.	1
7484	Find Greatest Common Divisor of 45 and 125, using Euclidean algorithm.	1
7485	Find Greatest Common Divisor of 17 and 3220, using repeated division.	1
7486	Find Greatest Common Divisor of 17 and 3220, using prime factorization.	1
7487	Find Greatest Common Divisor of 78012 and 299, using prime factorization.	1
7488	Find Greatest Common Divisor of 3, 4, 4 and 15, using prime factorization.	1
7489	Find Greatest Common Divisor of 88, 9, 88, 2 and 7, using prime factorization.	1
7490	Find Greatest Common Divisor of 732 and 358, using Euclidean algorithm.	1
7491	Find Greatest Common Divisor of 816 and 1071, using prime factorization.	1
7492	Find Greatest Common Divisor of 200, 1000 and 3000, using prime factorization.	1
7493	Find Greatest Common Divisor of 200, 1000 and 3000, using repeated division.	1
7494	Find Greatest Common Divisor of 220 and 440, using repeated division.	1
7495	Find Greatest Common Divisor of 1764.	1
7496	Find Greatest Common Divisor of 300549.	1
7497	Find Greatest Common Divisor of 453, 827, 501 and 952, using prime factorization.	1
7498	Find Greatest Common Divisor of 91261 and 117035, using Euclidean algorithm.	1
7499	Find Greatest Common Divisor of 17 and 2668, using Euclidean algorithm.	1
7500	Find Greatest Common Divisor of 13 and 352, using Euclidean algorithm.	1