We have to determine the complete factored form of the given polynomial
.
Let x= -1 in the given polynomial.
So, 
So, by factor theorem
(x+1) is a factor of the given polynomial.
So, dividing the given polynomial by (x+1), we get quotient as
.
So,
= (x+1)
.
= 
=![(x+1)[ 2x(3x-5)-3(3x-5)]](https://tex.z-dn.net/?f=%28x%2B1%29%5B%202x%283x-5%29-3%283x-5%29%5D)
=
is the completely factored form of the given polynomial.
Option D is the correct answer.
Answer:
Dimensions: 
Perimiter: 
Minimum perimeter: [16,16]
Step-by-step explanation:
This is a problem of optimization with constraints.
We can define the rectangle with two sides of size "a" and two sides of size "b".
The area of the rectangle can be defined then as:

This is the constraint.
To simplify and as we have only one constraint and two variables, we can express a in function of b as:

The function we want to optimize is the diameter.
We can express the diameter as:

To optimize we can derive the function and equal to zero.

The minimum perimiter happens when both sides are of size 16 (a square).
Answer:
$39.59
Step-by-step explanation:
37 increase 7% =
37 × (1 + 7%) = 37 × (1 + 0.07) = 39.59
0.08
0.2
+
=
0.28 that’s how u work it out
Find the greatest common factor
in this case it would be 8, so she'd be able to make 8 packets maximum