Difference between revisions of "GCD Command"
From GeoGebra Manual
m (Text replace - "<div class="box info"> 48px|left This page is part of the official manual for print and pdf. For structural reasons normal users can't edit this page. If you found any errors on this page please contact ) |
Kimeswenger (talk | contribs) |
||
Line 3: | Line 3: | ||
{{Alternate Language|region=US|page_type=Command|US_version=GCD|non-US_version=HCF}} | {{Alternate Language|region=US|page_type=Command|US_version=GCD|non-US_version=HCF}} | ||
− | ;GCD[ <Number | + | ;GCD[ <Number>, <Number> ] |
− | :Calculates the greatest common divisor of numbers | + | :Calculates the greatest common divisor of the two numbers . |
:{{example| 1=<div><code><nowiki>GCD[12, 15]</nowiki></code> yields ''3''.</div>}} | :{{example| 1=<div><code><nowiki>GCD[12, 15]</nowiki></code> yields ''3''.</div>}} | ||
;GCD[ <List of Numbers> ] | ;GCD[ <List of Numbers> ] |
Revision as of 14:08, 15 March 2013
This command differs among variants of English:
|
- GCD[ <Number>, <Number> ]
- Calculates the greatest common divisor of the two numbers .
- Example:
GCD[12, 15]
yields 3.
- GCD[ <List of Numbers> ]
- Calculates the greatest common divisor of the list of numbers.
- Example:
GCD[{12, 30, 18}]
yields 6.
CAS Syntax
- GCD[ <Number> , <Number> ]
- Calculates the greatest common divisor of the two numbers .
- Example:
GCD[12, 15]
yields 3.
- GCD[ <List of Numbers> ]
- Calculates the greatest common divisor of the list of numbers.
- Example:
GCD[{12, 30, 18}]
yields 6.
- GCD[ <Polynomial>, <Polynomial> ]
- Calculates the greatest common divisor of the two polynomials.
- Example:
GCD[x^2 + 4 x + 4, x^2 - x - 6]
yields x + 2.
- GCD[ <List of Polynomials> ]
- Calculates the greatest common divisor of the list of polynomials.
- Example:
GCD[{x^2 + 4 x + 4, x^2 - x - 6, x^3 - 4 x^2 - 3 x + 18}]
yields x + 2.