Crate polynomial_over_finite_prime_field[−][src]
Expand description
PolynomialOverP ring over finite prime field $\mathbb{F}_p[x]
$
use num_traits::Zero; use polynomial_over_finite_prime_field::PolynomialOverP; let p = PolynomialOverP::<i32>::new(vec![3, 1, 4, 1, 5, 9, 2, 6, 5, 3], 17); let q = PolynomialOverP::<i32>::new(vec![2, 7, 1, 8, 2, 8], 17); let mut r = p.clone(); let d = r.division(&q); assert!((d * q + r - p).is_zero());