up previous next
remainder for integers
We define the quotient
Q
and remainder
R
to be integers which
satisfy
N = Q*D + R with
0 <= R < D.
Then
div(N, D)
returns
Q
while
mod(N, D)
returns
R
.
NOTE: To perform the division algorithm on a polynomial, use
NR
(normal remainder) to find the remainder, or
DivAlg
to get both the quotients and the remainder.
/**/ div(10,3);
3
/**/ mod(10,3);
1
