An urn contains an unknown number of balls of one colour; A. A ball is drawn and replaced with a different colour; B. The draw is repeated and if the ball is colour A it is replaced by colour B, if it is B it is returned to the urn. The number of B initially climbs steeply, then more slowly and reaches a limit when all the balls are B. The practical application is to estimate the number of balls without having to draw and replace all of them.

Is there a model to estimate (with confidence intervals) the number of balls in an urn containing an unknown and countable (in practice less than 1000) number of balls, all of the same colour by drawing and replacement with balls of a different colour, that does not require all of the balls to be drawn and replaced ?

More Peter Apps's questions See All
Similar questions and discussions