Difference between revisions of "Mod Command"
From GeoGebra Manual
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 ) |
m |
||
| Line 1: | Line 1: | ||
<noinclude>{{Manual Page|version=4.2}}</noinclude> | <noinclude>{{Manual Page|version=4.2}}</noinclude> | ||
{{command|cas=true|algebra}} | {{command|cas=true|algebra}} | ||
| − | ; 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>}} | :{{example|1=<div><code><nowiki>Mod[9, 4]</nowiki></code> yields ''1''.</div>}} | ||
Revision as of 18:39, 29 April 2013
- 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.
