@article{(Open Science Index):https://publications.waset.org/pdf/10086,
	  title     = {Factoring a Polynomial with Multiple-Roots},
	  author    = {Feng Cheng Chang},
	  country	= {},
	  institution	= {},
	  abstract     = {A given polynomial, possibly with multiple roots, is
factored into several lower-degree distinct-root polynomials with
natural-order-integer powers. All the roots, including multiplicities,
of the original polynomial may be obtained by solving these lowerdegree
distinct-root polynomials, instead of the original high-degree
multiple-root polynomial directly.
The approach requires polynomial Greatest Common Divisor
(GCD) computation. The very simple and effective process, “Monic
polynomial subtractions" converted trickily from “Longhand
polynomial divisions" of Euclidean algorithm is employed. It
requires only simple elementary arithmetic operations without any
advanced mathematics.
Amazingly, the derived routine gives the expected results for the
test polynomials of very high degree, such as p( x) =(x+1)1000.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {2},
	  number    = {11},
	  year      = {2008},
	  pages     = {3718 - 3721},
	  ee        = {https://publications.waset.org/pdf/10086},
	  url   	= {https://publications.waset.org/vol/23},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  index 	= {Open Science Index 23, 2008},