But the average roll is 3.5

Suppose I have a line of squares, labelled 0 , 1 , 2 , 3 , 4 , 0,1,2,3,4, \ldots and so on. I place a counter on the square 0. On every turn, I roll a fair die (with the numbers 1 to 6) and move forward as follows: if I was on square P P before the roll and I get a x x then I move to square P + x P+x . Let X n X_n be the chance that I land on the square labelled n n . Find

max ( X n ) ? ( n N ) \text{max}(X_n)? \space\space ( n \in \mathbb{N})

and submit your answer as n n .

There is no maximum but X n X_n isn't strictly increasing 6 X n X_n is strictly increasing 7

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Varsha Dani
Oct 6, 2018

X n X_n = probability of landing on n n . In order to land on n n one must first land on one of n 6 , n 5 , n 1 n-6, n-5, \dots n-1 and then roll the appropriate number. Thus

X n = 1 6 j = 1 6 X n j X_n = \frac{1}{6} \sum_{j=1}^{6} X_{n-j}

Also, since the counter starts on 0, the base of the recurrence is X i = 0 X_{i} = 0 for i < 0 i<0 and X 0 = 1 X_0 =1 . Clearly X n X_n is increasing on 1 through 6. Thereafter, for each n n , since X n X_n averages the previous six values, X n max { X n j 1 j 6 } X_n \le \max\{X_{n-j} | 1\le j\le 6\} . It follows that the maximum values of X n X_n over windows of size 6 are decreasing. Therefore X n X_n is maximized at n = 6 n=6 .

By the way I found your question to be somewhat confusingly phrased. You may wish to rephrase it as:

Find a r g m a x n N ( X n ) \mathrm{argmax}_{n\in \mathbb{N}} (X_n) .

or

Find the value of n n that maximizes X n X_n .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...