Counting Probability & Statistics Basics - 10 Coin Tosses

  • Thread starter Thread starter mathwurkz
  • Start date Start date
  • Tags Tags
    Counting
AI Thread Summary
A fair coin tossed 10 times results in 2^10, or 1024 possible sequences. To find the number of sequences with exactly 3 heads, the calculation involves combinations, specifically "10 choose 3." This is computed as 10!/(3!7!), yielding 120 distinct sequences. Understanding combinations is essential for solving such probability problems effectively. Mastery of these concepts will aid in tackling more complex statistical challenges.
mathwurkz
Messages
41
Reaction score
0
I'm taking a crack at learning probability and statistics starting from the basics. Anyways here is the question.

---
A fair coin is tossed 10 times and the sequence of scores recorded.

How many sequences are there?

How many sequences are there that contain exactly 3 heads?

---

The first one is no problem. I understand it. It simply is 2^10 = 1024 possible sequences.

The second one is the one i have trouble dealing with. How do you compute it with that special case added in? The answer given is 120.
 
Physics news on Phys.org
eg THHHTTTT... THTT...THT..TTH. your counting the exact number of sequeences that have only ("exactly") 3 HHH. not necessary in successive order(that is THHHT)
 
mathwurkz said:
A fair coin is tossed 10 times and the sequence of scores recorded.

How many sequences are there?

How many sequences are there that contain exactly 3 heads?

For the second one, you have exactly 3 heads.

_, _, _, _, _, _, _, _, _, _

Each spot corresponds to a coin toss. First spot corresponds to the first toss, the second spot the second toss, etc.

You have 3 of the ten spots you need to put a head. One way to do this is to put a head in the first, second and third spots. Another way to do it is to place it one in the first spot one in the third spot and one in the last spot. You could list all the 120 possible ways to put 3 heads in 10 spots but there is an easier way.

If you have looked at combinations at all then by now you should see that the answer is just 10 choose 3.

<br /> \frac{10!}{3!7!} = 120 <br />

If you have not looked at combinations then I would recommend you study combinations before trying to work this kind of problem out.

Best of luck,
 
Last edited:
Thread 'Collision of a bullet on a rod-string system: query'
In this question, I have a question. I am NOT trying to solve it, but it is just a conceptual question. Consider the point on the rod, which connects the string and the rod. My question: just before and after the collision, is ANGULAR momentum CONSERVED about this point? Lets call the point which connects the string and rod as P. Why am I asking this? : it is clear from the scenario that the point of concern, which connects the string and the rod, moves in a circular path due to the string...
Thread 'A cylinder connected to a hanged mass'
Let's declare that for the cylinder, mass = M = 10 kg Radius = R = 4 m For the wall and the floor, Friction coeff = ##\mu## = 0.5 For the hanging mass, mass = m = 11 kg First, we divide the force according to their respective plane (x and y thing, correct me if I'm wrong) and according to which, cylinder or the hanging mass, they're working on. Force on the hanging mass $$mg - T = ma$$ Force(Cylinder) on y $$N_f + f_w - Mg = 0$$ Force(Cylinder) on x $$T + f_f - N_w = Ma$$ There's also...

Similar threads

Back
Top