Difference between revisions of "Mod Command"
From GeoGebra Manual
Line 8: | Line 8: | ||
;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> | + | {{example|1=<div><code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''9x + 4''.</div>}} |
− | |||
− | |||
− | </div>}} |
Revision as of 10:12, 19 August 2011
- Mod[ <Integer a>, <Integer b> ]
- Yields the remainder when integer a is divided by integer b.
- Mod[ <Polynomial>, <Polynomial>]
- Yields the remainder when the first entered polynomial is divided by the second polynomial.
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.