1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Elza [17]
3 years ago
15

Ben and Allison each decide to wager 1 unit against the other person on flips of an unfair coin, with probability 0.6 of landing

head, until one of them runs out of money. When the flip lands on head, Ben wins 1 unit from Allison; and when the coin lands on tail, Allison wins 1 from Ben. At the start of the contest, Ben has 30 units and Allison has 45 units. Find (a) the average number of flips needed until Ben is eventually broke, (b) the average number of flips needed until Allison is eventually broke, and (c) the average number of flips needed until either Ben or Allison is eventually broke.
Mathematics
1 answer:
dolphi86 [110]3 years ago
5 0

Answer:

(A) 75 flips

(B) 75 flips

(C) 75 flips

Step-by-step explanation:

Normally, the coin will have to land on tail 30 sure times (Allison will win 30 units from Ben) before Ben will be broke.

This does not mean that the first 30 flips will favour Allison (that Ben will get broke in the first 30 flips) hence we use the probability of tail to ascertain how many times the coin will be flipped until 30 tails are gotten. And for each sure tail, the coin will be tossed/flipped a number of times before the probability of tail will be one.

Also note that the coin used for this experiment is a biased or unfair coin. That is, both sides - head and tail - don't have an equal probability of occurrence which is 1/2 or 0.5

Same method applies for Head. The coin will have to land on Head 45 sure times (where in each time, probability of head occurring is 1) before Allison will be broke.

(A) Average number of flips needed until Ben is broke

This is equal to the average number of flips it takes for a tail to be gotten for sure X the number of units Ben will lose until he's broke.

The number of flips it takes to get a tail for sure is 2.5 flips.

How? 3 flips will get p(T) = 1.2

Hence 2.5 flips will get p(T) = 1

And that is when Ben loses a unit of his money

Now, if in 2.5 flips we have a tail, it will take X flips for us to get 30 tails

Cross multiply:

X = (2.5×30) / 1 = 75 flips

(B) Using the same cross multiplication method, we find that it takes 1.667 flips for Ben to win 1 unit of Allison's money because in 2 flips, the probability of head is 1.2, which is above 1.

So since it takes 1.667 for Allison to lose 1 unit of his money, it will take X flips for Allison to lose 45 units of his money

Cross multiply:

X = (45×1.667)/1 = 75 flips

(C) We would have had to use a formula for this one but there is no need, since it takes the same 75 flips for either Ben or Allison to get broke.

You might be interested in
Help find the perimeter! Please help! (30 points)
lord [1]
The perimeter is 16, according to my calculations.
5 0
2 years ago
Read 2 more answers
Need help with the answer please and thank you
Ahat [919]

Answer: i think its 35

Step-by-step explanation:

3 0
3 years ago
The mean number of hours per day spent on the phone, according to a national survey, is four hours, with a standard deviation of
Reika [66]

Answer:

The new mean is 5.

The new standard deviation is also 2.

Step-by-step explanation:

Let the sample space of hours be as follows, S = {x₁, x₂, x₃...xₙ}

The mean of this sample is 4. That is,\bar x=\frac{x_{1}+x_{2}+x_{3}+...+x_{n}}{n}=4

The standard deviation of this sample is 2. That is, s=\frac{1}{n-1}\sum (x_{i}-\bar x)^{2}=2.

Now it is stated that each of the sample values was increased by 1 hour.

The new sample is: S = {x₁ + 1, x₂ + 1, x₃ + 1...xₙ + 1}

Compute the mean of this sample as follows:

\bar x_{N}=\frac{x_{1}+1+x_{2}+1+x_{3}+1+...+x_{n}+1}{n}\\=\frac{(x_{1}+x_{2}+x_{3}+...+x_{n})}{n}+\frac{(1+1+1+...n\ times)}{n}\\=\bar x+1\\=4+1\\=5

The new mean is 5.

Compute the standard deviation of this sample as follows:

s_{N}=\frac{1}{n-1}\sum (x_{i}-\bar x)^{2}\\=\frac{1}{n-1}\sum ((x_{i}+1)-(\bar x+1))^{2}\\=\frac{1}{n-1}\sum (x_{i}+1-\bar x-1)^{2}\\=\frac{1}{n-1}\sum (x_{i}-\bar x)^{2}\\=s

The new standard deviation is also 2.

5 0
3 years ago
I think the answer is b, is this correct?
Art [367]

Answer:

I think its D .

Step-by-step explanation:

hope this helps you

3 0
3 years ago
If two distinct positive divisors of 64 are randomly selected, what is the probability that their sum will be less than 32?
scZoUnD [109]

Answer: The required probability is \dfrac{10}{21}

Step-by-step explanation:

Since we have given that

Divisors of 64= 1,2,4,8,16,32,64

Sum would be less than 32

Since it has 7 divisors in total.

If we select any two distinct divisors from first five divisors, the sum will always less than 32.

So, the probability that their sum will be less than 32 is given by

\dfrac{^5C_2}{^7C_2}\\\\=\dfrac{10}{21}

Hence, the required probability is \dfrac{10}{21}

8 0
3 years ago
Other questions:
  • answer for points and do it RIGHT with PROOF/WORK Plus you get points I wasted 80 points on a wrong answer before so please do i
    12·1 answer
  • 1/2 of 118. #7 please help homework is due tomorrow
    11·2 answers
  • Leticia tretched for 8 minutes then jogged around her block several times .it takes her 6 minutes to run around the block once .
    15·1 answer
  • X + 12/x + 2 = x/x + 8<br> A) X = -4<br> B) X = 8<br> C) X = 6<br> D) X = -6
    9·1 answer
  • Which of the following linear equations has the steepest slope
    12·1 answer
  • What are the next two numbers? 0.3 , 0.7 , 1.1 , 1.5 ,
    5·2 answers
  • Y=5x-1 and -15x-3y=3 how many solutions does this have
    11·1 answer
  • HELP!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
    8·1 answer
  • If u help I’ll give u brainliest but please give correct answer
    9·1 answer
  • The following formula gives the area of a circle, A, dependent on its radius, r.
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!