Trait malachite_base::num::arithmetic::traits::Lcm

pub trait Lcm<RHS = Self> {
    type Output;

    // Required method
    fn lcm(self, other: RHS) -> Self::Output;
}

Calculates the LCM (least common multiple) of two numbers.

Required Associated Types

type Output

Required Methods

fn lcm(self, other: RHS) -> Self::Output

Implementations on Foreign Types

impl Lcm for u8

fn lcm(self, other: u8) -> u8

Computes the LCM (least common multiple) of two numbers.

$$ f(x, y) = \operatorname{lcm}(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(1)$

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

Panics

Panics if the result is too large to be represented.

Examples

See here.

type Output = u8

impl Lcm for u16

fn lcm(self, other: u16) -> u16

Computes the LCM (least common multiple) of two numbers.

$$ f(x, y) = \operatorname{lcm}(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(1)$

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

Panics

Panics if the result is too large to be represented.

Examples

See here.

type Output = u16

impl Lcm for u32

fn lcm(self, other: u32) -> u32

Computes the LCM (least common multiple) of two numbers.

$$ f(x, y) = \operatorname{lcm}(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(1)$

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

Panics

Panics if the result is too large to be represented.

Examples

See here.

type Output = u32

impl Lcm for u64

fn lcm(self, other: u64) -> u64

Computes the LCM (least common multiple) of two numbers.

$$ f(x, y) = \operatorname{lcm}(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(1)$

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

Panics

Panics if the result is too large to be represented.

Examples

See here.

type Output = u64

impl Lcm for u128

fn lcm(self, other: u128) -> u128

Computes the LCM (least common multiple) of two numbers.

$$ f(x, y) = \operatorname{lcm}(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(1)$

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

Panics

Panics if the result is too large to be represented.

Examples

See here.

type Output = u128

impl Lcm for usize

fn lcm(self, other: usize) -> usize

Computes the LCM (least common multiple) of two numbers.

$$ f(x, y) = \operatorname{lcm}(x, y). $$

Worst-case complexity

$T(n) = O(n^2)$

$M(n) = O(1)$

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

Panics

Panics if the result is too large to be represented.

Examples

See here.

type Output = usize

Implementors