Ask question

Ask question

All categories

3 years ago

9

Jeff has a box containing 26 tiles, each with a different letter of the alphabet. he randomly draws 4 letters, one at a time wit

hout replacement. what is the probability that he will choose the letters n, w, b, t?

1 answer:

MArishka [77]3 years ago

8 0

The probability to choose letter n is $\frac{1}{26}$ . After drawing letter n there left 25 letters and the probability to choose the letter w is $\frac{1}{25}$ . After drawing two letters n and w there left 24 letters and then the probability to choose letter b is $\frac{1}{24}$ . After drawing three letters n, w and b there left 23 letters, so the probability to choose letter t is $\frac{1}{23}$ .
Using the product rule for probabilities, you can obtain that $P= \frac{1}{26} * \frac{1}{25} * \frac{1}{24}* \frac{1}{23} =0.0000027$ .

You might be interested in

I'LL MARK YOU BRAINLIEST HELP PLS XOXO

Pavel [41]

The answer is 240 to put in c hope this helps

3 0

3 years ago

1. Total selling price: $420,<br> Maine sales tax rate:<br> 5 percent.<br> Find the sales tax.

denpristay [2]

Answer: 21

Step-by-step explanation:

5%x420= 21

7 0

3 years ago

Trina has 72 collectors stamp she puts 43

ryzh [129]

116 if you add 72 plus 43

7 0

3 years ago

Read 2 more answers

Equation for= Y=x shift the graph up 5 units

telo118 [61]

Answer:

y = x + 5

Step-by-step explanation:

The graph of the ramp function y = x is a straight line with slope +1 and passing through the origin. If the whole graph is shifted up 5 units, the equation/function becomes

y = x + 5. The resulting graph is parallel to y = x.

5 0

3 years ago

Prove that if n is a perfect square then n + 2 is not a perfect square

notka56 [123]

Answer:

This statement can be proven by contradiction for $n \in \mathbb{N}$ (including the case where $n = 0$ .)

$\text{Let $n \in \mathbb{N}$ be a perfect square}$ .

$\textbf{Case 1.} ~ \text{n = 0}$ :

$\text{$n + 2 = 2$, which isn't a perfect square}$ .

$\text{Claim verified for $n = 0$}$ .

$\textbf{Case 2.} ~ \text{$n \in \mathbb{N}$ and $n \ne 0$. Hence $n \ge 1$}$ .

$\text{Assume that $n$ is a perfect square}$ .

$\text{$\iff$ $\exists$ $a \in \mathbb{N}$ s.t. $a^2 = n$}$ .

$\text{Assume $\textit{by contradiction}$ that $(n + 2)$ is a perfect square}$ .

$\text{$\iff$ $\exists$ $b \in \mathbb{N}$ s.t. $b^2 = n + 2$}$ .

$\text{$n + 2 > n > 0$ $\implies$ $b = \sqrt{n + 2} > \sqrt{n} = a$}$ .

$\text{$a,\, b \in \mathbb{N} \subset \mathbb{Z}$ $\implies b - a = b + (- a) \in \mathbb{Z}$}$ .

$\text{$b > a \implies b - a > 0$. Therefore, $b - a \ge 1$}$ .

$\text{$\implies b \ge a + 1$}$ .

$\text{$\implies n+ 2 = b^2 \ge (a + 1)^2= a^2 + 2\, a + 1 = n + 2\, a + 1$}$ .

$\text{$\iff 1 \ge 2\,a $}$ .

$\text{$\displaystyle \iff a \le \frac{1}{2}$}$ .

$\text{Contradiction (with the assumption that $a \ge 1$)}$ .

$\text{Hence the original claim is verified for $n \in \mathbb{N}\backslash\{0\}$}$ .

$\text{Hence the claim is true for all $n \in \mathbb{N}$}$ .

Step-by-step explanation:

Assume that the natural number $n \in \mathbb{N}$ is a perfect square. Then, (by the definition of perfect squares) there should exist a natural number $a$ ( $a \in \mathbb{N}$ ) such that $a^2 = n$ .

Assume by contradiction that $n + 2$ is indeed a perfect square. Then there should exist another natural number $b \in \mathbb{N}$ such that $b^2 = (n + 2)$ .

Note, that since $(n + 2) > n \ge 0$ , $\sqrt{n + 2} > \sqrt{n}$ . Since $b = \sqrt{n + 2}$ while $a = \sqrt{n}$ , one can conclude that $b > a$ .

Keep in mind that both $a$ and $b$ are natural numbers. The minimum separation between two natural numbers is $1$ . In other words, if $b > a$ , then it must be true that $b \ge a + 1$ .

Take the square of both sides, and the inequality should still be true. (To do so, start by multiplying both sides by $(a + 1)$ and use the fact that $b \ge a + 1$ to make the left-hand side $b^2$ .)

$b^2 \ge (a + 1)^2$ .

Expand the right-hand side using the binomial theorem:

$(a + 1)^2 = a^2 + 2\,a + 1$ .

$b^2 \ge a^2 + 2\,a + 1$ .

However, recall that it was assumed that $a^2 = n$ and $b^2 = n + 2$ . Therefore,

$\underbrace{b^2}_{=n + 2)} \ge \underbrace{a^2}_{=n} + 2\,a + 1$ .

$n + 2 \ge n + 2\, a + 1$ .

Subtract $n + 1$ from both sides of the inequality:

$1 \ge 2\, a$ .

$\displaystyle a \le \frac{1}{2} = 0.5$ .

Recall that $a$ was assumed to be a natural number. In other words, $a \ge 0$ and $a$ must be an integer. Hence, the only possible value of $a$ would be $0$ .

Since $a$ could be equal $0$ , there's not yet a valid contradiction. To produce the contradiction and complete the proof, it would be necessary to show that $a = 0$ just won't work as in the assumption.

If indeed $a = 0$ , then $n = a^2 = 0$ . $n + 2 = 2$ , which isn't a perfect square. That contradicts the assumption that if $n = 0$ is a perfect square, $n + 2 = 2$ would be a perfect square. Hence, by contradiction, one can conclude that

$\text{if $n$ is a perfect square, then $n + 2$ is not a perfect square.}$ .

Note that to produce a more well-rounded proof, it would likely be helpful to go back to the beginning of the proof, and show that $n \ne 0$ . Then one can assume without loss of generality that $n \ne 0$ . In that case, the fact that $\displaystyle a \le \frac{1}{2}$ is good enough to count as a contradiction.

7 0

3 years ago