This problem here would be a little tricky. Let us take into account first the variables presented which are the following: a collection of triangular and square tiles, 25 tiles, and 84 edges. Triangles and squares are 2D in shape so they give us a variable of 3 and 4 to work on those edges. Let us say that we represent square tiles with x and triangular tiles with y. There would be two equations which look like these:
x + y = 25 and 4x + 3y = 84
The first one would refer to the number of tiles and the second one to number of edges.
We will be using the first equation to the second equation and solve for one. So if we will be looking for y for instance, then x in the second equation would be substituted with x = 25 - y which would look like this:
4 (25 - y) + 3y = 84
Solve.
100 - 4y + 3y = 84
-4y +3y = 84 - 100
-y = -16
-y/-1 = -16/-1
y = 16
Then:
x = 25 -y
x = 25 - 16
x = 9
So the answer is that there are 9 square tiles and 16 triangular tiles.
Answer:
-5w^9.
Step-by-step explanation:
These two terms are what we call, 'like terms'. This means that they are terms whose variables and exponents are the same. 14w^9- 19w^9 have the variable w^9 in common.
In these cases, all we do is use the coefficients (the number in front of the variable). Hence, 14w^9- 19w^9, quite literally turns into, 14-19. If we complete the sum, 14-19= -5. Put it all together, we have -5w^9.
Hope this helps!
Answer:
The answer to your question is A.
The sequence is incrementing by

Therefore, the sixth number is

Which is 64.
Answer:
1. Objective function is a maximum at (16,0), Z = 4x+4y = 4(16) + 4(0) = 64
2. Objective function is at a maximum at (5,3), Z=3x+2y=3(5)+2(3)=21
Step-by-step explanation:
1. Maximize: P = 4x +4y
Subject to: 2x + y ≤ 20
x + 2y ≤ 16
x, y ≥ 0
Plot the constraints and the objective function Z, or P=4x+4y)
Push the objective function to the limit permitted by the feasible region to find the maximum.
Answer: Objective function is a maximum at (16,0),
Z = 4x+4y = 4(16) + 4(0) = 64
2. Maximize P = 3x + 2y
Subject to x + y ≤ 8
2x + y ≤ 13
x ≥ 0, y ≥ 0
Plot the constraints and the objective function Z, or P=3x+2y.
Push the objective function to the limit in the increase + direction permitted by the feasible region to find the maximum intersection.
Answer: Objective function is at a maximum at (5,3),
Z = 3x+2y = 3(5)+2(3) = 21