You are not logged in. Please login at to post your questions!


Extenstion of Coupon collector problem

X took N dices, numbered from 1 to N, shuffled them, took K of them randomly and then recorded their numbers and returned them to the pile. Then he repeated these steps: shuffle them again, again took the K dices, and so on.

how many times he need to do so,that each dice has been taken at least once?

asked 28 Dec '14, 14:53

anup1pma's gravatar image

accept rate: 0%

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 28 Dec '14, 14:53

question was seen: 1,281 times

last updated: 23 Feb '18, 23:18