2 years ago

Helppppppppppppppppppppppp!!!!!!!!!! Plz

Mathematics

1 answer:

taurus [48]2 years ago

4 0

Answer:

Step-by-step explanation:

the answer is a as proven by the othee options being false

You might be interested in

Suppose that 3 cards are drawn from a well-shuffled deck of 52 cards. What is the probability that all 3 are diamonds?

Marat540 [252]

There are 13 diamonds in the deck, so $\dbinom{13}3$ ways of drawing 3 diamonds.

There is a total of $\dbinom{52}3$ ways of drawing any 3 cards from the deck.

So the probability of drawing 3 diamonds is

$\dfrac{\binom{13}3}{\binom{52}3}=\dfrac{11}{850}\approx0.012941$

where $\dbinom nk=\dfrac{n!}{k!(n-k)!}$ .

5 0

2 years ago

How is 0.004 the same as and different from 0.444?

Lorico [155]

Answer:both are in thousandths place,in the thousandths place both have 4 as a value

Step-by-step explanation:

8 0

2 years ago

Read 2 more answers

Please Help!!!

Harman [31]

Answer: You will save $228 dollars after 12 weeks

Step-by-step explanation:

3 0

3 years ago

Write an recursive formula for An, the nth term of the sequence<br> 5, -2, -9,

oksian1 [2.3K]

Given:

The given sequence is:

$5,-2,-9,...$

To find:

The recursive formula for $a_n$ , the nth term of the sequence.

Solution:

We have,

$5,-2,-9,...$

Here, the first term is 5.

$-2-5=-7$

$-9-(-2)=-9+2$

$-9-(-2)=-7$

The common difference is -7.

The recursive formula for the nth term of the sequence is

$a_n=a_{n-1}+d$

Where, $d$ is the common difference.

Putting $d=-7$ in the above formula, we get

$a_n=a_{n-1}+(-7)$

$a_n=a_{n-1}-7$

Therefore, the recursive formula for the nth term of the sequence is $a_n=a_{n-1}-7$ .

3 0

2 years ago

A quadrilateral is sometimes a square? <br><br> True or False

Vesnalui [34]

I know this ...... it is false

7 0

2 years ago

Read 2 more answers