How Many Unique Ways Can 4 Dice Be Combined?

  • Thread starter Thread starter nille40
  • Start date Start date
nille40
Messages
34
Reaction score
0
Hi all!

In how many unique ways can 4 dices be combined? Note that the order amongst the dices is not relevant, so 1-2-3-4 = 4-3-2-1.

My idea is that you select the values, one by one. You can select the first value in 6 ways, the second in 6 ways, the third in 6 ways and the fourth in 6 ways. This yield 6^4 combinations. The order was irrelevant, so the answer should then be \frac{6^4}{4!}.

This is obviously wrong... I'm trying to figure out how to think to solve a problem like this.

The answer is

{6+4-1} \choose {4}

Which basically means "select 4 of the 6, and put each value back when you've selected it". I don't get this...

Would really appreciate some guidance!
Nille
 
Mathematics news on Phys.org
Ok, I have an idea.

Lets say we have dices in a line. The first dice has the value 1, the second 2, the third 3...the sixth 6. This yields the equation

x_1 + x_2 + x_3 + x_4 + x_5 + x_6 = 4

So the solution x_1 = 2, x_3 = 1, x_4 = 1 means that two dices has the value 1, one has 3 and one has 4.

This equation has the solution
{{4 + 6 - 1} \choose {4}} = {{4+6-1} \choose {5}}

Can this be solved in some other way?
Nille
 
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...
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...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
8
Views
2K
Replies
1
Views
2K
Replies
6
Views
4K
Replies
2
Views
2K
Replies
2
Views
1K
Replies
7
Views
2K
Replies
8
Views
2K
Replies
14
Views
4K
Back
Top