Coefficient

In mathematics, a coefficient is a multiplicative factor in some term of a polynomial, a series, or any expression. For example, in the polynomial 7x^2-3xy+1.5+y, with variables x and y, the first two terms have the coefficients 7 and −3. The third term 1.5 is the constant coefficient. In the final term, the coefficient is 1 and is not explicitly written. In many scenarios, coefficients are numbers (as is the case for each term of the previous example), although they could be parameters of the problem—or any expression in these parameters. In such a case, one must clearly distinguish between symbols representing variables and symbols representing parameters. Following René Descartes, the variables are often denoted by , , ..., and the parameters by , , , ..., but this is not always the case. For example, if is considered a parameter in the above expression, then the coefficient of would be , and the constant coefficient (with respect to ) would be . When one writes ax^2+bx+c, it is generally assumed that is the only variable, and that , and are parameters; thus the constant coefficient is in this case. Any polynomial in a single variable can be written as a_k x^k + \dotsb + a_1 x^1 + a_0 for some nonnegative integer k, where a_k, \dotsc, a_1, a_0 are the coefficients. This includes the possibility that some terms have coefficient 0; for example, in x^3 - 2x + 1, the coefficient of x^2 is 0, and the term 0x^2 does not appear explicitly. For the largest i such that a_i \ne 0 (if any), a_i is called the leading coefficient of the polynomial. For example, the leading coefficient of the polynomial 4x^5 + x^3 + 2x^2 is 4. This can be generalised to multivariate polynomials with respect to a monomial order, see . ==Linear algebra==

In linear algebra, a system of linear equations is frequently represented by its coefficient matrix. For example, the system of equations \begin{cases} 2x + 3y = 0 \\ 5x - 4y = 0 \end{cases}, the associated coefficient matrix is \begin{pmatrix} 2 & 3 \\ 5 & -4 \end{pmatrix}. Coefficient matrices are used in algorithms such as Gaussian elimination and Cramer's rule to find solutions to the system. The leading entry (sometimes leading coefficient) of a row in a matrix is the first nonzero entry in that row. So, for example, in the matrix \begin{pmatrix} 1 & 2 & 0 & 6\\ 0 & 2 & 9 & 4\\ 0 & 0 & 0 & 4\\ 0 & 0 & 0 & 0 \end{pmatrix}, the leading coefficient of the first row is 1; that of the second row is 2; that of the third row is 4, while the last row does not have a leading coefficient. Though coefficients are frequently viewed as constants in elementary algebra, they can also be viewed as variables as the context broadens. For example, the coordinates (x_1, x_2, \dotsc, x_n) of a vector v in a vector space with basis \lbrace e_1, e_2, \dotsc, e_n \rbrace are the coefficients of the basis vectors in the expression v = x_1 e_1 + x_2 e_2 + \dotsb + x_n e_n . ==See also==