-
Notifications
You must be signed in to change notification settings - Fork 32
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
I would like to re-use Primes.Factorization for polynomials #126
Comments
I think this should be doable. I don't believe we are using the assumption of integer type anywhere. |
Excellent! I wait for this... Unless you want me to make a pr? |
can you make the PR? I'll merge. |
Thank you for merging! Are you going to do a release? It would be good to have this and also the function |
I'm going to give myself a few days (mainly because I might want to get #120 in also). that said if I haven't made a release in a week or so, feel free to bump this. as for divisors, I'm probably not going to write the code myself, but if there was a PR for it I probably would merge (even though I kind of think the multiplicative functions might belong in a separate package) |
But the code for |
oh, that will be very easy then :) |
"if I haven't made a release in a week or so, feel free to bump this." BUMP! |
version tagged. sorry for the wait. |
Can this be closed? |
I have written code for factoring a univariate polynomial over a finite field, and over the integers (modules
Fact
andFFfac
in my packageGapjm
). I thought it would be convenient to usePrimes.Factorization
to store these factorizations. However, I cannot since it is written in several placesT<:Integer
.Are these annotations really useful? It seems to me they are not...
The text was updated successfully, but these errors were encountered: