Polynomials - hancockhighmath
... REMEMBER – look at the exponents on each terms variable,
If the term doesn’t have a variable, it’s degree is ZERO.
Groebner([f1,...,fm], [x1,...,xn], ord)
... row-reduction of a matrix depending on
row-reduction of augmented matrix depending
computation of min-max points using Lagrange
Learning Target Unit Sheet Course: Algebra Chapter 8: Polynomials
I can determine the degree of a polynomial
I can write a polynomial in standard form
I can combine polynomials using addition and/or subtraction.
I can multiply a monomial by a polynomial.
I can factor a monomial from a polynomial.
I can multiply two binomials or a binomial by a trinomial.
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a field K[x1, ..,xn]. A Gröbner basis allows many important properties of the ideal and the associated algebraic variety to be deduced easily, such as the dimension and the number of zeros when it is finite. Gröbner basis computation is one of the main practical tools for solving systems of polynomial equations and computing the images of algebraic varieties under projections or rational maps.Gröbner basis computation can be seen as a multivariate, non-linear generalization of both Euclid's algorithm for computing polynomial greatest common divisors, andGaussian elimination for linear systems.Gröbner bases were introduced in 1965, together with an algorithm to compute them (Buchberger's algorithm), by Bruno Buchberger in his Ph.D. thesis. He named them after his advisor Wolfgang Gröbner. In 2007, Buchberger received the Association for Computing Machinery's Paris Kanellakis Theory and Practice Award for this work.However, the Russian mathematician N. M. Gjunter had introduced a similar notion in 1913, published in various Russian mathematical journals. These papers were largely ignored by the mathematical community until their rediscovery in 1987 by Bodo Renschuch et al. An analogous concept for local rings was developed independently by Heisuke Hironaka in 1964, who named them standard bases.The theory of Gröbner bases has been extended by many authors in various directions. It has been generalized to other structures such as polynomials over principal ideal rings or polynomial rings, and also some classes of non-commutative rings and algebras, like Ore algebras.