summaryrefslogtreecommitdiff
path: root/src
AgeCommit message (Collapse)Author
2023-12-07RefinedHEADmasterJSDurand
* src/lib.rs: Now the `factors` function directly finds all irreducible factors of the polynomial without resoting to manual inspections when the polynomial is not square-free. Also some quality-of-life improvements were made. * src/main.rs: Now has the option of searching for primes modulo which the polynomial is irreducible, up till a given bound. This is useful if I am curious to know whether such small primes exist.
2023-12-06initial commitJSDurand
A manual implementation of the Berlekamp algorithm for finding irreducible factors of polynomials over finite fields.