Difference between revisions of "Mod Command"

From GeoGebra Manual
Jump to: navigation, search
m (Bot: Automated text replacement (-{{command +{{command|cas=true))
Line 6: Line 6:
 
;Mod[ <Polynomial>, <Polynomial>]
 
;Mod[ <Polynomial>, <Polynomial>]
 
:Yields the remainder when the first entered polynomial is divided by the second polynomial.
 
:Yields the remainder when the first entered polynomial is divided by the second polynomial.
:{{example|1=<div><code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''9 x + 4''.</div>}}
+
:{{example|1=<div><code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''4 x + 9''.</div>}}
 
==CAS Syntax==
 
==CAS Syntax==
 
;Mod[ <Integer a>, <Integer b> ]
 
;Mod[ <Integer a>, <Integer b> ]
Line 13: Line 13:
 
;Mod[ <Polynomial>, <Polynomial> ]
 
;Mod[ <Polynomial>, <Polynomial> ]
 
:Yields the remainder when the first entered polynomial is divided by the second polynomial.
 
:Yields the remainder when the first entered polynomial is divided by the second polynomial.
:{{example|1=<div><code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''9 x + 4''.</div>}}
+
:{{example|1=<div><code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''4 x + 9''.</div>}}

Revision as of 11:05, 30 November 2012


Mod[ <Integer a>, <Integer b> ]
Yields the remainder when integer a is divided by integer b.
Example:
Mod[9, 4] yields 1.
Mod[ <Polynomial>, <Polynomial>]
Yields the remainder when the first entered polynomial is divided by the second polynomial.
Example:
Mod[x^3 + x^2 + x + 6, x^2 - 3] yields 4 x + 9.

CAS Syntax

Mod[ <Integer a>, <Integer b> ]
Yields the remainder when integer a is divided by integer b.
Example:
Mod[9, 4] yields 1.
Mod[ <Polynomial>, <Polynomial> ]
Yields the remainder when the first entered polynomial is divided by the second polynomial.
Example:
Mod[x^3 + x^2 + x + 6, x^2 - 3] yields 4 x + 9.
© 2024 International GeoGebra Institute