Difference between revisions of "GCD Command"
From GeoGebra Manual
m |
Noel Lambert (talk | contribs) |
||
| Line 5: | Line 5: | ||
: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>}} | :{{example| 1=<div><code><nowiki>GCD[12, 15]</nowiki></code> yields ''3''.</div>}} | ||
| − | ;GCD[ | + | ;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>}} | :{{example| 1=<div><code><nowiki>GCD[{12, 30, 18}]</nowiki></code> yields ''6''.</div>}} | ||
| Line 12: | Line 12: | ||
: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>}} | :{{example| 1=<div><code><nowiki>GCD[12, 15]</nowiki></code> yields ''3''.</div>}} | ||
| − | ;GCD[ | + | ;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>}} | :{{example| 1=<div><code><nowiki>GCD[{12, 30, 18}]</nowiki></code> yields ''6''.</div>}} | ||
| Line 18: | Line 18: | ||
:Calculates the greatest common divisor of the two polynomials. | :Calculates the greatest common divisor of the two polynomials. | ||
:{{example| 1=<div><code><nowiki>GCD[x^2 + 4 x + 4, x^2 - x - 6]</nowiki></code> yields ''x + 2''.</div>}} | :{{example| 1=<div><code><nowiki>GCD[x^2 + 4 x + 4, x^2 - x - 6]</nowiki></code> yields ''x + 2''.</div>}} | ||
| − | ;GCD[ | + | ;GCD[ <List of Polynomials> ] |
: Calculates the greatest common divisor of the list of polynomials. | : Calculates the greatest common divisor of the list of polynomials. | ||
:{{example| 1=<div><code><nowiki>GCD[{x^2 + 4 x + 4, x^2 - x - 6, x^3 - 4 x^2 - 3 x + 18}]</nowiki></code> yields ''x + 2''.</div>}} | :{{example| 1=<div><code><nowiki>GCD[{x^2 + 4 x + 4, x^2 - x - 6, x^3 - 4 x^2 - 3 x + 18}]</nowiki></code> yields ''x + 2''.</div>}} | ||
Revision as of 21:41, 22 August 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.
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.
