Greatest Common Divisor

Definition (Greatest common divisor)

The greatest common divisor for any two integers is the the largest positive integer that divides each of the two integers. Given a,bZa,b\in\mathbb{Z} the greatest common divisor is expressed as gcd(a,b)=(a,b)gcd(a,b)=(a,b)

Linked from