Difference between revisions of "GCD Command"
From GeoGebra Manual
Line 12: | Line 12: | ||
;GCD[ <Number , Number> ] | ;GCD[ <Number , Number> ] | ||
:Calculates the greatest common divisor of the two numbers . | :Calculates the greatest common divisor of the two numbers . | ||
+ | :{{example| 1=<div><code><nowiki>GCD[12, 15]</nowiki></code> yields ''3''.</div>}} | ||
;GCD[ <List of Numbers> ] | ;GCD[ <List of Numbers> ] | ||
:Calculates the greatest common divisor of the list of numbers. | :Calculates the greatest common divisor of the list of numbers. | ||
+ | :{{example| 1=<div><code><nowiki>GCD[{12, 30, 18}]</nowiki></code> yields ''6''.</div>}} | ||
;GCD[ <Polynomial>, <Polynomial> ] | ;GCD[ <Polynomial>, <Polynomial> ] | ||
:Calculates the greatest common divisor of the two polynomials. | :Calculates the greatest common divisor of the two polynomials. |
Revision as of 16:54, 18 August 2011
This command differs among variants of English:
|
- GCD[Number a, Number b]
- Calculates the greatest common divisor of numbers a and b.
- 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³ - 4x² - 3x + 18}]
yields x + 2.