pub trait KroneckerSymbol<RHS = Self> {
// Required method
fn kronecker_symbol(self, other: RHS) -> i8;
}
Expand description
Calculates the Kronecker symbol of two numbers.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.
Computes the Kronecker symbol of two numbers.
$$
f(x, y) = \left ( \frac{x}{y} \right ).
$$
§Worst-case complexity
$T(n) = O(n^2)$
$M(n) = O(n)$
where $T$ is time, $M$ is additional memory, and $n$ is
max(self.significant_bits(), other.significant_bits()).
§Examples
See here.