Abstract
It is well known that the condition under which a quadratic in two variables reduces to a product of two linear factors is that the determinant of the associated quadratic form should be zero. This result is generalized to the case of a polynomial of degree n. For the degree n case there are 1/2(n - 1)n constraints for the polynomial to be reducible. A recursive algorithm is presented for determining them.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications in Numerical Methods in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
