Maths Olympiad Prep

Track / Stage 8 / 62 of 180 #1762 of 1964

Problem 1762

IMO Shortlist mid-range; USAMO P2/P5
Combinatorics Difficulty 8.2 Prove it

Let (un)(u_n) be a sequence of real numbers which satisfies
un+2=un+1unfor all nN.u_{n+2}=|u_{n+1}|-u_n\qquad\text{for all }n\in\mathbb N.Prove that there exists a positive integer pp such that un=un+pu_n=u_{n+p} holds for all nNn\in\mathbb N.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

To prove that there exists a positive integer p p such that un=un+p u_n = u_{n+p} for all nN n \in \mathbb{N} , we will analyze the sequence (un) (u_n) defined by the recurrence relation:
un+2=un+1un u_{n+2} = |u_{n+1}| - u_n

We will consider different initial conditions and show that the sequence is periodic with period 9 in all cases.

1. **Case 1: a=b=0 a = b = 0 **
- If u1=0 u_1 = 0 and u2=0 u_2 = 0 , then:
u3=u2u1=00=0 u_3 = |u_2| - u_1 = 0 - 0 = 0
u4=u3u2=00=0 u_4 = |u_3| - u_2 = 0 - 0 = 0
\vdots
- The sequence is 0,0,0, 0, 0, 0, \ldots , which is clearly periodic with period 1.

2. **Case 2: a=0 a = 0 and b>0 b > 0 **
- Consider S(0,1) S(0, 1) :
u1=0,u2=1 u_1 = 0, \quad u_2 = 1
u3=u2u1=10=1 u_3 = |u_2| - u_1 = 1 - 0 = 1
u4=u3u2=11=0 u_4 = |u_3| - u_2 = 1 - 1 = 0
u5=u4u3=01=1 u_5 = |u_4| - u_3 = 0 - 1 = -1
u6=u5u4=10=1 u_6 = |u_5| - u_4 = 1 - 0 = 1
u7=u6u5=1(1)=2 u_7 = |u_6| - u_5 = 1 - (-1) = 2
u8=u7u6=21=1 u_8 = |u_7| - u_6 = 2 - 1 = 1
u9=u8u7=12=1 u_9 = |u_8| - u_7 = 1 - 2 = -1
u10=u9u8=11=0 u_{10} = |u_9| - u_8 = 1 - 1 = 0
- The sequence is 0,1,1,0,1,1,2,1,1,0,1, 0, 1, 1, 0, -1, 1, 2, 1, -1, 0, 1, \ldots , which is periodic with period 9.

3. **Case 3: a=0 a = 0 and b<0 b < 0 **
- Consider S(0,1) S(0, -1) :
- This sequence is just S(0,1) S(0, 1) shifted by 4 positions:
u1=0,u2=1 u_1 = 0, \quad u_2 = -1
u3=u2u1=10=1 u_3 = |u_2| - u_1 = 1 - 0 = 1
u4=u3u2=1(1)=2 u_4 = |u_3| - u_2 = 1 - (-1) = 2
u5=u4u3=21=1 u_5 = |u_4| - u_3 = 2 - 1 = 1
u6=u5u4=12=1 u_6 = |u_5| - u_4 = 1 - 2 = -1
u7=u6u5=11=0 u_7 = |u_6| - u_5 = 1 - 1 = 0
u8=u7u6=0(1)=1 u_8 = |u_7| - u_6 = 0 - (-1) = 1
u9=u8u7=10=1 u_9 = |u_8| - u_7 = 1 - 0 = 1
u10=u9u8=11=0 u_{10} = |u_9| - u_8 = 1 - 1 = 0
- The sequence is 0,1,1,2,1,1,0,1,1,0,1, 0, -1, 1, 2, 1, -1, 0, 1, 1, 0, -1, \ldots , which is periodic with period 9.

4. **Case 4: a0 a \neq 0 and b=0 b = 0 **
- Using the symmetry property S(a,b)    S(b,a) S(a, b) \iff S(b, a) , this case is equivalent to Case 2 and Case 3, and thus periodic with period 9.

5. **Case 5: a0 a \neq 0 and b>0 b > 0 **
- Consider S(a,1) S(a, 1) :
- We need to analyze different ranges of a a :
5.1) If a2 a \ge 2 :
a,1,1a,a2,2a3,a1,2a,1,a1,a,1, \overline{a, 1, 1-a, a-2, 2a-3, a-1, 2-a, -1, a-1}, a, 1, \ldots
5.2) If 2a1 2 \ge a \ge 1 :
a,1,1a,a2,1,3a,2a,1,a1,a,1, \overline{a, 1, 1-a, a-2, 1, 3-a, 2-a, -1, a-1}, a, 1, \ldots
5.3) If 1a12 1 \ge a \ge \frac{1}{2} :
a,1,1a,a,2a1,3a1,a,12a,a1,a,1, \overline{a, 1, 1-a, -a, 2a-1, 3a-1, a, 1-2a, a-1}, a, 1, \ldots
5.4) If 12a0 \frac{1}{2} \ge a \ge 0 :
a,1,1a,a,2a1,1a,23a,12a,a1,a,1, \overline{a, 1, 1-a, -a, 2a-1, 1-a, 2-3a, 1-2a, a-1}, a, 1, \ldots
5.5) If 0a1 0 \ge a \ge -1 :
a,1,1a,a,1,1+a,2+a,1,1a,a,1, \overline{a, 1, 1-a, -a, -1, 1+a, 2+a, 1, -1-a}, a, 1, \ldots
5.6) If 1a -1 \ge a :
a,1,1a,a,1,1+a,a,12a,1a,a,1, \overline{a, 1, 1-a, -a, -1, 1+a, -a, -1-2a, -1-a}, a, 1, \ldots
- In all subcases, the sequence is periodic with period 9.

6. **Case 6: a0 a \neq 0 and b<0 b < 0 **
- Since u4=u3u2=u3b>0 u_4 = |u_3| - u_2 = |u_3| - b > 0 , the sequence S(u3,u4) S(u_3, u_4) falls into either Case 2 or Case 5, and thus periodic with period 9.

Hence, in all cases, the sequence (un) (u_n) is periodic with period 9.

un+9=unnN \boxed{u_{n+9} = u_n \quad \forall n \in \mathbb{N}}

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