Heads or tails? (Question from Feynman lectures)

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
4 replies · 2K views
#neutrino
Messages
51
Reaction score
2
I have been going through feynmans lectures on probability and have a few questions that i can't answer ; in the part regarding fluctuations he introduces us to tree diagrams(pascals triangle ) and gives an example regarding the toss of a coin
If we consider the no. Of tosses as n and no. Of heads as k then it can be given as
( n) n!
( k ) = ----
k!(n-k)!
I know that n! Represents n factorial and the fact that probability is generally
Given by
Probability = highest estimate of an event
----------------------------
Total no. Of events
However what i don't get is why do we multiply k! By (n-k)! Souldnt it be n! In the denominator and k! In the numerator ?
I know it has something to do with the triangle however unable to figure it out
 
Physics news on Phys.org
#neutrino said:
I have been going through feynmans lectures on probability and have a few questions that i can't answer ; in the part regarding fluctuations he introduces us to tree diagrams(pascals triangle ) and gives an example regarding the toss of a coin
If we consider the no. Of tosses as n and no. Of heads as k then it can be given as
( n) n!
( k ) = ----
k!(n-k)!
I know that n! Represents n factorial and the fact that probability is generally
Given by
Probability = highest estimate of an event
----------------------------
Total no. Of events
However what i don't get is why do we multiply k! By (n-k)! Souldnt it be n! In the denominator and k! In the numerator ?
I know it has something to do with the triangle however unable to figure it out
The equation is (n)= n!
(k) -----
k!(
 
The equation is (n)= n!
-----
k!(n-k)!
 
You're actually asking, I think, about how many ways you can get ##k## heads from ##n## coin tosses. And why the answer is ##\frac{n!}{(n-k)! k!}##

You could start by taking ##n = 5##, say, and counting all the ways you can get ##k = 0, 1, 2, 3, 4## and ##5##.

Then see whether that fits the formula, and why.
 
BTW (just in case anyone is interested), this was not Feynman's lecture, but Matt Sands' lecture. Feynman had to go out of town on some business for a week, so Matt Sands gave the lectures that became FLP Vol. I Chapters 5 and 6.
 
  • Like
Likes   Reactions: Vivek des