in reply to unordered sets of N elements

japhy,
Here is the mathematical formula with a little help from google.
(N+5) (N+4) (N+3) (N+2) (N+1) / 120
If I were solving the problem using code and I couldn't figure out how to use one of those nifty CPAN modules, I would do it the inefficient way (sort, join, use a hash).

Cheers - L~R

Replies are listed 'Best First'.
Re^2: unordered sets of N elements
by dragonchild (Archbishop) on Jul 13, 2004 at 13:48 UTC
    Or, to take it to any number of sides:
    k-1 ----- | | (N+i) i=1 ------------- (k-1)!

    Where N is the number of dice and k is the number of sides. The Pi is like Sigma, but for multiplication instead of addition.

    ------
    We are the carpenters and bricklayers of the Information Age.

    Then there are Damian modules.... *sigh* ... that's not about being less-lazy -- that's about being on some really good drugs -- you know, there is no spoon. - flyingmoose

    I shouldn't have to say this, but any code, unless otherwise stated, is untested

Re^2: unordered sets of N elements
by japhy (Canon) on Jul 13, 2004 at 13:50 UTC
    Wow. That's amazing. Thanks for finding that link for me. I hadn't used "dice" in my googling, and never found anything remotely close to what I needed.
    _____________________________________________________
    Jeff japhy Pinyan, P.L., P.M., P.O.D, X.S.: Perl, regex, and perl hacker
    How can we ever be the sold short or the cheated, we who for every service have long ago been overpaid? ~~ Meister Eckhart