L01_F10 - AMS 311 Introduction to Probability Spring...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
AMS 311 Introduction to Probability Spring Semester, 2010 Chapter One Combinatorial Analysis I will go over this chapter lightly because it covers material from combinatorics, and many have taken classes in this area. For those of you taking the actuarial examinations, combinatorial problems are a favorite type of question. When you study for that examination, remember that there is almost always a quick way of calculating the answer to their question. 1.2. The Basic Principle of Counting Basic Principle of Counting: Suppose that two experiments are to be performed. Then if experiment 1 can result in any one of m possible outcomes and if for each outcome of experiment 1 there are n possible outcomes of experiment 2, then together there are mn possible outcomes of the two experiments. Generalized Basic Principle of Counting: If r experiments that are to be performed are such that the first one may result in n 1 possible outcomes, and if for each of these n 1 possible outcomes there are n 2 possible outcomes of the second experiment, and if for each of the possible outcomes of the first two experiments there are n 3 possible outcomes of the third experiment, and if …, then there is a total of n 1 × n
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/22/2010 for the course AMS 311 taught by Professor Tucker,a during the Spring '08 term at SUNY Stony Brook.

Page1 / 3

L01_F10 - AMS 311 Introduction to Probability Spring...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online