Prove that for any pair of positive integers and , there exist positive integers (not necessarily different) such that
| # | Competition | Years | Problems | Years |
|---|---|---|---|---|
| 1 | International Mathematical Olympiad | 1959–2025 | 398 | |
| 2 | Middle European Mathematical Olympiad | 2009–2025 | 160 |
Prove that for any pair of positive integers and , there exist positive integers (not necessarily different) such that
A configuration of 4027 points in the plane is called Colombian if it consists of 2013 red points and 2014 blue points, and no three of the points of the configuration are collinear. By drawing some lines, the plane is divided into several regions. An arrangement of lines is good for a Colombian configuration if the following two conditions are satisfied:
Find the least value of such that for any Colombian configuration of 4027 points, there is a good arrangement of lines.
Let the excircle of triangle opposite the vertex be tangent to the side at the point . Define the points on and on analogously, using the excircles opposite and , respectively. Suppose that the circumcentre of triangle lies on the circumcircle of triangle . Prove that triangle is right-angled.
The excircle of triangle opposite the vertex is the circle that is tangent to the line segment , to the ray beyond , and to the ray beyond . The excircles opposite and are similarly defined.
Let be an acute-angled triangle with orthocentre , and let be a point on the side , lying strictly between and . The points and are the feet of the altitudes from and , respectively. Denote by the circumcircle of , and let be the point on such that is a diameter of . Analogously, denote by the circumcircle of , and let be the point on such that is a diameter of . Prove that , and are collinear.
Let be the set of positive rational numbers. Let be a function satisfying the following three conditions:
(i) for all , we have ;
(ii) for all , we have ;
(iii) there exists a rational number such that .
Prove that for all .
Let be an integer, and consider a circle with equally spaced points marked on it. Consider all labellings of these points with the numbers such that each label is used exactly once; two such labellings are considered to be the same if one can be obtained from the other by a rotation of the circle. A labelling is called beautiful if, for any four labels with , the chord joining the points labelled and does not intersect the chord joining the points labelled and .
Let be the number of beautiful labellings, and let be the number of ordered pairs of positive integers such that and . Prove that
Let be positive real numbers such that
Prove that
Find all triples for which equality holds.
Let be a positive integer. On a board consisting of squares, exactly tokens are placed so that each row and each column contains one token. In a step, a token is moved horizontally or vertically to a neighbouring square. Several tokens may occupy the same square at the same time. The tokens are to be moved to occupy all the squares of one of the two diagonals.
Determine the smallest number such that for any initial situation, we can do it in at most steps.
Let be an isosceles triangle with . Let be a point inside the triangle such that . Let be the intersection of the line and the line parallel to that passes through . Let be the intersection of the angle bisectors of the angles and .
Show that the lines and are perpendicular.
Let and be positive integers. Prove that there exist positive integers and such that
Find all functions such that for all , .
Let , , , such that , , and . Prove the inequality
There are houses on the northern side of a street. Going from the west to the east, the houses are numbered from to . The number of each house is shown on a plate. One day the inhabitants of the street make fun of the postman by shuffling their number plates in the following way: for each pair of neighbouring houses, the current number plates are swapped exactly once during the day.
How many different sequences of number plates are possible at the end of the day?
Consider finitely many points in the plane with no three points on a line. All these points can be coloured red or green such that any triangle with vertices of the same colour contains at least one point of the other colour in its interior.
What is the maximal possible number of points with this property?
Let be an acute triangle. Construct a triangle such that , , , and the lines , , and pass through the points , , and , respectively. (All six points , , , , , and are distinct.)
Let be a point inside an acute triangle , such that is a common tangent of the circumcircles of and . Let be the intersection of the lines and , and let be the intersection of the lines and . Let be the intersection of the line and the perpendicular bisector of the segment . The circumcircle of and the circle with centre and radius intersect at points and .
Prove that the segment is a diameter of .
The numbers from to are written row by row into a table consisting of cells. Afterwards, all columns and all rows containing at least one of the perfect squares are simultaneously deleted.
How many cells remain?
The expression is written on the blackboard. Two players, and , play a game, taking turns. Player takes the first turn. In each turn, the player on turn replaces a symbol by a positive integer. After all the symbols are replaced, player replaces each of the signs by either or , independently of each other. Player wins if the value of the expression on the blackboard is not divisible by any of the numbers . Otherwise, player wins.
Determine which player has a winning strategy.