NAVIGATION
Home
Research
Bookshelf
Garden
FIND ME ON
GitHub
LinkedIn
Email
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,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
Polynomials
Aperiodic