Question: 5.2.2 Suppose that 100 tags, numbered 1;2; : : : ; 100, are placed into an urn, and 10 tags are drawn successively, with replacement.
5.2.2 Suppose that 100 tags, numbered 1;2; : : : ; 100, are placed into an urn, and 10 tags are drawn successively, with replacement. Let A be the event that no tag is drawn twice. Show that

Use the approximation
![]()
to get
![]()
Interpret this in terms of the law of rare events.
Pr{A} = = (1-10) (1-170) (1 - 120) = 2 = 0.6282.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
