Math 2.0

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).

What this node 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)
  • edge specializes both: the more general notions and the special cases (0 of 1)

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

Sources

  1. Web https://en.wikipedia.org/wiki/Greatest_common_divisor, lead section

What links here

Definitions