1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
sladkih [1.3K]
3 years ago
8

Now expand the the expression

Mathematics
1 answer:
sveticcg [70]3 years ago
5 0

Answer:

5x + 4

Step-by-step explanation:

1/2 (10z + 8)

= 1/2 x 10z + 1/2 x 8

= 5z + 4

Hope this helps!!

You might be interested in
Find the height of a with a cone with a diameter of 22 m whose volume is 113 m3.
Alexxandr [17]

Answer:

h=0.89

Step-by-step explanation:

Given

Diameter=22m

so radius=11m

Volume=113m^3

Solution

1/3πr^2h=113

1/3×3.14×11×11h=113

h=113×3/3.14×11×11

h=0.89

So the value of h is 0.89

7 0
3 years ago
Read 2 more answers
There are 20 percent more goblins than wizards in magic club. There are 120 goblins in magic club.
sineoko [7]

Answer:

144

Step-by-step explanation:

120 x 1.20 = 144

.20 is 20% and adding the 1 adds it to the original value

5 0
3 years ago
PLEASE ANSWER ASAP WILL GIVE BRAINLIEST.
lara31 [8.8K]

Answer:

C) The cost increases $2.50 for every additional pair of shoes rented.

Step-by-step explanation:

Notice a pattern. When you buy a new pair of shoes, the total gets increased by $2.50 depending on how many pairs of shoes you buy. For example, starting with 1 pair of shoes, it costs $2.50, but when you buy another pair, the cost is $2.50+$2.50=2*$2.50=$5.00, and so on...

Therefore, the correct choice is C

7 0
3 years ago
In a particular flow network G = (V,E) with integer edge capacities ce, we have already found the maximum s-t flow. However, we
yulyashka [42]

Answer:

Check the explanation

Step-by-step explanation:

1) Algorithm for finding the new optimal flux: 1. Let E' be the edges eh E for which f(e)>O, and let G = (V,E). Find in Gi a path Pi from s to u and a path P_1, from v to t.  

2) [Special case: If P_1, and P_2 have some edge e in common, then Piu[(u,v)}uPx has a directed cycle containing (u,v). In this instance, the flow along this cycle can be reduced by a single unit without any need to change the size of the overall flow. Return the resulting flow.]

3) Reduce flow by one unit along P_1U{(u,v)}UP_2

4) Run Ford-Fulkerson with this sterling flow.

Justification and running time: Say the original flow has see F. Lees ignore the special case (4 After step (3) Of the elgorithuk we have a legal flaw that satisfies the new capacity constraint and has see F-1. Step (4). FOrd-Fueerson, then gives us the optimal flow under the new cePacie co mint. However. we know this flow is at most F, end thus Ford-Fulkerson runs for just one iteration. Since each of the steps is linear, the total running time is linear, that is, O(lVl + lEl).

4 0
3 years ago
Please help me out!!!
Alecsey [184]

Answer:

d

Step-by-step explanation:

if u substitute -4 in the equation it will give u a math error

5 0
3 years ago
Read 2 more answers
Other questions:
  • Which of the following is equivalent to -7/-12?<br><br> 7/-12<br> 7/12<br> 12/7
    13·2 answers
  • There are 12 students in the gym class. If 14 students can sit on the bench, how many benches are needed for all students
    5·1 answer
  • Simplify completely 3x4+5x2+2x/x​
    5·1 answer
  • What is the area of this figure?
    12·2 answers
  • What's the correct equation
    14·1 answer
  • A 10 foot ladder is leaning against a building. The ladder makes a 45 degree angle with the building. How far up the building do
    6·2 answers
  • Someone help me out please
    14·2 answers
  • Find: (a) the equations of the graphs
    13·1 answer
  • Write two numbers that multiply to the value on top and add to the value on bottom.
    8·2 answers
  • A machine that fills bottles on an assembly line does so according to a normal distribution, where the mean amount of liquid pou
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!