pub trait ModPowerOf2IsReduced {
// Required method
fn mod_power_of_2_is_reduced(&self, pow: u64) -> bool;
}
Expand description
Checks whether a number is reduced modulo $2^k$.
Returns whether a number is reduced modulo another number $2^k$; in other words,
whether it has no more than $k$ significant bits.
$f(x, k) = (x < 2^k)$.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Returns whether a number is reduced modulo another number $2^k$; in other words,
whether it has no more than $k$ significant bits.
$f(x, k) = (x < 2^k)$.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Returns whether a number is reduced modulo another number $2^k$; in other words,
whether it has no more than $k$ significant bits.
$f(x, k) = (x < 2^k)$.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Returns whether a number is reduced modulo another number $2^k$; in other words,
whether it has no more than $k$ significant bits.
$f(x, k) = (x < 2^k)$.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Returns whether a number is reduced modulo another number $2^k$; in other words,
whether it has no more than $k$ significant bits.
$f(x, k) = (x < 2^k)$.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.
Returns whether a number is reduced modulo another number $2^k$; in other words,
whether it has no more than $k$ significant bits.
$f(x, k) = (x < 2^k)$.
§Worst-case complexity
Constant time and additional memory.
§Examples
See here.