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
lisov135 [29]
3 years ago
11

PLS HELP Find the volume.

Mathematics
1 answer:
bazaltina [42]3 years ago
8 0

Answer:

660

Step-by-step explanation:

V= l×w×h/3

V= 24×11×7.5/3

V=1 980÷3

V= 660

You might be interested in
85 x 63 whoever gets it gets braiest
Katena32 [7]
<span>85 x 63 = 5355

hope it helps

---------------------</span>
6 0
3 years ago
Read 2 more answers
If both diagonals of a quadrilateral bisect each other when is the quadrilateral a parallelogram?
slamgirl [31]
It is more than just a quadrilateral. In fact it is going to be hard to pick.

These facts suit a square,  a rectangle, a rhombus, and a parallelogram. And the above statement is true, but maybe a little harder to prove than the converse of the statement, which is the usual one you find.

The converse is "If you have a parallelagram, the diagonals bisect each other."

You might think a trapezoid deserves some mention. The diagonals of a trapezoid do not bisect each other.
6 0
3 years ago
Suppose that you are given a bag containing n unbiased coins. You are told that n-1 of these coins are normal, with heads on one
gladu [14]

Answer:

The (conditional) probability that the coin you chose is the fake coin is 2/(1 + n)

Step-by-step explanation:

Given

Total unbiased coin = n

Normal coins =n - 1

Fake = 1

The (conditional) probability that the coin you chose is the fake coin is represented by

P(Fake | Head)

And it's calculated as follows;

P(Fake | Head) = P(Fake, Head) ÷ P(Head) ----- (1)

Where P(Fake, Head) = P(Fake) * P(Head | Fake)

P(Fake) = 1/n --- because only one is fake

P(Head | Fake) = n/n because all coins (including the fake) have head

So, P(Fake, Head) = P(Fake) * P(Head | Fake) becomes

P(Fake, Head) = 1/n * n/n

P(Fake, Head) = 1/n

P(Head) is calculated by

P(Fake) * P(Head | Fake) + P(Normal) * P(Head | Normal)

P(Fake) * P(Head | Fake) = P(Fake, Head) = 1/n (as calculated above)

P(Normal) * P(Head | Normal) = ½ * (n - 1)/n ----- considering that the coin also has a tail with equal probability as that of the head.

Going back to (1)

P(Fake | Head) = P(Fake, Head) ÷ P(Head) becomes

P(Fake | Head) = (1/n) ÷ ((1/n) + (½(n-1)/n))

= (1/n) ÷ ((1/n) + (½(n-1)/n))

= (1/n) ÷ (1/n + (n - 1)/2n)

= (1/n) ÷ (2 + n - 1)/(2n)

= (1/n) ÷ (1 + n)/(2n)

= (1/n) * (2n)/(1 + n)

= 2/(1 + n)

Hence, the (conditional) probability that the coin you chose is the fake coin is 2/(1 + n)

5 0
3 years ago
What is 22 less than 15​
blsea [12.9K]

Answer: Algebraic: 15-22

Simply:-7

Step-by-step explanation:

Less than means to take away from, so in this case we are taking away 22 from 15

6 0
3 years ago
Use a model to solve 13 x 4/9 . Leave your answer as an improper fraction.
ivanzaharov [21]

Step-by-step explanation:

13×4/9=52/9

answer as improper fraction is 52/9

3 0
2 years ago
Read 2 more answers
Other questions:
  • Harold measures the heights in inches of the new plants that are growing in his greenhouse. He records the lengths shown below a
    11·1 answer
  • List three tools and equipment needed for baking​
    6·2 answers
  • (6) Please check ans
    9·1 answer
  • Find the distance between the two points using the pythagorean theorem (3,2) and (7,5)​
    15·1 answer
  • What does A(2,5) become after rotated 360 degrees?
    11·1 answer
  • 3x + (-9x) + 12 + 8
    6·2 answers
  • How do you ratify the denominator for 2/ 2(sqrt2)? When I multiply by sqrt2/sqrt 2 I'm still left with a radical in the denomina
    11·1 answer
  • If y = 4x + 0.5, find y when x =1.5
    8·1 answer
  • Graph the image of the figure using the transformation given. (across y=-x)
    14·1 answer
  • F(x)=-(-1)^2+ 2(-1)-1
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!