Function ring_algorithm::modulo_divison

pub fn modulo_divison<T>(a: T, b: T, m: T) -> Option<T> where
    T: Sized + Eq + Zero + One + RingNormalize,
    for<'x> &'x T: EuclideanRingOperation<T>, 

division in modulo

calc x ($bx \equiv a \pmod{m}$)

use ring_algorithm::modulo_divison;
let a = 42;
let b = 32;
let m = 98;
let x = modulo_divison::<i32>(a, b, m).unwrap();
assert_eq!((b * x - a) % m, 0);