- #1
JohnnyGui
- 796
- 51
Hello,
I have been trying to solve this problem but I can't seem to find a way.
Given are ##n## cards and each card can show one of two values: M or K.
How many possible permutations are there in which there are as many cards with M as there are with K? Given that ##n## is an even amount of cards.
Is it possible to derive a formula for this as a function of ##n##? How does one deduce this?
I have been trying to solve this problem but I can't seem to find a way.
Given are ##n## cards and each card can show one of two values: M or K.
How many possible permutations are there in which there are as many cards with M as there are with K? Given that ##n## is an even amount of cards.
Is it possible to derive a formula for this as a function of ##n##? How does one deduce this?