Trait malachite_base::num::arithmetic::traits::ModMul

source · [−]
pub trait ModMul<RHS = Self, M = Self> {
    type Output;

    fn mod_mul(self, other: RHS, m: M) -> Self::Output;
}
Expand description

Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced mod $m$.

Required Associated Types

Required Methods

Implementations on Foreign Types

Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.

$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

This is equivalent to nmod_mul from nmod_vec.h, FLINT 2.7.1.

Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.

$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

This is equivalent to nmod_mul from nmod_vec.h, FLINT 2.7.1.

Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.

$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

This is equivalent to nmod_mul from nmod_vec.h, FLINT 2.7.1.

Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.

$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

This is equivalent to nmod_mul from nmod_vec.h, FLINT 2.7.1.

Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.

$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

This is equivalent to nmod_mul from nmod_vec.h, FLINT 2.7.1.

Multiplies two numbers modulo a third number $m$. Assumes the inputs are already reduced modulo $m$.

$f(x, y, m) = z$, where $x, y, z < m$ and $xy \equiv z \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

This is equivalent to nmod_mul from nmod_vec.h, FLINT 2.7.1.

Implementors