How Many Unique Outcomes with 5 Dice Ignoring Order?

  • Context: Undergrad 
  • Thread starter Thread starter gravenewworld
  • Start date Start date
  • Tags Tags
    Combinatorics
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
4 replies · 3K views
gravenewworld
Messages
1,129
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.
 
Physics 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

[tex]_{n}C_k = \frac{n!}{k!(n-k)!}[/tex]

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

[tex]_{n}C_k = \frac{n!}{k!(n-k)!}[/tex]

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.