Certain computer coding systems use randomization to assign memory
storage locations to account numbers. Suppose that N=M\lambda different
accounts are to be randomly located among M storage locations. Let x_(i) be
the number of accounts assigned to the i^(th ) location. If the accounts are
distributed independently and each location is equally likely to be chosen,
show that \lim_(N->\infty )P(x_(i)=k)=e^(-\lambda )(\lambda ^(k))/(k!). Show that x_(i) and x_(j) are independent
random variables in the limit, for distinct locations i!=j. In the limit, what
fraction of storage locations has two or more accounts assigned to them?