Home | History | Annotate | Download | only in libtommath

Lines Matching defs:Remainder

1059 Which will divide $a$ by $2^b$, store the quotient in ``c'' and the remainder in ``d'.  If $b \le 0$ then the
1061 value to signal that the remainder is not desired.
1085 This will divide $a$ in place by $x^b$ and discard the remainder. This function cannot fail as it performs the operations
1137 \section{Integer Division and Remainder}
1138 To perform a complete and general integer division with remainder use the following function.
1276 Modular reduction is process of taking the remainder of one quantity divided by another. Expressed
1277 as (\ref{eqn:mod}) the modular reduction is equivalent to the remainder of $b$ divided by $c$.