NAVIGATION
Home
Research
Bookshelf
Garden
FIND ME ON
GitHub
LinkedIn
š±
The greatest common divisor for any two integers is the the largest positive integer that divides each of the two integers. Given a,bāZa,b\in\mathbb{Z}a,bāZ the greatest common divisor is expressed as gcd(a,b)=(a,b)gcd(a,b)=(a,b)gcd(a,b)=(a,b)
Euclidean Algorithm
Relatively Prime
Uniqueness of GCD
Aperiodic