- Day 1
Let be a positive integer with four digits. We name plátano power to the smallest positive integer that can be inserted between the numbers and in such a way the new number is divisible by . Determine the value of .
Centroamerican and Caribbean Mathematical Olympiad 2019.
Let be a positive integer with four digits. We name plátano power to the smallest positive integer that can be inserted between the numbers and in such a way the new number is divisible by . Determine the value of .
We have a regular polygon with 2019 vertices, and in each vertex there is a coin. Two players Azul and Rojo take turns alternately, beginning with Azul, in the following way: first, Azul chooses a triangle with vertices in and colors its interior with blue, then Rojo selects a triangle with vertices in and colors its interior with red, so that the triangles formed in each move don't intersect internally the previous colored triangles. They continue playing until it's not possible to choose another triangle to be colored. Then, a player wins the coin of a vertex if he colored the greater quantity of triangles incident to that vertex (if the quantities of triangles colored with blue or red incident to the vertex are the same, then no one wins that coin and the coin is deleted). The player with the greater quantity of coins wins the game. Find a winning strategy for one of the players.
Note. Two triangles can share vertices or sides.
Let be a triangle and its circumcircle. Let be the foot of the altitude from to the side , and the midpoints of and , and the point on diametrically opposite to . Let be the midpoint of . Show that the lines perpendicular to and passing through and , respectively, meet on .
Let be a triangle, its circumcircle and the tangent to through . The altitudes from and are extended and meet at and , respectively. The lines and meet again at and , respectively. Show that the triangle is isosceles.
Let and be positive real numbers so that . Show that
A triminó is a rectangular tile of . Is it possible to cover a chessboard using triminós, in such a way there remains exactly one square without covering? In case the answer is in the affirmative, determine all the possible locations of such a unit square in the chessboard.