Suppose I have a line of squares, labelled 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 before the roll and I get a then I move to square . Let be the chance that I land on the square labelled . Find
and submit your answer as .
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.
X n = probability of landing on n . In order to land on n one must first land on one of n − 6 , n − 5 , … n − 1 and then roll the appropriate number. Thus
X n = 6 1 ∑ j = 1 6 X n − j
Also, since the counter starts on 0, the base of the recurrence is X i = 0 for i < 0 and X 0 = 1 . Clearly X n is increasing on 1 through 6. Thereafter, for each n , since X n averages the previous six values, X n ≤ max { X n − j ∣ 1 ≤ j ≤ 6 } . It follows that the maximum values of X n over windows of size 6 are decreasing. Therefore X n is maximized at 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 ) .
or
Find the value of n that maximizes X n .