Difference between revisions of "Mod Command"
From GeoGebra Manual
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[ < | + | ;Mod[ <Dividend Number>, <Divisor Number> ] |
| − | :Yields the remainder when | + | :Yields the remainder when dividend number is divided by divisor number. |
| − | :{{example|1= | + | :{{example|1=<code><nowiki>Mod[9, 4]</nowiki></code> yields ''1''.}} |
| − | ;Mod[ <Polynomial>, <Polynomial>] | + | ;Mod[ <Dividend Polynomial>, <Divisor Polynomial> ] |
| − | :Yields the remainder when the | + | :Yields the remainder when the dividend polynomial is divided by the divisor polynomial. |
| − | :{{example|1= | + | :{{example|1=<code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''4 x + 9''.}} |
==CAS Syntax== | ==CAS Syntax== | ||
| − | ;Mod[ < | + | ;Mod[ <Dividend Number>, <Divisor Number> ] |
| − | :Yields the remainder when | + | :Yields the remainder when dividend number is divided by divisor number. |
| − | :{{example|1= | + | :{{example|1=<code><nowiki>Mod[9, 4]</nowiki></code> yields ''1''.}} |
| − | ;Mod[ <Polynomial>, <Polynomial> ] | + | ;Mod[ <Dividend Polynomial>, <Divisor Polynomial> ] |
| − | :Yields the remainder when the | + | :Yields the remainder when the dividend polynomial is divided by the divisor polynomial. |
| − | :{{example|1= | + | :{{example|1=<code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''4 x + 9''.}} |
Revision as of 14:07, 3 May 2013
- Mod[ <Dividend Number>, <Divisor Number> ]
- Yields the remainder when dividend number is divided by divisor number.
- Example:
Mod[9, 4]yields 1.
- Mod[ <Dividend Polynomial>, <Divisor Polynomial> ]
- Yields the remainder when the dividend polynomial is divided by the divisor polynomial.
- Example:
Mod[x^3 + x^2 + x + 6, x^2 - 3]yields 4 x + 9.
CAS Syntax
- Mod[ <Dividend Number>, <Divisor Number> ]
- Yields the remainder when dividend number is divided by divisor number.
- Example:
Mod[9, 4]yields 1.
- Mod[ <Dividend Polynomial>, <Divisor Polynomial> ]
- Yields the remainder when the dividend polynomial is divided by the divisor polynomial.
- Example:
Mod[x^3 + x^2 + x + 6, x^2 - 3]yields 4 x + 9.
