Difference between revisions of "GCD Command"
From GeoGebra Manual
Noel Lambert (talk | contribs) |
m |
||
| Line 8: | Line 8: | ||
: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>}} | :{{example| 1=<div><code><nowiki>GCD[{12, 30, 18}]</nowiki></code> yields ''6''.</div>}} | ||
| − | + | ||
| − | + | {{hint|In the [[File:Menu view cas.svg|link=|16px]] [[CAS View]] you can also use the following syntax:}} | |
| − | |||
| − | |||
| − | |||
| − | : | ||
| − | |||
;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 11:37, 9 September 2015
 |
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.
Hint: In the 
CAS View you can also use the following syntax:- 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.
