All categories

2 years ago

___ L = 240 kL ? A. 24,000 B. 240,000 C. 0.240 D. 2.4

Mathematics

2 answers:

koban [17]2 years ago

6 0

It's b 240000
I'm sorry if wrong I'm not too good at these things

Hitman42 [59]2 years ago

6 0

Answer: B.240,000
240 Kiloliter =240,000 Liter

You might be interested in

Describe the rule for the sequence 2, 1, 2/3, 1/2, 2/5, 1/3, 1/7,...

Triss [41]

Multiply 2 by 1/2 to get 1.

Multiply 1 by 2/3 to get 2/3.

Multiply 2/3 by 3/4 to get 6/12 = 1/2.

Multiply 1/2 by 4/5 to get 4/10 = 2/5.

Multiply 2/5 by 5/6 to get 10/30 = 1/3.

Multiply 1/3 by 6/7 to get 6/21 = 2/7. (I suspect there's a typo in the question.)

And so on, so that the nth term in the sequence is multiplied by n/(n + 1) to get the (n + 1)th term.

Recursively, the sequence is given by

$\begin{cases}a_1=2\\a_n=\dfrac{n-1}na_{n-1}&\text{for }n>1\end{cases}$

We can solve this exactly by iterating:

$a_n=\dfrac{n-1}na_{n-1}=\dfrac{n-1}n\dfrac{n-2}na_{n-1}=\dfrac{n-1}n\dfrac{n-2}{n-1}\dfrac{n-3}{n-2}a_{n-3}=\cdots$

and so on down to

$a_n=\dfrac{(n-1)\cdot(n-2)\cdot(n-3)\cdot\cdots\cdot3\cdot2\cdot1}{n\cdot(n-1)\cdot(n-2)\cdot\cdots\cdot4\cdot3\cdot2}a_1$

$a_n=\dfrac{(n-1)!}{n!}a_1$

and with lots of cancellation, we end up with

$a_n=\dfrac{a_1}n=\boxed{\dfrac2n}$

6 0

2 years ago

Apply each of the four counting/sampling methods (with replacement and with ordering, without replacement and with ordering, wit

dusya [7]

Answer:

Step-by-step explanation:

I will illustrate this solution with a unique birthday party situation between Jane (the celebrant) and her 10 friends.

In the said party , we will assume that Jane only has 5 chocolates to share among her friends

i. Assuming that the 5 chocolates are of the same type, if she doesn't want to give any friend more than one piece of chocolate, the situation here is said to be WITHOUT REPLACEMENT & UN-ORDERED

n = 10 and k = 5

Total number of possible combinations becomes,

$(\left {n} \atop {k}} \right. )=(\left {10} \atop {5}} \right. )=252$

ii. Assuming that the 5 pieces of chocolate are of the same type and she is willing to give a friend more than one piece of chocolate, the situation is said to be WITH REPLACEMENT & UN-ORDERED

n = 10 and k = 5

Total number of possible combinations becomes,

$(\left {n+k-1} \atop {k}} \right. )=(\left {14} \atop {5}} \right. )=2002$

iii. Assuming that the 5 pieces of chocolate are of different types and she isn't willing to give any friend more than one piece of chocolate, the situation is said to be WITHOUT REPLACEMENT & ORDERED

n = 10 & k = 5

Total number of possible combinations becomes,

$P\left {n} \atop {k}} \right=P\left {10} \atop {5}} \right. =30240$

iv. Assuming the the 5 pieces of chocolate are of different types, if she is willing to give a friend more than one piece of chocolate, the situation is said to be WITH REPLACEMENT & ORDERED

n = 10 AND k = 5

Total number of combinations becomes

$n^k=10^5=100,000$

Sampling with replacement means that one friend can be sampled more than once i.e: A friend receives a piece of chocolate more than once

The order dictates how the sampling is applied.

3 0

3 years ago

A number that can be writtin as a fraction oftwo integers is called a ....

Keith_Richards [23]

Answer:

Step-by-step explanation:

5 0

2 years ago

Read 2 more answers

Use Gaussian elimination to find the complete solution to the system of equations, or state that none exists. Show your work. 4x

Kisachek [45]

You should find that your system doesn't have solutions. This is also confirmed by the fact that the determinant of the matrix of the coefficient of the variables x, y and z is equal to zero.

7 0

2 years ago

Round 82290 times 240

Alona [7]

19,749,600 is the correct answer. according to calculator

8 0

2 years ago