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
gregori [183]
3 years ago
11

Need help on work!!!

Mathematics
1 answer:
Juliette [100K]3 years ago
4 0

Answer:

you have chosen the correct answer

Step-by-step explanation:

the answer is 9.45

3/6.30=4.5/x

4.5*6.30=28.35

28.35/3= 9.45

You might be interested in
HELP[ WILL MARK BRAINLIEST!!!
Bess [88]

the answer is a, please mark me brainliest!

8 0
3 years ago
Read 2 more answers
Sammy has 2 pair of jeans, 3 pair of black pants, and 1 skirt. She also has 2 pink shirts, 4 striped shirts, and 2 hooded sweats
Diano4ka-milaya [45]

Answer: 72

Step-by-step explanation:

Ok, in her legs the options are:

2 jeans + 3 black pants + 1 skirt = 6 options.

on her torso the options are:

2 pinks shirts + 4 striped shirts = 6 options.

And on top of that she has:

2 hooded sweatshirts = 2 options.

The total number of combinations is equal to the product of options for each type of garmet; this is:

C = 6*6*2 =36*2 = 72

So she has 72 different outfits.

3 0
3 years ago
Miranda baked 48 muffins to sell at the school bake sale. She sold 2/3 of the muffins and gave the rest to her friends to eat. H
Murrr4er [49]
I hope this helps you



48.2/3



16.2


32 sold


7 0
3 years ago
Give a combinatorial proof that if n is a positive integer, then
gregori [183]

The Empire is attacking a Rebel base that is stocked with n X-wings and n Y-wings. The Rebels need to build a fleet consisting of n ships (with at least 1 X-wing), to be led by 1 pilot in an X-wing.

There are \binom n1=n ways of picking the leader, and \binom{2n-1}{n-1} ways of building the rest of the fleet, so there's a total of

n\dbinom{2n-1}{n-1}

ways of building such a fleet.

In the other direction, suppose we build a fleet comprising of k X-wings and n-k Y-wings. We have \binom nk ways of picking X-wings and \binom n{n-k} ways of picking Y-wings. Also from the k X-wings we pick 1 to be the leader, which we can do in \binom k1=k ways. So there are

k\dbinom nk\dbinom n{n-k}

ways of building such a fleet. But since

\dbinom nk=\dbinom n{n-k}, we have

k\dbinom nk^2

ways of building the fleet with these specifications. Sum over all possible values of k,

\displaystyle\sum_{k=1}^nk\binom nk^2

4 0
4 years ago
13.8 x 7.9<br> What is the answer
dimulka [17.4K]

Answer:

Answer 109.02i hope it is helpful have a nice day

8 0
3 years ago
Read 2 more answers
Other questions:
  • 4) Solve the equation below. You can type out your steps, record your steps or upload a picture of your steps. Make sure to show
    13·1 answer
  • Blaine buys 2 books and the total cost is $24.18. What is the constant of proportionality that relates the cost in dollars, y, t
    15·1 answer
  • Cicily wants to estimate the answer to this problem to see if her answer is reasonable.
    13·1 answer
  • Sandy is working with a carpenter to frame a house. They are using 8-foot-long boards, but each board must be cut to be 7 feet,
    9·1 answer
  • Geometry- please explain when you answer. #16
    15·1 answer
  • Three friends share the total cost of a game. Joe pays 30%, Mike pays , and Tony pays the rest.
    5·2 answers
  • Find x <br><br> H,I x+12<br> I,J 16+x<br> H,J 20
    13·2 answers
  • Simplify 5a×3×2b<br><br> Write down the answer, please.
    7·1 answer
  • Can someone pls answer this question
    10·1 answer
  • Can you help me i will mark brainliest
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!