Olympiad Maths Prep

Track / Stage 6 / 236 of 400 #1236 of 2000

Problem 1236

National olympiad, first round
Combinatorics Difficulty 6.4 Find the answer

Cast a dice nn times. Denote by X1, X2, , XnX_1,\ X_2,\ \cdots ,\ X_n the numbers shown on each dice. Define Y1, Y2, , YnY_1,\ Y_2,\ \cdots,\ Y_n by
Y1=X1, Yk=Xk+1Yk1 (k=2, , n)Y_1=X_1,\ Y_k=X_k+\frac{1}{Y_{k-1}}\ (k=2,\ \cdots,\ n)
Find the probability pnp_n such that 1+32Yn1+3.\frac{1+\sqrt{3}}{2}\leq Y_n\leq 1+\sqrt{3}.

35 points

Official solution

1. The Setup:
- We are given a sequence of random variables X1,X2,,XnX_1, X_2, \ldots, X_n representing the outcomes of rolling a dice nn times.
- We define another sequence Y1,Y2,,YnY_1, Y_2, \ldots, Y_n by:
Y1=X1,Yk=Xk+1Yk1fork=2,,n Y_1 = X_1, \quad Y_k = X_k + \frac{1}{Y_{k-1}} \quad \text{for} \quad k = 2, \ldots, n
- We need to find the probability pnp_n such that:
1+32Yn1+3 \frac{1 + \sqrt{3}}{2} \leq Y_n \leq 1 + \sqrt{3}

2. Initial Observations:
- Fact 1: Yk1Y_k \geq 1 for all kk. This is because the minimum value of XkX_k is 1 and 1Yk10\frac{1}{Y_{k-1}} \geq 0.
- Fact 2: YnY_n is never irrational. This follows from the fact that XkX_k are integers and 1Yk1\frac{1}{Y_{k-1}} is a rational number.

3. Probability Analysis:
- For 1+32Yn1+3\frac{1 + \sqrt{3}}{2} \leq Y_n \leq 1 + \sqrt{3} to hold, XnX_n must be either 1 or 2.
- Denote qnq_n as the probability that 1Yn1+321 \leq Y_n \leq \frac{1 + \sqrt{3}}{2}.

4. Case Analysis:
- **Case 1: Xn=1X_n = 1**
- We need:
3121Yn13 \frac{\sqrt{3} - 1}{2} \leq \frac{1}{Y_{n-1}} \leq \sqrt{3}
- Flipping the inequalities, we get:
13Yn11+3 \frac{1}{\sqrt{3}} \leq Y_{n-1} \leq 1 + \sqrt{3}
- The probability that Yn1Y_{n-1} lies in this range is pn1+qn1p_{n-1} + q_{n-1}.
- Therefore, the probability for this case is:
16(pn1+qn1) \frac{1}{6} (p_{n-1} + q_{n-1})

- **Case 2: Xn=2X_n = 2**
- We need:
1Yn131 \frac{1}{Y_{n-1}} \leq \sqrt{3} - 1
- Flipping the inequality, we get:
Yn11+32 Y_{n-1} \leq \frac{1 + \sqrt{3}}{2}
- The probability for this case is:
16(1qn1) \frac{1}{6} (1 - q_{n-1})

5. Combining Cases:
- The total probability pnp_n is given by:
pn=16(pn1+qn1)+16(1qn1) p_n = \frac{1}{6} (p_{n-1} + q_{n-1}) + \frac{1}{6} (1 - q_{n-1})
- Simplifying, we get:
pn=16(1+pn1) p_n = \frac{1}{6} (1 + p_{n-1})

6. Initial Condition:
- For n=1n = 1, Y1=X1Y_1 = X_1. The probability that X1X_1 lies in the range 1+32X11+3\frac{1 + \sqrt{3}}{2} \leq X_1 \leq 1 + \sqrt{3} is:
p1=16 p_1 = \frac{1}{6}

7. Solving the Recurrence:
- The recurrence relation is:
pn=16(1+pn1) p_n = \frac{1}{6} (1 + p_{n-1})
- This can be solved iteratively or using standard methods for solving linear recurrence relations.

The final answer is pn=16(1+pn1) \boxed{ p_n = \frac{1}{6} (1 + p_{n-1}) } with p1=16p_1 = \frac{1}{6}.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.