Abstract
The presentation in this section follows Gerhard (2001). Let Z be a UFD and f ∈ Z[x] nonzero primitive of degree n.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gerhard, J. (2004). 5. Modular Squarefree and Greatest Factorial Factorization. In: Modular Algorithms in Symbolic Summation and Symbolic Integration. Lecture Notes in Computer Science, vol 3218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30137-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-30137-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24061-7
Online ISBN: 978-3-540-30137-0
eBook Packages: Computer ScienceComputer Science (R0)