Function num_prime::nt_funcs::moebius

source · 
pub fn moebius<T: PrimalityBase>(target: &T) -> i8
where
    for<'r> &'r T: PrimalityRefBase<T>,
Expand description

This function calculate the Möbius μ(n) function of the input integer n

This function behaves like moebius_factorized(factorize(target)). If the input integer is very hard to factorize, it’s better to use the factors() function to control how the factorization is done, and then call moebius_factorized().

§Panics

if the factorization failed on target.