Trait malachite_base::num::arithmetic::traits::ModShl

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

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

Left-shifts a number (multiplies it by a power of 2) modulo another number $m$. Assumes the input is already reduced modulo $m$.

Required Associated Types

Required Methods

Implementations on Foreign Types

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $2^nx \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Left-shifts a number (multiplies it by a power of 2) modulo a number $m$. Assumes the input is already reduced modulo $m$.

$f(x, n, m) = y$, where $x, y < m$ and $\lfloor 2^nx \rfloor \equiv y \mod m$.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is other.significant_bits().

Examples

See here.

Implementors