Difference between revisions of "GCD Command"

From GeoGebra Manual
Jump to: navigation, search
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 )
 
(7 intermediate revisions by 4 users not shown)
Line 1: Line 1:
<noinclude>{{Manual Page|version=4.2}}</noinclude>
+
<noinclude>{{Manual Page|version=5.0}}</noinclude>{{command|cas=true|algebra}}
{{command|cas=true|algebra}}
 
 
{{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 a>, <Number b> ]
+
;GCD( <Number>, <Number> )
:Calculates the greatest common divisor of numbers ''a'' and ''b''.
 
:{{example| 1=<div><code><nowiki>GCD[12, 15]</nowiki></code> yields ''3''.</div>}}
 
;GCD[ <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>}}
 
==CAS Syntax==
 
;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>}}
+
:{{example| 1=<div><code><nowiki>GCD(12, 15)</nowiki></code> yields ''3''.</div>}}
;GCD[ <List of Numbers> ]
+
;GCD( &lt;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>}}
;GCD[ <Polynomial>, <Polynomial> ]
+
 
 +
{{hint|In the [[File:Menu view cas.svg|link=|16px]] [[CAS View]] you can also use the following syntax:}}
 +
;GCD( <Polynomial>, <Polynomial> )
 
: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[ <List of Polynomials> ]
+
;GCD( &lt;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>}}
 +
 
 +
{{note|See also [[LCM Command]] and [[ExtendedGCD Command]].}}

Latest revision as of 09:34, 29 April 2023



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.


Note Hint: In the Menu view cas.svg 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.


Note: See also LCM Command and ExtendedGCD Command.
© 2024 International GeoGebra Institute