SlideServe
Menu
Préférences
© SlideServe · v2026

Combinatorics

serena avatar
18 diapositives · 579 Views · Jul 13, 2014

Combinatorics. If you flip a penny 100 times, how many heads and tales do you expect?. Binomial distribution:. Independent events: the outcome (H,T) of the second coin does not depend on the outcome of the first. Typical sequence of result of 10 flips: HTTHTTTHTH

Combinatorics - slide 1
01 / 18Combinatorics
1 / 17

Télécharger la présentation

Combinatorics
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation
  1. Combinatorics

  2. If you flip a penny 100 times, how many heads and tales do you expect?

  3. Binomial distribution: • Independent events: the outcome (H,T) of the second coin does not depend on the outcome of the first. • Typical sequence of result of 10 flips: • HTTHTTTHTH • Given N fair coins, the probability of any given outcome sequence is (1/2)*(1/2)*…*(1/2)=1/2^N • The probability of HTTHTTTHTH is (1/2)^10=1/1024

  4. What if order doesn’t matter? • Two coins: the possible outcomes are: • 1) TT 2) TH 3) HT 4) HH • Each with probability ¼ • The probability of one head and one tail is equal to ½ since it can happen two different ways.

  5. Choosing subsets • A set of N elements has 2^N subsets if we include the empty set and the whole set. • Think of the set a set of N coins and the “chosen” subset of the ones that will be heads. • Binomial coefficients

  6. Let X1, X2, X3, ... Xn be a sequence of n independent and identically distributed (i.i.d) random variables each having finite values of expectation µ and variance σ2 > 0. The central limit theorem states that as the sample size n increases[3] [4] , the distribution of the sample average of these random variables approaches the normal distribution with a mean µ and variance σ2 / n irrespective of the shape of the original distribution.

  7. The central limit theorem has an interesting history. The first version of this theorem was postulated by the French-born mathematician Abraham de Moivre who, in a remarkable article published in 1733, used the normal distribution to approximate the distribution of the number of heads resulting from many tosses of a fair coin. This finding was far ahead of its time, and was nearly forgotten until the famous French mathematician Pierre-Simon Laplace rescued it from obscurity in his monumental work ThéorieAnalytique des Probabilités, which was published in 1812. Laplace expanded De Moivre's finding by approximating the binomial distribution with the normal distribution. But as with De Moivre, Laplace's finding received little attention in his own time. It was not until the nineteenth century was at an end that the importance of the central limit theorem was discerned, when, in 1901, Russian mathematician AleksandrLyapunov defined it in general terms and proved precisely how it worked mathematically. Nowadays, the central limit theorem is considered to be the unofficial sovereign of probability theory.

  8. Galton board illustrated

  9. Second application: card games • 5 card poker hands • The number ways of choosing 5 cards from a set of 52 cards is “52 choose 5” • =2,598,960

  10. Probabilities as proportions • Number of favorable outcomes divided by total number of possible outcomes • Chance of 4 of a kind: 13 out of 2,598,960 • 5.02x10^-6=0.00000502 • 5 out of a million

  11. Possible poker hands

  12. How to figure… • The number of ways to get a straight… • Starting rank: 10 possible A,K,Q,J,10,9,8,7,6,5 • Number of ways from a given starting rank: 4x4x4x4x4 = 1024 • Total: 10,240 • Subtract straight flushes: 10,200

  13. How to figure… The number of ways to get 3 of a kind… Rank: 13 possible Number of a given rank: “4 choose 3” = 4 Number of possibilities of remaining two cards that do not give a pair: 48x44/2 Total: 13x4x48x22=54912

  14. Problem • Show how to determine the number of ways in which to get a poker hand containing exactly a pair.