Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:abbreviation
|
| gptkbp:alsoKnownAs |
greatest common factor
highest common factor |
| gptkbp:application |
cryptography
modular arithmetic simplifying fractions |
| gptkbp:defines |
The largest positive integer that divides two or more integers without leaving a remainder.
|
| gptkbp:field |
gptkb:mathematics
|
| gptkbp:notation |
gcd(a, b)
|
| gptkbp:property |
gcd(a, 0) = |a|
gcd(a, b) = gcd(b, a) gcd(a, b, c) = gcd(gcd(a, b), c) |
| gptkbp:relatedTo |
least common multiple
prime factorization coprime numbers |
| gptkbp:standsFor |
Greatest Common Divisor
|
| gptkbp:supportsAlgorithm |
gptkb:Euclidean_algorithm
|
| gptkbp:usedIn |
computer science
engineering number theory |
| gptkbp:bfsParent |
gptkb:Garden_City_(LIRR_station)
gptkb:Guidance_and_Control_Systems_Division gptkb:LCM |
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
GCD
|