Combinations with Irregular Repetition

  • Thread starter Thread starter Strymon
  • Start date Start date
  • Tags Tags
    Combinations
AI Thread Summary
The discussion revolves around calculating the number of unique decks in Magic: The Gathering, where a deck consists of 60 cards, with 1729 cards limited to 0-4 copies and 5 cards allowed in any quantity. Participants explore the complexity of framing an equation for this scenario, noting that it resembles a combination problem with irregular repetition. A proposed method involves using generating functions to derive the solution, specifically looking for the coefficient of x^60 in the equation (1+x+x^2+x^3+x^4)^1729/(1-x)^5. The conversation highlights the challenge of finding existing formulas for combinations with limited repetition and suggests searching for specific keywords related to this topic. Overall, the thread seeks both the answer and a structured approach to tackle the problem.
Strymon
Messages
2
Reaction score
0
Hey folks, I believe this is the correct thread for this topic. I was debating between general mathematics and statistics. I believe it falls here.

So, I play the card game Magic: The Gathering, and one of the core tenants of the game is building a deck from a large variety of cards. The deck is then randomized (shuffled) and the actual game involves doing your best with the cards you've drawn, as well as knowing what you are likely to draw (reminiscent of poker.) Interestingly, in building a deck, knowledge of statistics is very useful as some cards you may want to see more than others.

One thing I've always been curious of, though, is how many possible decks can be created. It would seem like a simple combination problem, or even Combination with Repetition, except for a problem. Most cards you may have no more than four of in your deck, but there are five cards that you may have any number of in your deck.

=============================

So, here's the question:

A deck consists of 60 cards.
There are 1729 cards of which you may have 0 to 4 copies each in your deck.
There are 5 cards of which you may have any number of copies in your deck.

How many unique decks can be built?

=============================

More than the answer (though I'd be excited to see it,) I'd like to know how to frame an equation that would handle a situation like this. Any thoughts are welcome!

Thanks!
 
Last edited:
Physics news on Phys.org
If the problem is too complex to find a direct formula, split it in sub-problems:

Assume N of those 60 cards are used which cannot appear more than 4 times, and M different cards of that type are used (##M\geq \frac{N}{4}##).
This gives well-known problems for the number of combinations for those N cards and the 60-N other cards. I am too lazy to look up the formulas.
Afterwards, you can sum over all N and M.
 
Mfb, thanks for your reply!

I actually was not aware there were formulas for combination with limited repetition like this. I had searched around online briefly but wasn't able to find anything that would quite work, even as a partial solution. Are there some particular keywords I could search under to find them?
 
One way is using generating functions, so the solution is the coefficient of x^60 in (1+x+x^2+x^3+x^4)^1729/(1-x)^5
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
4
Views
2K
Replies
1
Views
1K
Replies
2
Views
2K
Replies
14
Views
2K
Replies
3
Views
2K
Replies
1
Views
2K
Back
Top