2
$\begingroup$

Suppose we have a card game with some $n$ cards and $m$ players, where $m \mid n$. Each player starts with $\frac{n}{m}$ cards.

How many starting states does the game have?

How many states can the game be in after $k$ rounds, if in every round, every player drops $j$ of their remaining cards at random?

$\endgroup$
  • $\begingroup$ Does m divide n? $\endgroup$ – Peter Jan 29 '14 at 20:06
  • 1
    $\begingroup$ @Peter, yes, and I've complemented the question with the information. $\endgroup$ – Nerius Jan 29 '14 at 20:09
0
$\begingroup$

If $l = \frac{n}{m}$ , we have

$$\frac{n!}{(l!)^m}$$

starting states.

After $k$ rounds, every player has $l-kj$ cards left.

So, the total number of cards is $m(l-kj) = n-mkj$

So, the number of states is now

$$\binom{n}{n-mkj}\frac{(n-mkj)!}{(l-kj)!^m}$$

$\endgroup$
  • $\begingroup$ Thanks, however this answer assumes that every round the player disposes of 1 card, whereas they dispose of some j. $\endgroup$ – Nerius Jan 29 '14 at 20:20

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.