All categories

3 years ago

How do you work out "2(c+4)="

Mathematics

1 answer:

Nonamiya [84]3 years ago

5 0

First you do distributive property.

2c + 8 = 0

Then subtract 8 with 0

2c = -8

Then divide -8/2

<h2>c = -4</h2><h2>Hope this helps :)</h2><h2 />

You might be interested in

I cannot seem to get this right.Find an equation of the line that has a slope of -4 and a y intercept of 9. y=

Gala2k [10]

Answer:

y=-4x+9

Step-by-step explanation:

-4 is the slope and the y intercept is 9

8 0

3 years ago

Read 2 more answers

The shortest path from a starting point to an endpoint, regardless of the path taken, is called the _____________.

balandron [24]

<span>The shortest path from a starting point to an endpoint, regardless of the path taken, is called the </span>geodesic. In flat (Euclidean) space it is simply a straight line.

7 0

3 years ago

Read 2 more answers

Food and clothing are shipped to victims of a natural disaster. Each carton of food will feed 13 people, while each carton of c

lutik1710 [3]

Answer:

233 cartons of food; 467 cartons of clothing

Step-by-step explanation:

This linear programming problem can be formulated as two inequalities (in addition to the usual constraints that the variables be non-negative). One of these expresses the constraint on weight. Let f and c represent numbers of food and clothing containers, respectively.

40f +25c ≤ 21000

The other expresses the limit on volume.

20f + 5c ≤ 7000

_____

<u>Feasible Region vertex</u>

We can subtract the boundary line equation of the first inequality from that of 5 times the second to find f:

5(20f +5c) -(40f +25c) = 5(7000) -21000

60f = 14000

f = 233 1/3

The second boundary line equation can be rearranged to find c:

c = 1400 -4f = 466 2/3

The nearest integer numbers to these values are ...

(f, c) = (233, 467)

The other vertices of the feasible region are associated with one or the other variable being zero: (f, c) = (0, 840) or (350, 0).

<u>Check of Integer Solution</u>

Trying these in the constraint inequalities gives ...

40·233 +25·467 = 20,995 < 21000
20·233 +5·467 = 6995 < 7000

<u>Selection of the Answer</u>

The answer to the question will be the feasible region vertex that maximizes the number of people helped. That is, we want to maximize ...

p = 13f + 6c

The values of p at the vertices are ...

p = 13·233 + 6·467 = 5831

p = 13·0 + 6·840 = 5040

p = 13·350 + 6·0 = 2100

The most people are helped when the plane is filled with 233 food cartons and 467 clothing cartons.

7 0

3 years ago

A barrel of oil was filled at a constant rate of 7.5 gal/min. the barrel had 10 gallons before filling began. write an equation

Xelga [282]

Assuming that :

- The number of the gallons is symbolized by g
- Time per minute is symbolized by t

the equation would be :

g = 10 + 7.5 t

Hope this helps

5 0

3 years ago

Simplify the expression: 2(4 + 6f) plz help this is my end of the year assesment Thanks!

julia-pushkina [17]

Answer:

8+12f

hope this helps

have a good day :)

Step-by-step explanation:

3 0

3 years ago

Read 2 more answers