Join GitHub today
GitHub is home to over 20 million developers working together to host and review code, manage projects, and build software together.
Research feasibility of using Math::Polynomial+Math::GMPz instead of Math::Primality::BigPolynomial #5
Currently we have Math::Primality::BigPolynomial, which basically allows you to create univariate polynomials with Math::GMPz objects as coefficients.
Last night I was going to extract BigPolynomial out to it's own CPAN module, but I ran across Math::Polynomial, which allows arbitrary objects as coefficients of univariate polynomials.
It seems like we could remove the need for M::P::BigPolynomial if we have Math::Primality::AKS use Math::Polynomial with Math::GMPz objects. This would also mean moving the mpz_* functions out of M::P::BigPolynomial back into M::P::AKS, which is probably where they belong, for now.
Any comments about this, @bubaflub ?
This comment has been minimized.
This comment has been minimized.Show comment Hide comment
Quoth the Math::Polynomial docs:
Math::GMPz does have operator overloading:
So in theory we could combine this and just take our specific algorithm out. It looks like Math::Polynomial has mod and mmod functions which should cover what we need. Do you want to open up another branch to hack on this?