Od 10,-) 3 17 =-3x –10. What is be

In aâ€‹ lottery, 6 numbers are randomly sampled without replacement from the integers 1 to 50. Their order of selection is not i

nlexa [21]

Answer: 0.444225

Step-by-step explanation:

Given : The total number of tickets = 50

Number of tickets are randomly sampled without replacement =6

Since the order of selection is not important , so we use combinations.

Total number of ways to select 6 tickets = $^{50}C_6$

The number of winning tickets = 6

So, number of tickets that are not winning = 50-6=44

Number of ways of selecting zero winning numbers= $^{44}C_{6}$

Now , the probability of holding a ticket that has zero winning numbers out of the 6 numbers selected for the winning ticket out of the 50 possible numbers would be $\dfrac{^{44}C_{6}}{^{50}C_6}$

$=\dfrac{\dfrac{44!}{6!(44-6)!}}{\dfrac{50!}{6!(50-6)!}}\\\\\\=\dfrac{\dfrac{44\times43\times42\times41\times40\times39\times38!}{38!}}{\dfrac{50\times49\times48\times47\times46\times45\times44!}{44!}}\\\\\\=\dfrac{44\times43\times42\times41\times40\times39}{50\times49\times48\times47\times46\times45}\\\\=\dfrac{252109}{567525}\approx0.444225$

Hence, the required probability = 0.444225

8 0

3 years ago

Simplify log(16x²) ± 2㏒(1÷×)

sp2606 [1]

Answer: just simplify condense it then your answer will be log(16)

8 0

3 years ago

Help plz. need help getting to the answer

bulgar [2K]

The answer is x = -5, it looks like you got it right.

8 0

3 years ago

Each sequence below gives an explicit formula. Write the first five terms of each sequence. Then, write a recursive

Bas_tet [7]

Answer:

The first five values are 12, 14, 16, 18 and 20

The recursive formula is as follow

$\left \{ {{a_{1} =12} \atop {a_{n} =a_{n-1} } + 2} \right.$

Step-by-step explanation:

Since we need to find the first 5 values we start with n = 1 to n = 5. Note that we don't start from n = 0 as the question states that n ≥ 1.

For the first 5 values we just replace the value of n with 1, 2, 3, 4 and 5 and calculate the answer

$a_{1} = 2(1) + 10 = 12\\ a_{2} = 2(2) + 10 = 14\\ a_{3} = 2(3) + 10 = 16\\ a_{4} = 2(4) + 10 = 18\\ a_{5} = 2(5) + 10 = 20$

The first five values are 12, 14, 16, 18 and 20

A recursive formula is one that

a) Mentions the initial term

b) provides a formula connecting the previous term to the existing term.

Since we know the first term is 12, i.e $a_{1} = 12$ and we know that the difference between consecutive terms is 2 we can conclude that the recursive formula is made up of the following two formulas

$a_{1} = 12$

$a_{n} = a_{n-1} + 2$

The over all formula is as follow

$\left \{ {{a_{1} =12} \atop {a_{n} =a_{n-1} } + 2} \right.$

8 0

3 years ago

Write an equation of the line that is perpendicular to -x+y=15 and passes through the point (2,-5)

hichkok12 [17]

2-5=15

2+5=15

i think . sorry if its wrong

3 0

3 years ago