Skip to main content
OlympiadHQ

Browse · MathNet

Print

Baltic Way 2019

Baltic Way 2019 algebra

Problem

Let be a sequence defined recursively by and for . Find all pairs of positive integers such that
Solution
From the equation we have On the other hand, if and then we have a contradiction. Therefore and we have to solve the equation becomes We will show by induction that for any . Indeed, for we have , . Therefore, . For we have . Assume and for some . We have then . Thus For we can check and see that .
Final answer
(3,4), (5,6), (6,7)

Techniques

Recurrence relationsTechniques: modulo, size analysis, order analysis, inequalities