 The following is a set of programs that I developed to find the roots of 
 polynomials.  However as a bonus I also created a program to reduce any
 polynomial into its quadratic factors.
 
 The first program is FCTP. (factor polynomial)
 When it is passed the coefficients of a polynomial in a list it returns the
 factors of that polynomal.  ex:
 
 1: { 1 -17.8 99.41 -261.218 352.611 -134.106 }
 FCTP
 3: { 1 -4.2 2.1 }
 2: { 1 -3.3 6.2 }
 1: { 1 -10.3 }
 
 This tells us that X^5-17.8*X^4+99.41*X^3-261.218*X^2+352.611*X-134.106
 factors to (X^2-4.2*X+2.1)*(X^2-3.3*X+6.2)*(X-10.3)
 
 Neat!
 
 The next program is RT. (Roots)
 If given a polynmoial it return its roots.  ex:
 
 1: { 1 -17.8 99.41 -261.218 352.611 -134.106 }
 RT
 5: 3.61986841536
 4: .58013158464
 3: (1.65, 1.8648056199)
 2: (1.65, -1.8648056199)
 1: 10.3
 
 Very Useful!

 Another [buggy] program that is included is PMUL to multiply two polys. ex:

 2: { 1 5 -7 }
 1: { 1 -5 }
 PMUL
 1: { 1 0 -32 35 }

 Unfortunatly PMUL will not work on a 28 as is.  When someone fixes this
 send me a copy. [won't work on a 48 either - jkh]

 But wait theres more!  A program called PDIV is yours free just for trying 
 this set of programs. Can you guess what it does?

 2: { 1 0 -32 36 }
 1: { 1 5 -7 }
 PDIV
 2: { 1 -5 }
 1: { 0 1 }

 This means that (X^3-32*X+35) / (X^2+5*X-7) = X-5 with remander 0*X+1 
 
 These programs use the BAIRS program which performs Bairstow's method of
 quadratic factors and QUD which does the quadratic equation.

 Have Fun!

 Wayne Scott            | INTERNET:   wscott at en.ecn.purdue.edu
 Electrical Engineering | BITNET:     wscott%ea.ecn.purdue.edu at purccvm
 Purdue University      | UUCP:      {purdue,pur-ee}!en.ecn.purdue.edu!wscott

                   "To iterate is human.  To recurse, divine."

