Let be a sequence defined recursively as follows: and For every , prove that .
MK-MO 2021
North Macedonia national mathematics olympiad 2021.
Other problems
In the City of Islands there are islands connected by bridges. For any given pair of islands and , one can go from island to island using the bridges. Moreover, for any four islands and : if there is a bridge from to for each , then there is a bridge between and for some with . Show that there is at least one island which is connected to any other island by a bridge.
Let be a trapezoid with and . Let be the intersection point of the diagonals and . The circumcircle of intersects the segment at . The lines and intersect at , while the lines and intersect at . Prove that the line is tangent to iff the line is tangent to the circumcircle of .
For a fixed positive integer we are given a board with all unit squares initially white. We define a floating plusas a -tuple of unit squares such that is in the same row and left of , is in the same row and right of , is in the same column and above and is in the same column and below . It is possible for to form a floating plus with unit squares that are not next to it. Find the largest positive integer (depending on ) such that we can color some squares black in such a way that there is no black colored floating plus.
Authored by Nikola Velov
Let be a sequence defined recursively with and . Let , where are coprime. Show that if is a prime divisor of , then either or .
Authored by Nikola Velov