A unit 9 Geometry quiz question

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol

the correct option is:

b. a value of the variable that makes the polynomial equal to zero.

the root or roots of a polynomial are the values of the variable that makes the polynomial equal to 0. we can find the roots of a polynomial making the expression equal to 0 and then, isolating the variable (it it has just one variable).

for example, given the following polynomial:

the root or zero of the polynomial, can be found by making the expression equal to 0, and then, isolating the variable, so, finding the root we have:

therefore, we have that the root of the polynomial is equal to 2.

we must remember that the number of roots that a polynomial can have, will depend on the degree of the polynomial, a first degree polynomial have will have one single root, a second degree polynomial (quadratic expression) may have two roots and so.

hence the correct option is:

b. a value of the variable that makes the polynomial equal to zero.

have a nice day!

kjnsk nidn t

dfj dt

step-by-step explanation:

vjnijernv