#polynomial #algebra #modulo

polynomial-over-finite-prime-field

polynomial over finite prime field

10 unstable releases (3 breaking)

0.4.3 Apr 16, 2022
0.4.2 Apr 15, 2022
0.3.2 Feb 13, 2022
0.3.1 Aug 4, 2021
0.1.1 May 1, 2021

#1344 in Math

27 downloads per month
Used in algebraic-equation-over-f…

AGPL-3.0-or-later

34KB
874 lines

Polynomial ring over finite prime field $\mathbb{F}_p[x]$

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());

Licence

AGPL-3.0-or-later


lib.rs:

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());

Dependencies

~3MB
~59K SLoC