Answer:
32 is not minimum value of C
Step-by-step explanation:
Given constraints:
Now we draw the graph of each constraint and see the feasible region in graph. Please have a look attached graph.
We got three corner points A(0,8) B(2,4) and C(6,0)
Now we find the optimal solution for each value of corner points.
C(0,8)=7(0)+8(8)=64
C(2,4)=7(2)+8(4)=14+32=46
C(6,0)=7(6)+8(0)=42
Option A is correct. 32 is not minimum value of C
Answer:
3.)You can perform the same transformations on polynomial functions that you performed on quadratic and linear functions.
Number 1 & 2 is sortof answered in the pictures. Hope this helped. :\
Step-by-step explanation:
<em>In algebra, the polynomial remainder theorem or little Bézout's theorem is an application of Euclidean division of polynomials. It states that the remainder of the division of a polynomial by a linear polynomial is equal to In particular, is a divisor of if and only if a property known as the factor theorem. In algebra, the polynomial remainder theorem or little Bézout's theorem is an application of Euclidean division of polynomials. It states that the remainder of the division of a polynomial by a linear polynomial is equal to In particular, is a divisor of if and only if a property known as the factor theorem. </em>
