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
pochemuha
3 years ago
12

Mary wants to mix sparkling soda and fruit punch to make a beverage. The recipe says, “Mix 1 cup of sparkling soda with 2 quarts

of fruit punch to make a beverage.” The ratio of sparkling soda to fruit punch is 1:8.
Mary should mix _____ fluid ounce(s) of sparkling soda with 72 fluid ounces of fruit punch to make her beverage.
Mathematics
1 answer:
-Dominant- [34]3 years ago
3 0

Answer:

9 fluid ounces of sparkling soda.

Step-by-step explanation:

The ratio is 1 to 8 so:

72 / 8 = 9

You might be interested in
Use A as the subject of formula<br>p= A ( 1+r\100)​
ZanzabumX [31]

Answer:

A = \frac{100 P}{100+r}

Step-by-step explanation:

Given P = A( 1 + \frac{r}{100} )

To make A as the subject of the formula we need to rearrange

Divide by (1 +\frac{r}{100})  throughout  we get

\frac{P}{1+\frac{r}{100}} = A

A = \frac{100P}{100 + r}

4 0
4 years ago
Please help need to get too 80%
Musya8 [376]

Answer:

1/50 is abswer ........

8 0
3 years ago
Solve for missing angle, show your work : HELP!
Serga [27]

Answer:

105

Step-by-step explanation:

The interior angles must sum to 360

360-91+82-82 = 105

7 0
3 years ago
Which diagram represents the end of a cube? Select all that apply
Studentka2010 [4]

Answer:

C

Step-by-step explanation:

8 0
3 years ago
Read 2 more answers
Identify at least one Hamilton path and at least one Hamilton circuit
Anna71 [15]

We will investigate how to determine Hamilton paths and circuits

Hamilton path: A path that connect each vertex/point once without repetition of a point/vertex. However, the starting and ending point/vertex can be different.

Hamilton circuit: A path that connect each vertex/point once without repetition of a point/vertex. However, the starting and ending point/vertex must be the same!

As the starting point we can choose any of the points. We will choose point ( F ) and trace a path as follows:

F\to D\to E\to C\to A\to B\to F

The above path covers all the vertices/points with the starting and ending point/vertex to be ( F ). Such a path is called a Hamilton circuit per definition.

We will choose a different point now. Lets choose ( E ) as our starting point and trace the path as follows:

E\to D\to F\to B\to A->C

The above path covers all the vertices/points with the starting and ending point/vertex are different with be ( E ) and ( C ), respectively. Such a path is called a Hamilton path per definition.

One more thing to note is that all Hamilton circuits can be converted into a Hamilton path like follows:

F\to D\to E\to C\to A\to B

The above path is a hamilton path that can be formed from the Hamilton circuit example.

But its not necessary for all Hamilton paths to form a Hamilton circuit! Unfortunately, this is not the case in the network given. Every point is in a closed loop i.e there is no loose end/vertex that is not connected by any other vertex.

4 0
1 year ago
Other questions:
  • Not 100% if this is correct please help!
    10·2 answers
  • (3y-2)/3+(2y+3)/3=(y+7)/6 step by step plz
    15·1 answer
  • 9. Stephanie gets her hair cut every 42 days. Her sister goes to the
    8·1 answer
  • Three friends are selling items at a bake sale. May makes $23.25 selling bread. Inez sells gift baskets and makes 100 times as m
    15·1 answer
  • WORTH 30 Points
    10·1 answer
  • What is a coefficient?​
    14·2 answers
  • Gfc of 12a^4 and 16a^2
    13·1 answer
  • How many 34 cup servings of granola can be measured from a box containing six cups of granola?
    13·1 answer
  • Classify each pair of numbered angles.
    14·2 answers
  • PLEASE HELP ASAP<br> WILL GIVE BRANLIEST<br> FIND THE SHADED AREA
    11·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!