✳flâneur — a map of the web's best reading
IA Probability - Classical probability
dec41.user.srcf.net · 1,748 words · saved by 1 readers
1Classical probability
IA Probability - Classical probability 1 Classical probability IA Probability 1.2 Coun ting T o find probabilities, w e often need to c ount things. F or example, in our example ab o ve, w e had to coun t the n umber of elemen ts in B k . Example. A menu has 6 starters, 7 mains and 6 desserts. How many possible meals combinations are there? Clearly 6 × 7 × 6 = 252. Here we are using the fundamen tal rule of coun ting: Theorem (F undamental rule of coun ting) . Suppose we ha ve to make r m ultiple c hoices in sequence. There are m 1 p ossibilities for the first c hoice, m 2 p ossibilities for t
Explore this link on the map →related reading
- Introduction to Probability by Joseph K. Blitzstein, Jessica Hwang (z-lib.org).pdfuni.dcdev.ro
- Ordered Sampling Without Replacement | Permutation | Factorial | Birthday Paradoxprobabilitycourse.com
- Unordered Sampling Without Replacement | Combinations | Binomial Distribution | Bernoulliprobabilitycourse.com
- Counting | Combinatorics | Multiplication Principle | Samplingprobabilitycourse.com
- Combinatorics Solved Problemsprobabilitycourse.com
- A Mathematical Theory of Communicationpeople.math.harvard.edu
- Poisson distribution - Wikipediaen.wikipedia.org
- 275A, Notes 0: Foundations of probability theory | What's newterrytao.wordpress.com
- Understanding the Birthday Paradox – BetterExplainedbetterexplained.com
- CS106B At the ballot boxweb.stanford.edu
- Stirling numbers of the second kind - Wikipediaen.wikipedia.org
- Napkin.pdfvenhance.github.io