Making equations with six six-sided dice

  • Thread starter Thread starter Mingy Jongo
  • Start date Start date
  • Tags Tags
    Dice
Mingy Jongo
Messages
5
Reaction score
0
Suppose I am playing a game where I roll some dice, and must use only combinations of elementary operations (addition, subtraction, multiplication, or division) to make an equation using each number rolled exactly once.

For example, if I roll four six-sided dice, and get this:
2, 3, 3, 4
A possible solution is:
3-2=4-3
Another one is:
(3+3)-2=4

Now, I'm fairly certain that for up to five six-sided dice, not all combinations can be made into valid equations. Here are some examples:
2 dice: Everything except doubles
3 dice: Triples greater than 1s; two 1s and a 3, 4, 5, or 6
4 dice: Three 1s and a 4, 5, or 6
5 dice: Four 1s and a 5 or 6

My question is, are there any combinations that cannot be made into valid equations for six six-sided dice? Five ones and a six works here: (1+1)*(1+1+1)=6
If so, can someone give me an example of such a combination, and more interestingly, the minimum number of six-sided dice needed to guarantee a valid equation for any possible roll, if there indeed exists a minimum?
 
Mathematics news on Phys.org
Consider that for any number of rolls above 6, you will always have a duplicate die which can be counted as 1 (via division of the duplicate by itself).

Definitely a neat thing to think about, wonder if it or something similar has come up here before?
 
What a wonderful problem; it will give me something to do over the summer.
It seems to me that it would be easiest/most informative to consider each operation separately; for example, when considering addition, we're really asking how may roles generate exactly two partitions of the same number, which opens the door to using results from number theory.
 
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.
Back
Top