Coin Probability: Odds of One vs Rest

  • Thread starter Thread starter ArcanaNoir
  • Start date Start date
  • Tags Tags
    Probability
Click For Summary

Homework Help Overview

The discussion revolves around the probability of one person being at odds with the rest when n people flip a coin. The original poster presents a formula and attempts to derive the probability but encounters discrepancies in their calculations.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore various cases for small values of n (2, 3, 4, and 5) to identify patterns in the outcomes. There are attempts to derive a general formula based on these cases, with some questioning the relevance of order in the outcomes.

Discussion Status

Participants are actively engaging with the problem, sharing their reasoning and calculations. Some have suggested that the original formula may not apply correctly for all values of n, particularly n=2. There is a recognition of potential errors in the problem statement itself, and some participants are providing guidance on how to approach the counting of outcomes.

Contextual Notes

There is mention of a possible oversight in the problem's formulation, as well as a discussion on the implications of counting permutations and combinations in the context of the probability problem.

ArcanaNoir
Messages
778
Reaction score
4

Homework Statement



If n people flip a coin what is the probaility that one is at odds with the rest?
(answer is [itex]n2^{1-n}[/itex])

Homework Equations


The Attempt at a Solution



I tried (2/2)(1/2)(1/2)(1/2)... and figure that equaled [itex]\frac{1}{2^{n-1}}[/itex] but that isn't the answer. :(
 
Physics news on Phys.org
Try listing the possibilities for n=2 and n=3 explicitly, and see if you can see the pattern. What you have used for the formula doesn't correspond to what the question is asking.

For n=2, we have two possibilities: TH or HT, and obviously we don't care about the order.

For n=3, we have six possibilities: THH, HTH, HHT, HTT, THT and TTH and again we don't care about the order.

Try to convert these explicit cases into a formulaic representation.
 
Okay. for two people: HH, HT, TT = 1/3
three people: HHH, HHT, HTT, TTT = 2/4
Four people: HHHH, HHHT, HHTT, HTTT, TTTT = 2/5
five people= HHHHH, HHHHT, HHHTT, HHTTT, HTTTT, TTTTT = 2/6

So I'm thinking 2/(n+1), except that doesn't work for two people, but hey, I can specify 3 or more peoples easy. Problem is, this is not the answer either. :confused:
 
You have the pattern XYYYYYY here.
How many ways to shuffle that?
 
Hmm... no that's not right. Sorry, I think you read further into my "we don't care about order" statement than I was intending. I probably shouldn't have written that in the first place. The probability for 2 people, for instance, would be 1/2, since it could happen by getting HT or TH, and the total possibilities are HH, TH, HT, TT.

I'll let you work with Serena on this, as I see she's helped you before.
 
Oh okay, order does matter.

For two people: (Shuffle XY)(P XY) = (2!/2!)(2/2)(1/2) = 1/2
Three people: (Shuffle XXY)(P XXY) = (3!/2!)(2/2)(1/2)(1/2) = 3/4

So for four peeps: (4!/3!)(2/2)(1/2^3)

So for n peeps: [tex](\frac{n!}{(n-1)!})(\frac{1}{2^{n-1}}) = n2^{1-n}[/tex] correct?
 
Yep! :smile:

Note that the formula breaks down for n=2.
It seems that the author of your problem has been sloppy.
(Or was there an extra condition that n>2?)
 
No extra condition. Author was sloppy. Book just came out this summer. Sloppy author is actually prof at MY university. Uck. I hate errors.

Um, on a shuffling side note (I don't see why I still don't get it) take a look at these:

a) 6,7,8,9
b) 6,7,8,8
c) 7,7,8,8
d) 7,8,8,8

Now, how many ways can I shuffle each?

For a) I tried 4!/(1!1!1!1!4!) but that equal 1. What gives?
For b) 4!/(1!1!2!2!)= 6 but isn't it 10? (by tabling)
For c) 4!/(2!2!2!)= 3 but isn't it 6?
For d) I tried 4!/(1!3!) = 4 which I think is correct.
 
If you flip a coin n times the probability of m "heads" and "n- m" tails is
[tex]\left(\begin{array}{c}n \\ m\end{array}\right)\frac{1}{2^n}[/tex].

If I read your question correctly, you want the probability that either there are n-1 heads and 1 head or n-1 tails and 1 head.
 
  • #10
ArcanaNoir said:
No extra condition. Author was sloppy. Book just came out this summer. Sloppy author is actually prof at MY university. Uck. I hate errors.

Um, on a shuffling side note (I don't see why I still don't get it) take a look at these:

a) 6,7,8,9
b) 6,7,8,8
c) 7,7,8,8
d) 7,8,8,8

Now, how many ways can I shuffle each?

For a) I tried 4!/(1!1!1!1!4!) but that equal 1. What gives?
For b) 4!/(1!1!2!2!)= 6 but isn't it 10? (by tabling)
For c) 4!/(2!2!2!)= 3 but isn't it 6?
For d) I tried 4!/(1!3!) = 4 which I think is correct.

Well, there's shuffling and shuffling.
The correcting factor was because you were double-counting certain combinations.
That's not the case here.
I'll try to explain using your examples.

a) The permutions of 4 different specific numbers is simply 4! = 24

b) In this case you'd be double-counting the 8, so the number is 4! / 2! = 12
Actually, you'd have 4! / (1!1!2!).
Where did you get the last 2!? And how did you get 10?

c) Double-counting 7, and double-counting 8.
However, 7 and 8 are specific numbers, and not counted once for the one, and another time for the other number.
So: 4! / (2!2!) = 6.

d) Yes, this is correct.
 
  • #11
ArcanaNoir said:

Homework Statement



If n people flip a coin what is the probaility that one is at odds with the rest?
(answer is [itex]n2^{1-n}[/itex])

Homework Equations





The Attempt at a Solution



I tried (2/2)(1/2)(1/2)(1/2)... and figure that equaled [itex]\frac{1}{2^{n-1}}[/itex] but that isn't the answer. :(

If b(n,k) = C(n,k)/2^n = probability of getting k heads in n tosses (a binomial probability), then you want b(1,n) + b(n-1,n) = 2*n/2^n.

RGV
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 23 ·
Replies
23
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 22 ·
Replies
22
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
6
Views
1K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 15 ·
Replies
15
Views
8K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
23
Views
2K