Resultant
Given a Polynomial 
of degree 
with roots 
, 
, ..., and a Polynomial 
of degree 
with roots 
, 
, ..., , the resultant is defined by
There exists an Algorithm similar to the Euclidean Algorithm for computing resultants (Pohst and Zassenhaus1989). The resultant is the Determinant of the corresponding Sylvester Matrix. Given
and 
, then
is a Polynomial of degree
, having as its roots all sums of the form 
.See also Discriminant (Polynomial), Sylvester Matrix
References
Pohst, M. and Zassenhaus, H. Algorithmic Algebraic Number Theory. Cambridge, England: Cambridge University Press, 1989. Wagon, S. Mathematica in Action. New York: W. H. Freeman, p. 348, 1991.
- Routh's Theorem
- RSA Encryption
- RSA Number
- Rubber-Sheet Geometry
- Rubik's Clock
- Rubik's Cube
- Rudin-Shapiro Sequence
- Rudvalis Group
- Rule
- Ruled Surface
- Rule of 72
- Ruler
- Ruler Function
- Ruling
- Run
- Runge-Kutta Method
- Runge-Walsh Theorem
- Running Knot
- Russell's Antinomy
- Russell's Paradox
- Russian Multiplication
- Russian Roulette
- Ryser Formula
- Rényi's Parking Constants
- Rössler Model