stat100a_occupancy_problem

# stat100a_occupancy_problem - 2,1,1,1,1,1,0 2,2,1,1,1,0,0 ....

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

University of California, Los Angeles Department of Statistics Statistics 100A Instructor: Nicolas Christou Occupancy problem Consider n = 7 cells and r = 7 marbles. In how many ways can the 7 marbles be distributed in the 7 cells? Please complete the table below. Occupancy numbers Number of arrangements Probability 1,1,1,1,1,1,1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2,1,1,1,1,1,0 2,2,1,1,1,0,0 . . . . . . . . . 7,0,0,0,0,0,0 Notes: There are 15 conﬁgurations. 1,1,1,1,1,1,1 means that each cell will receive 1 marble, 2,1,1,1,1,1,0 means that one cell will receive 2 marbles, ﬁve cells will receive 1 marble, and one cell will receive no marbles, etc....
View Full Document

## This note was uploaded on 02/11/2012 for the course STATS 100A 262303210 taught by Professor Wu during the Fall '09 term at UCLA.

Ask a homework question - tutors are online