Results 1 to 3 of 3

Math Help - Computing probability of getting desired items from an infinite pool

  1. #1
    Newbie
    Joined
    Nov 2011
    Posts
    2

    Computing probability of getting desired items from an infinite pool

    Hello,

    the following real life example of personal significance got me curious about what the answer would look like:

    Hasbro is currently selling a series of 24 different "My Little Pony" figurines, all sold separately in non-transparent bags with no clue as to which of the 24 ponies are inside. I only want six specific ponies, and the problem is knowing how many bags I would have to buy in order to get, with probability p, at least one of *each* of the six desirable ponies. Assume that there is an infinite supply of bags, and that the pony inside each bag is random. Assume further that I open all bags at once, not going back to the store for more.

    To generalize and put the problem in more familiar terms:
    Consider a die with n sides, numbered from 1 to n. How many throws must one make in order to have the chance p of getting all numbers [1..k] (where k <= n)?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,657
    Thanks
    1615
    Awards
    1

    Re: Computing probability of getting desired items from an infinite pool

    Quote Originally Posted by blackpaws View Post
    Hello,

    the following real life example of personal significance got me curious about what the answer would look like:

    Hasbro is currently selling a series of 24 different "My Little Pony" figurines, all sold separately in non-transparent bags with no clue as to which of the 24 ponies are inside. I only want six specific ponies, and the problem is knowing how many bags I would have to buy in order to get, with probability p, at least one of *each* of the six desirable ponies. Assume that there is an infinite supply of bags, and that the pony inside each bag is random. Assume further that I open all bags at once, not going back to the store for more.

    To generalize and put the problem in more familiar terms:
    Consider a die with n sides, numbered from 1 to n. How many throws must one make in order to have the chance p of getting all numbers [1..k] (where k <= n)?
    This is the coupon collection problem.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Nov 2011
    Posts
    2

    Re: Computing probability of getting desired items from an infinite pool

    Quote Originally Posted by Plato View Post
    Thanks for the pointer! But I can't fit that description of the coupon collection problem to my particular version. For one, it only seems to describe cases where you collect *any* set of k coupons, rather than a specific set. (k=6 particular ponies!)

    (Collecting any 6 distinct coupons is naturally easier than collecting 6 particular distinct ones.)
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 5
    Last Post: February 10th 2013, 02:11 PM
  2. Smallest number of items from given probability
    Posted in the Statistics Forum
    Replies: 2
    Last Post: March 30th 2011, 08:37 AM
  3. Probability of winning prize pool
    Posted in the Statistics Forum
    Replies: 1
    Last Post: October 9th 2010, 01:37 PM
  4. Combinatorics, Probability and Computing
    Posted in the Advanced Math Topics Forum
    Replies: 0
    Last Post: November 21st 2009, 07:13 AM
  5. computing probability
    Posted in the Statistics Forum
    Replies: 1
    Last Post: July 31st 2007, 11:52 AM

Search Tags


/mathhelpforum @mathhelpforum