polynomial-over-finite-prime-field
| Crates.io | polynomial-over-finite-prime-field |
| lib.rs | polynomial-over-finite-prime-field |
| version | 0.4.3 |
| source | src |
| created_at | 2021-05-01 16:22:20.670219 |
| updated_at | 2022-04-16 13:23:05.447744 |
| description | polynomial over finite prime field |
| homepage | |
| repository | https://gitlab.com/Toru3/polynomial-over-finite-prime-field/ |
| max_upload_size | |
| id | 391942 |
| size | 38,369 |
(Toru3)
documentation
https://docs.rs/polynomial-over-finite-prime-field/
README
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