How Many Unique Outcomes with 5 Dice Ignoring Order?

  • Thread starter Thread starter gravenewworld
  • Start date Start date
  • Tags Tags
    Combinatorics
AI Thread Summary
The discussion focuses on calculating the number of unique outcomes when rolling 5 dice, where order does not matter and repetitions are allowed. It highlights that this scenario involves combinations rather than permutations, specifically allowing for repeated elements. The method described uses a "stars and bars" approach, where 5 dice rolls are represented as stars and the boundaries between different numbers as bars. The total arrangements can be calculated as C(10,5), which represents choosing 5 positions for the bars among 10 total spots. This combinatorial method effectively simplifies the problem of counting unique outcomes.
gravenewworld
Messages
1,128
Reaction score
27
Say you have 5 regular die, how many permutations are possible if permutations such as 1,1,1,1,2 and 1,2,1,1,1 are not unique but considered the same (ordering doesn't matter)? I haven't done any combinatorics work in almost 6 years, so I am completely rusty on counting problems. No this, isn't homework, I graduated 2 years ago, I am just trying to help out a college friend of mine who is a computer programmer.
 
Mathematics news on Phys.org
A permutation where ordering doesn't matter is just a 'combination'

To choose k objects from n, without respect to order, there are

_{n}C_k = \frac{n!}{k!(n-k)!}

ways to do it. (Where 'n C k' is just a symbol for the number of combinations)

See wikipedia for more: http://en.wikipedia.org/wiki/Combination
 
Last edited:
Mute said:
A permutation where ordering doesn't matter is just a 'combination'

To choose k objects from n, without respect to order, there are

_{n}C_k = \frac{n!}{k!(n-k)!}

ways to do it. (Where 'n C k' is just a symbol for the number of combinations)

See wikipedia for more: http://en.wikipedia.org/wiki/Combination

But for a combination, according to wiki, 'the elements of the combination can not be repeated'. This is what makes this problem harder, because you are allowed to have repitition for example 1,1,1,1,1 is one combination as well as 1,1,1,1,2=1,1,1,2,1=1,1,2,1,1=1,2,1,1,1=2,1,1,1,1 etc.



So I have the set {1,2,3,4,5,6} and must choose 5 times from it. Repetition is allowed and ordering doesn't matter.
 
Two sequences are equal if they have the same amount of each number. Consider the rolls
1,2,3,4,5
1,2,3,3,4
6,5,4,3,2
If we let a star represent each die roll and separate each 1,2,3,4,5,6 by a bar.
*|*|*|*|*| represents the first roll
*|*|**|*|| represents the second, and
|*|*|*|*|* represents the third.

There are then 10 total spots to arrange the 5 bars and 5 stars.
_ _ _ _ _ _ _ _ _ _
If we leave the spots where the we place the bars as blank spots, the problem reduces to the number of ways to arrange 5 bars in 10 spots or C(10,5)
 
Last edited:
Vid said:
Two sequences are equal if they have the same amount of each number. Consider the rolls
1,2,3,4,5
1,2,3,3,4
6,5,4,3,2
If we let a star represent each die roll and separate each 1,2,3,4,5,6 by a bar.
*|*|*|*|*| represents the first roll
*|*|**|*|| represents the second, and
|*|*|*|*|* represents the third.

There are then 10 total spots to arrange the 5 bars and 5 stars.
_ _ _ _ _ _ _ _ _ _
If we leave the spots where the we place the bars as blank spots, the problem reduces to the number of ways to arrange 5 bars in 10 spots or C(10,5)

Hey that's a pretty neat way of thinking about it! Thanks.
 
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top