benchmarks.wiki / Public workspace

Omni-MATH / Morteza and Amir Reza play the following game. First each of them independently…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Morteza and Amir Reza play the following game. First each of them independently roll a dice 100100 times in a row to construct a 100100-digit number with digits 1,2,3,4,5,61,2,3,4,5,6 then they simultaneously shout a number from 11 to 100100 and write down the corresponding digit to the number other person shouted in their 100100 digit number. If both of the players write down 66 they both win otherwise they both loose. Do they have a strategy with wining chance more than 136\frac{1}{36}?
Plain-text mathematical notation (without MathML)
Morteza and Amir Reza play the following game. First each of them independently roll a dice 100 times in a row to construct a 100-digit number with digits 1,2,3,4,5,6 then they simultaneously shout a number from 1 to 100 and write down the corresponding digit to the number other person shouted in their 100 digit number. If both of the players write down 6 they both win otherwise they both loose. Do they have a strategy with wining chance more than (1)/(36)?
Original LaTeX notation
Morteza and Amir Reza play the following game. First each of them independently roll a dice $100$ times in a row to construct a $100$-digit number with digits $1,2,3,4,5,6$ then they simultaneously shout a number from $1$ to $100$ and write down the corresponding digit to the number other person shouted in their $100$ digit number. If both of the players write down $6$ they both win otherwise they both loose. Do they have a strategy with wining chance more than $\frac{1}{36}$?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import