Difference between revisions of "Mod Command"

From GeoGebra Manual
Jump to: navigation, search
Line 3: Line 3:
 
; Mod[ <Integer a>, <Integer b> ]
 
; Mod[ <Integer a>, <Integer b> ]
 
:Yields the remainder when integer ''a'' is divided by integer ''b''.
 
:Yields the remainder when integer ''a'' is divided by integer ''b''.
 +
{{example|1=<div><code><nowiki>Mod[9, 4]</nowiki></code> yields ''1''.</div>}}
 
;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 ''9x + 4''.</div>}}
 
==CAS Syntax==
 
==CAS Syntax==
 
;Mod[ <Integer a>, <Integer b> ]
 
;Mod[ <Integer a>, <Integer b> ]

Revision as of 09:19, 19 August 2011


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 9x + 4.

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 9x + 4.
© 2024 International GeoGebra Institute