Q2 Solutions

Q2 Solutions - Question 3. Explain why C k,n = P k,n /k ! ....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Steven Weber Dept. of ECE Drexel University ENGR 361: Statistical Analysis of Engineering Systems (Fall, 2007) Quiz 2 Solutions (Wednesday, October 3) Question 1. Prove P ( A ) 1 for any event A ∈ E using the three axioms of probability. First, note that A, A 0 are disjoint events, hence P ( A A 0 ) = P ( A ) + P ( A 0 ). Also, note that A A 0 = S , and thus P ( A ) + P ( A 0 ) = 1. Next, note that P ( A 0 ) 0, which means 1 - P ( A ) 0, or P ( A ) 1. Question 2. Define a permutation and a combination. A permutation is an ordered subset, a combination is an unordered subset.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Question 3. Explain why C k,n = P k,n /k ! . For each combination of k elements there are k ! ways of ordering those elements, i.e., there are k ! distinct permutations for each combination. Hence, the number of combinations is obtained by dividing the number of permutations by k !. www.ece.drexel.edu/faculty/sweber 1 October 3, 2007...
View Full Document

This note was uploaded on 04/05/2010 for the course ENGR 361 taught by Professor Eisenstein during the Spring '04 term at Drexel.

Ask a homework question - tutors are online