Suppose that we have a situation where:

there are n repetitions or "trials" of a random event
each trial has two possible outcomes, "success" or "failure"
trials are independent
the probability of a "success", p, remains constant from trial to trial

What is the probability of obtaining r successes in n trials?

The case n=1

When n=1 there is only one trial. There is a probability p that the trial results in success (S) and probability q=1-p that the trial results in failure (F). We can show this in two ways - by a tree diagram and a table.

Successes 0 1 Total
Probability q p q+p=1

The case n=2

There are four possible results from two trials: SS, SF, FS and FF. Because the trials are independent the probabilities obey the multiplication rule:

Pr(S first and S second) = Pr(S first) x Pr(S second) = Pr(S) x Pr(S) = pxp = p2

Successes 0 1 2 Total
Probability q2 2pq p2 q2+2pq+p2=(q+p)2=1

The case n=3

There are 8 possible results from three trials: SSS, SSF, SFS, SFF, FSS, FSF, FFS, FFF. Proceeding as before we have:

Successes 0 1 2 3 Total
Probability q3 3pq2 3p2q p3 q3+3pq2+3p2q+p3=(q+p)3=1

A pattern is becoming apparent in these probabilities:

  1. The power of p is always the number of successes (remember p1=p and p0=1).
  2. The power of q is always the number of failures.
  3. There is only one way of getting 0 successes or n successes.
  4. The number of ways of getting r successes in n trials is the number of ways of choosing the r branches which have an S on them. There is a mathematical function which calculates this number - it is called "n choose r" and written nCr .
  5. The individual probabilities are the terms in the series expansion of (q+p)n.
  6. The total probability is always 1.

So, in general:

Pr( r successes in n trials) = nCr x pr x q(n-r)

The function nCr is probably on your calculator, but is easily calculated by hand.
Consider n=4:

4C0 = 4C4 = 1 (by definition - see iii above)

4C1 = (4/1) = 4

4C2 = (4/2) x (3/1) = 6

4C3 = (4/3) x (3/2) x (2/1) = 4

 

To continue on the recommended route click on the Graphs button at the top of the page.

 

DISCUSS Home Page
Copyright © 1997   Neville Hunt  
Coventry University
All rights reserved.  Last updated: 21 March 2003 .