All categories

3 years ago

8. Stan made 4 goals out of 6 attempts in soccer today. What fraction

Mathematics

1 answer:

lisabon 2012 [21]3 years ago

8 0

Answer:

$\frac{4}{6}$

Step-by-step explanation:

You might be interested in

First, decide whether the distribution is a discrete probability distribution, then select the reason for making this decision.

Lyrx [107]

It is not a probability distribution, as the sum of the probabilities is more than 1, thus, the correct option is No, considering that:

c) Since the sum of the probabilities is not equal to 1.

-----------------------------------------

For the sequence $(x, P(X = x))$ representing a probability distribution, it is needed that:

All probabilities are between 0 and 1, that is, for all values of x, $0 \leq P(X = x) \leq 1$ .
The sum of all probabilities is 1, that is: $\sum_{i = 1}^n P(x_i) = 1$

In this problem, the sum of the probabilities is:

$\sum_{i = 1}^n P(x_i) = 0.39 + 0.69 + 0.12 = 1.20$

Sum is not 1, thus it is not a probability distribution, and the correct option is:

c) Since the sum of the probabilities is not equal to 1.

A similar problem is given at brainly.com/question/24858659

8 0

3 years ago

Help me please i need to do this fast

Archy [21]

hey im too lazy to do it but u should do the pythagorean theorem to find out

8 0

3 years ago

To write 1.65 × 102 in standard notation, move the decimal point two places to the left, true or false?

ivann1987 [24]

False. If you want to make 1.65 × 10to the power of 2 you would move it right two spots. Now if it was 1.65×10-2 then you would move it to the left.

5 0

3 years ago

Examine the right triangle. What is the length of the hypotenuse, c? Answers are in the pic

Olenka [21]

a^2+b^2=c^2 <----- the equation to find out sides for a right triangle

7 0

3 years ago

Read 2 more answers

Antonio is a freelance computer programer. In his work , he often uses the power of 2^n to find the number of ways bits (or unit

valentina_108 [34]

Answer: $2^{n} -1$

Justification:

As told in the statement, n stands for the number of bits, and $2^{n}$ is the highest number of ways n bits can be arranged in the system.

Now, Antonio wants to show that the character can collect one less key than that. So, that number is $2^{n}$ less 1, which is what the formula $2^{n}$ - 1 states.

4 0

4 years ago