Concept information
Terme préférentiel
greatest common divisor
Définition
-
In mathematics, the greatest common divisor (GCD) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers x, y, the greatest common divisor of x and y is denoted gcd(x, y). For example, the GCD of 8 and 12 is 4, that is, gcd(8,12)=4.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Greatest_common_divisor)
Concept générique
Synonyme(s)
- GCD
Traductions
-
français
-
PGCD
URI
http://data.loterre.fr/ark:/67375/PSR-WZ1SBRL6-6
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}