All categories

3 years ago

Any number which is divisible by both 3 and 5 must…..

Mathematics

2 answers:

mariarad [96]3 years ago

8 0

The correct answer would be d

Mice21 [21]3 years ago

5 0

Answer:

Step-by-step explanation:

A is wrong because a factor of 15 is not divisible by both

B is wrong because 30 is even and divisible by both

C is wrong because 30 does not end with a 5

D is correct because there are no numbers other than multiples of 15 that doesn't lead to a decimal when you divide by those numbers

You might be interested in

There are four white socks and six black socks in a drawer. What is the probability of selecting a white sock, not replacing it,

m_a_m_a [10]

Answer:

A: 1/3

Step-by-step explanation:

please mark this answer as brainlest

8 0

3 years ago

Of the choices below, what is the best estimate of the speed of the milk van?

galben [10]

Answer:

A. 77 kilometers per hour

Step-by-step explanation:

Speeds of vehicles are normally calculated in kilometers per hour, meters per hour is too small the measurement and millimeters is even smaller.

7 0

3 years ago

Please pass this on... ( #helpsavelives )

Zielflug [23.3K]

Answer:

great..:)

Are u a motivational speaker??

4 0

3 years ago

Read 2 more answers

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

Y = 4x<br> 4x^2 + y = 20

Romashka [77]

Answer:

8X=4Y

Step-by-step explanation:

JUST ADD

4 0

3 years ago