Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
integers
|
| gptkbp:field |
number theory
|
| gptkbp:generalizes |
gcd property of integers
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bézout's identity
|
| gptkbp:implies |
gcd(a, b) is the smallest positive integer expressible as ax + by
|
| gptkbp:namedAfter |
gptkb:Étienne_Bézout
|
| gptkbp:relatedTo |
greatest common divisor
linear Diophantine equation |
| gptkbp:state |
For any integers a and b, there exist integers x and y such that ax + by = gcd(a, b).
|
| gptkbp:usedIn |
gptkb:Euclidean_algorithm
|
| gptkbp:bfsParent |
gptkb:Euclidean_algorithm
gptkb:Euclidean_algorithm_for_GCD gptkb:Bézout's_theorem gptkb:Étienne_Bézout |
| gptkbp:bfsLayer |
6
|