Math 2.0

Number theory Divisibility and primes Concept

Greatest common divisor

Summary

The greatest common divisor of two integers is the largest integer that divides both of them. We write it as gcd⁡(a,b)\gcd(a, b). The definition of the greatest common divisor gives the precise form and the convention for gcd⁡(0,0)\gcd(0, 0).

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Greatest_common_divisor, lead section
About this page
Tag0C8WYW4KYQ
URIm2://0C8WYW4KYQ
Kindconcept
WritingW1 stated
MSC11A05
SpecializesGreatest common divisor in an integral domain
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions

Used by