lecture4 notes

Possible orders hence pk heads n k k n k n n

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

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

Unformatted text preview: ices (n − k)! • P(sequence) = p# heads(1 − p)# tails – Choose k items, then order them (k! possible orders) • Hence: ￿ P(k heads) = ￿n ￿ k · k! = ￿n ￿ k = n! (n − k)! k=0 = (# of k−head seqs.) · pk (1 − p)n−k n! k!(n − k)! n ￿ ￿n ￿ k P(seq.) k−head seq. = ￿n ￿ k pk (1 − p)n−k = Coin tossing problem Partitions • event B : 3 out of 10 tosses were “heads”. • 52-card deck, dealt to 4 players • Find P(each gets an ace) – Given that B occurred,...
View Full Document

This document was uploaded on 03/17/2014 for the course EECS 6.041 at MIT.

Ask a homework question - tutors are online