Daily

Random

Practice set

Baltic Way 2019 · Problem 2

Algebra

Let (Fn)(F_n) be the sequence defined recursively by F1=F2=1F_1=F_2=1 and Fn+1=Fn+Fn−1F_{n+1}=F_n+F_{n-1} for n≥2n\ge2. Find all pairs of positive integers (x,y)(x,y) such that

5Fx−3Fy=1.5F_x-3F_y=1.
Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Sequences and recurrences · Equations and inequalities

Solutions

Solution

From the equation 5Fx=3Fy+15F_x = 3F_y + 1 we have

3Fy+1=5Fx>3Fx+1  ⟹  y>x3F_y + 1 = 5F_x > 3F_x + 1 \implies y > x

On the other hand, if y≥x+2y \ge x + 2 and x>1x > 1 then

3Fy+1≥3Fx+2+1=3(Fx+1+3Fx)+1=6Fx+3Fx−1+1>5Fx3F_y + 1 \ge 3F_{x+2} + 1 = 3(F_{x+1} + 3F_x) + 1 = 6F_x + 3F_{x-1} + 1 > 5F_x

we have a contradiction. Therefore y=x+1y = x + 1 and we have to solve the equation becomes 3Fx+1+1=5Fx3F_{x+1} + 1 = 5F_x We will show by induction that 3Fx+1+1<5Fx3F_{x+1} + 1 < 5F_x for any x≥7x \ge 7. Indeed, for x=7x = 7 we have F7=13F_7 = 13, F8=21F_8 = 21. Therefore, 3F8+1=3⋅21+1=64<5F7=653F_8 + 1 = 3 \cdot 21 + 1 = 64 < 5F_7 = 65. For x=8x = 8 we have 3F9+1=103<5F8=1053F_9 + 1 = 103 < 5F_8 = 105. Assume 3Fk+1+1<5Fk3F_{k+1} + 1 < 5F_k and 3Fk+2+1<5Fk+13F_{k+2} + 1 < 5F_{k+1} for some k≥7k \ge 7. We have then 3(Fk+1+Fk+2)+2<5(Fk+Fk+1)3(F_{k+1} + F_{k+2}) + 2 < 5(F_k + F_{k+1}). Thus

3Fk+3+1<3Fk+3+2<5Fk+23F_{k+3} + 1 < 3F_{k+3} + 2 < 5F_{k+2}

For x<7x < 7 we can check and see that x∈{3,5,6}x \in \{3, 5, 6\}.

Contest context

Results from Baltic Way 2019

11 teams

Mean score
3.8 / 5
Scores of 4 or 5
8 / 11
Estonia
5 / 5

Score distribution

01
11
20
31
42
56
All team scores
TeamScore
St. Petersburg5 / 5
Poland5 / 5
Estonia5 / 5
Lithuania4 / 5
Germany1 / 5
Norway3 / 5
Finland5 / 5
Denmark5 / 5
Sweden4 / 5
Latvia0 / 5
Iceland5 / 5