Ask question

Ask question

All categories

3 years ago

5

By coincidence, Kimberly's Paint Supplies sold equal quantities of two paint colors yesterday: yellow and blue. All yellow paint

comes in 9-liter containers while blue paint is sold in 12-liter containers. What is the smallest amount of each paint color the store must have sold?

1 answer:

Vlad1618 [11]3 years ago

8 0

Answer:

36 liters

Step-by-step explanation:

We solve this question using the least common multiple method

Find and list multiples of the liter the blue paint comes in the liters the yellow paint comes in. We find the first common multiple is found. This is the least common multiple.

Multiples of 9:

9, 18, 27, 36, 45, 54

Multiples of 12:

12, 24, 36, 48, 60

Therefore,

LCM(9, 12) = 36

Hence, the smallest amount of each paint color the store must have sold is 36 liters

You might be interested in

The general form of the equation of a circle is Ax2 + By2 + Cx + Dy + E = 0, where A = B 0. If the circle has a radius of 3 unit

Lynna [10]

The correct answer is b.

8 0

3 years ago

Read 2 more answers

Which ordered pair is the solution to the system of equations? {y=3x−102x+3y=3

uysha [10]

(3,-1) for sure i took the test 100%
hope i helped out

8 0

3 years ago

Binomial Expansion/Pascal's triangle. Please help with all of number 5.

Mandarinka [93]

$\begin{matrix}1\\1&1\\1&2&1\\1&3&3&1\\1&4&6&4&1\end{bmatrix}$

The rows add up to $1,2,4,8,16$ , respectively. (Notice they're all powers of 2)

The sum of the numbers in row $n$ is $2^{n-1}$ .

The last problem can be solved with the binomial theorem, but I'll assume you don't take that for granted. You can prove this claim by induction. When $n=1$ ,

$(1+x)^1=1+x=\dbinom10+\dbinom11x$

so the base case holds. Assume the claim holds for $n=k$ , so that

$(1+x)^k=\dbinom k0+\dbinom k1x+\cdots+\dbinom k{k-1}x^{k-1}+\dbinom kkx^k$

Use this to show that it holds for $n=k+1$ .

$(1+x)^{k+1}=(1+x)(1+x)^k$
$(1+x)^{k+1}=(1+x)\left(\dbinom k0+\dbinom k1x+\cdots+\dbinom k{k-1}x^{k-1}+\dbinom kkx^k\right)$
$(1+x)^{k+1}=1+\left(\dbinom k0+\dbinom k1\right)x+\left(\dbinom k1+\dbinom k2\right)x^2+\cdots+\left(\dbinom k{k-2}+\dbinom k{k-1}\right)x^{k-1}+\left(\dbinom k{k-1}+\dbinom kk\right)x^k+x^{k+1}$

Notice that

$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{k!}{\ell!(k-\ell)!}+\dfrac{k!}{(\ell+1)!(k-\ell-1)!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{k!(\ell+1)}{(\ell+1)!(k-\ell)!}+\dfrac{k!(k-\ell)}{(\ell+1)!(k-\ell)!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{k!(\ell+1)+k!(k-\ell)}{(\ell+1)!(k-\ell)!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{k!(k+1)}{(\ell+1)!(k-\ell)!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dfrac{(k+1)!}{(\ell+1)!((k+1)-(\ell+1))!}$
$\dbinom k\ell+\dbinom k{\ell+1}=\dbinom{k+1}{\ell+1}$

So you can write the expansion for $n=k+1$ as

$(1+x)^{k+1}=1+\dbinom{k+1}1x+\dbinom{k+1}2x^2+\cdots+\dbinom{k+1}{k-1}x^{k-1}+\dbinom{k+1}kx^k+x^{k+1}$

and since $\dbinom{k+1}0=\dbinom{k+1}{k+1}=1$ , you have

$(1+x)^{k+1}=\dbinom{k+1}0+\dbinom{k+1}1x+\cdots+\dbinom{k+1}kx^k+\dbinom{k+1}{k+1}x^{k+1}$

and so the claim holds for $n=k+1$ , thus proving the claim overall that

$(1+x)^n=\dbinom n0+\dbinom n1x+\cdots+\dbinom n{n-1}x^{n-1}+\dbinom nnx^n$

Setting $x=1$ gives

$(1+1)^n=\dbinom n0+\dbinom n1+\cdots+\dbinom n{n-1}+\dbinom nn=2^n$

which agrees with the result obtained for part (c).

4 0

3 years ago

Bugbug0221 hollo hi<br> wut r u doing

givi [52]

Answer:

STealing points

Step-by-step explanation:

and you

6 0

2 years ago

Read 2 more answers

5x – 4y = 9<br> x - 2y = 3 <br> System of equation

padilas [110]

Answer:

{x,y}={5,4} x is =5 y= to 4

3 0

3 years ago