Hmmm I don't think either is correct.
So he weighs 44 pounds, and needs to lose 7 pounds
44 - 7 = x
where x is the dog's new weight.
<h3>
Answer:</h3>
Gary did not use the greatest common factor in the equation.
<h3>
Step-by-step explanation:</h3>
The largest number on both factor lists (the GCF) is 6, not 3. The factoring should be ...
66 + 36 = 6(11 +6)
The dimensions of the prism can be 2x, 2x+3 and x+6.
We first factor out the GCF of the trinomial. The GCF of the coefficients is 2. Each term has an x in common as well, so the GCF is 2x.
Factoring out the 2x, we have
2x(2x²+15x+18).
To factor the remaining trinomial, we find factors of 2*18=36 that sum to 15. 12*3 = 36 and 12+3 = 15. We split up 15x into 12x and 3x:
2x(2x²+12x+3x+18)
Now we group together the first two terms in parentheses and the last two:
2x((2x²+12x)+(3x+18))
Factor out the GCF of the first group:
2x(2x(x+6)+(3x+18))
Factor out the GCF of the second group:
2x(2x(x+6)+3(x+6))
Factoring out what these have in common,
2x(x+6)(2x+3)
The question looks like it encountered the biggest, baddest, bully in the world
In general, you solve a problem like this by identifying the vertices of the feasible region. Graphing is often a good way to do it, or you can solve the equations pairwise to identify the x- and y-values that are at the limits of the region.
In the attached graph, the solution spaces of the last two constraints are shown in red and blue, and their overlap is shown in purple. Hence the vertices of the feasible region are the vertices of the purple area: (0, 0), (0, 1), (1.5, 1.5), and (3, 0).
The signs of the variables in the contraint function (+ for x, - for y) tell you that to maximize C, you want to make y as small as possible, while making x as large as possible at the same time. The solution space vertex that does that is (3, 0).
