Let be an integer. Ivan writes the numbers each on different cards. He then shuffles these cards, and divides them into two piles. Prove that at least one of the piles contains two cards such that the sum of their numbers is a perfect square.
International Competitions 2021
| # | Competition | Years | Problems | Years |
|---|---|---|---|---|
| 1 | International Mathematical Olympiad | 1959–2025 | 398 | |
| 2 | Middle European Mathematical Olympiad | 2009–2025 | 160 |
Show that the inequality holds for all real numbers .
Let be an interior point of the acute triangle with so that . The point on the segment satisfies , the point on the segment satisfies , and the point on the line satisfies . Let and be the circumcentres of the triangles and , respectively. Prove that the lines , , and are concurrent.
Let be a circle with centre , and a convex quadrilateral such that each of the segments , , and is tangent to . Let be the circumcircle of the triangle . The extension of beyond meets at , and the extension of beyond meets at . The extensions of and beyond meet at and , respectively. Prove that
Two squirrels, Bushy and Jumpy, have collected 2021 walnuts for the winter. Jumpy numbers the walnuts from 1 through 2021, and digs 2021 little holes in a circular pattern in the ground around their favourite tree. The next morning Jumpy notices that Bushy had placed one walnut into each hole, but had paid no attention to the numbering. Unhappy, Jumpy decides to reorder the walnuts by performing a sequence of 2021 moves. In the -th move, Jumpy swaps the positions of the two walnuts adjacent to walnut .
Prove that there exists a value of such that, on the -th move, Jumpy swaps some walnuts and such that .
Let be an integer, be a finite set of (not necessarily positive) integers, and be subsets of . Assume that for each the sum of the elements of is . Prove that contains at least elements.
Determine all real numbers such that every sequence of non-zero real numbers satisfying
for every integer , has only finitely many negative terms.
Let and be positive integers. Some squares of an board are coloured red. A sequence of pairwise distinct red squares is called a bishop circuit if for every , the squares and lie on a diagonal, but the squares and do not lie on a diagonal (here and ).
In terms of and , determine the maximum possible number of red squares on an board without a bishop circuit.
(Remark. Two squares lie on a diagonal if the line passing through their centres intersects the sides of the board at an angle of .)
Let be an acute triangle and an interior point of segment . Points and lie in the half-plane determined by the line containing such that is perpendicular to and is tangent to the circumcircle of , while is perpendicular to and is tangent to the circumcircle of . Prove that the points , , and are concyclic.
Let be an integer. Zagi the squirrel sits at a vertex of a regular -gon. Zagi plans to make a journey of jumps such that in the -th jump, it jumps by edges clockwise, for . Prove that if after jumps Zagi has visited distinct vertices, then after jumps Zagi will have visited all of the vertices.
(Remark. For a real number , we denote by the smallest integer larger or equal to .)
Determine all functions such that the inequality
holds for all real numbers and .
Given a positive integer , we say that a polynomial with real coefficients is -pretty if the equation has exactly real solutions. Show that for each positive integer
(a) there exists an -pretty polynomial;
(b) any -pretty polynomial has a degree of at least .
(Remark. For a real number , we denote by the largest integer smaller than or equal to .)
Let , and be positive integers. A group of pirates wants to fairly split their treasure. The treasure consists of identical coins distributed over bags, of which at least bags are initially empty. Captain Jack inspects the contents of each bag and then performs a sequence of moves. In one move, he can take any number of coins from a single bag and put them into one empty bag. Prove that no matter how the coins are initially distributed, Jack can perform at most moves and then split the bags among the pirates such that each pirate gets bags and coins.
Let be a positive integer. Prove that in a regular -gon, we can draw diagonals with pairwise distinct ends and partition the drawn diagonals into triplets so that:
- the diagonals in each triplet intersect in one interior point of the polygon and
- all these intersection points are distinct.
Let be the diameter of the circumcircle of an acute triangle . The lines through parallel to and meet lines and in points and , respectively. Lines and meet at . Prove that and are perpendicular.
Let be a triangle and let be the midpoint of the segment . Let be a point on the ray such that . Let be a point on the ray such that . The line intersects the circumcircle of the triangle at and , such that the points , , , and lie in this order on the line . Prove that .
Find all pairs of positive integers such that is prime and
Prove that there are infinitely many positive integers such that written in base contains only digits and .