The greatest common divisor of two integers is the largest positive integer dividing both.
What Is Greatest Common Divisor?
The greatest common divisor of two integers is the largest positive integer dividing both.
Examples of Greatest Common Divisor
1
gcd(18,24)=6.Formula and Key Points
Formula / rule
gcd(a,b)
- Know the definition and standard notation for Greatest Common Divisor.
- Be able to recognise or compute greatest common divisor in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in cryptography, hashing, coding theory, security protocols and efficient integer algorithms.
Related Math Terms
Greatest Common Divisor: Frequently Asked Questions
What is Greatest Common Divisor?
The greatest common divisor of two integers is the largest positive integer dividing both.
Why is Greatest Common Divisor useful in computer science?
Used in cryptography, hashing, coding theory, security protocols and efficient integer algorithms.