Ashwin has a fair die with sides labeled 1 to 6. He first rolls the die and records it on a piece of paper. Then, every second thereafter, he re-rolls the die. If he rolls a different value than his previous roll, he records the value and continues rolling. If he rolls the same value, he stops, does not record his final roll, and computes the average of his previously recorded rolls. Given that Vincent first rolled a , let be the expected value of his result. There exist rational numbers such that and is not a perfect power. If =
for relatively prime positive integers and Please help
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Here I got something
Let En,k denote the expected value of the average after n rolls ending with the number k, then we have En,1=n⋅6n−15bn−1+∑m=26(nn−1)6En−1,mwhere bn is the number of sequences of length n ending in a 2. It's not hard to find that bn=5bn−2+4bn−1, b1=0, b2=1, so bn=305(−1)n+5n. For k=1, we have En,k=6nn−1(∑m=1,m=k6En−1,k)+n⋅6n−1k⋅bnnow let En denote the expected average after n rolls regardless of the last number rolled, then we have En=∑m=16En,m=6n5(n−1)En−1+n⋅6n−15n−1+n⋅6n−115bnwhere E1=1. By induction we arrive at En=(65)n−1+n⋅6n−115∑m=2nbm⋅5n−mSince Ashwin must roll the same number again in order to end the game, the desired value is 61∑n=1∞En=1+15∑n=1∞n(61)2∑m=2nbm⋅5n−mPlugging in the explicit form for bn and using the Taylor series for ln(1+x), this simplifies to 27−125ln7⟹r+s+t=12131⟹100m+n=13112