prob.part21.43_44 - 1.2. DISCRETE PROBABILITY DISTRIBUTIONS...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: 1.2. DISCRETE PROBABILITY DISTRIBUTIONS 35 We see that these two mathematicians arrived at two very different ways to solve the problem of points. Pascal’s method was to develop an algorithm and use it to calculate the fair division. This method is easy to implement on a computer and easy to generalize. Fermat’s method, on the other hand, was to change the problem into an equivalent problem for which he could use counting or combinatorial methods. We will see in Chapter 3 that, in fact, Fermat used what has become known as Pascal’s triangle! In our study of probability today we shall find that both the algorithmic approach and the combinatorial approach share equal billing, just as they did 300 years ago when probability got its start. Exercises 1 Let Ω = { a,b,c } be a sample space. Let m ( a ) = 1 / 2, m ( b ) = 1 / 3, and m ( c ) = 1 / 6. Find the probabilities for all eight subsets of Ω. 2 Give a possible sample space Ω for each of the following experiments: (a) An election decides between two candidates A and B....
View Full Document

This note was uploaded on 09/15/2009 for the course SCF scf taught by Professor Scf during the Spring '09 term at Indian Institute Of Management, Ahmedabad.

Page1 / 2

prob.part21.43_44 - 1.2. DISCRETE PROBABILITY DISTRIBUTIONS...

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