Triangle has a right angle at . Let be the point on line such that and lies between and . Point is chosen such that and is the bisector of . Point is chosen such that and is the bisector of . Let be the midpoint of . Let be the point such that is a parallelogram (where and ). Prove that lines , , and are concurrent.
International Competitions 2016
| # | Competition | Years | Problems | Years |
|---|---|---|---|---|
| 1 | International Mathematical Olympiad | 1959–2025 | 398 | |
| 2 | Middle European Mathematical Olympiad | 2009–2025 | 160 |
Find all positive integers for which each cell of an table can be filled with one of the letters , and in such a way that:
- in each row and each column, one third of the entries are , one third are and one third are ; and
- in any diagonal, if the number of entries on the diagonal is a multiple of three, then one third of the entries are , one third are and one third are .
Note: The rows and columns of an table are each labelled 1 to in a natural order. Thus each cell corresponds to a pair of positive integers with . For , the table has diagonals of two types. A diagonal of the first type consists of all cells for which is a constant, and a diagonal of the second type consists of all cells for which is a constant.
Let be a convex polygon in the plane. The vertices have integral coordinates and lie on a circle. Let be the area of . An odd positive integer is given such that the squares of the side lengths of are integers divisible by . Prove that is an integer divisible by .
A set of positive integers is called fragrant if it contains at least two elements and each of its elements has a prime factor in common with at least one of the other elements. Let . What is the least possible value of the positive integer such that there exists a non-negative integer for which the set is fragrant?
The equation is written on the board, with 2016 linear factors on each side. What is the least possible value of for which it is possible to erase exactly of these 4032 linear factors so that at least one factor remains on each side and the resulting equation has no real solutions?
There are line segments in the plane such that every two segments cross, and no three segments meet at a point. Geoff has to choose an endpoint of each segment and place a frog on it, facing the other endpoint. Then he will clap his hands times. Every time he claps, each frog will immediately jump forward to the next intersection point on its segment. Frogs never change the direction of their jumps. Geoff wishes to place the frogs in such a way that no two of them will ever occupy the same intersection point at the same time.
(a) Prove that Geoff can always fulfil his wish if is odd.
(b) Prove that Geoff can never fulfil his wish if is even.
Let be an integer and be real numbers satisfying
(a) for and
(b) .
Prove the inequality
and determine when equality holds.
There are positive integers written on a blackboard. A move consists of choosing three numbers on the blackboard such that they are the sides of a non-degenerate non-equilateral triangle and replacing them by , and .
Show that an infinite sequence of moves cannot exist.
Let be an acute-angled triangle with and with circumcentre . The point lies in its interior such that the points lie on a circle and is perpendicular to . The point lies on the segment such that is parallel to .
Prove that .
Find all functions such that divides for all .
Remark: denotes the set of positive integers.
Determine all triples of real numbers satisfying the system of equations
Let denote the set of real numbers. Determine all functions such that holds for all real numbers and .
A tract of land in the shape of an square, whose sides are oriented north-south and east-west, consists of smaller square plots. There can be at most one house on each of the individual plots. A house can only occupy a single square plot.
A house is said to be blocked from sunlight if there are three houses on the plots immediately to its east, west and south.
What is the maximum number of houses that can simultaneously exist, such that none of them is blocked from sunlight?
Remark: By definition, houses on the east, west and south borders are never blocked from sunlight.
A class of high school students wrote a test. Every question was graded as either point for a correct answer or points otherwise. It is known that each question was answered correctly by at least one student and the students did not all achieve the same total score.
Prove that there was a question on the test with the following property: The students who answered the question correctly got a higher average test score than those who did not.
Let be an acute-angled triangle with , and let be its circumcentre. The line intersects the circumcircle of a second time in point , and the line in point . The circumcircle of intersects the line a second time in point . The line intersects the line in point . The line through parallel to intersects the altitude of the triangle that passes through in point .
Prove that .
Let be a triangle with . The points are the midpoints of the sides , respectively. The inscribed circle of with centre touches the side at point . The line , which passes through the midpoint of segment and is perpendicular to , intersects the line at point .
Prove that .
A positive integer is called a Mozartian number if the numbers together contain an even number of each digit (in base ).
Prove:
(a) All Mozartian numbers are even.
(b) There are infinitely many Mozartian numbers.
We consider the equation , where are positive integers.
Prove:
(a) There are no solutions for .
(b) For , must be divisible by for every solution .
(c) The equation has infinitely many solutions for .