Answer: The answer is C on edg.
Step-by-step explanation: I got it right
Answer:
greatest number of areas that can be created=5
Step-by-step explanation:
given data
Number of pine trees = 45
Number of oak trees = 30
solution
we want area have same number of both trees
so we get here greatest number of area
we find here greatest common factor of 45 and 30
so Prime factorization of 45 and 30 are
45 = 3 × 3 × 5
30 = 2 × 3 × 5
as here GCF = 5
so here greatest number of areas that can be created=5
Our matrix C is the encoder. Let X be our secret message and let B be our encoded message. Therefore the relationship between the 3 can be represented as:
CX = B
So we want to solve for X (our secret message). So using matrix algebra:
X = C^-1*B
where C^-1 is the inverse of C.
C^-1 = | 3 -2 |
|4 -3 |
So we take C^-1 and multiply it by matrix B to get X. Matrix B is already given to us. So just multiply those two. I used a calculator to get:
X = | 20 8 5 3 15 12 15 |
| 18 9 19 2 12 21 5 |
And since A = 1, B = 2, C = 3, etc....
We decode our message and it says:
X = | T H E C O L O |
| R I S B L U E |
So the answer is: The color is blue (D)
Answer:
The polynomial function is 
Step-by-step explanation:
A polynomial function is completely determined by its roots, up to a constant factor. So, if we want that
,
and
be roots of the polynomial P, we can write it as

Now, notice that the factor
has real coefficients, while the other one don't. So, we need to ‘‘eliminate’’ the complex coefficients that will appear. This can be done adding other complex root to the polynomial: the conjugate of
: 2-3i. Then,

Expanding the above expression we obtain the desired polynomial

Recall that P(x) must have three roots, and this implies that P has at least degree 3. As we had to add a new root in order to obtain real coefficients, the degree of P must be at least 4. With this reasoning we assure the minimal degree.