problem
stringlengths 14
10.4k
| solution
stringlengths 1
24.1k
| answer
stringlengths 1
250
⌀ | problem_is_valid
stringclasses 4
values | solution_is_valid
stringclasses 3
values | question_type
stringclasses 4
values | problem_type
stringclasses 8
values | problem_raw
stringlengths 14
10.4k
| solution_raw
stringlengths 1
24.1k
| metadata
dict |
|---|---|---|---|---|---|---|---|---|---|
We are given 1999 coins. No two coins have the same weight. A machine is provided which allows us with one operation to determine, for any three coins, which one has the middle weight. Prove that the coin that is the 1000 -th by weight can be determined using no more than 1000000 operations and that this is the only coin whose position by weight can be determined using this machine.
|
It is possible to find the 1000 -th coin (i.e. the medium one among the 1999 coins). First we exclude the lightest and heaviest coin - for this we use 1997 weighings, putting the medium-weighted coin aside each time. Next we exclude the 2 -nd and 1998 -th coins using 1995 weighings, etc. In total we need
$$
1997+1995+1993+\ldots+3+1=999 \cdot 999<1000000
$$
weighings to determine the 1000 -th coin in such a way.
It is not possible to determine the position by weight of any other coin, since we cannot distinguish between the $k$-th and $(2000-k)$-th coin. To prove this, label the coins in some order as $a_{1}, a_{2}, \ldots, a_{1999}$. If a procedure for finding the $k$-th coin exists then it should work as follows. First we choose some three coins $a_{i_{1}}, a_{j_{1}}, a_{k_{1}}$, find the medium-weighted one among them, then choose again some three coins $a_{i_{2}}, a_{j_{2}}, a_{k_{2}}$ (possibly using the information obtained from the previous weighing) etc. The results of these
weighings can be written in a table like this:
| Coin 1 | Coin 2 | Coin 3 | Medium |
| :---: | :---: | :---: | :---: |
| $a_{i_{1}}$ | $a_{j_{1}}$ | $a_{k_{1}}$ | $a_{m_{1}}$ |
| $a_{i_{2}}$ | $a_{j_{2}}$ | $a_{k_{2}}$ | $a_{m_{2}}$ |
| $\ldots$ | $\ldots$ | $\ldots$ | $\ldots$ |
| $a_{i_{n}}$ | $a_{j_{n}}$ | $a_{k_{n}}$ | $a_{m_{n}}$ |
Suppose we make a decision " $a_{k}$ is the $k$-th coin" based on this table. Now let us exchange labels of the lightest and the heaviest coins, of the 2-nd and 1998 -th (by weight) coins etc. It is easy to see that, after this relabeling, each step in the procedure above gives the same result as before - but if $a_{k}$ was previously the $k$-th coin by weight, then now it is the $(2000-k)$-th coin, so the procedure yields a wrong coin which gives us the contradiction.
|
proof
|
Yes
|
Yes
|
proof
|
Combinatorics
|
We are given 1999 coins. No two coins have the same weight. A machine is provided which allows us with one operation to determine, for any three coins, which one has the middle weight. Prove that the coin that is the 1000 -th by weight can be determined using no more than 1000000 operations and that this is the only coin whose position by weight can be determined using this machine.
|
It is possible to find the 1000 -th coin (i.e. the medium one among the 1999 coins). First we exclude the lightest and heaviest coin - for this we use 1997 weighings, putting the medium-weighted coin aside each time. Next we exclude the 2 -nd and 1998 -th coins using 1995 weighings, etc. In total we need
$$
1997+1995+1993+\ldots+3+1=999 \cdot 999<1000000
$$
weighings to determine the 1000 -th coin in such a way.
It is not possible to determine the position by weight of any other coin, since we cannot distinguish between the $k$-th and $(2000-k)$-th coin. To prove this, label the coins in some order as $a_{1}, a_{2}, \ldots, a_{1999}$. If a procedure for finding the $k$-th coin exists then it should work as follows. First we choose some three coins $a_{i_{1}}, a_{j_{1}}, a_{k_{1}}$, find the medium-weighted one among them, then choose again some three coins $a_{i_{2}}, a_{j_{2}}, a_{k_{2}}$ (possibly using the information obtained from the previous weighing) etc. The results of these
weighings can be written in a table like this:
| Coin 1 | Coin 2 | Coin 3 | Medium |
| :---: | :---: | :---: | :---: |
| $a_{i_{1}}$ | $a_{j_{1}}$ | $a_{k_{1}}$ | $a_{m_{1}}$ |
| $a_{i_{2}}$ | $a_{j_{2}}$ | $a_{k_{2}}$ | $a_{m_{2}}$ |
| $\ldots$ | $\ldots$ | $\ldots$ | $\ldots$ |
| $a_{i_{n}}$ | $a_{j_{n}}$ | $a_{k_{n}}$ | $a_{m_{n}}$ |
Suppose we make a decision " $a_{k}$ is the $k$-th coin" based on this table. Now let us exchange labels of the lightest and the heaviest coins, of the 2-nd and 1998 -th (by weight) coins etc. It is easy to see that, after this relabeling, each step in the procedure above gives the same result as before - but if $a_{k}$ was previously the $k$-th coin by weight, then now it is the $(2000-k)$-th coin, so the procedure yields a wrong coin which gives us the contradiction.
|
{
"exam": "BalticWay",
"problem_label": "8",
"problem_match": "\n8.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n8.",
"tier": "T3",
"year": "1999"
}
|
A cube with edge length 3 is divided into 27 unit cubes. The numbers $1,2, \ldots, 27$ are distributed arbitrarily over the unit cubes, with one number in each cube. We form the 27 possible row sums (there are nine such sums of three integers for each of the three directions parallel to the edges of the cube). At most how many of the 27 row sums can be odd?
|
Answer: 24.
Since each unit cube contributes to exactly three of the row sums, then the total of all the 27 row sums is $3 \cdot(1+2+\ldots+27)=3 \cdot 14 \cdot 27$, which is even. Hence there must be an even number of odd row sums.
(a)
(b)
I
II
III
Figure 2
Figure 3
We shall prove that if one of the three levels of the cube (in any given direction) contains an even row sum, then there is another even row sum within that same level - hence there cannot be 26 odd row sums. Indeed, if this even row sum is formed by three even numbers (case (a) on Figure 2, where + denotes an even number and - denotes an odd number), then in order not to have even column sums (i.e. row sums in the perpendicular direction), we must have another even number in each of the three columns. But then the two remaining rows contain three even and three odd numbers, and hence their row sums cannot both be odd. Consider now the other case when the even row sum is formed by one even number and two odd numbers (case (b) on Figure 2). In order not to have even column sums, the column
containing the even number must contain another even number and an odd number, and each of the other two columns must have two numbers of the same parity. Hence the two other row sums have different parity, and one of them must be even.
It remains to notice that we can achieve 24 odd row sums (see Figure 3, where the three levels of the cube are shown).
|
24
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
A cube with edge length 3 is divided into 27 unit cubes. The numbers $1,2, \ldots, 27$ are distributed arbitrarily over the unit cubes, with one number in each cube. We form the 27 possible row sums (there are nine such sums of three integers for each of the three directions parallel to the edges of the cube). At most how many of the 27 row sums can be odd?
|
Answer: 24.
Since each unit cube contributes to exactly three of the row sums, then the total of all the 27 row sums is $3 \cdot(1+2+\ldots+27)=3 \cdot 14 \cdot 27$, which is even. Hence there must be an even number of odd row sums.
(a)
(b)
I
II
III
Figure 2
Figure 3
We shall prove that if one of the three levels of the cube (in any given direction) contains an even row sum, then there is another even row sum within that same level - hence there cannot be 26 odd row sums. Indeed, if this even row sum is formed by three even numbers (case (a) on Figure 2, where + denotes an even number and - denotes an odd number), then in order not to have even column sums (i.e. row sums in the perpendicular direction), we must have another even number in each of the three columns. But then the two remaining rows contain three even and three odd numbers, and hence their row sums cannot both be odd. Consider now the other case when the even row sum is formed by one even number and two odd numbers (case (b) on Figure 2). In order not to have even column sums, the column
containing the even number must contain another even number and an odd number, and each of the other two columns must have two numbers of the same parity. Hence the two other row sums have different parity, and one of them must be even.
It remains to notice that we can achieve 24 odd row sums (see Figure 3, where the three levels of the cube are shown).
|
{
"exam": "BalticWay",
"problem_label": "9",
"problem_match": "\n9.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n9.",
"tier": "T3",
"year": "1999"
}
|
Can the points of a disc of radius 1 (including its circumference) be partitioned into three subsets in such a way that no subset contains two points separated by distance 1 ?
|
Answer: no.
Let $O$ denote the centre of the disc, and $P_{1}, \ldots, P_{6}$ the vertices of an inscribed regular hexagon in the natural order (see Figure 4).
If the required partitioning exists, then $\{O\},\left\{P_{1}, P_{3}, P_{5}\right\}$ and $\left\{P_{2}, P_{4}, P_{6}\right\}$ are contained in different subsets. Now consider the circles of radius 1 centered in $P_{1}, P_{3}$ and $P_{5}$. The circle of radius $1 / \sqrt{3}$ centered in $O$ intersects these three circles in the vertices $A_{1}, A_{2}, A_{3}$ of an equilateral triangle of side length 1 . The vertices of this triangle belong to different subsets, but none of them can belong to the same subset as $P_{1}$ - a contradiction. Hence the required partitioning does not exist.
Figure 4
|
proof
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Can the points of a disc of radius 1 (including its circumference) be partitioned into three subsets in such a way that no subset contains two points separated by distance 1 ?
|
Answer: no.
Let $O$ denote the centre of the disc, and $P_{1}, \ldots, P_{6}$ the vertices of an inscribed regular hexagon in the natural order (see Figure 4).
If the required partitioning exists, then $\{O\},\left\{P_{1}, P_{3}, P_{5}\right\}$ and $\left\{P_{2}, P_{4}, P_{6}\right\}$ are contained in different subsets. Now consider the circles of radius 1 centered in $P_{1}, P_{3}$ and $P_{5}$. The circle of radius $1 / \sqrt{3}$ centered in $O$ intersects these three circles in the vertices $A_{1}, A_{2}, A_{3}$ of an equilateral triangle of side length 1 . The vertices of this triangle belong to different subsets, but none of them can belong to the same subset as $P_{1}$ - a contradiction. Hence the required partitioning does not exist.
Figure 4
|
{
"exam": "BalticWay",
"problem_label": "10",
"problem_match": "\n10.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n10.",
"tier": "T3",
"year": "1999"
}
|
Prove that for any four points in the plane, no three of which are collinear, there exists a circle such that three of the four points are on the circumference and the fourth point is either on the circumference or inside the circle.
|
Consider a circle containing all these four points in its interior. First, decrease its radius until at least one of these points (say, $A$ ) will be on the circle. If the other three points are still in the interior of the circle, then rotate the circle around $A$ (with its radius unchanged) until at least one of the other three points (say, $B$ ) will also be on the circle. The centre of the circle now lies on the perpendicular bisector of the segment $A B$ - moving
the centre along that perpendicular bisector (and changing its radius at the same time, so that points $A$ and $B$ remain on the circle) we arrive at a situation where at least one of the remaining two points will also be on the circle (see Figure 5).
Figure 5
Alternative solution. The quadrangle with its vertices in the four points can be convex or non-convex.
If the quadrangle is non-convex, then one of the points lies in the interior of the triangle defined by the remaining three points (see Figure 6) - the circumcircle of that triangle has the required property.
Figure 6
Figure 7
Assume now that the quadrangle $A B C D$ (where $A, B, C, D$ are the four points) is convex. Then it has a pair of opposite angles, the sum of which is at least $180^{\circ}$ - assume these are at vertices $B$ and $D$ (see Figure 7). We shall prove that point $D$ lies either in the interior of the circumcircle of triangle $A B C$ or on that circle. Indeed, let the ray drawn from the
circumcentre $O$ of triangle $A B C$ through point $D$ intersect the circumcircle in $D^{\prime}$ : since $\angle B+\angle D^{\prime}=180^{\circ}$ and $\angle B+\angle D \geqslant 180^{\circ}$, then $D$ cannot lie in the exterior of the circumcircle.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Prove that for any four points in the plane, no three of which are collinear, there exists a circle such that three of the four points are on the circumference and the fourth point is either on the circumference or inside the circle.
|
Consider a circle containing all these four points in its interior. First, decrease its radius until at least one of these points (say, $A$ ) will be on the circle. If the other three points are still in the interior of the circle, then rotate the circle around $A$ (with its radius unchanged) until at least one of the other three points (say, $B$ ) will also be on the circle. The centre of the circle now lies on the perpendicular bisector of the segment $A B$ - moving
the centre along that perpendicular bisector (and changing its radius at the same time, so that points $A$ and $B$ remain on the circle) we arrive at a situation where at least one of the remaining two points will also be on the circle (see Figure 5).
Figure 5
Alternative solution. The quadrangle with its vertices in the four points can be convex or non-convex.
If the quadrangle is non-convex, then one of the points lies in the interior of the triangle defined by the remaining three points (see Figure 6) - the circumcircle of that triangle has the required property.
Figure 6
Figure 7
Assume now that the quadrangle $A B C D$ (where $A, B, C, D$ are the four points) is convex. Then it has a pair of opposite angles, the sum of which is at least $180^{\circ}$ - assume these are at vertices $B$ and $D$ (see Figure 7). We shall prove that point $D$ lies either in the interior of the circumcircle of triangle $A B C$ or on that circle. Indeed, let the ray drawn from the
circumcentre $O$ of triangle $A B C$ through point $D$ intersect the circumcircle in $D^{\prime}$ : since $\angle B+\angle D^{\prime}=180^{\circ}$ and $\angle B+\angle D \geqslant 180^{\circ}$, then $D$ cannot lie in the exterior of the circumcircle.
|
{
"exam": "BalticWay",
"problem_label": "11",
"problem_match": "\n11.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n11.",
"tier": "T3",
"year": "1999"
}
|
In a triangle $A B C$ it is given that $2|A B|=|A C|+|B C|$. Prove that the incentre of $A B C$, the circumcentre of $A B C$, and the midpoints of $A C$ and $B C$ are concyclic.
|
Let $N$ be the midpoint of $B C$ and $M$ the midpoint of $A C$. Let $O$ be the circumcentre of $A B C$ and $I$ its incentre (see Figure 8). Since $\angle C M O=\angle C N O=90^{\circ}$, the points $C, N, O$ and $M$ are concyclic (regardless of whether $O$ lies inside the triangle $A B C$ ). We now have to show that the points $C, N, I$ and $M$ are also concyclic, i.e $I$ lies on the same circle as $C, N, O$ and $M$. It will be sufficient to show that $\angle N C M+\angle N I M=180^{\circ}$ in the quadrilateral $C N I M$. Since
$$
|A B|=\frac{|A C|+|B C|}{2}=|A M|+|B N|
$$
we can choose a point $D$ on the side $A B$ such that $|A D|=|A M|$ and $|B D|=|B N|$. Then triangle $A I M$ is congruent to triangle $A I D$, and similarly triangle $B I N$ is congruent to triangle $B I D$. Therefore
$$
\begin{aligned}
\angle N C M+\angle N I M & =\angle N C M+\left(360^{\circ}-2 \angle A I D-2 \angle B I D\right)= \\
& =\angle B C A+360^{\circ}-2 \angle A I B= \\
& =\angle B C A+360^{\circ}-2 \cdot\left(180^{\circ}-\frac{\angle B A C}{2}-\frac{\angle A B C}{2}\right)= \\
& =\angle B C A+\angle A B C+\angle C A B=180^{\circ} .
\end{aligned}
$$
Figure 8
Figure 9
Alternative solution. Let $O$ be the circumcentre of $A B C$ and $I$ its in-
centre, and let $G, H$ and $K$ be the points where the incircle touches the sides $B C, A C$ and $A B$ of the triangle, respectively. Also, let $N$ be the midpoint of $B C$ and $M$ the midpoint of $A C$ (see Figure 9). Since $\angle C M O=\angle C N O=90^{\circ}$, points $M$ and $N$ lie on the circle with diameter $O C$. We will show that point $I$ also lies on that circle. Indeed, we have
$$
|A H|+|B G|=|A K|+|B K|=|A B|=\frac{|A C|+|B C|}{2}=|A M|+|B N|,
$$
implying $|M H|=|N G|$. Since $M H$ and $N G$ are the perpendicular projections of $O I$ to the lines $A C$ and $B C$, respectively, then $I O$ must be either parallel or perpendicular to the bisector $C I$ of angle $A C B$. (To formally prove this, consider unit vectors $\overrightarrow{e_{1}}$ and $\overrightarrow{e_{2}}$ defined by the rays $C A$ and $C B$, and show that the condition $|M H|=|N G|$ is equivalent to $\left(\overrightarrow{e_{1}} \pm \overrightarrow{e_{2}}\right) \cdot \overrightarrow{I O}=0$.)
If $I O$ is perpendicular to $C I$, then $\angle C I O=90^{\circ}$ and we are done. If $I O$ is parallel to $C I$, the the circumcentre $O$ of triangle $A B C$ lies on the bisector $C I$ of angle $A C B$, whence $|A C|=|B C|$ and the condition $2|A B|=|A C|+|B C|$ implies that $A B C$ is an equilateral triangle. Hence in this case points $O$ and $I$ coincide and the claim of the problem holds trivially.
## 13. Answer: $60^{\circ}$.
Let $F$ be the point of the side $A B$ such that $|A F|=|A E|$ and $|B F|=|B D|$ (see Figure 10). The line $A D$ is the angle bisector of $\angle A$ in the isosceles triangle $A E F$. This implies that $A D$ is the perpendicular bisector of $E F$, whence $|D E|=|D F|$. Similarly we show that $|D E|=|E F|$. This proves that the triangle $D E F$ is equilateral, i.e. $\angle E F D=60^{\circ}$. Hence $\angle A F E+\angle B F D=120^{\circ}$, and also $\angle A E F+\angle B D F=120^{\circ}$. Thus $\angle C A B+\angle C B A=120^{\circ}$ and finally $\angle C=60^{\circ}$.
Alternative solution. Let $I$ be the incenter of triangle $A B C$, and let $G$, $H, K$ be the points where its incircle touches the sides $B C, A C, A B$ respectively (see Figure 11). Then
$$
|A E|+|B D|=|A B|=|A K|+|B K|=|A H|+|B G| \text {, }
$$
implying $|D G|=|E H|$. Hence the triangles $D I G$ ja $E I H$ are congruent,
and
$\angle D I E=\angle G I H=180^{\circ}-\angle C$.
Figure 10
Figure 11
On the other hand,
$$
\angle D I E=\angle A I B=180^{\circ}-\frac{\angle A+\angle B}{2} .
$$
Hence
$$
\angle C=\frac{\angle A+\angle B}{2}=90^{\circ}-\frac{\angle C}{2}
$$
which gives $\angle C=60^{\circ}$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
In a triangle $A B C$ it is given that $2|A B|=|A C|+|B C|$. Prove that the incentre of $A B C$, the circumcentre of $A B C$, and the midpoints of $A C$ and $B C$ are concyclic.
|
Let $N$ be the midpoint of $B C$ and $M$ the midpoint of $A C$. Let $O$ be the circumcentre of $A B C$ and $I$ its incentre (see Figure 8). Since $\angle C M O=\angle C N O=90^{\circ}$, the points $C, N, O$ and $M$ are concyclic (regardless of whether $O$ lies inside the triangle $A B C$ ). We now have to show that the points $C, N, I$ and $M$ are also concyclic, i.e $I$ lies on the same circle as $C, N, O$ and $M$. It will be sufficient to show that $\angle N C M+\angle N I M=180^{\circ}$ in the quadrilateral $C N I M$. Since
$$
|A B|=\frac{|A C|+|B C|}{2}=|A M|+|B N|
$$
we can choose a point $D$ on the side $A B$ such that $|A D|=|A M|$ and $|B D|=|B N|$. Then triangle $A I M$ is congruent to triangle $A I D$, and similarly triangle $B I N$ is congruent to triangle $B I D$. Therefore
$$
\begin{aligned}
\angle N C M+\angle N I M & =\angle N C M+\left(360^{\circ}-2 \angle A I D-2 \angle B I D\right)= \\
& =\angle B C A+360^{\circ}-2 \angle A I B= \\
& =\angle B C A+360^{\circ}-2 \cdot\left(180^{\circ}-\frac{\angle B A C}{2}-\frac{\angle A B C}{2}\right)= \\
& =\angle B C A+\angle A B C+\angle C A B=180^{\circ} .
\end{aligned}
$$
Figure 8
Figure 9
Alternative solution. Let $O$ be the circumcentre of $A B C$ and $I$ its in-
centre, and let $G, H$ and $K$ be the points where the incircle touches the sides $B C, A C$ and $A B$ of the triangle, respectively. Also, let $N$ be the midpoint of $B C$ and $M$ the midpoint of $A C$ (see Figure 9). Since $\angle C M O=\angle C N O=90^{\circ}$, points $M$ and $N$ lie on the circle with diameter $O C$. We will show that point $I$ also lies on that circle. Indeed, we have
$$
|A H|+|B G|=|A K|+|B K|=|A B|=\frac{|A C|+|B C|}{2}=|A M|+|B N|,
$$
implying $|M H|=|N G|$. Since $M H$ and $N G$ are the perpendicular projections of $O I$ to the lines $A C$ and $B C$, respectively, then $I O$ must be either parallel or perpendicular to the bisector $C I$ of angle $A C B$. (To formally prove this, consider unit vectors $\overrightarrow{e_{1}}$ and $\overrightarrow{e_{2}}$ defined by the rays $C A$ and $C B$, and show that the condition $|M H|=|N G|$ is equivalent to $\left(\overrightarrow{e_{1}} \pm \overrightarrow{e_{2}}\right) \cdot \overrightarrow{I O}=0$.)
If $I O$ is perpendicular to $C I$, then $\angle C I O=90^{\circ}$ and we are done. If $I O$ is parallel to $C I$, the the circumcentre $O$ of triangle $A B C$ lies on the bisector $C I$ of angle $A C B$, whence $|A C|=|B C|$ and the condition $2|A B|=|A C|+|B C|$ implies that $A B C$ is an equilateral triangle. Hence in this case points $O$ and $I$ coincide and the claim of the problem holds trivially.
## 13. Answer: $60^{\circ}$.
Let $F$ be the point of the side $A B$ such that $|A F|=|A E|$ and $|B F|=|B D|$ (see Figure 10). The line $A D$ is the angle bisector of $\angle A$ in the isosceles triangle $A E F$. This implies that $A D$ is the perpendicular bisector of $E F$, whence $|D E|=|D F|$. Similarly we show that $|D E|=|E F|$. This proves that the triangle $D E F$ is equilateral, i.e. $\angle E F D=60^{\circ}$. Hence $\angle A F E+\angle B F D=120^{\circ}$, and also $\angle A E F+\angle B D F=120^{\circ}$. Thus $\angle C A B+\angle C B A=120^{\circ}$ and finally $\angle C=60^{\circ}$.
Alternative solution. Let $I$ be the incenter of triangle $A B C$, and let $G$, $H, K$ be the points where its incircle touches the sides $B C, A C, A B$ respectively (see Figure 11). Then
$$
|A E|+|B D|=|A B|=|A K|+|B K|=|A H|+|B G| \text {, }
$$
implying $|D G|=|E H|$. Hence the triangles $D I G$ ja $E I H$ are congruent,
and
$\angle D I E=\angle G I H=180^{\circ}-\angle C$.
Figure 10
Figure 11
On the other hand,
$$
\angle D I E=\angle A I B=180^{\circ}-\frac{\angle A+\angle B}{2} .
$$
Hence
$$
\angle C=\frac{\angle A+\angle B}{2}=90^{\circ}-\frac{\angle C}{2}
$$
which gives $\angle C=60^{\circ}$.
|
{
"exam": "BalticWay",
"problem_label": "12",
"problem_match": "\n12.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n12.",
"tier": "T3",
"year": "1999"
}
|
Let $A B C$ be an isosceles triangle with $|A B|=|A C|$. Points $D$ and $E$ lie on the sides $A B$ and $A C$, respectively. The line passing through $B$ and parallel to $A C$ meets the line $D E$ at $F$. The line passing through $C$ and parallel to $A B$ meets the line $D E$ at $G$. Prove that
$$
\frac{[D B C G]}{[F B C E]}=\frac{|A D|}{|A E|}
$$
where $[P Q R S]$ denotes the area of the quadrilateral $P Q R S$.
|
The quadrilaterals $D B C G$ and $F B C E$ are trapeziums. The area of a trapezium is equal to half the sum of the lengths of the parallel sides multiplied by the distance between them. But the distance between the parallel sides is the same for both of these trapeziums, since the distance from $B$ to $A C$ is equal to the distance from $C$ to $A B$. It therefore suffices to show that
$$
\frac{|B D|+|C G|}{|C E|+|B F|}=\frac{|A D|}{|A E|}
$$
(see Figure 12). Now, since the triangles $B D F, A D E$ and $C G E$ are similar, we have
$$
\frac{|B D|}{|B F|}=\frac{|C G|}{|C E|}=\frac{|A D|}{|A E|}
$$
which implies the required equality.
Figure 12
Figure 13
Alternative solution. As in the first solution, we need to show that
$$
\frac{|B D|+|C G|}{|B F|+|C E|}=\frac{|A D|}{|A E|}
$$
Let $M$ be the midpoint of $B C$, and let $F^{\prime}$ and $G^{\prime}$ be the points symmetric to $F$ and $G$, respectively, relative to $M$ (see Figure 13). Since $C G$ is parallel to $A B$, then point $G^{\prime}$ lies on the line $A B$, and $\left|B G^{\prime}\right|=|C G|$. Similarly point $F^{\prime}$ lies on the line $A C$, and $\left|C F^{\prime}\right|=|B F|$. It remains to show that
$$
\frac{\left|D G^{\prime}\right|}{\left|E F^{\prime}\right|}=\frac{|A D|}{|A E|}
$$
which follows from $D E$ and $F^{\prime} G^{\prime}$ being parallel.
Another solution. Express the areas of the quadrilaterals as
$$
[D B C G]=[A B C]-[A D E]+[E C G]
$$
and
$$
[F B C E]=[A B C]-[A D E]+[D B F]
$$
The required equality can now be proved by direct computation.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be an isosceles triangle with $|A B|=|A C|$. Points $D$ and $E$ lie on the sides $A B$ and $A C$, respectively. The line passing through $B$ and parallel to $A C$ meets the line $D E$ at $F$. The line passing through $C$ and parallel to $A B$ meets the line $D E$ at $G$. Prove that
$$
\frac{[D B C G]}{[F B C E]}=\frac{|A D|}{|A E|}
$$
where $[P Q R S]$ denotes the area of the quadrilateral $P Q R S$.
|
The quadrilaterals $D B C G$ and $F B C E$ are trapeziums. The area of a trapezium is equal to half the sum of the lengths of the parallel sides multiplied by the distance between them. But the distance between the parallel sides is the same for both of these trapeziums, since the distance from $B$ to $A C$ is equal to the distance from $C$ to $A B$. It therefore suffices to show that
$$
\frac{|B D|+|C G|}{|C E|+|B F|}=\frac{|A D|}{|A E|}
$$
(see Figure 12). Now, since the triangles $B D F, A D E$ and $C G E$ are similar, we have
$$
\frac{|B D|}{|B F|}=\frac{|C G|}{|C E|}=\frac{|A D|}{|A E|}
$$
which implies the required equality.
Figure 12
Figure 13
Alternative solution. As in the first solution, we need to show that
$$
\frac{|B D|+|C G|}{|B F|+|C E|}=\frac{|A D|}{|A E|}
$$
Let $M$ be the midpoint of $B C$, and let $F^{\prime}$ and $G^{\prime}$ be the points symmetric to $F$ and $G$, respectively, relative to $M$ (see Figure 13). Since $C G$ is parallel to $A B$, then point $G^{\prime}$ lies on the line $A B$, and $\left|B G^{\prime}\right|=|C G|$. Similarly point $F^{\prime}$ lies on the line $A C$, and $\left|C F^{\prime}\right|=|B F|$. It remains to show that
$$
\frac{\left|D G^{\prime}\right|}{\left|E F^{\prime}\right|}=\frac{|A D|}{|A E|}
$$
which follows from $D E$ and $F^{\prime} G^{\prime}$ being parallel.
Another solution. Express the areas of the quadrilaterals as
$$
[D B C G]=[A B C]-[A D E]+[E C G]
$$
and
$$
[F B C E]=[A B C]-[A D E]+[D B F]
$$
The required equality can now be proved by direct computation.
|
{
"exam": "BalticWay",
"problem_label": "14",
"problem_match": "\n14.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n14.",
"tier": "T3",
"year": "1999"
}
|
Let $A B C$ be a triangle with $\angle C=60^{\circ}$ and $|A C|<|B C|$. The point $D$ lies on the side $B C$ and satisfies $|B D|=|A C|$. The side $A C$ is extended to the point $E$ where $|A C|=|C E|$. Prove that $|A B|=|D E|$.
|
Consider a point $F$ on $B C$ such that $|C F|=|B D|$ (see Figure 14). Since $\angle A C F=60^{\circ}$, triangle $A C F$ is equilateral. Therefore $|A F|=|A C|=|C E|$
and $\angle A F B=\angle E C D=120^{\circ}$. Moreover, $|B F|=|C D|$. This implies that triangles $A F B$ and $E C D$ are congruent, and $|A B|=|D E|$.
Figure 14
Alternative solution. The cosine law in triangle $A B C$ implies
$$
\begin{aligned}
|A B|^{2} & =|A C|^{2}+|B C|^{2}-2 \cdot|A C| \cdot|B C| \cdot \cos \angle A C B= \\
& =|A C|^{2}+|B C|^{2}-|A C| \cdot|B C|= \\
& =|A C|^{2}+(|B D|+|D C|)^{2}-|A C| \cdot(|B D|+|D C|)= \\
& =|A C|^{2}+(|A C|+|D C|)^{2}-|A C| \cdot(|A C|+|D C|)= \\
& =|A C|^{2}+|D C|^{2}+|A C| \cdot|D C|
\end{aligned}
$$
On the other hand, the cosine law in triangle $C D E$ gives
$$
\begin{aligned}
|D E|^{2} & =|D C|^{2}+|C E|^{2}-2 \cdot|D C| \cdot|C E| \cdot \cos \angle D C E= \\
& =|D C|^{2}+|C E|^{2}+|D C| \cdot|E C|= \\
& =|D C|^{2}+|A C|^{2}+|D C| \cdot|A C| .
\end{aligned}
$$
Hence $|A B|=|D E|$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with $\angle C=60^{\circ}$ and $|A C|<|B C|$. The point $D$ lies on the side $B C$ and satisfies $|B D|=|A C|$. The side $A C$ is extended to the point $E$ where $|A C|=|C E|$. Prove that $|A B|=|D E|$.
|
Consider a point $F$ on $B C$ such that $|C F|=|B D|$ (see Figure 14). Since $\angle A C F=60^{\circ}$, triangle $A C F$ is equilateral. Therefore $|A F|=|A C|=|C E|$
and $\angle A F B=\angle E C D=120^{\circ}$. Moreover, $|B F|=|C D|$. This implies that triangles $A F B$ and $E C D$ are congruent, and $|A B|=|D E|$.
Figure 14
Alternative solution. The cosine law in triangle $A B C$ implies
$$
\begin{aligned}
|A B|^{2} & =|A C|^{2}+|B C|^{2}-2 \cdot|A C| \cdot|B C| \cdot \cos \angle A C B= \\
& =|A C|^{2}+|B C|^{2}-|A C| \cdot|B C|= \\
& =|A C|^{2}+(|B D|+|D C|)^{2}-|A C| \cdot(|B D|+|D C|)= \\
& =|A C|^{2}+(|A C|+|D C|)^{2}-|A C| \cdot(|A C|+|D C|)= \\
& =|A C|^{2}+|D C|^{2}+|A C| \cdot|D C|
\end{aligned}
$$
On the other hand, the cosine law in triangle $C D E$ gives
$$
\begin{aligned}
|D E|^{2} & =|D C|^{2}+|C E|^{2}-2 \cdot|D C| \cdot|C E| \cdot \cos \angle D C E= \\
& =|D C|^{2}+|C E|^{2}+|D C| \cdot|E C|= \\
& =|D C|^{2}+|A C|^{2}+|D C| \cdot|A C| .
\end{aligned}
$$
Hence $|A B|=|D E|$.
|
{
"exam": "BalticWay",
"problem_label": "15",
"problem_match": "\n15.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n15.",
"tier": "T3",
"year": "1999"
}
|
Find the smallest positive integer $k$ which is representable in the form $k=19^{n}-5^{m}$ for some positive integers $m$ and $n$.
|
Answer: 14.
Assume that there are integers $n, m$ such that $k=19^{n}-5^{m}$ is a positive integer smaller than $19^{1}-5^{1}=14$. For obvious reasons, $n$ and $m$ must be positive.
Case 1: Assume that $n$ is even. Then the last digit of $k$ is 6 . Consequently, we have $19^{n}-5^{m}=6$. Considering this equation modulo 3 implies that $m$
must be even as well. With $n=2 n^{\prime}$ and $m=2 m^{\prime}$ the above equation can be restated as $\left(19^{n^{\prime}}+5^{m^{\prime}}\right)\left(19^{n^{\prime}}-5^{m^{\prime}}\right)=6$ which evidently has no solution in positive integers.
Case 2: Assume that $n$ is odd. Then the last digit of $k$ is 4 . Consequently, we have $19^{n}-5^{m}=4$. On the other hand, the remainder of $19^{n}-5^{m}$ modulo 3 is never 1 , a contradiction.
|
14
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find the smallest positive integer $k$ which is representable in the form $k=19^{n}-5^{m}$ for some positive integers $m$ and $n$.
|
Answer: 14.
Assume that there are integers $n, m$ such that $k=19^{n}-5^{m}$ is a positive integer smaller than $19^{1}-5^{1}=14$. For obvious reasons, $n$ and $m$ must be positive.
Case 1: Assume that $n$ is even. Then the last digit of $k$ is 6 . Consequently, we have $19^{n}-5^{m}=6$. Considering this equation modulo 3 implies that $m$
must be even as well. With $n=2 n^{\prime}$ and $m=2 m^{\prime}$ the above equation can be restated as $\left(19^{n^{\prime}}+5^{m^{\prime}}\right)\left(19^{n^{\prime}}-5^{m^{\prime}}\right)=6$ which evidently has no solution in positive integers.
Case 2: Assume that $n$ is odd. Then the last digit of $k$ is 4 . Consequently, we have $19^{n}-5^{m}=4$. On the other hand, the remainder of $19^{n}-5^{m}$ modulo 3 is never 1 , a contradiction.
|
{
"exam": "BalticWay",
"problem_label": "16",
"problem_match": "\n16.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n16.",
"tier": "T3",
"year": "1999"
}
|
Does there exist a finite sequence of integers $c_{1}, \ldots, c_{n}$ such that all the numbers $a+c_{1}, \ldots, a+c_{n}$ are primes for more than one but not infinitely many different integers $a$ ?
|
Answer: yes.
Let $n=5$ and consider the integers $0,2,8,14,26$. Adding $a=3$ or $a=5$ to all of these integers we get primes. Since the numbers $0,2,8,14$ and 26 have pairwise different remainders modulo 5 then for any integer $a$ the numbers $a+0, a+2, a+8, a+14$ and $a+26$ have also pairwise different remainders modulo 5 ; therefore one of them is divisible by 5 . Hence if the numbers $a+0, a+2, a+8, a+14$ and $a+26$ are all primes then one of them must be equal to 5 , which is only true for $a=3$ and $a=5$.
|
proof
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Does there exist a finite sequence of integers $c_{1}, \ldots, c_{n}$ such that all the numbers $a+c_{1}, \ldots, a+c_{n}$ are primes for more than one but not infinitely many different integers $a$ ?
|
Answer: yes.
Let $n=5$ and consider the integers $0,2,8,14,26$. Adding $a=3$ or $a=5$ to all of these integers we get primes. Since the numbers $0,2,8,14$ and 26 have pairwise different remainders modulo 5 then for any integer $a$ the numbers $a+0, a+2, a+8, a+14$ and $a+26$ have also pairwise different remainders modulo 5 ; therefore one of them is divisible by 5 . Hence if the numbers $a+0, a+2, a+8, a+14$ and $a+26$ are all primes then one of them must be equal to 5 , which is only true for $a=3$ and $a=5$.
|
{
"exam": "BalticWay",
"problem_label": "17",
"problem_match": "\n17.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n17.",
"tier": "T3",
"year": "1999"
}
|
Let $m$ be a positive integer such that $m \equiv 2(\bmod 4)$. Show that there exists at most one factorization $m=a b$ where $a$ and $b$ are positive integers satisfying $0<a-b<\sqrt{5+4 \sqrt{4 m+1}}$.
|
Squaring the second inequality gives $(a-b)^{2}<5+4 \sqrt{4 m+1}$. Since $m=a b$, we have
$$
(a+b)^{2}<5+4 \sqrt{4 m+1}+4 m=(\sqrt{4 m+1}+2)^{2}
$$
implying
$$
a+b<\sqrt{4 m+1}+2 \text {. }
$$
Since $a>b$, different factorizations $m=a b$ will give different values for the sum $a+b(a b=m, a+b=k, a>b$ has at most one solution in $(a, b))$. Since $m \equiv 2(\bmod 4)$, we see that $a$ and $b$ must have different parity, and $a+b$ must be odd. Also note that
$$
a+b \geqslant 2 \sqrt{a b}=\sqrt{4 m}
$$
Since $4 m$ cannot be a square we have
$$
a+b \geqslant \sqrt{4 m+1} .
$$
Since $a+b$ is odd and the interval $[\sqrt{4 m+1}, \sqrt{4 m+1}+2)$ contains exactly one odd integer, then there can be at most one pair $(a, b)$ such that $a+b<\sqrt{4 m+1}+2$, or equivalently $a-b<\sqrt{5+4 \sqrt{4 m+1}}$.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
Let $m$ be a positive integer such that $m \equiv 2(\bmod 4)$. Show that there exists at most one factorization $m=a b$ where $a$ and $b$ are positive integers satisfying $0<a-b<\sqrt{5+4 \sqrt{4 m+1}}$.
|
Squaring the second inequality gives $(a-b)^{2}<5+4 \sqrt{4 m+1}$. Since $m=a b$, we have
$$
(a+b)^{2}<5+4 \sqrt{4 m+1}+4 m=(\sqrt{4 m+1}+2)^{2}
$$
implying
$$
a+b<\sqrt{4 m+1}+2 \text {. }
$$
Since $a>b$, different factorizations $m=a b$ will give different values for the sum $a+b(a b=m, a+b=k, a>b$ has at most one solution in $(a, b))$. Since $m \equiv 2(\bmod 4)$, we see that $a$ and $b$ must have different parity, and $a+b$ must be odd. Also note that
$$
a+b \geqslant 2 \sqrt{a b}=\sqrt{4 m}
$$
Since $4 m$ cannot be a square we have
$$
a+b \geqslant \sqrt{4 m+1} .
$$
Since $a+b$ is odd and the interval $[\sqrt{4 m+1}, \sqrt{4 m+1}+2)$ contains exactly one odd integer, then there can be at most one pair $(a, b)$ such that $a+b<\sqrt{4 m+1}+2$, or equivalently $a-b<\sqrt{5+4 \sqrt{4 m+1}}$.
|
{
"exam": "BalticWay",
"problem_label": "18",
"problem_match": "\n18.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n18.",
"tier": "T3",
"year": "1999"
}
|
Prove that there exist infinitely many even positive integers $k$ such that for every prime $p$ the number $p^{2}+k$ is composite.
|
Note that the square of any prime $p \neq 3$ is congruent to 1 modulo 3 . Hence the numbers $k=6 m+2$ will have the required property for any $p \neq 3$, as
$p^{2}+k$ will be divisible by 3 and hence composite.
In order to have $3^{2}+k$ also composite, we look for such values of $m$ for which $k=6 m+2$ is congruent to 1 modulo 5 - then $3^{2}+k$ will be divisible by 5 and hence composite. Taking $m=5 t+4$, we have $k=30 t+26$, which is congruent to 2 modulo 3 and congruent to 1 modulo 5 . Hence $p^{2}+(30 t+26)$ is composite for any positive integer $t$ and prime $p$.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
Prove that there exist infinitely many even positive integers $k$ such that for every prime $p$ the number $p^{2}+k$ is composite.
|
Note that the square of any prime $p \neq 3$ is congruent to 1 modulo 3 . Hence the numbers $k=6 m+2$ will have the required property for any $p \neq 3$, as
$p^{2}+k$ will be divisible by 3 and hence composite.
In order to have $3^{2}+k$ also composite, we look for such values of $m$ for which $k=6 m+2$ is congruent to 1 modulo 5 - then $3^{2}+k$ will be divisible by 5 and hence composite. Taking $m=5 t+4$, we have $k=30 t+26$, which is congruent to 2 modulo 3 and congruent to 1 modulo 5 . Hence $p^{2}+(30 t+26)$ is composite for any positive integer $t$ and prime $p$.
|
{
"exam": "BalticWay",
"problem_label": "19",
"problem_match": "\n19.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n19.",
"tier": "T3",
"year": "1999"
}
|
Let $a, b, c$ and $d$ be prime numbers such that $a>3 b>6 c>12 d$ and $a^{2}-b^{2}+c^{2}-d^{2}=1749$. Determine all possible values of $a^{2}+b^{2}+c^{2}+d^{2}$.
## Solutions
|
Answer: the only possible value is 1999 .
Since $a^{2}-b^{2}+c^{2}-d^{2}$ is odd, one of the primes $a, b, c$ and $d$ must be 2 , and in view of $a>3 b>6 c>12 d$ we must have $d=2$. Now
$$
1749=a^{2}-b^{2}+c^{2}-d^{2}>9 b^{2}-b^{2}+4 d^{2}-d^{2}=8 b^{2}-12,
$$
implying $b \leqslant 13$. From $4<c<\frac{b}{2}$ we now have $c=5$ and $b$ must be either 11 or 13 . It remains to check that $1749+2^{2}-5^{2}+13^{2}=1897$ is not a square of an integer, and $1749+2^{2}-5^{2}+11^{2}=1849=43^{2}$. Hence $b=11$, $a=43$ and
$$
a^{2}+b^{2}+c^{2}+d^{2}=43^{2}+11^{2}+5^{2}+2^{2}=1999
$$
|
1999
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Let $a, b, c$ and $d$ be prime numbers such that $a>3 b>6 c>12 d$ and $a^{2}-b^{2}+c^{2}-d^{2}=1749$. Determine all possible values of $a^{2}+b^{2}+c^{2}+d^{2}$.
## Solutions
|
Answer: the only possible value is 1999 .
Since $a^{2}-b^{2}+c^{2}-d^{2}$ is odd, one of the primes $a, b, c$ and $d$ must be 2 , and in view of $a>3 b>6 c>12 d$ we must have $d=2$. Now
$$
1749=a^{2}-b^{2}+c^{2}-d^{2}>9 b^{2}-b^{2}+4 d^{2}-d^{2}=8 b^{2}-12,
$$
implying $b \leqslant 13$. From $4<c<\frac{b}{2}$ we now have $c=5$ and $b$ must be either 11 or 13 . It remains to check that $1749+2^{2}-5^{2}+13^{2}=1897$ is not a square of an integer, and $1749+2^{2}-5^{2}+11^{2}=1849=43^{2}$. Hence $b=11$, $a=43$ and
$$
a^{2}+b^{2}+c^{2}+d^{2}=43^{2}+11^{2}+5^{2}+2^{2}=1999
$$
|
{
"exam": "BalticWay",
"problem_label": "20",
"problem_match": "\n20.",
"resource_path": "BalticWay/segmented/en-bw99sol.jsonl",
"solution_match": "\n20.",
"tier": "T3",
"year": "1999"
}
|
A finite set of integers is called bad if its elements add up to 2010. A finite set of integers is a Benelux-set if none of its subsets is bad. Determine the smallest integer $n$ such that the set $\{502,503,504, \ldots, 2009\}$ can be partitioned into $n$ Benelux-sets.
(A partition of a set $S$ into $n$ subsets is a collection of $n$ pairwise disjoint subsets of $S$, the union of which equals $S$.)
|
As $502+1508=2010$, the set $S=\{502,503, \ldots, 2009\}$ is not a Benelux-set, so $n=1$ does not work. We will prove that $n=2$ does work, i.e. that $S$ can be partitioned into 2 Benelux-sets.
Define the following subsets of $S$ :
$$
\begin{aligned}
& A=\{502,503, \ldots, 670\}, \\
& B=\{671,672, \ldots, 1005\}, \\
& C=\{1006,1007, \ldots, 1339\}, \\
& D=\{1340,1341, \ldots, 1508\}, \\
& E=\{1509,1510, \ldots, 2009\} .
\end{aligned}
$$
We will show that $A \cup C \cup E$ and $B \cup D$ are both Benelux-sets.
Note that there does not exist a bad subset of $S$ of one element, since that element would have to be 2010. Also, there does not exist a bad subset of $S$ of more than three elements, since the sum of four or more elements would be at least $502+503+504+505=2014>2010$. So any possible bad subset of $S$ contains two or three elements.
Consider a bad subset of two elements $a$ and $b$. As $a, b \geq 502$ and $a+b=2010$, we have $a, b \leq 2010-502=1508$. Furthermore, exactly one of $a$ and $b$ is smaller than 1005 and one is larger than 1005. So one of them, say $a$, is an element of $A \cup B$, and the other is an element of $C \cup D$. Suppose $a \in A$, then $b \geq 2010-670=1340$, so $b \in D$. On the other hand, suppose $a \in B$, then $b \leq 2010-671=1339$, so $b \in C$. Hence $\{a, b\}$ cannot be a subset of $A \cup C \cup E$, nor of $B \cup D$.
Now consider a bad subset of three elements $a, b$ and $c$. As $a, b, c \geq 502, a+b+c=2010$, and the three elements are pairwise distinct, we have $a, b, c \leq 2010-502-503=1005$. So $a, b, c \in A \cup B$. At least one of the elements, say $a$, is smaller than $\frac{2010}{3}=670$, and at least one of the elements, say $b$, is larger than 670 . So $a \in A$ and $b \in B$. We conclude that $\{a, b, c\}$ cannot be a subset of $A \cup C \cup E$, nor of $B \cup D$.
This proves that $A \cup C \cup E$ and $B \cup D$ are Benelux-sets, and therefore the smallest $n$ for which $S$ can be partitioned into $n$ Benelux-sets is $n=2$.
Remark. Observe that $A \cup C \cup E_{1}$ and $B \cup D \cup E_{2}$ are also Benelux-sets, where $\left\{E_{1}, E_{2}\right\}$ is any partition of $E$.
|
2
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
A finite set of integers is called bad if its elements add up to 2010. A finite set of integers is a Benelux-set if none of its subsets is bad. Determine the smallest integer $n$ such that the set $\{502,503,504, \ldots, 2009\}$ can be partitioned into $n$ Benelux-sets.
(A partition of a set $S$ into $n$ subsets is a collection of $n$ pairwise disjoint subsets of $S$, the union of which equals $S$.)
|
As $502+1508=2010$, the set $S=\{502,503, \ldots, 2009\}$ is not a Benelux-set, so $n=1$ does not work. We will prove that $n=2$ does work, i.e. that $S$ can be partitioned into 2 Benelux-sets.
Define the following subsets of $S$ :
$$
\begin{aligned}
& A=\{502,503, \ldots, 670\}, \\
& B=\{671,672, \ldots, 1005\}, \\
& C=\{1006,1007, \ldots, 1339\}, \\
& D=\{1340,1341, \ldots, 1508\}, \\
& E=\{1509,1510, \ldots, 2009\} .
\end{aligned}
$$
We will show that $A \cup C \cup E$ and $B \cup D$ are both Benelux-sets.
Note that there does not exist a bad subset of $S$ of one element, since that element would have to be 2010. Also, there does not exist a bad subset of $S$ of more than three elements, since the sum of four or more elements would be at least $502+503+504+505=2014>2010$. So any possible bad subset of $S$ contains two or three elements.
Consider a bad subset of two elements $a$ and $b$. As $a, b \geq 502$ and $a+b=2010$, we have $a, b \leq 2010-502=1508$. Furthermore, exactly one of $a$ and $b$ is smaller than 1005 and one is larger than 1005. So one of them, say $a$, is an element of $A \cup B$, and the other is an element of $C \cup D$. Suppose $a \in A$, then $b \geq 2010-670=1340$, so $b \in D$. On the other hand, suppose $a \in B$, then $b \leq 2010-671=1339$, so $b \in C$. Hence $\{a, b\}$ cannot be a subset of $A \cup C \cup E$, nor of $B \cup D$.
Now consider a bad subset of three elements $a, b$ and $c$. As $a, b, c \geq 502, a+b+c=2010$, and the three elements are pairwise distinct, we have $a, b, c \leq 2010-502-503=1005$. So $a, b, c \in A \cup B$. At least one of the elements, say $a$, is smaller than $\frac{2010}{3}=670$, and at least one of the elements, say $b$, is larger than 670 . So $a \in A$ and $b \in B$. We conclude that $\{a, b, c\}$ cannot be a subset of $A \cup C \cup E$, nor of $B \cup D$.
This proves that $A \cup C \cup E$ and $B \cup D$ are Benelux-sets, and therefore the smallest $n$ for which $S$ can be partitioned into $n$ Benelux-sets is $n=2$.
Remark. Observe that $A \cup C \cup E_{1}$ and $B \cup D \cup E_{2}$ are also Benelux-sets, where $\left\{E_{1}, E_{2}\right\}$ is any partition of $E$.
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "\nProblem 1.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2010"
}
|
Find all polynomials $p(x)$ with real coefficients such that
$$
p(a+b-2 c)+p(b+c-2 a)+p(c+a-2 b)=3 p(a-b)+3 p(b-c)+3 p(c-a)
$$
for all $a, b, c \in \mathbb{R}$.
|
. For $a=b=c$, we have $3 p(0)=9 p(0)$, hence $p(0)=0$. Now set $b=c=0$, then we have
$$
p(a)+p(-2 a)+p(a)=3 p(a)+3 p(-a)
$$
for all $a \in \mathbb{R}$. So we find a polynomial equation
$$
p(-2 x)=p(x)+3 p(-x)
$$
Note that the zero polynomial is a solution to this equation. Now suppose that $p$ is not the zero polynomial, and let $n \geq 0$ be the degree of $p$. Let $a_{n} \neq 0$ be the coefficient of $x^{n}$ in $p(x)$. At the left-hand side of (1), the coefficient of $x^{n}$ is $(-2)^{n} \cdot a_{n}$, while at the right-hand side the coefficient of $x^{n}$ is $a_{n}+3 \cdot(-1)^{n} \cdot a_{n}$. Hence $(-2)^{n}=1+3 \cdot(-1)^{n}$. For $n$ even, we find $2^{n}=4$, so $n=2$, and for $n$ odd, we find $-2^{n}=-2$, so $n=1$. As we already know that $p(0)=0$, we must have $p(x)=a_{2} x^{2}+a_{1} x$, where $a_{1}$ and $a_{2}$ are real numbers (possibly zero).
The polynomial $p(x)=x$ is a solution to our problem, as
$$
(a+b-2 c)+(b+c-2 a)+(c+a-2 b)=0=3(a-b)+3(b-c)+3(c-a)
$$
for all $a, b, c \in \mathbb{R}$. Also, $p(x)=x^{2}$ is a solution, since
$$
\begin{aligned}
(a+b-2 c)^{2}+(b+c-2 a)^{2}+(c+a-2 b)^{2} & =6\left(a^{2}+b^{2}+c^{2}\right)-6(a b+b c+c a) \\
& =3(a-b)^{2}+3(b-c)^{2}+3(c-a)^{2}
\end{aligned}
$$
for all $a, b, c \in \mathbb{R}$.
Now note that if $p(x)$ is a solution to our problem, then so is $\lambda p(x)$ for all $\lambda \in \mathbb{R}$. Also, if $p(x)$ and $q(x)$ are both solutions, then so is $p(x)+q(x)$. We conclude that for all real numbers $a_{2}$ and $a_{1}$ the polynomial $a_{2} x^{2}+a_{1} x$ is a solution. Since we have already shown that there can be no other solutions, these are the only solutions.
|
a_{2} x^{2} + a_{1} x
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Find all polynomials $p(x)$ with real coefficients such that
$$
p(a+b-2 c)+p(b+c-2 a)+p(c+a-2 b)=3 p(a-b)+3 p(b-c)+3 p(c-a)
$$
for all $a, b, c \in \mathbb{R}$.
|
. For $a=b=c$, we have $3 p(0)=9 p(0)$, hence $p(0)=0$. Now set $b=c=0$, then we have
$$
p(a)+p(-2 a)+p(a)=3 p(a)+3 p(-a)
$$
for all $a \in \mathbb{R}$. So we find a polynomial equation
$$
p(-2 x)=p(x)+3 p(-x)
$$
Note that the zero polynomial is a solution to this equation. Now suppose that $p$ is not the zero polynomial, and let $n \geq 0$ be the degree of $p$. Let $a_{n} \neq 0$ be the coefficient of $x^{n}$ in $p(x)$. At the left-hand side of (1), the coefficient of $x^{n}$ is $(-2)^{n} \cdot a_{n}$, while at the right-hand side the coefficient of $x^{n}$ is $a_{n}+3 \cdot(-1)^{n} \cdot a_{n}$. Hence $(-2)^{n}=1+3 \cdot(-1)^{n}$. For $n$ even, we find $2^{n}=4$, so $n=2$, and for $n$ odd, we find $-2^{n}=-2$, so $n=1$. As we already know that $p(0)=0$, we must have $p(x)=a_{2} x^{2}+a_{1} x$, where $a_{1}$ and $a_{2}$ are real numbers (possibly zero).
The polynomial $p(x)=x$ is a solution to our problem, as
$$
(a+b-2 c)+(b+c-2 a)+(c+a-2 b)=0=3(a-b)+3(b-c)+3(c-a)
$$
for all $a, b, c \in \mathbb{R}$. Also, $p(x)=x^{2}$ is a solution, since
$$
\begin{aligned}
(a+b-2 c)^{2}+(b+c-2 a)^{2}+(c+a-2 b)^{2} & =6\left(a^{2}+b^{2}+c^{2}\right)-6(a b+b c+c a) \\
& =3(a-b)^{2}+3(b-c)^{2}+3(c-a)^{2}
\end{aligned}
$$
for all $a, b, c \in \mathbb{R}$.
Now note that if $p(x)$ is a solution to our problem, then so is $\lambda p(x)$ for all $\lambda \in \mathbb{R}$. Also, if $p(x)$ and $q(x)$ are both solutions, then so is $p(x)+q(x)$. We conclude that for all real numbers $a_{2}$ and $a_{1}$ the polynomial $a_{2} x^{2}+a_{1} x$ is a solution. Since we have already shown that there can be no other solutions, these are the only solutions.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "\nProblem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "\nSolution 1",
"tier": "T3",
"year": "2010"
}
|
Find all polynomials $p(x)$ with real coefficients such that
$$
p(a+b-2 c)+p(b+c-2 a)+p(c+a-2 b)=3 p(a-b)+3 p(b-c)+3 p(c-a)
$$
for all $a, b, c \in \mathbb{R}$.
|
. For $a=b=c$, we have $3 p(0)=9 p(0)$, hence $p(0)=0$. Now set $b=c=0$, then we have
$$
p(a)+p(-2 a)+p(a)=3 p(a)+3 p(-a)
$$
for all $a \in \mathbb{R}$. So we find a polynomial equation
$$
p(-2 x)=p(x)+3 p(-x)
$$
Define $q(x)=p(x)+p(-x)$, then we find that
$$
q(2 x)=p(2 x)+p(-2 x)=(p(-x)+3 p(x))+(p(x)+3 p(-x))=4 q(x)
$$
Note that the zero polynomial is a solution to this equation. Now suppose that $q$ is not the zero polynomial, and let $m \geq 0$ be the degree of $q$. Let $b_{m} \neq 0$ be the coefficient of $x^{m}$ in $q(x)$. At the left-hand side of (3), the coefficient of $x^{m}$ is $2^{m} \cdot b_{m}$, while at the right-hand side the coefficient of $x^{m}$ is $4 b_{m}$. Hence $m=2$. As $q(x)=p(x)+p(-x)$, the polynomial $q(x)$ does not contain any nonzero terms with odd exponent of $x$. Since also $q(0)=2 p(0)=0$, we conclude that
$$
q(x)=b_{2} x^{2}
$$
where $b_{2}$ is a real number (possibly zero).
From (2) we now deduce that $p(2 x)=p(-x)+3 p(x)=2 p(x)+q(x)$, so
$$
p(2 x)-2 p(x)=b_{2} x^{2}
$$
Suppose that that degree $n$ of $p$ is greater than 2 . Let $a_{n} \neq 0$ be the coefficient of $x^{n}$ in $p(x)$. At the left-hand side of (4), the coefficient of $x^{n}$ is $\left(2^{n}-2\right) \cdot a_{n} \neq 0$. But the coefficient of $x^{n}$ at the right-hand side vanishes, yielding a contradiction. So the degree of $p$ is at most 2 . As we already know that $p(0)=0$, we must have $p(x)=a_{2} x^{2}+a_{1} x$, where $a_{1}$ and $a_{2}$ are real numbers (possibly zero).
We finally check that every polynomial of this form is indeed a solution (see solution 1 ).
|
p(x)=a_{2} x^{2}+a_{1} x
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Find all polynomials $p(x)$ with real coefficients such that
$$
p(a+b-2 c)+p(b+c-2 a)+p(c+a-2 b)=3 p(a-b)+3 p(b-c)+3 p(c-a)
$$
for all $a, b, c \in \mathbb{R}$.
|
. For $a=b=c$, we have $3 p(0)=9 p(0)$, hence $p(0)=0$. Now set $b=c=0$, then we have
$$
p(a)+p(-2 a)+p(a)=3 p(a)+3 p(-a)
$$
for all $a \in \mathbb{R}$. So we find a polynomial equation
$$
p(-2 x)=p(x)+3 p(-x)
$$
Define $q(x)=p(x)+p(-x)$, then we find that
$$
q(2 x)=p(2 x)+p(-2 x)=(p(-x)+3 p(x))+(p(x)+3 p(-x))=4 q(x)
$$
Note that the zero polynomial is a solution to this equation. Now suppose that $q$ is not the zero polynomial, and let $m \geq 0$ be the degree of $q$. Let $b_{m} \neq 0$ be the coefficient of $x^{m}$ in $q(x)$. At the left-hand side of (3), the coefficient of $x^{m}$ is $2^{m} \cdot b_{m}$, while at the right-hand side the coefficient of $x^{m}$ is $4 b_{m}$. Hence $m=2$. As $q(x)=p(x)+p(-x)$, the polynomial $q(x)$ does not contain any nonzero terms with odd exponent of $x$. Since also $q(0)=2 p(0)=0$, we conclude that
$$
q(x)=b_{2} x^{2}
$$
where $b_{2}$ is a real number (possibly zero).
From (2) we now deduce that $p(2 x)=p(-x)+3 p(x)=2 p(x)+q(x)$, so
$$
p(2 x)-2 p(x)=b_{2} x^{2}
$$
Suppose that that degree $n$ of $p$ is greater than 2 . Let $a_{n} \neq 0$ be the coefficient of $x^{n}$ in $p(x)$. At the left-hand side of (4), the coefficient of $x^{n}$ is $\left(2^{n}-2\right) \cdot a_{n} \neq 0$. But the coefficient of $x^{n}$ at the right-hand side vanishes, yielding a contradiction. So the degree of $p$ is at most 2 . As we already know that $p(0)=0$, we must have $p(x)=a_{2} x^{2}+a_{1} x$, where $a_{1}$ and $a_{2}$ are real numbers (possibly zero).
We finally check that every polynomial of this form is indeed a solution (see solution 1 ).
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "\nProblem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2010"
}
|
On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$.
(a) Prove that $P, T, S$ are collinear.
(b) Prove that $P, K, L$ are collinear.
#
|
.
(a) Since $P, R$ and $Q$ are collinear, we have $\triangle P A Q \sim \triangle P B R$, hence
$$
\frac{|A Q|}{|B R|}=\frac{|A P|}{|B P|}
$$
Conversely, $P, T$ and $S$ are collinear if it holds that
$$
\frac{|A S|}{|B T|}=\frac{|A P|}{|B P|}
$$
So it suffices to prove
$$
\frac{|B T|}{|B R|}=\frac{|A S|}{|A Q|}
$$
Since $\angle A B T=90^{\circ}=\angle A L B$ and $\angle T A B=\angle B A L$, we have $\triangle A B T \sim \triangle A L B$. And since $\angle A L B=90^{\circ}=\angle Q A B$ and $\angle L B A=\angle A B Q$, we have $\triangle A L B \sim \triangle Q A B$. Hence $\triangle A B T \sim \triangle Q A B$, so
$$
\frac{|B T|}{|B A|}=\frac{|A B|}{|A Q|}
$$
Similarly, we have $\triangle A B R \sim \triangle A K B \sim \triangle S A B$, so
$$
\frac{|B R|}{|B A|}=\frac{|A B|}{|A S|}
$$
Combining both results, we get
$$
\frac{|B T|}{|B R|}=\frac{|B T| /|B A|}{|B R| /|B A|}=\frac{|A B| /|A Q|}{|A B| /|A S|}=\frac{|A S|}{|A Q|}
$$
which had to be proved.
(b) Let the line $P K$ intersect $B R$ in $B_{1}$ and $A Q$ in $A_{1}$ and let the line $P L$ intersect $B R$ in $B_{2}$ and $A Q$ in $A_{2}$. Consider the points $A_{1}, A$ and $S$ on the line $A Q$, and the points $B_{1}, B$ and $T$ on the line $B R$. As $A Q \| B R$ and the three lines $A_{1} B_{1}, A B$ and $S T$ are concurrent (in $P$ ), we have
$$
A_{1} A: A S=B_{1} B: B T
$$
where all lengths are directed. Similarly, as $A_{1} B_{1}, A R$ and $S B$ are concurrent (in $K$ ), we have
$$
A_{1} A: A S=B_{1} R: R B
$$
This gives
$$
\frac{B B_{1}}{B T}=\frac{R B_{1}}{R B}=\frac{R B+B B_{1}}{R B}=1+\frac{B B_{1}}{R B}=1-\frac{B B_{1}}{B R}
$$
so
$$
B B_{1}=\frac{1}{\frac{1}{B T}+\frac{1}{B R}} .
$$
Similary, using the lines $A_{2} B_{2}, A B$ and $Q R$ (concurrent in $P$ ) and the lines $A_{2} B_{2}$, $A T$ and $Q B$ (concurrent in $L$ ), we find
$$
B_{2} B: B R=A_{2} A: A Q=B_{2} T: T B
$$
This gives
$$
\frac{B B_{2}}{B R}=\frac{T B_{2}}{T B}=\frac{T B+B B_{2}}{T B}=1+\frac{B B_{2}}{T B}=1-\frac{B B_{2}}{B T}
$$
so
$$
B B_{2}=\frac{1}{\frac{1}{B R}+\frac{1}{B T}}
$$
We conclude that $B_{1}=B_{2}$, which implies that $P, K$ and $L$ are collinear.
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$.
(a) Prove that $P, T, S$ are collinear.
(b) Prove that $P, K, L$ are collinear.
#
|
.
(a) Since $P, R$ and $Q$ are collinear, we have $\triangle P A Q \sim \triangle P B R$, hence
$$
\frac{|A Q|}{|B R|}=\frac{|A P|}{|B P|}
$$
Conversely, $P, T$ and $S$ are collinear if it holds that
$$
\frac{|A S|}{|B T|}=\frac{|A P|}{|B P|}
$$
So it suffices to prove
$$
\frac{|B T|}{|B R|}=\frac{|A S|}{|A Q|}
$$
Since $\angle A B T=90^{\circ}=\angle A L B$ and $\angle T A B=\angle B A L$, we have $\triangle A B T \sim \triangle A L B$. And since $\angle A L B=90^{\circ}=\angle Q A B$ and $\angle L B A=\angle A B Q$, we have $\triangle A L B \sim \triangle Q A B$. Hence $\triangle A B T \sim \triangle Q A B$, so
$$
\frac{|B T|}{|B A|}=\frac{|A B|}{|A Q|}
$$
Similarly, we have $\triangle A B R \sim \triangle A K B \sim \triangle S A B$, so
$$
\frac{|B R|}{|B A|}=\frac{|A B|}{|A S|}
$$
Combining both results, we get
$$
\frac{|B T|}{|B R|}=\frac{|B T| /|B A|}{|B R| /|B A|}=\frac{|A B| /|A Q|}{|A B| /|A S|}=\frac{|A S|}{|A Q|}
$$
which had to be proved.
(b) Let the line $P K$ intersect $B R$ in $B_{1}$ and $A Q$ in $A_{1}$ and let the line $P L$ intersect $B R$ in $B_{2}$ and $A Q$ in $A_{2}$. Consider the points $A_{1}, A$ and $S$ on the line $A Q$, and the points $B_{1}, B$ and $T$ on the line $B R$. As $A Q \| B R$ and the three lines $A_{1} B_{1}, A B$ and $S T$ are concurrent (in $P$ ), we have
$$
A_{1} A: A S=B_{1} B: B T
$$
where all lengths are directed. Similarly, as $A_{1} B_{1}, A R$ and $S B$ are concurrent (in $K$ ), we have
$$
A_{1} A: A S=B_{1} R: R B
$$
This gives
$$
\frac{B B_{1}}{B T}=\frac{R B_{1}}{R B}=\frac{R B+B B_{1}}{R B}=1+\frac{B B_{1}}{R B}=1-\frac{B B_{1}}{B R}
$$
so
$$
B B_{1}=\frac{1}{\frac{1}{B T}+\frac{1}{B R}} .
$$
Similary, using the lines $A_{2} B_{2}, A B$ and $Q R$ (concurrent in $P$ ) and the lines $A_{2} B_{2}$, $A T$ and $Q B$ (concurrent in $L$ ), we find
$$
B_{2} B: B R=A_{2} A: A Q=B_{2} T: T B
$$
This gives
$$
\frac{B B_{2}}{B R}=\frac{T B_{2}}{T B}=\frac{T B+B B_{2}}{T B}=1+\frac{B B_{2}}{T B}=1-\frac{B B_{2}}{B T}
$$
so
$$
B B_{2}=\frac{1}{\frac{1}{B R}+\frac{1}{B T}}
$$
We conclude that $B_{1}=B_{2}$, which implies that $P, K$ and $L$ are collinear.
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "# Solution 1",
"tier": "T3",
"year": "2010"
}
|
On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$.
(a) Prove that $P, T, S$ are collinear.
(b) Prove that $P, K, L$ are collinear.
#
|
.
(a) Define $X$ as the intersection of $A T$ and $B S$, and $Y$ as the intersection of $A R$ and $B Q$. To prove that $P, S$ and $T$ are collinear, we will use Menelaos' theorem in $\triangle A B X$, so we have to prove
$$
\frac{A P}{P B} \frac{B S}{S X} \frac{X T}{T A}=-1
$$
Note that $B$ is between $P$ and $A, X$ is between $S$ and $B$, and $X$ is between $T$ and $A$, so it suffices to prove that
$$
\frac{|A P|}{|P B|} \frac{|B S|}{|S X|} \frac{|X T|}{|T A|}=1
$$
Because $A Q$ and $B R$ are parallel, we have $\triangle A Q P \sim \triangle B R P$, hence
$$
\frac{|A P|}{|B P|}=\frac{|Q A|}{|R B|}
$$
Also, since $\angle A S B=\angle K B R$ and $\angle B A S=90^{\circ}=\angle B K R$, we have $\triangle A S B \sim$ $\triangle K B R$, hence
$$
\frac{|B S|}{|R B|}=\frac{|A S|}{|K B|}, \quad \text { so } \quad|B S|=\frac{|A S|}{|K B|}|R B| \text {. }
$$
Similarly, we have $\triangle A T B \sim \triangle Q A L$, hence
$$
\frac{|T A|}{|A Q|}=\frac{|T B|}{|A L|}, \quad \text { so } \quad|T A|=\frac{|T B|}{|A L|}|A Q| \text {. }
$$
As $\angle A S X=\angle A S B=90^{\circ}-\angle A B S=90^{\circ}-\angle A B K=\angle K A B=\angle Y A B$, and $\angle S A X=90^{\circ}-\angle X A B=90^{\circ}-\angle L A B=\angle A B L=\angle A B Y$, we have $\triangle S X A \sim$ $\triangle A Y B$, hence
$$
\frac{|S X|}{|A Y|}=\frac{|A S|}{|B A|}, \quad \text { so } \quad|S X|=\frac{|A S|}{|B A|}|A Y| \text {. }
$$
Similarly, we have $\triangle B X T \sim \triangle A Y B$, hence
$$
\frac{|X T|}{|Y B|}=\frac{|B T|}{|A B|}, \quad \text { so } \quad|X T|=\frac{|B T|}{|A B|}|Y B| \text {. }
$$
By combining (5) - (9), we find
$$
\begin{aligned}
\frac{|A P|}{|P B|} \frac{|B S|}{|S X|} \frac{|X T|}{|T A|} & =\frac{|Q A|}{|R B|} \cdot \frac{|A S|}{|K B|}|R B| \cdot \frac{|B A|}{|A S||A Y|} \cdot \frac{|B T|}{|A B|}|Y B| \cdot \frac{|A L|}{|T B||A Q|} \\
& =\frac{|A L|}{|K B|} \frac{|Y B|}{|A Y|} .
\end{aligned}
$$
Since $\angle Y L A=90^{\circ}=\angle Y K B$ and $\angle A Y L=\angle B Y K$, we have $\triangle A Y L \sim \triangle B Y K$, hence
$$
\frac{|A L|}{|B K|}=\frac{|A Y|}{|B Y|}, \quad \text { so } \quad \frac{|A L|}{|B K|} \frac{|B Y|}{|A Y|}=1
$$
By combining (10) and (11), we find
$$
\frac{|A P|}{|P B|} \frac{|B S|}{|S X|} \frac{|X T|}{|T A|}=1,
$$
as we wanted to prove.
(b) Again, we will use Menelaos' theorem in $\triangle A B X$, so we have to prove
$$
\frac{A P}{P B} \frac{B K}{K X} \frac{X L}{L A}=-1
$$
Note that $\frac{A P}{P B}<0$, and $\frac{B K}{K X}<0$ if and only if $\frac{X L}{L A}<0$, so it suffices to prove that
$$
\frac{|A P|}{|P B|} \frac{|B K|}{|K X|} \frac{|X L|}{|L A|}=1
$$
As $\angle B X L=\angle A X K$ and $\angle B L X=90^{\circ}=\angle A K X$, we have $\triangle B L X \sim \triangle A K X$, hence
$$
\frac{|X L|}{|X K|}=\frac{|B L|}{|A K|}
$$
Since $\angle A L B=90^{\circ}=\angle Q A B$, we have $\triangle A L B \sim \triangle Q A B$, hence
$$
\frac{|L A|}{|A Q|}=\frac{|L B|}{|A B|}, \quad \text { so } \quad|L A|=\frac{|L B|}{|A B|}|A Q| \text {. }
$$
Similarly, we have $\triangle A K B \sim \triangle A B R$, hence
$$
\frac{|B K|}{|R B|}=\frac{|A K|}{|A B|}, \quad \text { so } \quad|B K|=\frac{|A K|}{|A B|}|R B|
$$
By combining (5) and (12) - (14), we find
$$
\left.\frac{|A P|}{|P B|}\left|\frac{|B K|}{|K X|} \frac{|X L|}{|L A|}=\frac{|Q A|}{|R B|} \cdot \frac{|B L|}{|A K|} \cdot \frac{|A B|}{|L B||A Q|} \cdot \frac{|A K|}{|A B|}\right| R B \right\rvert\,=1,
$$
which is what we wanted to prove.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$.
(a) Prove that $P, T, S$ are collinear.
(b) Prove that $P, K, L$ are collinear.
#
|
.
(a) Define $X$ as the intersection of $A T$ and $B S$, and $Y$ as the intersection of $A R$ and $B Q$. To prove that $P, S$ and $T$ are collinear, we will use Menelaos' theorem in $\triangle A B X$, so we have to prove
$$
\frac{A P}{P B} \frac{B S}{S X} \frac{X T}{T A}=-1
$$
Note that $B$ is between $P$ and $A, X$ is between $S$ and $B$, and $X$ is between $T$ and $A$, so it suffices to prove that
$$
\frac{|A P|}{|P B|} \frac{|B S|}{|S X|} \frac{|X T|}{|T A|}=1
$$
Because $A Q$ and $B R$ are parallel, we have $\triangle A Q P \sim \triangle B R P$, hence
$$
\frac{|A P|}{|B P|}=\frac{|Q A|}{|R B|}
$$
Also, since $\angle A S B=\angle K B R$ and $\angle B A S=90^{\circ}=\angle B K R$, we have $\triangle A S B \sim$ $\triangle K B R$, hence
$$
\frac{|B S|}{|R B|}=\frac{|A S|}{|K B|}, \quad \text { so } \quad|B S|=\frac{|A S|}{|K B|}|R B| \text {. }
$$
Similarly, we have $\triangle A T B \sim \triangle Q A L$, hence
$$
\frac{|T A|}{|A Q|}=\frac{|T B|}{|A L|}, \quad \text { so } \quad|T A|=\frac{|T B|}{|A L|}|A Q| \text {. }
$$
As $\angle A S X=\angle A S B=90^{\circ}-\angle A B S=90^{\circ}-\angle A B K=\angle K A B=\angle Y A B$, and $\angle S A X=90^{\circ}-\angle X A B=90^{\circ}-\angle L A B=\angle A B L=\angle A B Y$, we have $\triangle S X A \sim$ $\triangle A Y B$, hence
$$
\frac{|S X|}{|A Y|}=\frac{|A S|}{|B A|}, \quad \text { so } \quad|S X|=\frac{|A S|}{|B A|}|A Y| \text {. }
$$
Similarly, we have $\triangle B X T \sim \triangle A Y B$, hence
$$
\frac{|X T|}{|Y B|}=\frac{|B T|}{|A B|}, \quad \text { so } \quad|X T|=\frac{|B T|}{|A B|}|Y B| \text {. }
$$
By combining (5) - (9), we find
$$
\begin{aligned}
\frac{|A P|}{|P B|} \frac{|B S|}{|S X|} \frac{|X T|}{|T A|} & =\frac{|Q A|}{|R B|} \cdot \frac{|A S|}{|K B|}|R B| \cdot \frac{|B A|}{|A S||A Y|} \cdot \frac{|B T|}{|A B|}|Y B| \cdot \frac{|A L|}{|T B||A Q|} \\
& =\frac{|A L|}{|K B|} \frac{|Y B|}{|A Y|} .
\end{aligned}
$$
Since $\angle Y L A=90^{\circ}=\angle Y K B$ and $\angle A Y L=\angle B Y K$, we have $\triangle A Y L \sim \triangle B Y K$, hence
$$
\frac{|A L|}{|B K|}=\frac{|A Y|}{|B Y|}, \quad \text { so } \quad \frac{|A L|}{|B K|} \frac{|B Y|}{|A Y|}=1
$$
By combining (10) and (11), we find
$$
\frac{|A P|}{|P B|} \frac{|B S|}{|S X|} \frac{|X T|}{|T A|}=1,
$$
as we wanted to prove.
(b) Again, we will use Menelaos' theorem in $\triangle A B X$, so we have to prove
$$
\frac{A P}{P B} \frac{B K}{K X} \frac{X L}{L A}=-1
$$
Note that $\frac{A P}{P B}<0$, and $\frac{B K}{K X}<0$ if and only if $\frac{X L}{L A}<0$, so it suffices to prove that
$$
\frac{|A P|}{|P B|} \frac{|B K|}{|K X|} \frac{|X L|}{|L A|}=1
$$
As $\angle B X L=\angle A X K$ and $\angle B L X=90^{\circ}=\angle A K X$, we have $\triangle B L X \sim \triangle A K X$, hence
$$
\frac{|X L|}{|X K|}=\frac{|B L|}{|A K|}
$$
Since $\angle A L B=90^{\circ}=\angle Q A B$, we have $\triangle A L B \sim \triangle Q A B$, hence
$$
\frac{|L A|}{|A Q|}=\frac{|L B|}{|A B|}, \quad \text { so } \quad|L A|=\frac{|L B|}{|A B|}|A Q| \text {. }
$$
Similarly, we have $\triangle A K B \sim \triangle A B R$, hence
$$
\frac{|B K|}{|R B|}=\frac{|A K|}{|A B|}, \quad \text { so } \quad|B K|=\frac{|A K|}{|A B|}|R B|
$$
By combining (5) and (12) - (14), we find
$$
\left.\frac{|A P|}{|P B|}\left|\frac{|B K|}{|K X|} \frac{|X L|}{|L A|}=\frac{|Q A|}{|R B|} \cdot \frac{|B L|}{|A K|} \cdot \frac{|A B|}{|L B||A Q|} \cdot \frac{|A K|}{|A B|}\right| R B \right\rvert\,=1,
$$
which is what we wanted to prove.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "# Solution 2",
"tier": "T3",
"year": "2010"
}
|
On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$.
(a) Prove that $P, T, S$ are collinear.
(b) Prove that $P, K, L$ are collinear.
#
|
. As $\angle A K B=\angle A L B=90^{\circ}$, the points $K$ and $L$ belong to the circle with diameter $A B$. Since $\angle Q A B=\angle A B R=90^{\circ}$, the lines $A Q$ and $B R$ are tangents to this circle.
Apply Pascal's theorem to the points $A, A, K, L, B$ and $B$, all on the same circle. This yields that the intersection $Q$ of the tangent in $A$ and the line $B L$, the intersection $R$ of the tangent in $B$ and the line $A K$, and the intersection of $K L$ and $A B$ are collinear. So $K L$ passes through the intersection of $A B$ and $Q R$, which is point $P$. Hence $P, K$ and $L$ are collinear. This proves part b.
Now apply Pascal's theorem to the points $A, A, L, K, B$ and $B$. This yields that the intersection $S$ of the tangent in $A$ and the line $B K$, the intersection $T$ of the tangent in $B$ and the line $A L$, and the intersection $P$ of $K L$ and $A B$ are collinear. This proves part a.
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$.
(a) Prove that $P, T, S$ are collinear.
(b) Prove that $P, K, L$ are collinear.
#
|
. As $\angle A K B=\angle A L B=90^{\circ}$, the points $K$ and $L$ belong to the circle with diameter $A B$. Since $\angle Q A B=\angle A B R=90^{\circ}$, the lines $A Q$ and $B R$ are tangents to this circle.
Apply Pascal's theorem to the points $A, A, K, L, B$ and $B$, all on the same circle. This yields that the intersection $Q$ of the tangent in $A$ and the line $B L$, the intersection $R$ of the tangent in $B$ and the line $A K$, and the intersection of $K L$ and $A B$ are collinear. So $K L$ passes through the intersection of $A B$ and $Q R$, which is point $P$. Hence $P, K$ and $L$ are collinear. This proves part b.
Now apply Pascal's theorem to the points $A, A, L, K, B$ and $B$. This yields that the intersection $S$ of the tangent in $A$ and the line $B K$, the intersection $T$ of the tangent in $B$ and the line $A L$, and the intersection $P$ of $K L$ and $A B$ are collinear. This proves part a.
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "\nSolution 3",
"tier": "T3",
"year": "2010"
}
|
On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$.
(a) Prove that $P, T, S$ are collinear.
(b) Prove that $P, K, L$ are collinear.
#
|
.
(a) W.l.o.g. we may assume that $A=(0,0)$ and $B=(1,0)$ and the line through $P$ is in the upper half plane, so $l$ is the $x$-axis, $a$ is the $y$-axis and $b$ is the line $x=1$. Take $P=(p, 0)(p>1)$ and $Q=(0, q)(q>0)$. Since $P Q$ is given by $\frac{x}{p}+\frac{y}{q}=1$, we find $R=\left(1, \frac{q(p-1)}{p}\right)$.
Now $A R$ is given by $y=\frac{q(p-1)}{p} x$, hence $B S$, the line perpendicular to $A R$ and passing through $B=(1,0)$, is given by $y=-\frac{p}{q(p-1)}(x-1)$. We find $S=\left(0, \frac{p}{q(p-1)}\right)$.
Moreover $B Q$ is given by $y=-q(x-1)$, hence $A T$, the line perpendicular to $B Q$ and passing through $A=(0,0)$, is given by $y=\frac{1}{q} x$. We find $T=\left(1, \frac{1}{q}\right)$. Since $\frac{|B T|}{|B P|}=\frac{1 / q}{p-1}=\frac{\frac{p}{q(p-1)}}{p}=\frac{|A S|}{|A P|}$, we conclude that $P, T$ and $S$ are collinear.
(b) Point $K$ is the intersection of $A R$ and $B S$. Solving for $x$ yields
$$
\begin{aligned}
\frac{q(p-1)}{p} x & =-\frac{p}{q(p-1)}(x-1) \\
\left(\frac{q(p-1)}{p}+\frac{p}{q(p-1)}\right) x & =\frac{p}{q(p-1)} \\
x & =\frac{\frac{p}{q(p-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}
\end{aligned}
$$
so
$$
K=\left(\frac{\frac{p}{q(p-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}, \frac{1}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}\right)
$$
Point $L$ is the point of intersection of $A T$ and $B Q$. Solving for $x$ yields
$$
\begin{aligned}
\frac{1}{q} x & =-q(x-1) \\
\left(\frac{1}{q}+q\right) x & =q \\
x & =\frac{q}{\frac{1}{q}+q}
\end{aligned}
$$
so
$$
L=\left(\frac{q}{\frac{1}{q}+q}, \frac{1}{\frac{1}{q}+q}\right)
$$
Let $K_{0}$ and $L_{0}$ be the projections of $K$ and $L$ on the $x$-axis. We have to show that the following fractions are equal:
$$
\frac{\left|K_{0} K\right|}{\left|K_{0} P\right|}=\frac{\frac{1}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}}{p-\frac{\frac{p}{q-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}} \quad \text { and } \quad \frac{\left|L_{0} L\right|}{\left|L_{0} P\right|}=\frac{\frac{1}{\frac{1}{q}+q}}{p-\frac{q}{\frac{1}{q}+q}}
$$
Working out cross products twice, this comes down to
$$
\begin{aligned}
\frac{1}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}} \cdot\left(p-\frac{q}{\frac{1}{q}+q}\right) & \stackrel{?}{=} \frac{1}{\frac{1}{q}+q} \cdot\left(p-\frac{\frac{p}{q(p-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}\right) \\
\left(\frac{1}{q}+q\right) \cdot\left(p-\frac{q}{\frac{1}{q}+q}\right) & \stackrel{?}{=}\left(\frac{q(p-1)}{p}+\frac{p}{q(p-1)}\right) \cdot\left(p-\frac{\frac{p}{q(p-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}\right) \\
\frac{p}{q}+p q-q & \stackrel{?}{=} q(p-1)+\frac{p^{2}}{q(p-1)}-\frac{p}{q(p-1)} \\
\frac{p}{q}+p q-q & \stackrel{?}{=} q(p-1)+\frac{p(p-1)}{q(p-1)}
\end{aligned}
$$
which is clearly true.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
On a line $l$ there are three different points $A, B$ and $P$ in that order. Let $a$ be the line through $A$ perpendicular to $l$, and let $b$ be the line through $B$ perpendicular to $l$. A line through $P$, not coinciding with $l$, intersects $a$ in $Q$ and $b$ in $R$. The line through $A$ perpendicular to $B Q$ intersects $B Q$ in $L$ and $B R$ in $T$. The line through $B$ perpendicular to $A R$ intersects $A R$ in $K$ and $A Q$ in $S$.
(a) Prove that $P, T, S$ are collinear.
(b) Prove that $P, K, L$ are collinear.
#
|
.
(a) W.l.o.g. we may assume that $A=(0,0)$ and $B=(1,0)$ and the line through $P$ is in the upper half plane, so $l$ is the $x$-axis, $a$ is the $y$-axis and $b$ is the line $x=1$. Take $P=(p, 0)(p>1)$ and $Q=(0, q)(q>0)$. Since $P Q$ is given by $\frac{x}{p}+\frac{y}{q}=1$, we find $R=\left(1, \frac{q(p-1)}{p}\right)$.
Now $A R$ is given by $y=\frac{q(p-1)}{p} x$, hence $B S$, the line perpendicular to $A R$ and passing through $B=(1,0)$, is given by $y=-\frac{p}{q(p-1)}(x-1)$. We find $S=\left(0, \frac{p}{q(p-1)}\right)$.
Moreover $B Q$ is given by $y=-q(x-1)$, hence $A T$, the line perpendicular to $B Q$ and passing through $A=(0,0)$, is given by $y=\frac{1}{q} x$. We find $T=\left(1, \frac{1}{q}\right)$. Since $\frac{|B T|}{|B P|}=\frac{1 / q}{p-1}=\frac{\frac{p}{q(p-1)}}{p}=\frac{|A S|}{|A P|}$, we conclude that $P, T$ and $S$ are collinear.
(b) Point $K$ is the intersection of $A R$ and $B S$. Solving for $x$ yields
$$
\begin{aligned}
\frac{q(p-1)}{p} x & =-\frac{p}{q(p-1)}(x-1) \\
\left(\frac{q(p-1)}{p}+\frac{p}{q(p-1)}\right) x & =\frac{p}{q(p-1)} \\
x & =\frac{\frac{p}{q(p-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}
\end{aligned}
$$
so
$$
K=\left(\frac{\frac{p}{q(p-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}, \frac{1}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}\right)
$$
Point $L$ is the point of intersection of $A T$ and $B Q$. Solving for $x$ yields
$$
\begin{aligned}
\frac{1}{q} x & =-q(x-1) \\
\left(\frac{1}{q}+q\right) x & =q \\
x & =\frac{q}{\frac{1}{q}+q}
\end{aligned}
$$
so
$$
L=\left(\frac{q}{\frac{1}{q}+q}, \frac{1}{\frac{1}{q}+q}\right)
$$
Let $K_{0}$ and $L_{0}$ be the projections of $K$ and $L$ on the $x$-axis. We have to show that the following fractions are equal:
$$
\frac{\left|K_{0} K\right|}{\left|K_{0} P\right|}=\frac{\frac{1}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}}{p-\frac{\frac{p}{q-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}} \quad \text { and } \quad \frac{\left|L_{0} L\right|}{\left|L_{0} P\right|}=\frac{\frac{1}{\frac{1}{q}+q}}{p-\frac{q}{\frac{1}{q}+q}}
$$
Working out cross products twice, this comes down to
$$
\begin{aligned}
\frac{1}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}} \cdot\left(p-\frac{q}{\frac{1}{q}+q}\right) & \stackrel{?}{=} \frac{1}{\frac{1}{q}+q} \cdot\left(p-\frac{\frac{p}{q(p-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}\right) \\
\left(\frac{1}{q}+q\right) \cdot\left(p-\frac{q}{\frac{1}{q}+q}\right) & \stackrel{?}{=}\left(\frac{q(p-1)}{p}+\frac{p}{q(p-1)}\right) \cdot\left(p-\frac{\frac{p}{q(p-1)}}{\frac{q(p-1)}{p}+\frac{p}{q(p-1)}}\right) \\
\frac{p}{q}+p q-q & \stackrel{?}{=} q(p-1)+\frac{p^{2}}{q(p-1)}-\frac{p}{q(p-1)} \\
\frac{p}{q}+p q-q & \stackrel{?}{=} q(p-1)+\frac{p(p-1)}{q(p-1)}
\end{aligned}
$$
which is clearly true.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "# Solution 4",
"tier": "T3",
"year": "2010"
}
|
Find all quadruples $(a, b, p, n)$ of positive integers, such that $p$ is a prime and
$$
a^{3}+b^{3}=p^{n}
$$
|
. Let $(a, b, p, n)$ be a solution. Note that we can write the given equation as
$$
(a+b)\left(a^{2}-a b+b^{2}\right)=p^{n}
$$
As $a$ and $b$ are positive integers, we have $a+b \geq 2$, so $p \mid a+b$. Furthermore, $a^{2}-a b+b^{2}=$ $(a-b)^{2}+a b$, so either $a=b=1$ or $a^{2}-a b+b^{2} \geq 2$. Assume that the latter is the case. Then $p$ is a divisor of both $a+b$ and $a^{2}-a b+b^{2}$, hence also of $(a+b)^{2}-\left(a^{2}-a b+b^{2}\right)=3 a b$. This means that $p$ either is equal to 3 or is a divisor of $a b$. Since $p$ is a divisor of $a+b$, we have $p|a \Leftrightarrow p| b$, hence either $p=3$, or $p \mid a$ and $p \mid b$. If $p \mid a$ and $p \mid b$, then we can write $a=p a^{\prime}, b=p b^{\prime}$ with $a^{\prime}$ and $b^{\prime}$ positive integers, and we have $\left(a^{\prime}\right)^{3}+\left(b^{\prime}\right)^{3}=p^{n-3}$, so $\left(a^{\prime}, b^{\prime}, p, n-3\right)$ then is another solution (note that $\left(a^{\prime}\right)^{3}+\left(b^{\prime}\right)^{3}$ is a positive integer greater than 1 , so $n-3$ is positive).
Now assume that $\left(a_{0}, b_{0}, p_{0}, n_{0}\right)$ is a solution such that $p \nmid a$. From the reasoning above it follows that either $a_{0}=b_{0}=1$, or $p_{0}=3$. After all, if we do not have $a_{0}=b_{0}=1$ and we have $p_{0} \neq 3$, then $p \mid a$. Also, given an arbitrary solution $(a, b, p, n)$, we can divide everything by $p$ repeatedly until there are no factors $p$ left in $a$.
Suppose $a_{0}=b_{0}=1$. Then the solution is $(1,1,2,1)$.
Suppose $p_{0}=3$. Assume that $3^{2} \mid\left(a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}\right)$. As $3^{2} \mid\left(a_{0}+b_{0}\right)^{2}$, we then have $3^{2} \mid\left(a_{0}+b_{0}\right)^{2}-\left(a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}\right)=3 a_{0} b_{0}$, so $3 \mid a_{0} b_{0}$. But $3 \nmid a_{0}$ by assumption, and $3 \mid a_{0}+b_{0}$, so $3 \nmid b_{0}$, which contradicts $3 \mid a_{0} b_{0}$. We conclude that $3^{2} \nmid\left(a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}\right)$. As both $a_{0}+b_{0}$ and $a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}$ must be powers of 3 , we have $a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}=3$. Hence $\left(a_{0}-b_{0}\right)^{2}+a_{0} b_{0}=3$. We must have $\left(a_{0}-b_{0}\right)^{2}=0$ or $\left(a_{0}-b_{0}\right)^{2}=1$. The former does not give a solution; the latter gives $a_{0}=2$ and $b_{0}=1$ or $a_{0}=1$ and $b_{0}=2$.
So all solutions with $p \nmid a$ are $(1,1,2,1),(2,1,3,2)$ and $(1,2,3,2)$. From the above it follows that all other solutions are of the form $\left(p_{0}^{k} a_{0}, p_{0}^{k} b_{0}, p_{0}, n_{0}+3 k\right)$, where $\left(a_{0}, b_{0}, p_{0}, n_{0}\right)$ is one of these three solutions. Hence we find three families of solutions:
- $\left(2^{k}, 2^{k}, 2,3 k+1\right)$ with $k \in \mathbb{Z}_{\geq 0}$,
- $\left(2 \cdot 3^{k}, 3^{k}, 3,3 k+2\right)$ with $k \in \mathbb{Z}_{\geq 0}$,
- $\left(3^{k}, 2 \cdot 3^{k}, 3,3 k+2\right)$ with $k \in \mathbb{Z}_{\geq 0}$.
It is easy to check that all these quadruples are indeed solutions.
|
not found
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find all quadruples $(a, b, p, n)$ of positive integers, such that $p$ is a prime and
$$
a^{3}+b^{3}=p^{n}
$$
|
. Let $(a, b, p, n)$ be a solution. Note that we can write the given equation as
$$
(a+b)\left(a^{2}-a b+b^{2}\right)=p^{n}
$$
As $a$ and $b$ are positive integers, we have $a+b \geq 2$, so $p \mid a+b$. Furthermore, $a^{2}-a b+b^{2}=$ $(a-b)^{2}+a b$, so either $a=b=1$ or $a^{2}-a b+b^{2} \geq 2$. Assume that the latter is the case. Then $p$ is a divisor of both $a+b$ and $a^{2}-a b+b^{2}$, hence also of $(a+b)^{2}-\left(a^{2}-a b+b^{2}\right)=3 a b$. This means that $p$ either is equal to 3 or is a divisor of $a b$. Since $p$ is a divisor of $a+b$, we have $p|a \Leftrightarrow p| b$, hence either $p=3$, or $p \mid a$ and $p \mid b$. If $p \mid a$ and $p \mid b$, then we can write $a=p a^{\prime}, b=p b^{\prime}$ with $a^{\prime}$ and $b^{\prime}$ positive integers, and we have $\left(a^{\prime}\right)^{3}+\left(b^{\prime}\right)^{3}=p^{n-3}$, so $\left(a^{\prime}, b^{\prime}, p, n-3\right)$ then is another solution (note that $\left(a^{\prime}\right)^{3}+\left(b^{\prime}\right)^{3}$ is a positive integer greater than 1 , so $n-3$ is positive).
Now assume that $\left(a_{0}, b_{0}, p_{0}, n_{0}\right)$ is a solution such that $p \nmid a$. From the reasoning above it follows that either $a_{0}=b_{0}=1$, or $p_{0}=3$. After all, if we do not have $a_{0}=b_{0}=1$ and we have $p_{0} \neq 3$, then $p \mid a$. Also, given an arbitrary solution $(a, b, p, n)$, we can divide everything by $p$ repeatedly until there are no factors $p$ left in $a$.
Suppose $a_{0}=b_{0}=1$. Then the solution is $(1,1,2,1)$.
Suppose $p_{0}=3$. Assume that $3^{2} \mid\left(a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}\right)$. As $3^{2} \mid\left(a_{0}+b_{0}\right)^{2}$, we then have $3^{2} \mid\left(a_{0}+b_{0}\right)^{2}-\left(a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}\right)=3 a_{0} b_{0}$, so $3 \mid a_{0} b_{0}$. But $3 \nmid a_{0}$ by assumption, and $3 \mid a_{0}+b_{0}$, so $3 \nmid b_{0}$, which contradicts $3 \mid a_{0} b_{0}$. We conclude that $3^{2} \nmid\left(a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}\right)$. As both $a_{0}+b_{0}$ and $a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}$ must be powers of 3 , we have $a_{0}^{2}-a_{0} b_{0}+b_{0}^{2}=3$. Hence $\left(a_{0}-b_{0}\right)^{2}+a_{0} b_{0}=3$. We must have $\left(a_{0}-b_{0}\right)^{2}=0$ or $\left(a_{0}-b_{0}\right)^{2}=1$. The former does not give a solution; the latter gives $a_{0}=2$ and $b_{0}=1$ or $a_{0}=1$ and $b_{0}=2$.
So all solutions with $p \nmid a$ are $(1,1,2,1),(2,1,3,2)$ and $(1,2,3,2)$. From the above it follows that all other solutions are of the form $\left(p_{0}^{k} a_{0}, p_{0}^{k} b_{0}, p_{0}, n_{0}+3 k\right)$, where $\left(a_{0}, b_{0}, p_{0}, n_{0}\right)$ is one of these three solutions. Hence we find three families of solutions:
- $\left(2^{k}, 2^{k}, 2,3 k+1\right)$ with $k \in \mathbb{Z}_{\geq 0}$,
- $\left(2 \cdot 3^{k}, 3^{k}, 3,3 k+2\right)$ with $k \in \mathbb{Z}_{\geq 0}$,
- $\left(3^{k}, 2 \cdot 3^{k}, 3,3 k+2\right)$ with $k \in \mathbb{Z}_{\geq 0}$.
It is easy to check that all these quadruples are indeed solutions.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "\nProblem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "\nSolution 1",
"tier": "T3",
"year": "2010"
}
|
Find all quadruples $(a, b, p, n)$ of positive integers, such that $p$ is a prime and
$$
a^{3}+b^{3}=p^{n}
$$
|
. Let $(a, b, p, n)$ be a solution. Note that we can write the given equation as
$$
(a+b)\left(a^{2}-a b+b^{2}\right)=p^{n}
$$
As $a$ and $b$ are positive integers, we have $a+b \geq 2$ and $a^{2}-a b+b^{2}=(a-b)^{2}+a b \geq 1$. So both factors are positive and therefore must be powers of $p$. Let $k$ be an integer with $1 \leq k \leq n$ such that $a+b=p^{k}$. Then $a^{2}-a b+b^{2}=p^{n-k}$. If we substitute $b=p^{k}-a$, we find
$$
p^{n-k}=(a+b)^{2}-3 a b=p^{2 k}-3 a\left(p^{k}-a\right) .
$$
We can rewrite this as:
$$
3 a^{2}-3 p^{k} a+p^{2 k}-p^{n-k}=0
$$
from which we see that $a$ is a solution of the following quadratic equation in $x$ :
$$
3 x^{2}-3 p^{k} x+p^{2 k}-p^{n-k}=0 .
$$
The discriminant of (15) is
$$
D=\left(-3 p^{k}\right)^{2}-4 \cdot 3 \cdot\left(p^{2 k}-p^{n-k}\right)=3 \cdot\left(4 p^{n-k}-p^{2 k}\right)=3 p^{n-k} \cdot\left(4-p^{3 k-n}\right)
$$
As $p^{n-k}=(a+b)^{2}-3 a b<(a+b)^{2}=p^{2 k}$, we have $n-k<2 k$, so $3 k-n>0$. Since $a$ is a solution of (15), the discriminant must be nonnegative. Hence $4-p^{3 k-n} \geq 0$. If $p=2$, this implies $3 k-n=1$ or $3 k-n=2$; if $p=3$, this implies $3 k-n=1$; and if $p>3$, then $p \geq 5$ so $4 \geq p^{3 k-n}$ can never be true.
Suppose $p=2$ and $3 k-n=1$. Then $D=3 \cdot 2^{2 k-1} \cdot(4-2)=3 \cdot 2^{2 k}$. But this is a not a square, so the solutions of (15) will not be integers, which yields a contradiction.
Suppose $p=2$ and $3 k-n=2$. Then $D=3 \cdot 2^{2 k-2} \cdot(4-4)=0$, so the only solution of (15) is $x=\frac{3 \cdot 2^{k}}{2 \cdot 3}=2^{k-1}$. Therefore $a=2^{k-1}$ and $b=2^{k}-a=2^{k-1}$, and this gives a solution for all $k \geq 1$, namely ( $\left.2^{k-1}, 2^{k-1}, 2,3 k-2\right)$.
Suppose $p=3$ and $3 k-n=1$. Then $D=3 \cdot 3^{2 k-1} \cdot(4-3)=3^{2 k}$, so the solutions of (15) are $x=\frac{3^{k+1} \pm 3^{k}}{2 \cdot 3}=\frac{1}{2}\left(3^{k} \pm 3^{k-1}\right)$. Therefore $a=2 \cdot 3^{k-1}$ or $a=3^{k-1}$. For all $k \geq 1$ we find the solutions $\left(2 \cdot 3^{k-1}, 3^{k-1}, 3,3 k-1\right)$ and $\left(3^{k-1}, 2 \cdot 3^{k-1}, 3,3 k-1\right)$.
We conclude that there are three families of solutions:
- $\left(2^{k-1}, 2^{k-1}, 2,3 k-2\right)$ with $k \in \mathbb{Z}_{\geq 1}$,
- $\left(2 \cdot 3^{k-1}, 3^{k-1}, 3,3 k-1\right)$ with $k \in \mathbb{Z}_{\geq 1}$,
- $\left(3^{k-1}, 2 \cdot 3^{k-1}, 3,3 k-1\right)$ with $k \in \mathbb{Z}_{\geq 1}$.
It is easy to check that all these quadruples are indeed solutions.
| null |
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find all quadruples $(a, b, p, n)$ of positive integers, such that $p$ is a prime and
$$
a^{3}+b^{3}=p^{n}
$$
|
. Let $(a, b, p, n)$ be a solution. Note that we can write the given equation as
$$
(a+b)\left(a^{2}-a b+b^{2}\right)=p^{n}
$$
As $a$ and $b$ are positive integers, we have $a+b \geq 2$ and $a^{2}-a b+b^{2}=(a-b)^{2}+a b \geq 1$. So both factors are positive and therefore must be powers of $p$. Let $k$ be an integer with $1 \leq k \leq n$ such that $a+b=p^{k}$. Then $a^{2}-a b+b^{2}=p^{n-k}$. If we substitute $b=p^{k}-a$, we find
$$
p^{n-k}=(a+b)^{2}-3 a b=p^{2 k}-3 a\left(p^{k}-a\right) .
$$
We can rewrite this as:
$$
3 a^{2}-3 p^{k} a+p^{2 k}-p^{n-k}=0
$$
from which we see that $a$ is a solution of the following quadratic equation in $x$ :
$$
3 x^{2}-3 p^{k} x+p^{2 k}-p^{n-k}=0 .
$$
The discriminant of (15) is
$$
D=\left(-3 p^{k}\right)^{2}-4 \cdot 3 \cdot\left(p^{2 k}-p^{n-k}\right)=3 \cdot\left(4 p^{n-k}-p^{2 k}\right)=3 p^{n-k} \cdot\left(4-p^{3 k-n}\right)
$$
As $p^{n-k}=(a+b)^{2}-3 a b<(a+b)^{2}=p^{2 k}$, we have $n-k<2 k$, so $3 k-n>0$. Since $a$ is a solution of (15), the discriminant must be nonnegative. Hence $4-p^{3 k-n} \geq 0$. If $p=2$, this implies $3 k-n=1$ or $3 k-n=2$; if $p=3$, this implies $3 k-n=1$; and if $p>3$, then $p \geq 5$ so $4 \geq p^{3 k-n}$ can never be true.
Suppose $p=2$ and $3 k-n=1$. Then $D=3 \cdot 2^{2 k-1} \cdot(4-2)=3 \cdot 2^{2 k}$. But this is a not a square, so the solutions of (15) will not be integers, which yields a contradiction.
Suppose $p=2$ and $3 k-n=2$. Then $D=3 \cdot 2^{2 k-2} \cdot(4-4)=0$, so the only solution of (15) is $x=\frac{3 \cdot 2^{k}}{2 \cdot 3}=2^{k-1}$. Therefore $a=2^{k-1}$ and $b=2^{k}-a=2^{k-1}$, and this gives a solution for all $k \geq 1$, namely ( $\left.2^{k-1}, 2^{k-1}, 2,3 k-2\right)$.
Suppose $p=3$ and $3 k-n=1$. Then $D=3 \cdot 3^{2 k-1} \cdot(4-3)=3^{2 k}$, so the solutions of (15) are $x=\frac{3^{k+1} \pm 3^{k}}{2 \cdot 3}=\frac{1}{2}\left(3^{k} \pm 3^{k-1}\right)$. Therefore $a=2 \cdot 3^{k-1}$ or $a=3^{k-1}$. For all $k \geq 1$ we find the solutions $\left(2 \cdot 3^{k-1}, 3^{k-1}, 3,3 k-1\right)$ and $\left(3^{k-1}, 2 \cdot 3^{k-1}, 3,3 k-1\right)$.
We conclude that there are three families of solutions:
- $\left(2^{k-1}, 2^{k-1}, 2,3 k-2\right)$ with $k \in \mathbb{Z}_{\geq 1}$,
- $\left(2 \cdot 3^{k-1}, 3^{k-1}, 3,3 k-1\right)$ with $k \in \mathbb{Z}_{\geq 1}$,
- $\left(3^{k-1}, 2 \cdot 3^{k-1}, 3,3 k-1\right)$ with $k \in \mathbb{Z}_{\geq 1}$.
It is easy to check that all these quadruples are indeed solutions.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "\nProblem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2010-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2010"
}
|
An ordered pair of integers $(m, n)$ with $1<m<n$ is said to be a Benelux couple if the following two conditions hold: $m$ has the same prime divisors as $n$, and $m+1$ has the same prime divisors as $n+1$.
(a) Find three Benelux couples $(m, n)$ with $m \leqslant 14$.
(b) Prove that there exist infinitely many Benelux couples.
#
|
(a) It is possible to see that $(2,8),(6,48)$ and $(14,224)$ are Benelux couples.
(b) Let $k \geqslant 2$ be an integer and $m=2^{k}-2$. Define $n=m(m+2)=2^{k}\left(2^{k}-2\right)$. Since $m$ is even, $m$ and $n$ have the same prime factors. Also, $n+1=m(m+2)+1=(m+1)^{2}$, so $m+1$ and $n+1$ have the same prime factors, too. We have thus obtained a Benelux couple $\left(2^{k}-2,2^{k}\left(2^{k}-2\right)\right)$ for each $k \geqslant 2$.
#
|
(2,8),(6,48),(14,224)
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
An ordered pair of integers $(m, n)$ with $1<m<n$ is said to be a Benelux couple if the following two conditions hold: $m$ has the same prime divisors as $n$, and $m+1$ has the same prime divisors as $n+1$.
(a) Find three Benelux couples $(m, n)$ with $m \leqslant 14$.
(b) Prove that there exist infinitely many Benelux couples.
#
|
(a) It is possible to see that $(2,8),(6,48)$ and $(14,224)$ are Benelux couples.
(b) Let $k \geqslant 2$ be an integer and $m=2^{k}-2$. Define $n=m(m+2)=2^{k}\left(2^{k}-2\right)$. Since $m$ is even, $m$ and $n$ have the same prime factors. Also, $n+1=m(m+2)+1=(m+1)^{2}$, so $m+1$ and $n+1$ have the same prime factors, too. We have thus obtained a Benelux couple $\left(2^{k}-2,2^{k}\left(2^{k}-2\right)\right)$ for each $k \geqslant 2$.
#
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2011-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2011"
}
|
Let $A B C$ be a triangle with incentre $I$. The angle bisectors $A I, B I$ and $C I$ meet $[B C],[C A]$ and $[A B]$ at $D, E$ and $F$, respectively. The perpendicular bisector of $[A D]$ intersects the lines $B I$ and $C I$ at $M$ and $N$, respectively. Show that $A, I, M$ and $N$ lie on a circle.
#
|
The quadrilateral $A M D B$ is cyclic. Indeed, $M$ is the intersection of the line $B I$, which bisects the angle $\widehat{A B D}$ in $A B D$ and the perpendicular bisector of $[A D]$. By uniqueness of this intersection point, it follows that $M$ lies on the circumcircle of $A B D$, and thence $A M D B$ is cyclic. Analogously, $A N D C$ is cyclic.
Moreover, $M N B C$ is cyclic, for $\widehat{N M I}=90^{\circ}-\widehat{E I A}$. Indeed, $A$ and $I$ lie on either side of the midpoint of $[A D]$, for $\widehat{B D A}=\widehat{C A D}+\widehat{B C A}>\widehat{B A D}$. But
$$
\widehat{E I A}=180^{\circ}-\frac{1}{2} \widehat{B A C}-\widehat{B E A}=180^{\circ}-\frac{1}{2} \widehat{B A C}-\left(\frac{1}{2} \widehat{C B A}+\widehat{B C A}\right)=90^{\circ}-\frac{1}{2} \widehat{B C A}
$$
It follows that $\widehat{N M I}=\widehat{B C I}$, which implies that $M N B C$ is cyclic, as the points $I$ and $D$ lie on the same side of $M N$.
There are now two ways of completing the proof:
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with incentre $I$. The angle bisectors $A I, B I$ and $C I$ meet $[B C],[C A]$ and $[A B]$ at $D, E$ and $F$, respectively. The perpendicular bisector of $[A D]$ intersects the lines $B I$ and $C I$ at $M$ and $N$, respectively. Show that $A, I, M$ and $N$ lie on a circle.
#
|
The quadrilateral $A M D B$ is cyclic. Indeed, $M$ is the intersection of the line $B I$, which bisects the angle $\widehat{A B D}$ in $A B D$ and the perpendicular bisector of $[A D]$. By uniqueness of this intersection point, it follows that $M$ lies on the circumcircle of $A B D$, and thence $A M D B$ is cyclic. Analogously, $A N D C$ is cyclic.
Moreover, $M N B C$ is cyclic, for $\widehat{N M I}=90^{\circ}-\widehat{E I A}$. Indeed, $A$ and $I$ lie on either side of the midpoint of $[A D]$, for $\widehat{B D A}=\widehat{C A D}+\widehat{B C A}>\widehat{B A D}$. But
$$
\widehat{E I A}=180^{\circ}-\frac{1}{2} \widehat{B A C}-\widehat{B E A}=180^{\circ}-\frac{1}{2} \widehat{B A C}-\left(\frac{1}{2} \widehat{C B A}+\widehat{B C A}\right)=90^{\circ}-\frac{1}{2} \widehat{B C A}
$$
It follows that $\widehat{N M I}=\widehat{B C I}$, which implies that $M N B C$ is cyclic, as the points $I$ and $D$ lie on the same side of $M N$.
There are now two ways of completing the proof:
#
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2011-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2011"
}
|
Let $A B C$ be a triangle with incentre $I$. The angle bisectors $A I, B I$ and $C I$ meet $[B C],[C A]$ and $[A B]$ at $D, E$ and $F$, respectively. The perpendicular bisector of $[A D]$ intersects the lines $B I$ and $C I$ at $M$ and $N$, respectively. Show that $A, I, M$ and $N$ lie on a circle.
#
|
(using $A M D B$ and $M N B C$ )
Since $A M D B$ is cyclic, $\widehat{M A I}=\widehat{M A D}=\widehat{M B D}$, as, by construction, $B$ and $M$ lie on either side of $A D$. Moreover, $\widehat{M B D}=\widehat{M B C}=\widehat{M N C}$ for $M N B C$ is cyclic. Thus $\widehat{M A I}=\widehat{M N I}$, so $A M I N$ is cyclic, for $M$ and $N$ lie on either side of $A D$.
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with incentre $I$. The angle bisectors $A I, B I$ and $C I$ meet $[B C],[C A]$ and $[A B]$ at $D, E$ and $F$, respectively. The perpendicular bisector of $[A D]$ intersects the lines $B I$ and $C I$ at $M$ and $N$, respectively. Show that $A, I, M$ and $N$ lie on a circle.
#
|
(using $A M D B$ and $M N B C$ )
Since $A M D B$ is cyclic, $\widehat{M A I}=\widehat{M A D}=\widehat{M B D}$, as, by construction, $B$ and $M$ lie on either side of $A D$. Moreover, $\widehat{M B D}=\widehat{M B C}=\widehat{M N C}$ for $M N B C$ is cyclic. Thus $\widehat{M A I}=\widehat{M N I}$, so $A M I N$ is cyclic, for $M$ and $N$ lie on either side of $A D$.
#
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2011-zz.jsonl",
"solution_match": "# Solution 1",
"tier": "T3",
"year": "2011"
}
|
Let $A B C$ be a triangle with incentre $I$. The angle bisectors $A I, B I$ and $C I$ meet $[B C],[C A]$ and $[A B]$ at $D, E$ and $F$, respectively. The perpendicular bisector of $[A D]$ intersects the lines $B I$ and $C I$ at $M$ and $N$, respectively. Show that $A, I, M$ and $N$ lie on a circle.
#
|
(using $A M D B$ and $A N D C$ )
Since $A M D B$ and $A N D C$ are cylic, $\widehat{A M I}+\widehat{A N I}=\widehat{A M B}+\widehat{A N C}=\widehat{A D B}+\widehat{A D C}=180^{\circ}$, because $B$ and $M$, and $C$ and $N$ lie on either side of $A D$. Hence $A M I N$ is cyclic, for $M$ and $N$ lie on either side of $A D$.
Remark. It is moreover true that $B M \perp D N$ and $C N \perp D M$. Indeed, symmetry implies that the image $J$ of $I$ under reflection in $M N$ lies on the circumcircle of $D M N$. Moreover, $D I$ is a height of $D M N$, so the fact that $I$ and $J$ are equidistant from the side $[M N]$ implies that $I$ is the orthocentre of $D M N$. This implies the claim.
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with incentre $I$. The angle bisectors $A I, B I$ and $C I$ meet $[B C],[C A]$ and $[A B]$ at $D, E$ and $F$, respectively. The perpendicular bisector of $[A D]$ intersects the lines $B I$ and $C I$ at $M$ and $N$, respectively. Show that $A, I, M$ and $N$ lie on a circle.
#
|
(using $A M D B$ and $A N D C$ )
Since $A M D B$ and $A N D C$ are cylic, $\widehat{A M I}+\widehat{A N I}=\widehat{A M B}+\widehat{A N C}=\widehat{A D B}+\widehat{A D C}=180^{\circ}$, because $B$ and $M$, and $C$ and $N$ lie on either side of $A D$. Hence $A M I N$ is cyclic, for $M$ and $N$ lie on either side of $A D$.
Remark. It is moreover true that $B M \perp D N$ and $C N \perp D M$. Indeed, symmetry implies that the image $J$ of $I$ under reflection in $M N$ lies on the circumcircle of $D M N$. Moreover, $D I$ is a height of $D M N$, so the fact that $I$ and $J$ are equidistant from the side $[M N]$ implies that $I$ is the orthocentre of $D M N$. This implies the claim.
#
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2011-zz.jsonl",
"solution_match": "# Solution 2",
"tier": "T3",
"year": "2011"
}
|
If $k$ is an integer, let $\mathrm{c}(k)$ denote the largest cube that is less than or equal to $k$. Find all positive integers $p$ for which the following sequence is bounded:
$$
a_{0}=p \quad \text { and } \quad a_{n+1}=3 a_{n}-2 c\left(a_{n}\right) \quad \text { for } n \geqslant 0
$$
#
|
Since $\mathrm{c}\left(a_{n}\right) \leqslant a_{n}$ for all $n \in \mathbb{N}, a_{n+1} \geqslant a_{n}$ with equality if and only if $\mathrm{c}\left(a_{n}\right)=a_{n}$. Hence the sequence is bounded if and only if it is eventually constant, which is if and only if $a_{n}$ is a perfect cube, for some $n \geqslant 0$. In particular, the sequence is bounded if $p$ is a perfect cube.
We now claim that, if $a_{n}$ is not a cube for some $n$, then neither is $a_{n+1}$. Indeed, if $a_{n}$ is not a cube, $q^{3}<a_{n}<(q+1)^{3}$ for some $q \in \mathbb{N}$, so that $\mathrm{c}\left(a_{n}\right)=q^{3}$. Suppose to the contrary that $a_{n+1}$ is a cube. Then
$$
a_{n+1}=3 a_{n}-2 \mathrm{c}\left(a_{n}\right)<3(q+1)^{3}-2 q^{3}=q^{3}+9 q^{2}+9 q+3<q^{3}+9 q^{2}+27 q+27=(q+3)^{3}
$$
Also, since $\mathrm{c}\left(a_{n}\right)<a_{n}, a_{n+1}>a_{n}>q^{3}$, so $q^{3}<a_{n+1}<(q+3)^{3}$. It follows that the only possible values of $a_{n+1}$ are $(q+1)^{3}$ and $(q+2)^{3}$. However, in both of these cases,
$$
\begin{aligned}
& 3 a_{n}-2 q^{3}=a_{n+1}=(q+1)^{3} \Longleftrightarrow 3 a_{n}=3\left(q^{3}+q^{2}+q\right)+1 \\
& 3 a_{n}-2 q^{3}=a_{n+1}=(q+2)^{3} \Longleftrightarrow 3 a_{n}=3\left(q^{3}+2 q^{2}+4 q\right)+8
\end{aligned}
$$
a contradiction modulo 3 . This proves that, if $a_{n}$ is not a cube, then neither is $a_{n+1}$. Hence, if $p$ is not a perfect cube, $a_{n}$ is not a cube for any $n \in \mathbb{N}$, and the sequence is not bounded. We conclude that the sequence is bounded if and only if $p$ is a perfect cube.
#
|
p \text{ is a perfect cube}
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
If $k$ is an integer, let $\mathrm{c}(k)$ denote the largest cube that is less than or equal to $k$. Find all positive integers $p$ for which the following sequence is bounded:
$$
a_{0}=p \quad \text { and } \quad a_{n+1}=3 a_{n}-2 c\left(a_{n}\right) \quad \text { for } n \geqslant 0
$$
#
|
Since $\mathrm{c}\left(a_{n}\right) \leqslant a_{n}$ for all $n \in \mathbb{N}, a_{n+1} \geqslant a_{n}$ with equality if and only if $\mathrm{c}\left(a_{n}\right)=a_{n}$. Hence the sequence is bounded if and only if it is eventually constant, which is if and only if $a_{n}$ is a perfect cube, for some $n \geqslant 0$. In particular, the sequence is bounded if $p$ is a perfect cube.
We now claim that, if $a_{n}$ is not a cube for some $n$, then neither is $a_{n+1}$. Indeed, if $a_{n}$ is not a cube, $q^{3}<a_{n}<(q+1)^{3}$ for some $q \in \mathbb{N}$, so that $\mathrm{c}\left(a_{n}\right)=q^{3}$. Suppose to the contrary that $a_{n+1}$ is a cube. Then
$$
a_{n+1}=3 a_{n}-2 \mathrm{c}\left(a_{n}\right)<3(q+1)^{3}-2 q^{3}=q^{3}+9 q^{2}+9 q+3<q^{3}+9 q^{2}+27 q+27=(q+3)^{3}
$$
Also, since $\mathrm{c}\left(a_{n}\right)<a_{n}, a_{n+1}>a_{n}>q^{3}$, so $q^{3}<a_{n+1}<(q+3)^{3}$. It follows that the only possible values of $a_{n+1}$ are $(q+1)^{3}$ and $(q+2)^{3}$. However, in both of these cases,
$$
\begin{aligned}
& 3 a_{n}-2 q^{3}=a_{n+1}=(q+1)^{3} \Longleftrightarrow 3 a_{n}=3\left(q^{3}+q^{2}+q\right)+1 \\
& 3 a_{n}-2 q^{3}=a_{n+1}=(q+2)^{3} \Longleftrightarrow 3 a_{n}=3\left(q^{3}+2 q^{2}+4 q\right)+8
\end{aligned}
$$
a contradiction modulo 3 . This proves that, if $a_{n}$ is not a cube, then neither is $a_{n+1}$. Hence, if $p$ is not a perfect cube, $a_{n}$ is not a cube for any $n \in \mathbb{N}$, and the sequence is not bounded. We conclude that the sequence is bounded if and only if $p$ is a perfect cube.
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2011-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2011"
}
|
Abby and Brian play the following game: They first choose a positive integer $N$. Then they write numbers on a blackboard in turn. Abby starts by writing a 1. Thereafter, when one of them has written the number $n$, the other writes down either $n+1$ or $2 n$, provided that the number is not greater than $N$. The player who writes $N$ on the blackboard wins.
(a) Determine which player has a winning strategy if $N=2011$.
(b) Find the number of positive integers $N \leqslant 2011$ for which Brian has a winning strategy.
#
|
(a) Abby has a winning strategy for odd $N$ : Observe that, whenever any player writes down an odd number, the other player has to write down an even number. By adding 1 to that number, the first player can write down another odd number. Since Abby starts the game by writing down an odd number, she can force Brian to write down even numbers only. Since $N$ is odd, Abby will win the game. In particular, Abby has a winning strategy if $N=2011$.
(b) - Let $N=4 k$. If any player is forced to write down a number $m \in\{k+1, k+2, \ldots, 2 k\}$, the other player wins the game by writing down $2 m \in\{2 k+2,2 k+4, \ldots, 4 k\}$, for the players will have to write down the remaining numbers one after the other. Since there is an even number of numbers remaining, the latter player wins. This implies that the player who can write down $k$, i.e. has a winning strategy for $N=k$, wins the game for $N=4 k$.
- Similarly, let $N=4 k+2$. If any player is forced to write down a number $m \in\{k+1, k+2, \ldots, 2 k+1\}$, the other player wins the game by writing down $2 m \in\{2 k+2,2 k+4, \ldots, 4 k+2\}$, as in the previous case. Analogously, this implies that the player who has a winning strategy for $N=k$ wins the game for $N=4 k+2$.
Since Abby wins the game for $N=1,3$, while Brian wins the game for $N=2$, Brian wins the game for $N=8,10$, as well, and thus for $N=32,34,40,42$, too. Then Brian wins the game for a further 8 values of $N$ between 128 and 170, and thence for a further 16 values between 512 and 682 , and for no other values with $N \leqslant 2011$. Hence Brian has a winning strategy for precisely 31 values of $N$ with $N \leqslant 2011$.
|
31
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Abby and Brian play the following game: They first choose a positive integer $N$. Then they write numbers on a blackboard in turn. Abby starts by writing a 1. Thereafter, when one of them has written the number $n$, the other writes down either $n+1$ or $2 n$, provided that the number is not greater than $N$. The player who writes $N$ on the blackboard wins.
(a) Determine which player has a winning strategy if $N=2011$.
(b) Find the number of positive integers $N \leqslant 2011$ for which Brian has a winning strategy.
#
|
(a) Abby has a winning strategy for odd $N$ : Observe that, whenever any player writes down an odd number, the other player has to write down an even number. By adding 1 to that number, the first player can write down another odd number. Since Abby starts the game by writing down an odd number, she can force Brian to write down even numbers only. Since $N$ is odd, Abby will win the game. In particular, Abby has a winning strategy if $N=2011$.
(b) - Let $N=4 k$. If any player is forced to write down a number $m \in\{k+1, k+2, \ldots, 2 k\}$, the other player wins the game by writing down $2 m \in\{2 k+2,2 k+4, \ldots, 4 k\}$, for the players will have to write down the remaining numbers one after the other. Since there is an even number of numbers remaining, the latter player wins. This implies that the player who can write down $k$, i.e. has a winning strategy for $N=k$, wins the game for $N=4 k$.
- Similarly, let $N=4 k+2$. If any player is forced to write down a number $m \in\{k+1, k+2, \ldots, 2 k+1\}$, the other player wins the game by writing down $2 m \in\{2 k+2,2 k+4, \ldots, 4 k+2\}$, as in the previous case. Analogously, this implies that the player who has a winning strategy for $N=k$ wins the game for $N=4 k+2$.
Since Abby wins the game for $N=1,3$, while Brian wins the game for $N=2$, Brian wins the game for $N=8,10$, as well, and thus for $N=32,34,40,42$, too. Then Brian wins the game for a further 8 values of $N$ between 128 and 170, and thence for a further 16 values between 512 and 682 , and for no other values with $N \leqslant 2011$. Hence Brian has a winning strategy for precisely 31 values of $N$ with $N \leqslant 2011$.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2011-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2011"
}
|
A sequence $a_{1}, a_{2}, \ldots, a_{n}, \ldots$ of natural numbers is defined by the rule
$$
a_{n+1}=a_{n}+b_{n} \quad(n=1,2, \ldots)
$$
where $b_{n}$ is the last digit of $a_{n}$. Prove that such a sequence contains infinitely many powers of 2 if and only if $a_{1}$ is not divisible by 5 .
|
First we can observe that:
- If $a_{1}$ is divisible by 5 , then $a_{n}=a_{2}=0(\bmod 10) \forall n \geq 2$.
- If $a_{1}$ is not divisible by 5 , then for $n \geq 2: a_{n}$ is even, the sequence $b_{n}$ is periodic, its period is a cyclic permutation of $(2,4,8,6)$, and $a_{n+4}=a_{n}+20$.
(a) Let us suppose that $a_{1}$ is divisible by 5 .
Since $2^{k} \neq 0(\bmod 10)$ for any $k \in \mathbb{N}$, the sequence does not contain any power of 2 for $n \geq 2$.
(b) Let us suppose that $a_{1}$ is not divisible by 5 .
We can remark that the sequence of powers of 2 modulo 20 respects the period $(12,4,8,16)$ starting with $2^{5}=32$. We choose $j$ such that $a_{j}=2(\bmod 10)\left(\right.$ i.e. $\left.b_{j}=2\right)$ and look at the parity of its penultimate digit.
- If $a_{j}=12(\bmod 20)$, then the numbers $a_{j+4 k}, k \in \mathbb{N}$, represent all the numbers congruent to $12(\bmod 20)$ and greater than $a_{j}$, so all powers of 2 congruent to 12 $(\bmod 20)$ and greater than $a_{j}$ appear in the sequence.
- If $a_{j}=2(\bmod 20)$, then the numbers $a_{j+1+4 k}, k \in \mathbb{N}$, represent all the numbers congruent to $4(\bmod 20)$ and greater than $a_{j+1}$, so all powers of 2 congruent to 4 $(\bmod 20)$ and greater than $a_{j+1}$ appear in the sequence.
Thus, the sequence contains infinitely many powers of 2 .
Alternative 1 for (b). We choose $j$ such that $a_{j}=2(\bmod 10)$ (i.e. $\left.b_{j}=2\right)$.
- If $a_{j}=20 t+12$ for some $t \in \mathbb{N}$, then $a_{j+4 k}=a_{j}+20 k=20(t+k)+12, \forall k \in \mathbb{N}$. We obtain infinitely many powers of 2 by taking $k=\frac{2^{4 s+3}-3}{5}-t$ (with $s \in \mathbb{N}$ large enough to have $k>0)$ since $2^{4 s+3}=3(\bmod 5), \forall s \in \mathbb{N}$.
- If $a_{j}=20 t+2$ for some $t \in \mathbb{N}$, then $a_{j+1+4 k}=a_{j+1}+20 k=20(t+k)+4, \forall k \in \mathbb{N}$. We obtain infinitely many powers of 2 by taking $k=\frac{2^{4 s}-1}{5}-t$ (with $s \in \mathbb{N}$ large enough to have $k>0)$ since $2^{4 s}=1(\bmod 5), \forall s \in \mathbb{N}$.
Alternative 2 for (b). Choose $j$ such that $a_{j}$ is a multiple of 4 , i.e. $a_{j}=4 q$ (such a $j$ always exists since $a_{n+1}=a_{n}+2$ for infinitely many $n$ ). Then we have $a_{j+4 k}=a_{j}+20 k=4(q+5 k)$. Let us look for $(k, m)$ such that
$$
a_{j+4 k}=2^{m} \Longleftrightarrow 4(q+5 k)=2^{m} \Longleftrightarrow q+5 k=2^{m-2} \Longleftrightarrow 2^{m-2}=q(\bmod 5)
$$
Since $q$ could not be a multiple of 5 , we have $q \in\{1,2,3,4\}(\bmod 5)$. Since the sequence $2^{m-2}(\bmod 5)$ is periodic with period $(1,2,4,3)$, we find that $2^{m-2}=q(\bmod 5)$ happens for infinitely many values of $m$. Hence $2^{m-2}=q+5 k$ is solvable for infinitely many pairs $(k, m)$. Noting that $m$ determines $k$ and that $k$ is nonnegative as soon as $m$ is large enough concludes the proof.
Alternative 3 for (b). We shall show that for any $n>1$ there is some $k \geq n$ such that $a_{k}$ is a power of 2. First, we observe that we can always find $m \in\{n, n+1, n+2, n+3\}$ such that $a_{m}$ is divisible by 4 . If $a_{m}$ is not a power of 2 , we write $a_{m}=2^{b} c$ with $b \geq 2$ and $c>1$ odd. Then we have
$$
a_{m+4 \cdot 2^{b-2}}=a_{m}+20\left(2^{b-2}\right)=2^{b} c+5 \cdot 2^{b}=2^{b+1} \frac{c+5}{2} .
$$
If $c>5$, we have $\frac{c+5}{2}<c$ and hence the odd factor of $a_{m+4.2^{b-2}}$ is strictly smaller than the odd factor of $a_{m}$. Therefore there is some $m^{\prime}>m$ such that $a_{m^{\prime}}=2^{b^{\prime}} c^{\prime}$ with $c^{\prime}$ odd and $\leq 5$. The case $c^{\prime}=5$ is forbidden. If $c^{\prime}=1$, then $a_{m^{\prime}}$ is a power of 2 . If $c^{\prime}=3$, then $a_{m^{\prime}+4.2^{b^{\prime}-2}}=2^{b^{\prime}+3}$ is a power of 2 .
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
A sequence $a_{1}, a_{2}, \ldots, a_{n}, \ldots$ of natural numbers is defined by the rule
$$
a_{n+1}=a_{n}+b_{n} \quad(n=1,2, \ldots)
$$
where $b_{n}$ is the last digit of $a_{n}$. Prove that such a sequence contains infinitely many powers of 2 if and only if $a_{1}$ is not divisible by 5 .
|
First we can observe that:
- If $a_{1}$ is divisible by 5 , then $a_{n}=a_{2}=0(\bmod 10) \forall n \geq 2$.
- If $a_{1}$ is not divisible by 5 , then for $n \geq 2: a_{n}$ is even, the sequence $b_{n}$ is periodic, its period is a cyclic permutation of $(2,4,8,6)$, and $a_{n+4}=a_{n}+20$.
(a) Let us suppose that $a_{1}$ is divisible by 5 .
Since $2^{k} \neq 0(\bmod 10)$ for any $k \in \mathbb{N}$, the sequence does not contain any power of 2 for $n \geq 2$.
(b) Let us suppose that $a_{1}$ is not divisible by 5 .
We can remark that the sequence of powers of 2 modulo 20 respects the period $(12,4,8,16)$ starting with $2^{5}=32$. We choose $j$ such that $a_{j}=2(\bmod 10)\left(\right.$ i.e. $\left.b_{j}=2\right)$ and look at the parity of its penultimate digit.
- If $a_{j}=12(\bmod 20)$, then the numbers $a_{j+4 k}, k \in \mathbb{N}$, represent all the numbers congruent to $12(\bmod 20)$ and greater than $a_{j}$, so all powers of 2 congruent to 12 $(\bmod 20)$ and greater than $a_{j}$ appear in the sequence.
- If $a_{j}=2(\bmod 20)$, then the numbers $a_{j+1+4 k}, k \in \mathbb{N}$, represent all the numbers congruent to $4(\bmod 20)$ and greater than $a_{j+1}$, so all powers of 2 congruent to 4 $(\bmod 20)$ and greater than $a_{j+1}$ appear in the sequence.
Thus, the sequence contains infinitely many powers of 2 .
Alternative 1 for (b). We choose $j$ such that $a_{j}=2(\bmod 10)$ (i.e. $\left.b_{j}=2\right)$.
- If $a_{j}=20 t+12$ for some $t \in \mathbb{N}$, then $a_{j+4 k}=a_{j}+20 k=20(t+k)+12, \forall k \in \mathbb{N}$. We obtain infinitely many powers of 2 by taking $k=\frac{2^{4 s+3}-3}{5}-t$ (with $s \in \mathbb{N}$ large enough to have $k>0)$ since $2^{4 s+3}=3(\bmod 5), \forall s \in \mathbb{N}$.
- If $a_{j}=20 t+2$ for some $t \in \mathbb{N}$, then $a_{j+1+4 k}=a_{j+1}+20 k=20(t+k)+4, \forall k \in \mathbb{N}$. We obtain infinitely many powers of 2 by taking $k=\frac{2^{4 s}-1}{5}-t$ (with $s \in \mathbb{N}$ large enough to have $k>0)$ since $2^{4 s}=1(\bmod 5), \forall s \in \mathbb{N}$.
Alternative 2 for (b). Choose $j$ such that $a_{j}$ is a multiple of 4 , i.e. $a_{j}=4 q$ (such a $j$ always exists since $a_{n+1}=a_{n}+2$ for infinitely many $n$ ). Then we have $a_{j+4 k}=a_{j}+20 k=4(q+5 k)$. Let us look for $(k, m)$ such that
$$
a_{j+4 k}=2^{m} \Longleftrightarrow 4(q+5 k)=2^{m} \Longleftrightarrow q+5 k=2^{m-2} \Longleftrightarrow 2^{m-2}=q(\bmod 5)
$$
Since $q$ could not be a multiple of 5 , we have $q \in\{1,2,3,4\}(\bmod 5)$. Since the sequence $2^{m-2}(\bmod 5)$ is periodic with period $(1,2,4,3)$, we find that $2^{m-2}=q(\bmod 5)$ happens for infinitely many values of $m$. Hence $2^{m-2}=q+5 k$ is solvable for infinitely many pairs $(k, m)$. Noting that $m$ determines $k$ and that $k$ is nonnegative as soon as $m$ is large enough concludes the proof.
Alternative 3 for (b). We shall show that for any $n>1$ there is some $k \geq n$ such that $a_{k}$ is a power of 2. First, we observe that we can always find $m \in\{n, n+1, n+2, n+3\}$ such that $a_{m}$ is divisible by 4 . If $a_{m}$ is not a power of 2 , we write $a_{m}=2^{b} c$ with $b \geq 2$ and $c>1$ odd. Then we have
$$
a_{m+4 \cdot 2^{b-2}}=a_{m}+20\left(2^{b-2}\right)=2^{b} c+5 \cdot 2^{b}=2^{b+1} \frac{c+5}{2} .
$$
If $c>5$, we have $\frac{c+5}{2}<c$ and hence the odd factor of $a_{m+4.2^{b-2}}$ is strictly smaller than the odd factor of $a_{m}$. Therefore there is some $m^{\prime}>m$ such that $a_{m^{\prime}}=2^{b^{\prime}} c^{\prime}$ with $c^{\prime}$ odd and $\leq 5$. The case $c^{\prime}=5$ is forbidden. If $c^{\prime}=1$, then $a_{m^{\prime}}$ is a power of 2 . If $c^{\prime}=3$, then $a_{m^{\prime}+4.2^{b^{\prime}-2}}=2^{b^{\prime}+3}$ is a power of 2 .
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "\nProblem 1.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2012-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2012"
}
|
Find all quadruples $(a, b, c, d)$ of positive real numbers such that $a b c d=1$, $a^{2012}+2012 b=2012 c+d^{2012}$ and $2012 a+b^{2012}=c^{2012}+2012 d$.
|
Rewrite the last two equations into
$$
a^{2012}-d^{2012}=2012(c-b) \text { and } c^{2012}-b^{2012}=2012(a-d)
$$
and observe that $a=d$ holds if and only if $c=b$ holds. In that case, the last two equations are satisfied, and condition $a b c d=1$ leads to a set of valid quadruples of the form $(a, b, c, d)=\left(t, \frac{1}{t}, \frac{1}{t}, t\right)$ for any $t>0$.
We show that there are no other solutions. Assume that $a \neq d$ and $c \neq b$. Multiply both sides of (1) to obtain
$$
\left(a^{2012}-d^{2012}\right)\left(c^{2012}-b^{2012}\right)=2012^{2}(c-b)(a-d)
$$
and divide the left-hand side by the (nonzero) right-hand side to get
$$
\frac{a^{2011}+\cdots+a^{2011-i} d^{i}+\cdots+d^{2011}}{2012} \cdot \frac{c^{2011}+\cdots+c^{2011-i} b^{i}+\cdots+b^{2011}}{2012}=1
$$
Now apply the arithmetic-geometric mean inequality to the first factor
$$
\frac{a^{2011}+\cdots+a^{2011-i} d^{i}+\cdots+d^{2011}}{2012}>\sqrt[2012]{(a d)^{\frac{2011 \times 2012}{2}}}=(a d)^{\frac{2011}{2}}
$$
The inequality is strict, since equality holds only if all terms in the mean are equal to each other, which happens only if $a=d$. Similarly, we find
$$
\frac{c^{2011}+\cdots+c^{2011-i} b^{i}+\cdots b^{2011}}{2012}>\sqrt[2012]{(c b)^{\frac{2011 \times 2012}{2}}}=(c b)^{\frac{2011}{2}} .
$$
Multiplying both inequalities, we obtain
$$
(a d)^{\frac{2011}{2}}(c b)^{\frac{2011}{2}}<1
$$
which is equivalent to $a b c d<1$, a contradiction.
|
(a, b, c, d)=\left(t, \frac{1}{t}, \frac{1}{t}, t\right) \text{ for any } t>0
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Find all quadruples $(a, b, c, d)$ of positive real numbers such that $a b c d=1$, $a^{2012}+2012 b=2012 c+d^{2012}$ and $2012 a+b^{2012}=c^{2012}+2012 d$.
|
Rewrite the last two equations into
$$
a^{2012}-d^{2012}=2012(c-b) \text { and } c^{2012}-b^{2012}=2012(a-d)
$$
and observe that $a=d$ holds if and only if $c=b$ holds. In that case, the last two equations are satisfied, and condition $a b c d=1$ leads to a set of valid quadruples of the form $(a, b, c, d)=\left(t, \frac{1}{t}, \frac{1}{t}, t\right)$ for any $t>0$.
We show that there are no other solutions. Assume that $a \neq d$ and $c \neq b$. Multiply both sides of (1) to obtain
$$
\left(a^{2012}-d^{2012}\right)\left(c^{2012}-b^{2012}\right)=2012^{2}(c-b)(a-d)
$$
and divide the left-hand side by the (nonzero) right-hand side to get
$$
\frac{a^{2011}+\cdots+a^{2011-i} d^{i}+\cdots+d^{2011}}{2012} \cdot \frac{c^{2011}+\cdots+c^{2011-i} b^{i}+\cdots+b^{2011}}{2012}=1
$$
Now apply the arithmetic-geometric mean inequality to the first factor
$$
\frac{a^{2011}+\cdots+a^{2011-i} d^{i}+\cdots+d^{2011}}{2012}>\sqrt[2012]{(a d)^{\frac{2011 \times 2012}{2}}}=(a d)^{\frac{2011}{2}}
$$
The inequality is strict, since equality holds only if all terms in the mean are equal to each other, which happens only if $a=d$. Similarly, we find
$$
\frac{c^{2011}+\cdots+c^{2011-i} b^{i}+\cdots b^{2011}}{2012}>\sqrt[2012]{(c b)^{\frac{2011 \times 2012}{2}}}=(c b)^{\frac{2011}{2}} .
$$
Multiplying both inequalities, we obtain
$$
(a d)^{\frac{2011}{2}}(c b)^{\frac{2011}{2}}<1
$$
which is equivalent to $a b c d<1$, a contradiction.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "\nProblem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2012-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2012"
}
|
In triangle $A B C$ the midpoint of $B C$ is called $M$. Let $P$ be a variable interior point of the triangle such that $\angle C P M=\angle P A B$. Let $\Gamma$ be the circumcircle of triangle $A B P$. The line $M P$ intersects $\Gamma$ a second time in $Q$. Define $R$ as the reflection of $P$ in the tangent to $\Gamma$ in $B$. Prove that the length $|Q R|$ is independent of the position of $P$ inside the triangle.
|
We claim $|Q R|=|B C|$, which will clearly imply that quantity $|Q R|$ is independent from the position of $P$ inside triangle $\triangle A B C$ (and independent from the position of $A$ ).
This equality will follow from the equality between triangles $\triangle B P C$ and $\triangle R B Q$. This in turn will be shown by means of three equalities (two sides and an angle): $|B P|=|R B|,|P C|=|B Q|$ and $\angle B P C=\angle R B Q$.
(a) $|B P|=|R B|$
Obvious since $R$ is the reflection of $P$ in a line going through $B$.
(b) $|P C|=|B Q|$
Let $U$ be the fourth vertex of parallelogram $B P C U$. Then $U$ is on line $P Q$ and $\angle B U P=$ $\angle U P C=\alpha$. If $Q$ is on the same $\operatorname{arc} P B$ as $A$, then $\angle B Q P=\alpha$, and $\triangle Q P U$ is isosceles; hence, $|B Q|=|B U|=|P C|$. On the other way, if $Q$ is on the other $\operatorname{arc} P B$, then $\angle B Q P$ and $\alpha$ are supplementary, hence $B Q U=\alpha$, and again $\triangle Q P U$ is isosceles; the same conclusion follows.
(c) $\angle B P C=\angle R B Q$
Define $T$ to be the midpoint of $P R$. Then line $B T$, tangent to circle $\Gamma$ in $B$, splits $\angle R B Q$ into two parts, $\angle R B T$ and $\angle T B Q$.
We first show that $\angle R B T=\alpha$. Indeed, by symmetry, $\angle R B T=\angle P B T$ and, since $B T$ is tangent to $\Gamma$, we have that $\angle P B T=\angle P A B$ (because they both intercept the same $\operatorname{arc} \widehat{P B}$ on circle $\Gamma$ ), from which our claim follows.
We then show that $\angle T B Q=\angle B P M$. Indeed, since $\angle T B Q$ and $\angle B P Q$ intercept opposite arcs on circle $\Gamma$, they are supplementary and we have $\angle T B Q=\pi-\angle B P Q=\angle B P M$. We finally conclude that
$$
\angle R B Q=\angle R B T+\angle T B Q=\alpha+\angle B P M=\angle M P C+\angle B P M=\angle B P C
$$
We have thus shown $\triangle B P C=\triangle R B Q$, which completes the proof.
Note. Notice that point $A$ does not play any role in the problem except fixing circle $\Gamma$ (and, for that reason, the result is also valid when $P$ is chosen outside of triangle $\triangle A B C$ ).
Alternative 1 for (b). The law of sines in triangle $\triangle B Q M$ gives
$$
\frac{|B M|}{\sin \angle B Q M}=\frac{|B Q|}{\sin \angle B M Q} .
$$
Since $Q$ belongs to circle $\Gamma$, we have either $\angle B Q P=\angle B A P=\alpha$, hence $\angle B Q M=\angle M P C$, or these angles are supplementary; in both cases they have equal sines. We also have that $\angle B M Q$ and $\angle C M P$ are supplementary, hence have equal sines. Using these facts along with $|B M|=|M C|$ transforms (2) into
$$
\frac{|M C|}{\sin \angle M P C}=\frac{|B Q|}{\sin \angle C M P}
$$
from which the law of sines in triangle $\triangle C P M$ implies that $|B Q|=|P C|$.
Alternative 2 for (b). Let $S$ be the second intersection of line $C P$ with circle $\Gamma$. Then, $\angle B S P=\alpha$, so $B S$ and $M P$ are parallel; since $M$ is the midpoint of segment $B C, P$ is the midpoint of $S C$. If $Q$ is on the same $\operatorname{arc} P B$ as $A$, then the quadrilateral $Q P B S$ is an isosceles trapezoid, and $|Q B|=|S P|=|P C|$. If $Q$ is on the other arc $P B$, then the quadrilateral $P Q B S$ is an isosceles trapezoid, and again $|Q B|=|S P|=|P C|$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
In triangle $A B C$ the midpoint of $B C$ is called $M$. Let $P$ be a variable interior point of the triangle such that $\angle C P M=\angle P A B$. Let $\Gamma$ be the circumcircle of triangle $A B P$. The line $M P$ intersects $\Gamma$ a second time in $Q$. Define $R$ as the reflection of $P$ in the tangent to $\Gamma$ in $B$. Prove that the length $|Q R|$ is independent of the position of $P$ inside the triangle.
|
We claim $|Q R|=|B C|$, which will clearly imply that quantity $|Q R|$ is independent from the position of $P$ inside triangle $\triangle A B C$ (and independent from the position of $A$ ).
This equality will follow from the equality between triangles $\triangle B P C$ and $\triangle R B Q$. This in turn will be shown by means of three equalities (two sides and an angle): $|B P|=|R B|,|P C|=|B Q|$ and $\angle B P C=\angle R B Q$.
(a) $|B P|=|R B|$
Obvious since $R$ is the reflection of $P$ in a line going through $B$.
(b) $|P C|=|B Q|$
Let $U$ be the fourth vertex of parallelogram $B P C U$. Then $U$ is on line $P Q$ and $\angle B U P=$ $\angle U P C=\alpha$. If $Q$ is on the same $\operatorname{arc} P B$ as $A$, then $\angle B Q P=\alpha$, and $\triangle Q P U$ is isosceles; hence, $|B Q|=|B U|=|P C|$. On the other way, if $Q$ is on the other $\operatorname{arc} P B$, then $\angle B Q P$ and $\alpha$ are supplementary, hence $B Q U=\alpha$, and again $\triangle Q P U$ is isosceles; the same conclusion follows.
(c) $\angle B P C=\angle R B Q$
Define $T$ to be the midpoint of $P R$. Then line $B T$, tangent to circle $\Gamma$ in $B$, splits $\angle R B Q$ into two parts, $\angle R B T$ and $\angle T B Q$.
We first show that $\angle R B T=\alpha$. Indeed, by symmetry, $\angle R B T=\angle P B T$ and, since $B T$ is tangent to $\Gamma$, we have that $\angle P B T=\angle P A B$ (because they both intercept the same $\operatorname{arc} \widehat{P B}$ on circle $\Gamma$ ), from which our claim follows.
We then show that $\angle T B Q=\angle B P M$. Indeed, since $\angle T B Q$ and $\angle B P Q$ intercept opposite arcs on circle $\Gamma$, they are supplementary and we have $\angle T B Q=\pi-\angle B P Q=\angle B P M$. We finally conclude that
$$
\angle R B Q=\angle R B T+\angle T B Q=\alpha+\angle B P M=\angle M P C+\angle B P M=\angle B P C
$$
We have thus shown $\triangle B P C=\triangle R B Q$, which completes the proof.
Note. Notice that point $A$ does not play any role in the problem except fixing circle $\Gamma$ (and, for that reason, the result is also valid when $P$ is chosen outside of triangle $\triangle A B C$ ).
Alternative 1 for (b). The law of sines in triangle $\triangle B Q M$ gives
$$
\frac{|B M|}{\sin \angle B Q M}=\frac{|B Q|}{\sin \angle B M Q} .
$$
Since $Q$ belongs to circle $\Gamma$, we have either $\angle B Q P=\angle B A P=\alpha$, hence $\angle B Q M=\angle M P C$, or these angles are supplementary; in both cases they have equal sines. We also have that $\angle B M Q$ and $\angle C M P$ are supplementary, hence have equal sines. Using these facts along with $|B M|=|M C|$ transforms (2) into
$$
\frac{|M C|}{\sin \angle M P C}=\frac{|B Q|}{\sin \angle C M P}
$$
from which the law of sines in triangle $\triangle C P M$ implies that $|B Q|=|P C|$.
Alternative 2 for (b). Let $S$ be the second intersection of line $C P$ with circle $\Gamma$. Then, $\angle B S P=\alpha$, so $B S$ and $M P$ are parallel; since $M$ is the midpoint of segment $B C, P$ is the midpoint of $S C$. If $Q$ is on the same $\operatorname{arc} P B$ as $A$, then the quadrilateral $Q P B S$ is an isosceles trapezoid, and $|Q B|=|S P|=|P C|$. If $Q$ is on the other arc $P B$, then the quadrilateral $P Q B S$ is an isosceles trapezoid, and again $|Q B|=|S P|=|P C|$.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2012-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2012"
}
|
Yesterday, $n \geq 4$ people sat around a round table. Each participant remembers only who his two neighbours were, but not which one sat on his left and which one sat on his right. Today, you would like the same people to sit around the same round table so that each participant has the same two neighbours as yesterday (it is possible that yesterday's lefthand side neighbour is today's right-hand side neighbour). You are allowed to query some of the participants: if anyone is asked, he will answer by pointing at his two neighbours from yesterday.
(a) Determine the minimal number $f(n)$ of participants you have to query in order to be certain to succeed, if later questions must not depend on the outcome of the previous questions. That is, you have to choose in advance the list of people you are going to query, before effectively asking any question.
(b) Determine the minimal number $g(n)$ of participants you have to query in order to be certain to succeed, if later questions may depend on the outcome of previous questions. That is, you can wait until you get the first answer to choose whom to ask the second question, and so on.
#
|
(a) $f(n)=n-3$.
- Asking $n-4$ questions is not enough since the $n-4$ people queried might be sitting in a consecutive string, in which case the $n-4$ answers allow one to sit $n-2$ people in the same positions as yesterday, but there is still an ambiguity among the two remaining ones.
- Let us show that $n-3$ questions suffice. Among the 3 people who are not queried, at least 2 must sit next to people who have been queried. If exactly 2 do, then both these people must be neighbours of the third, so that the neighbours of everybody are known and we are done. If all 3 unqueried people sit next to a queried person, then at least one of them has two queried neighbours, and again it follows that the neighbours of everybody are known, so that we are done.
(b) $g(n)=n-1-\left\lceil\frac{n}{3}\right\rceil\left(=n-1-\left\lfloor\frac{n+2}{3}\right\rfloor=\left\lfloor\frac{2 n}{3}\right\rfloor-1=\left\lceil\frac{2 n-5}{3}\right\rceil\right)$.
Say there is a link between two people if and only if they are neighbours. There are in total $n$ links, which we all need to identify. By asking a person for his neighbours, we can discover at most two new links. More precisely, if at any point we query a participant who has not yet been pointed as a neighbour, we discover exactly two new links (we call this a type-0 query). If we query a participant who has been pointed once as a neighbour, will discover exactly one new link (we call this a type-1 query). Of course, querying a participant who has already been pointed twice provides no information (and we assume in the rest of this solution that it never happens).
First note that, since $f(4)=1$, we also have $g(4)=1$. We now prove the formula for $g(n)$ for $n \geq 5$.
- Let us show that $n-1-\left\lceil\frac{n}{3}\right\rceil$ questions suffice. Our strategy consists in making sure that the first $\left\lceil\frac{n}{3}\right\rceil$ queries are type- 0 . Let us show that this is always possible. A type-0 query requires a participant that hasn't been queried or pointed before. Since the number of those participants decreases by three at most after each query, we see that it is always possible to perform $\left\lceil\frac{n}{3}\right\rceil$ type-0 queries first. During this phase we discover $2\left\lceil\frac{n}{3}\right\rceil$ links.
The remaining queries will be either type-0 or type-1, and each of them discovers at least one new link. We perform them until $n-1$ links have been discovered, after which we are done (the last link can be deduced without query). The number of queries in this second phase is therefore at $\operatorname{most}^{1} n-1-2\left\lceil\frac{n}{3}\right\rceil$, and the total is at $\operatorname{most}\left\lceil\frac{n}{3}\right\rceil+\left(n-1-2\left\lceil\frac{n}{3}\right\rceil\right)=n-1-\left\lceil\frac{n}{3}\right\rceil$.
- We now show that $n-2-\left\lceil\frac{n}{3}\right\rceil=\hat{g}(n)$ questions are not enough.
(i) Consider the pool of unqueried and unpointed participants ; each type-0 must query this pool. Since, from the point of view of the questioner, all elements of the pool are undistinguishable, we can assume that each type-0 query asks the second leftmost participant in the pool (except if there is only one element left in the pool). One can then check that the pool, which starts as a string of $n$ contiguous participants, will stay contiguous after each type-0 and type1 query. Furthermore, using our assumption, we see that each type-0 query removes three participants from the pool. Therefore there can be at most $\left\lceil\frac{n}{3}\right\rceil$ type-0 queries in the scenarios corresponding to our assumption.
(ii) Assume there are $k$ type-0 queries. Since there are $\hat{g}(n)$ queries, the number of discovered links is equal to $2 k+(\hat{g}(n)-k)=\hat{g}(n)+k=n-2+k-\left\lceil\frac{n}{3}\right\rceil$. If $k$ is strictly less than $\left\lceil\frac{n}{3}\right\rceil$, we discover strictly less than $n-2$ links, which is clearly insufficient (indeed, there are at least three missing links, and one can check that whatever the configuration of the missing links, there are always several orders compatible with the discovered links).
(iii) We now analyze the remaining case with $k=\left\lceil\frac{n}{3}\right\rceil$ type-0 queries ${ }^{2}$, in which we discover $n-2$ links. On the one hand, if the missing links are disjoint, there are always two orders compatible with the discovered links (for example when $n=7$ and links are missing between the $(4,5)$ and $(7,1)$ pairs of neighbours, the two orders are $1-2-3-4 \quad 5-6-7$ and $1-2-3-4 \quad 7-6-5)$. On the other hand, a situation where the two missing links would be adjacent would allow the identification of the correct order. However, this never happens in the scenarios corresponding to the assumption we made in (i). Indeed, two adjacent missing links imply that some participant is unqueried and unpointed at the end of the process. Since we perform $k=\left\lceil\frac{n}{3}\right\rceil$ type-0 queries (the maximum), the reasoning from (i) shows that the pool of unqueried and unpointed participants is empty at the end of the process, which contradicts the existence of two adjacent missing links.
[^0]
[^0]: ${ }^{1}$ Here we use the assumption $n \geq 5$, since quantity $n-1-2\left\lceil\frac{n}{3}\right\rceil$ is negative when $n=4$.
${ }^{2}$ Note that this cannot happen when $n \in\{4,5,7\}$ since we have $\left\lceil\frac{n}{3}\right\rceil>\hat{g}(n)$ in those cases.
|
g(n)=n-1-\left\lceil\frac{n}{3}\right\rceil
|
Yes
|
Incomplete
|
math-word-problem
|
Combinatorics
|
Yesterday, $n \geq 4$ people sat around a round table. Each participant remembers only who his two neighbours were, but not which one sat on his left and which one sat on his right. Today, you would like the same people to sit around the same round table so that each participant has the same two neighbours as yesterday (it is possible that yesterday's lefthand side neighbour is today's right-hand side neighbour). You are allowed to query some of the participants: if anyone is asked, he will answer by pointing at his two neighbours from yesterday.
(a) Determine the minimal number $f(n)$ of participants you have to query in order to be certain to succeed, if later questions must not depend on the outcome of the previous questions. That is, you have to choose in advance the list of people you are going to query, before effectively asking any question.
(b) Determine the minimal number $g(n)$ of participants you have to query in order to be certain to succeed, if later questions may depend on the outcome of previous questions. That is, you can wait until you get the first answer to choose whom to ask the second question, and so on.
#
|
(a) $f(n)=n-3$.
- Asking $n-4$ questions is not enough since the $n-4$ people queried might be sitting in a consecutive string, in which case the $n-4$ answers allow one to sit $n-2$ people in the same positions as yesterday, but there is still an ambiguity among the two remaining ones.
- Let us show that $n-3$ questions suffice. Among the 3 people who are not queried, at least 2 must sit next to people who have been queried. If exactly 2 do, then both these people must be neighbours of the third, so that the neighbours of everybody are known and we are done. If all 3 unqueried people sit next to a queried person, then at least one of them has two queried neighbours, and again it follows that the neighbours of everybody are known, so that we are done.
(b) $g(n)=n-1-\left\lceil\frac{n}{3}\right\rceil\left(=n-1-\left\lfloor\frac{n+2}{3}\right\rfloor=\left\lfloor\frac{2 n}{3}\right\rfloor-1=\left\lceil\frac{2 n-5}{3}\right\rceil\right)$.
Say there is a link between two people if and only if they are neighbours. There are in total $n$ links, which we all need to identify. By asking a person for his neighbours, we can discover at most two new links. More precisely, if at any point we query a participant who has not yet been pointed as a neighbour, we discover exactly two new links (we call this a type-0 query). If we query a participant who has been pointed once as a neighbour, will discover exactly one new link (we call this a type-1 query). Of course, querying a participant who has already been pointed twice provides no information (and we assume in the rest of this solution that it never happens).
First note that, since $f(4)=1$, we also have $g(4)=1$. We now prove the formula for $g(n)$ for $n \geq 5$.
- Let us show that $n-1-\left\lceil\frac{n}{3}\right\rceil$ questions suffice. Our strategy consists in making sure that the first $\left\lceil\frac{n}{3}\right\rceil$ queries are type- 0 . Let us show that this is always possible. A type-0 query requires a participant that hasn't been queried or pointed before. Since the number of those participants decreases by three at most after each query, we see that it is always possible to perform $\left\lceil\frac{n}{3}\right\rceil$ type-0 queries first. During this phase we discover $2\left\lceil\frac{n}{3}\right\rceil$ links.
The remaining queries will be either type-0 or type-1, and each of them discovers at least one new link. We perform them until $n-1$ links have been discovered, after which we are done (the last link can be deduced without query). The number of queries in this second phase is therefore at $\operatorname{most}^{1} n-1-2\left\lceil\frac{n}{3}\right\rceil$, and the total is at $\operatorname{most}\left\lceil\frac{n}{3}\right\rceil+\left(n-1-2\left\lceil\frac{n}{3}\right\rceil\right)=n-1-\left\lceil\frac{n}{3}\right\rceil$.
- We now show that $n-2-\left\lceil\frac{n}{3}\right\rceil=\hat{g}(n)$ questions are not enough.
(i) Consider the pool of unqueried and unpointed participants ; each type-0 must query this pool. Since, from the point of view of the questioner, all elements of the pool are undistinguishable, we can assume that each type-0 query asks the second leftmost participant in the pool (except if there is only one element left in the pool). One can then check that the pool, which starts as a string of $n$ contiguous participants, will stay contiguous after each type-0 and type1 query. Furthermore, using our assumption, we see that each type-0 query removes three participants from the pool. Therefore there can be at most $\left\lceil\frac{n}{3}\right\rceil$ type-0 queries in the scenarios corresponding to our assumption.
(ii) Assume there are $k$ type-0 queries. Since there are $\hat{g}(n)$ queries, the number of discovered links is equal to $2 k+(\hat{g}(n)-k)=\hat{g}(n)+k=n-2+k-\left\lceil\frac{n}{3}\right\rceil$. If $k$ is strictly less than $\left\lceil\frac{n}{3}\right\rceil$, we discover strictly less than $n-2$ links, which is clearly insufficient (indeed, there are at least three missing links, and one can check that whatever the configuration of the missing links, there are always several orders compatible with the discovered links).
(iii) We now analyze the remaining case with $k=\left\lceil\frac{n}{3}\right\rceil$ type-0 queries ${ }^{2}$, in which we discover $n-2$ links. On the one hand, if the missing links are disjoint, there are always two orders compatible with the discovered links (for example when $n=7$ and links are missing between the $(4,5)$ and $(7,1)$ pairs of neighbours, the two orders are $1-2-3-4 \quad 5-6-7$ and $1-2-3-4 \quad 7-6-5)$. On the other hand, a situation where the two missing links would be adjacent would allow the identification of the correct order. However, this never happens in the scenarios corresponding to the assumption we made in (i). Indeed, two adjacent missing links imply that some participant is unqueried and unpointed at the end of the process. Since we perform $k=\left\lceil\frac{n}{3}\right\rceil$ type-0 queries (the maximum), the reasoning from (i) shows that the pool of unqueried and unpointed participants is empty at the end of the process, which contradicts the existence of two adjacent missing links.
[^0]
[^0]: ${ }^{1}$ Here we use the assumption $n \geq 5$, since quantity $n-1-2\left\lceil\frac{n}{3}\right\rceil$ is negative when $n=4$.
${ }^{2}$ Note that this cannot happen when $n \in\{4,5,7\}$ since we have $\left\lceil\frac{n}{3}\right\rceil>\hat{g}(n)$ in those cases.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "\nProblem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2012-zz.jsonl",
"solution_match": "# Solution.",
"tier": "T3",
"year": "2012"
}
|
Let $n \geqslant 3$ be an integer. A frog is to jump along the real axis, starting at the point 0 and making $n$ jumps: one of length 1 , one of length $2, \ldots$, one of length $n$. It may perform these $n$ jumps in any order. If at some point the frog is sitting on a number $a \leqslant 0$, its next jump must be to the right (towards the positive numbers). If at some point the frog is sitting on a number $a>0$, its next jump must be to the left (towards the negative numbers). Find the largest positive integer $k$ for which the frog can perform its jumps in such an order that it never lands on any of the numbers $1,2, \ldots, k$.
|
We claim that the largest positive integer $k$ with the given property is $\left\lfloor\frac{n-1}{2}\right\rfloor$, where $\lfloor x\rfloor$ is by definition the largest integer not exceeding $x$.
Consider a sequence of $n$ jumps of length $1,2, \ldots n$ such that the frog never lands on any of the numbers $1,2, \ldots, k$, where $k \geqslant 1$. Note that we must have $k<n$ in order for the frog to be able to make its first jump. As the frog jumps to the right only if it is in a number $a \leqslant 0$, and the largest jump has length $n$, it is impossible to reach numbers greater than $n$. On the other hand, suppose the frog is in a number $a>0$, then it must even be in a number $a \geqslant k+1$, since it is not allowed to hit the numbers $1,2, \ldots, k$. So the frog jumps to the left only if it is in a number $a \geqslant k+1$, and therefore it is impossible to reach numbers less than $(k+1)-n=k-n+1$. This means the frog only possibly lands on the numbers $i$ satisfying
$$
k-n+1 \leqslant i \leqslant 0 \quad \text { or } \quad k+1 \leqslant i \leqslant n \text {. }
$$
When performing a jump of length $k$, the frog has to remain at either side of the numbers $1,2, \ldots, k$. Indeed, jumping over $1,2, \ldots, k$ requires a jump of at least length $k+1$. In case it starts at a number $a>0$ (in fact $k+1 \leqslant a \leqslant n$ ), it lands in $a-k$ and we must also have $a-k \geqslant k+1$. So $2 k+1 \leqslant a \leqslant n$, therefore $2 k+1 \leqslant n$. In case it starts at a number $a \leqslant 0$ (in fact $k-n+1 \leqslant a \leqslant 0$ ), it lands in $a+k$ and we must also have $a+k \leqslant 0$. Adding $k$ to both sides of $k-n+1 \leqslant a$, we obtain $2 k-n+1 \leqslant a+k \leqslant 0$, so in this case we have $2 k+1 \leqslant n$ as well. We conclude that $k \leqslant \frac{n-1}{2}$. Since $k$ is integer, we even have $k \leqslant\left\lfloor\frac{n-1}{2}\right\rfloor$.
Next we prove that this upperbound is sharp: for $k=\left\lfloor\frac{n-1}{2}\right\rfloor$ the frog really can perform its jumps in such an order that it never lands on any of the numbers $1,2, \ldots, k$.
Suppose $n$ is odd, then $\frac{n-1}{2}$ is an integer and we have $k=\frac{n-1}{2}$, so $n=2 k+1$. We claim that when the frog performs the jumps of length $1, \ldots, 2 k+1$ in the following order, it does never land on $1,2, \ldots, k$ : it starts with a jump of length $k+1$, then it performs two jumps, one of length $k+2$ followed by one of length 1 , next two jumps of length $k+3$ and $2, \ldots$, next two jumps of length $k+(i+1)$ and $i, \ldots$, and finally two jumps of length $k+(k+1)$ and $k$. In this order of the jumps every length between 1 and $n=2 k+1$ does occur: it performs a pair of jumps for $1 \leqslant i \leqslant k$, which are the jumps of length $1,2, \ldots$, $k$ and the jumps of length $k+2, k+3, \ldots, 2 k+1$, and it starts with the jump of length $k+1$.
We now prove the correctness of this jumping scheme. After the first jump the frog lands in $k+1>k$. Now suppose the frog is in 0 or $k+1$ and is about to perform the pair of jumps of length $k+(i+1)$ and $i$. Starting from 0 , it lands in $k+(i+1)>k$, after which it lands in $(k+i+1)-i=k+1>k$. If on the contrary it starts in $k+1$, it lands in $(k+1)-(k+(i+1))=-i<1$, after which it lands in $(-i)+i=0$. We see that, starting in 0 , the frog lands in $k+1$ after the pair of jumps, while starting in $k+1$ the frog lands in 0 , while in both cases the jumps do not touch $1,2, \ldots k$. This proves the correctness of its series of jumps. As the frog (after its first jump) alters between $k+1$ and 0 exactly $k$ times, for odd $k$ it will end up in 0 , while for even $k$ it will end up in $k+1$.
Suppose $n$ is even, then $\frac{n-1}{2}$ is not an integer and we have $k=\frac{n-1}{2}-\frac{1}{2}=\frac{n-2}{2}$, so $n=2 k+2$. Let the frog firstly perform the same series of jumps as in the previous case; they still do not touch $1,2, \ldots, k$. Now let the frog make a final extra jump of length $2 k+2$. It will land in $0+(2 k+2)=2 k+2>k$ if $k$ is odd, or in $(k+1)-(2 k+2)=-k-1<1$ if $k$ is even, and its series of jumps is correct again.
We conclude that the largest positive integer $k$ with the given property is $\left\lfloor\frac{n-1}{2}\right\rfloor$.
|
\left\lfloor\frac{n-1}{2}\right\rfloor
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Let $n \geqslant 3$ be an integer. A frog is to jump along the real axis, starting at the point 0 and making $n$ jumps: one of length 1 , one of length $2, \ldots$, one of length $n$. It may perform these $n$ jumps in any order. If at some point the frog is sitting on a number $a \leqslant 0$, its next jump must be to the right (towards the positive numbers). If at some point the frog is sitting on a number $a>0$, its next jump must be to the left (towards the negative numbers). Find the largest positive integer $k$ for which the frog can perform its jumps in such an order that it never lands on any of the numbers $1,2, \ldots, k$.
|
We claim that the largest positive integer $k$ with the given property is $\left\lfloor\frac{n-1}{2}\right\rfloor$, where $\lfloor x\rfloor$ is by definition the largest integer not exceeding $x$.
Consider a sequence of $n$ jumps of length $1,2, \ldots n$ such that the frog never lands on any of the numbers $1,2, \ldots, k$, where $k \geqslant 1$. Note that we must have $k<n$ in order for the frog to be able to make its first jump. As the frog jumps to the right only if it is in a number $a \leqslant 0$, and the largest jump has length $n$, it is impossible to reach numbers greater than $n$. On the other hand, suppose the frog is in a number $a>0$, then it must even be in a number $a \geqslant k+1$, since it is not allowed to hit the numbers $1,2, \ldots, k$. So the frog jumps to the left only if it is in a number $a \geqslant k+1$, and therefore it is impossible to reach numbers less than $(k+1)-n=k-n+1$. This means the frog only possibly lands on the numbers $i$ satisfying
$$
k-n+1 \leqslant i \leqslant 0 \quad \text { or } \quad k+1 \leqslant i \leqslant n \text {. }
$$
When performing a jump of length $k$, the frog has to remain at either side of the numbers $1,2, \ldots, k$. Indeed, jumping over $1,2, \ldots, k$ requires a jump of at least length $k+1$. In case it starts at a number $a>0$ (in fact $k+1 \leqslant a \leqslant n$ ), it lands in $a-k$ and we must also have $a-k \geqslant k+1$. So $2 k+1 \leqslant a \leqslant n$, therefore $2 k+1 \leqslant n$. In case it starts at a number $a \leqslant 0$ (in fact $k-n+1 \leqslant a \leqslant 0$ ), it lands in $a+k$ and we must also have $a+k \leqslant 0$. Adding $k$ to both sides of $k-n+1 \leqslant a$, we obtain $2 k-n+1 \leqslant a+k \leqslant 0$, so in this case we have $2 k+1 \leqslant n$ as well. We conclude that $k \leqslant \frac{n-1}{2}$. Since $k$ is integer, we even have $k \leqslant\left\lfloor\frac{n-1}{2}\right\rfloor$.
Next we prove that this upperbound is sharp: for $k=\left\lfloor\frac{n-1}{2}\right\rfloor$ the frog really can perform its jumps in such an order that it never lands on any of the numbers $1,2, \ldots, k$.
Suppose $n$ is odd, then $\frac{n-1}{2}$ is an integer and we have $k=\frac{n-1}{2}$, so $n=2 k+1$. We claim that when the frog performs the jumps of length $1, \ldots, 2 k+1$ in the following order, it does never land on $1,2, \ldots, k$ : it starts with a jump of length $k+1$, then it performs two jumps, one of length $k+2$ followed by one of length 1 , next two jumps of length $k+3$ and $2, \ldots$, next two jumps of length $k+(i+1)$ and $i, \ldots$, and finally two jumps of length $k+(k+1)$ and $k$. In this order of the jumps every length between 1 and $n=2 k+1$ does occur: it performs a pair of jumps for $1 \leqslant i \leqslant k$, which are the jumps of length $1,2, \ldots$, $k$ and the jumps of length $k+2, k+3, \ldots, 2 k+1$, and it starts with the jump of length $k+1$.
We now prove the correctness of this jumping scheme. After the first jump the frog lands in $k+1>k$. Now suppose the frog is in 0 or $k+1$ and is about to perform the pair of jumps of length $k+(i+1)$ and $i$. Starting from 0 , it lands in $k+(i+1)>k$, after which it lands in $(k+i+1)-i=k+1>k$. If on the contrary it starts in $k+1$, it lands in $(k+1)-(k+(i+1))=-i<1$, after which it lands in $(-i)+i=0$. We see that, starting in 0 , the frog lands in $k+1$ after the pair of jumps, while starting in $k+1$ the frog lands in 0 , while in both cases the jumps do not touch $1,2, \ldots k$. This proves the correctness of its series of jumps. As the frog (after its first jump) alters between $k+1$ and 0 exactly $k$ times, for odd $k$ it will end up in 0 , while for even $k$ it will end up in $k+1$.
Suppose $n$ is even, then $\frac{n-1}{2}$ is not an integer and we have $k=\frac{n-1}{2}-\frac{1}{2}=\frac{n-2}{2}$, so $n=2 k+2$. Let the frog firstly perform the same series of jumps as in the previous case; they still do not touch $1,2, \ldots, k$. Now let the frog make a final extra jump of length $2 k+2$. It will land in $0+(2 k+2)=2 k+2>k$ if $k$ is odd, or in $(k+1)-(2 k+2)=-k-1<1$ if $k$ is even, and its series of jumps is correct again.
We conclude that the largest positive integer $k$ with the given property is $\left\lfloor\frac{n-1}{2}\right\rfloor$.
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "\nProblem 1.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2013-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2013"
}
|
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that
$$
f(x+y)+y \leqslant f(f(f(x)))
$$
holds for all $x, y \in \mathbb{R}$.
|
Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a function satisfying the given inequality (2). Writing $z$ for $x+y$, we find that $f(z)+(z-x) \leqslant f(f(f(x)))$, or equivalently
$$
f(z)+z \leqslant f(f(f(x)))+x
$$
for all $x, z \in \mathbb{R}$. Substituting $z=f(f(x))$ yields $f(f(f(x)))+f(f(x)) \leqslant f(f(f(x)))+x$, from which we see that
$$
f(f(x)) \leqslant x
$$
for all $x \in \mathbb{R}$. Substituting $f(x)$ for $x$ we get $f(f(f(x))) \leqslant f(x)$, which combined with (3) gives $f(z)+z \leqslant f(f(f(x)))+x \leqslant f(x)+x$. So
$$
f(z)+z \leqslant f(x)+x
$$
for all $x, z \in \mathbb{R}$. By symmetry we see that we also have $f(x)+x \leqslant f(z)+z$, from which we conclude that in fact we even have
$$
f(z)+z=f(x)+x
$$
for all $x, z \in \mathbb{R}$. So $f(z)+z=f(0)+0$ for all $z \in \mathbb{R}$, and we conclude that $f(z)=c-z$ for some $c \in \mathbb{R}$.
Now we check whether all functions of this form satisfy the given inequality. Let $c \in \mathbb{R}$ be given and consider the function $f: \mathbb{R} \rightarrow \mathbb{R}$ defined by $f(z)=c-z$ for all $z \in \mathbb{R}$. Note that $f(f(z))=c-(c-z)=z$ for all $z \in \mathbb{R}$. For the lefthand side of (2) we find
$$
f(x+y)+y=(c-(x+y))+y=c-x,
$$
while the righthand side reads
$$
f(f(f(x)))=f(x)=c-x .
$$
We see that inequality (2) holds; in fact we even have equality here.
We conclude that the solutions to (2) are given by the functions $f: \mathbb{R} \rightarrow \mathbb{R}$ defined by $f(z)=c-z$ for all $z \in \mathbb{R}$, where $c$ is an arbitrary real constant.
|
f(z)=c-z
|
Yes
|
Yes
|
proof
|
Algebra
|
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that
$$
f(x+y)+y \leqslant f(f(f(x)))
$$
holds for all $x, y \in \mathbb{R}$.
|
Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a function satisfying the given inequality (2). Writing $z$ for $x+y$, we find that $f(z)+(z-x) \leqslant f(f(f(x)))$, or equivalently
$$
f(z)+z \leqslant f(f(f(x)))+x
$$
for all $x, z \in \mathbb{R}$. Substituting $z=f(f(x))$ yields $f(f(f(x)))+f(f(x)) \leqslant f(f(f(x)))+x$, from which we see that
$$
f(f(x)) \leqslant x
$$
for all $x \in \mathbb{R}$. Substituting $f(x)$ for $x$ we get $f(f(f(x))) \leqslant f(x)$, which combined with (3) gives $f(z)+z \leqslant f(f(f(x)))+x \leqslant f(x)+x$. So
$$
f(z)+z \leqslant f(x)+x
$$
for all $x, z \in \mathbb{R}$. By symmetry we see that we also have $f(x)+x \leqslant f(z)+z$, from which we conclude that in fact we even have
$$
f(z)+z=f(x)+x
$$
for all $x, z \in \mathbb{R}$. So $f(z)+z=f(0)+0$ for all $z \in \mathbb{R}$, and we conclude that $f(z)=c-z$ for some $c \in \mathbb{R}$.
Now we check whether all functions of this form satisfy the given inequality. Let $c \in \mathbb{R}$ be given and consider the function $f: \mathbb{R} \rightarrow \mathbb{R}$ defined by $f(z)=c-z$ for all $z \in \mathbb{R}$. Note that $f(f(z))=c-(c-z)=z$ for all $z \in \mathbb{R}$. For the lefthand side of (2) we find
$$
f(x+y)+y=(c-(x+y))+y=c-x,
$$
while the righthand side reads
$$
f(f(f(x)))=f(x)=c-x .
$$
We see that inequality (2) holds; in fact we even have equality here.
We conclude that the solutions to (2) are given by the functions $f: \mathbb{R} \rightarrow \mathbb{R}$ defined by $f(z)=c-z$ for all $z \in \mathbb{R}$, where $c$ is an arbitrary real constant.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "\nProblem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2013-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2013"
}
|
Let $\triangle A B C$ be a triangle with circumcircle $\Gamma$, and let $I$ be the center of the incircle of $\triangle A B C$. The lines $A I, B I$ and $C I$ intersect $\Gamma$ in $D \neq A, E \neq B$ and $F \neq C$. The tangent lines to $\Gamma$ in $F, D$ and $E$ intersect the lines $A I, B I$ and $C I$ in $R, S$ and $T$, respectively. Prove that
$$
|A R| \cdot|B S| \cdot|C T|=|I D| \cdot|I E| \cdot|I F|
$$
|
We first prove that $|D B|=|D I|$. (This may also be claimed by referring to the lemma that $D$ is the centre of the circumcircle of $B I C I_{a}$.) By the constant angle theorem and the fact that $A D$ and $B E$ are angle bisectors of triangle $A B C$, we see that
$$
\angle D B I=\angle D B C+\angle C B I=\angle D A C+\angle C B E=\angle D A B+\angle A B E,
$$
while
$$
\angle D I B=180^{\circ}-\angle A I B=\angle I A B+\angle A B I=\angle D A B+\angle A B E .
$$
So $\triangle B D I$ has equal angles $\angle D B I=\angle D I B$, so $|D B|=|D I|$. This proves our claim. We similarly deduce that $|E C|=|E I|$ and $|F A|=|F I|$.
Rewriting (7) into $\frac{|A R|}{|I F|} \cdot \frac{|B S|}{|I D|} \cdot \frac{|C T|}{|I E|}=1$, we see that it suffices to prove that
$$
\frac{|A R|}{|A F|} \cdot \frac{|B S|}{|B D|} \cdot \frac{|C T|}{|C E|}=1
$$
We now prove by angle chasing that $\triangle R F A \sim \triangle A C I$. As $R F$ is tangent to the circumcircle of $\triangle A F C$, we obtain (using also that $C F$ is angle bisector of $\angle A C B$ )
$$
\angle R F A=\angle F C A=\angle I C A .
$$
Moreover, from $|F A|=|F I|$ we deduce that $\angle F A I=\angle F I A$, so
$$
\angle F A R=180^{\circ}-\angle F A I=180^{\circ}-\angle F I A=\angle C I A
$$
This proves our similarity, which entails that $\frac{|A R|}{|A F|}=\frac{|I A|}{|I C|}$. In the same way we deduce that $\frac{|B S|}{|B D|}=\frac{|I B|}{|I A|}$ and $\frac{|C T|}{|C E|}=\frac{|I C|}{|I B|}$. By these equal ratios we know that
$$
\frac{|A R|}{|A F|} \cdot \frac{|B S|}{|B D|} \cdot \frac{|C T|}{|C E|}=\frac{|I A|}{|I C|} \cdot \frac{|I B|}{|I A|} \cdot \frac{|I C|}{|I B|}=1
$$
which proves (8), as required.
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $\triangle A B C$ be a triangle with circumcircle $\Gamma$, and let $I$ be the center of the incircle of $\triangle A B C$. The lines $A I, B I$ and $C I$ intersect $\Gamma$ in $D \neq A, E \neq B$ and $F \neq C$. The tangent lines to $\Gamma$ in $F, D$ and $E$ intersect the lines $A I, B I$ and $C I$ in $R, S$ and $T$, respectively. Prove that
$$
|A R| \cdot|B S| \cdot|C T|=|I D| \cdot|I E| \cdot|I F|
$$
|
We first prove that $|D B|=|D I|$. (This may also be claimed by referring to the lemma that $D$ is the centre of the circumcircle of $B I C I_{a}$.) By the constant angle theorem and the fact that $A D$ and $B E$ are angle bisectors of triangle $A B C$, we see that
$$
\angle D B I=\angle D B C+\angle C B I=\angle D A C+\angle C B E=\angle D A B+\angle A B E,
$$
while
$$
\angle D I B=180^{\circ}-\angle A I B=\angle I A B+\angle A B I=\angle D A B+\angle A B E .
$$
So $\triangle B D I$ has equal angles $\angle D B I=\angle D I B$, so $|D B|=|D I|$. This proves our claim. We similarly deduce that $|E C|=|E I|$ and $|F A|=|F I|$.
Rewriting (7) into $\frac{|A R|}{|I F|} \cdot \frac{|B S|}{|I D|} \cdot \frac{|C T|}{|I E|}=1$, we see that it suffices to prove that
$$
\frac{|A R|}{|A F|} \cdot \frac{|B S|}{|B D|} \cdot \frac{|C T|}{|C E|}=1
$$
We now prove by angle chasing that $\triangle R F A \sim \triangle A C I$. As $R F$ is tangent to the circumcircle of $\triangle A F C$, we obtain (using also that $C F$ is angle bisector of $\angle A C B$ )
$$
\angle R F A=\angle F C A=\angle I C A .
$$
Moreover, from $|F A|=|F I|$ we deduce that $\angle F A I=\angle F I A$, so
$$
\angle F A R=180^{\circ}-\angle F A I=180^{\circ}-\angle F I A=\angle C I A
$$
This proves our similarity, which entails that $\frac{|A R|}{|A F|}=\frac{|I A|}{|I C|}$. In the same way we deduce that $\frac{|B S|}{|B D|}=\frac{|I B|}{|I A|}$ and $\frac{|C T|}{|C E|}=\frac{|I C|}{|I B|}$. By these equal ratios we know that
$$
\frac{|A R|}{|A F|} \cdot \frac{|B S|}{|B D|} \cdot \frac{|C T|}{|C E|}=\frac{|I A|}{|I C|} \cdot \frac{|I B|}{|I A|} \cdot \frac{|I C|}{|I B|}=1
$$
which proves (8), as required.
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2013-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2013"
}
|
a) Find all positive integers $g$ with the following property: for each odd prime number $p$ there exists a positive integer $n$ such that $p$ divides the two integers
$$
g^{n}-n \quad \text { and } \quad g^{n+1}-(n+1)
$$
b) Find all positive integers $g$ with the following property: for each odd prime number $p$ there exists a positive integer $n$ such that $p$ divides the two integers
$$
g^{n}-n^{2} \quad \text { and } \quad g^{n+1}-(n+1)^{2}
$$
#
|
a) Let $g$ be a positive integer with the given property. So for each odd prime number $p$ there exists a positive integer $n$ such that $p \mid g^{n}-n$ and $p \mid g^{n+1}-(n+1)$.
If $g$ has an odd prime factor $p$, then from $p \mid g^{n}-n$ it follows that $p \mid n$, while from $p \mid g^{n+1}-(n+1)$ we deduce that $p \mid n+1$. But $p$ cannot divide both $n$ and $n+1$; contradiction. So $g$ is a power of $2: g=2^{k}$ for some $k \geqslant 0$.
If $g=2^{0}=1$, then $p \mid 1-n$ and $p \mid 1-(n+1)$, which is again a contradiction.
Suppose $k \geqslant 2$. Then $g-1$ has an odd prime factor $p$, therefore $g \equiv 1(\bmod p)$ so $0 \equiv g^{n}-n \equiv 1-n(\bmod p)$ and $0 \equiv g^{n+1}-(n+1) \equiv 1-(n+1)(\bmod p)$, which is again a contradiction.
Now we prove that $g=2^{1}=2$ does satisfy the condition. Let a prime $p>2$ be given. Choose $n=(p-1)^{2}$, then we have $n \equiv(-1)^{2}=1(\bmod p)$. By Fermat's little theorem (using $\operatorname{gcd}(2, p)=1)$ we know that $2^{p-1} \equiv 1(\bmod p)$, so
$$
2^{n}=2^{(p-1)^{2}}=\left(2^{p-1}\right)^{p-1} \equiv 1 \equiv n \quad(\bmod p)
$$
Multiplying both sides by 2 , we see that also
$$
2^{n+1} \equiv 2 n=n+n \equiv n+1 \quad(\bmod p)
$$
We conclude that only $g=2$ has the given property.
b) Let $g$ be a positive integer with the given property. So for each odd prime number $p$ there exists a positive integer $n$ such that $p \mid g^{n}-n^{2}$ and $p \mid g^{n+1}-(n+1)^{2}$.
If $g$ has an odd prime factor $p$, then from $p \mid g^{n}-n^{2}$ it follows that $p \mid n^{2}$, so also $p \mid n$, while from $p \mid g^{n+1}-(n+1)^{2}$ we deduce that $p \mid(n+1)^{2}$, so also $p \mid n+1$.
But $p$ cannot divide both $n$ and $n+1$; contradiction. So $g$ is a power of $2: g=2^{k}$ for some $k \geqslant 0$.
If $g=2^{0}=1$, then for any odd prime $p$ we have $p \mid 1-n^{2}=(1-n)(1+n)$ and $p \mid 1-(n+1)^{2}=(1-(n+1))(1+(n+1))$. Now take $p=5$. The first statement says that $n \equiv 1$ or $n \equiv-1 \equiv 4(\bmod 5)$, and the second that $n \equiv 0$ or $n \equiv-2 \equiv 3$ $(\bmod 5)$. But this yields a contradiction.
If $g=2^{1}=2$, then for any odd prime $p$ we have $p \mid 2^{n}-n^{2}$ and $p \mid 2^{n+1}-(n+1)^{2}$. Now take $p=3$. As $3 \nmid 2^{n}$ and $3 \nmid 2^{n+1}$, we know that $3 \nmid n^{2}$ and $3 \nmid(n+1)^{2}$. So these two squares must be 1 modulo 3 (as 2 can never be a square modulo 3 ). Therefore also $2^{n}$ and $2^{n+1}$ must be 1 modulo 3 , which gives $2 \cdot 1 \equiv 2 \cdot 2^{n}=2^{n+1} \equiv 1(\bmod 3)$; contradiction.
Now suppose $k \geqslant 2$. Then $g-1$ has an odd prime factor $p$, therefore $g \equiv 1(\bmod p)$ so $0 \equiv g^{n}-n^{2} \equiv 1-n^{2}=(1-n)(1+n)(\bmod p)$ and $0 \equiv g^{n+1}-(n+1)^{2} \equiv$ $1-(n+1)^{2}=(1-(n+1))(1+(n+1))(\bmod p)$. Suppose $p \geqslant 5$. The first statement says that $n \equiv 1$ or $n \equiv-1(\bmod p)$, and the second that $n \equiv 0$ or $n \equiv-2(\bmod p)$. But $n$ can only be congruent to at most one of the numbers $-2,-1,0$ and 1 , since $p \geqslant 5$; contradiction. We conclude that $p=3$, so $g-1$ contains only prime factors 3 . Hence $2^{k}-1=3^{\ell}$ for some $\ell>0$. We see that $2^{k}-1 \equiv(-1)^{k}-1(\bmod 3)$, while $3^{\ell} \equiv 0(\bmod 3)$. So $k$ has to be even, say $k=2 m$, and our equation becomes $2^{2 m}-1=3^{\ell}$, or equivalently $\left(2^{m}-1\right)\left(2^{m}+1\right)=3^{\ell}$. Not both factors on the left-hand side can be divisible by 3 , so $2^{m}-1=1$ and $2^{m}+1=3^{\ell}$, so $m=1$. Hence $g=2^{2}=4$.
Now we show that $g=4$ does have the given property. For this we use that $g=2$ is a solution to part (a): for any odd prime $p$ there exists a positive integer $n$ such that
$$
n \equiv 2^{n} \quad(\bmod p) \quad \text { and } \quad n+1 \equiv 2^{n+1} \quad(\bmod p) .
$$
Taking the square of both congruences, we obtain
$$
n^{2} \equiv\left(2^{n}\right)^{2}=\left(2^{2}\right)^{n}=4^{n} \quad(\bmod p)
$$
and
$$
(n+1)^{2} \equiv\left(2^{n+1}\right)^{2}=\left(2^{2}\right)^{n+1}=4^{n+1} \quad(\bmod p)
$$
as desired.
We conclude that only $g=4$ has the given property.
|
g=2
|
Yes
|
Incomplete
|
math-word-problem
|
Number Theory
|
a) Find all positive integers $g$ with the following property: for each odd prime number $p$ there exists a positive integer $n$ such that $p$ divides the two integers
$$
g^{n}-n \quad \text { and } \quad g^{n+1}-(n+1)
$$
b) Find all positive integers $g$ with the following property: for each odd prime number $p$ there exists a positive integer $n$ such that $p$ divides the two integers
$$
g^{n}-n^{2} \quad \text { and } \quad g^{n+1}-(n+1)^{2}
$$
#
|
a) Let $g$ be a positive integer with the given property. So for each odd prime number $p$ there exists a positive integer $n$ such that $p \mid g^{n}-n$ and $p \mid g^{n+1}-(n+1)$.
If $g$ has an odd prime factor $p$, then from $p \mid g^{n}-n$ it follows that $p \mid n$, while from $p \mid g^{n+1}-(n+1)$ we deduce that $p \mid n+1$. But $p$ cannot divide both $n$ and $n+1$; contradiction. So $g$ is a power of $2: g=2^{k}$ for some $k \geqslant 0$.
If $g=2^{0}=1$, then $p \mid 1-n$ and $p \mid 1-(n+1)$, which is again a contradiction.
Suppose $k \geqslant 2$. Then $g-1$ has an odd prime factor $p$, therefore $g \equiv 1(\bmod p)$ so $0 \equiv g^{n}-n \equiv 1-n(\bmod p)$ and $0 \equiv g^{n+1}-(n+1) \equiv 1-(n+1)(\bmod p)$, which is again a contradiction.
Now we prove that $g=2^{1}=2$ does satisfy the condition. Let a prime $p>2$ be given. Choose $n=(p-1)^{2}$, then we have $n \equiv(-1)^{2}=1(\bmod p)$. By Fermat's little theorem (using $\operatorname{gcd}(2, p)=1)$ we know that $2^{p-1} \equiv 1(\bmod p)$, so
$$
2^{n}=2^{(p-1)^{2}}=\left(2^{p-1}\right)^{p-1} \equiv 1 \equiv n \quad(\bmod p)
$$
Multiplying both sides by 2 , we see that also
$$
2^{n+1} \equiv 2 n=n+n \equiv n+1 \quad(\bmod p)
$$
We conclude that only $g=2$ has the given property.
b) Let $g$ be a positive integer with the given property. So for each odd prime number $p$ there exists a positive integer $n$ such that $p \mid g^{n}-n^{2}$ and $p \mid g^{n+1}-(n+1)^{2}$.
If $g$ has an odd prime factor $p$, then from $p \mid g^{n}-n^{2}$ it follows that $p \mid n^{2}$, so also $p \mid n$, while from $p \mid g^{n+1}-(n+1)^{2}$ we deduce that $p \mid(n+1)^{2}$, so also $p \mid n+1$.
But $p$ cannot divide both $n$ and $n+1$; contradiction. So $g$ is a power of $2: g=2^{k}$ for some $k \geqslant 0$.
If $g=2^{0}=1$, then for any odd prime $p$ we have $p \mid 1-n^{2}=(1-n)(1+n)$ and $p \mid 1-(n+1)^{2}=(1-(n+1))(1+(n+1))$. Now take $p=5$. The first statement says that $n \equiv 1$ or $n \equiv-1 \equiv 4(\bmod 5)$, and the second that $n \equiv 0$ or $n \equiv-2 \equiv 3$ $(\bmod 5)$. But this yields a contradiction.
If $g=2^{1}=2$, then for any odd prime $p$ we have $p \mid 2^{n}-n^{2}$ and $p \mid 2^{n+1}-(n+1)^{2}$. Now take $p=3$. As $3 \nmid 2^{n}$ and $3 \nmid 2^{n+1}$, we know that $3 \nmid n^{2}$ and $3 \nmid(n+1)^{2}$. So these two squares must be 1 modulo 3 (as 2 can never be a square modulo 3 ). Therefore also $2^{n}$ and $2^{n+1}$ must be 1 modulo 3 , which gives $2 \cdot 1 \equiv 2 \cdot 2^{n}=2^{n+1} \equiv 1(\bmod 3)$; contradiction.
Now suppose $k \geqslant 2$. Then $g-1$ has an odd prime factor $p$, therefore $g \equiv 1(\bmod p)$ so $0 \equiv g^{n}-n^{2} \equiv 1-n^{2}=(1-n)(1+n)(\bmod p)$ and $0 \equiv g^{n+1}-(n+1)^{2} \equiv$ $1-(n+1)^{2}=(1-(n+1))(1+(n+1))(\bmod p)$. Suppose $p \geqslant 5$. The first statement says that $n \equiv 1$ or $n \equiv-1(\bmod p)$, and the second that $n \equiv 0$ or $n \equiv-2(\bmod p)$. But $n$ can only be congruent to at most one of the numbers $-2,-1,0$ and 1 , since $p \geqslant 5$; contradiction. We conclude that $p=3$, so $g-1$ contains only prime factors 3 . Hence $2^{k}-1=3^{\ell}$ for some $\ell>0$. We see that $2^{k}-1 \equiv(-1)^{k}-1(\bmod 3)$, while $3^{\ell} \equiv 0(\bmod 3)$. So $k$ has to be even, say $k=2 m$, and our equation becomes $2^{2 m}-1=3^{\ell}$, or equivalently $\left(2^{m}-1\right)\left(2^{m}+1\right)=3^{\ell}$. Not both factors on the left-hand side can be divisible by 3 , so $2^{m}-1=1$ and $2^{m}+1=3^{\ell}$, so $m=1$. Hence $g=2^{2}=4$.
Now we show that $g=4$ does have the given property. For this we use that $g=2$ is a solution to part (a): for any odd prime $p$ there exists a positive integer $n$ such that
$$
n \equiv 2^{n} \quad(\bmod p) \quad \text { and } \quad n+1 \equiv 2^{n+1} \quad(\bmod p) .
$$
Taking the square of both congruences, we obtain
$$
n^{2} \equiv\left(2^{n}\right)^{2}=\left(2^{2}\right)^{n}=4^{n} \quad(\bmod p)
$$
and
$$
(n+1)^{2} \equiv\left(2^{n+1}\right)^{2}=\left(2^{2}\right)^{n+1}=4^{n+1} \quad(\bmod p)
$$
as desired.
We conclude that only $g=4$ has the given property.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2013-zz.jsonl",
"solution_match": "# Solution.",
"tier": "T3",
"year": "2013"
}
|
Find the smallest possible value of the expression
$$
\left\lfloor\frac{a+b+c}{d}\right\rfloor+\left\lfloor\frac{b+c+d}{a}\right\rfloor+\left\lfloor\frac{c+d+a}{b}\right\rfloor+\left\lfloor\frac{d+a+b}{c}\right\rfloor,
$$
in which $a, b, c$ and $d$ vary over the set of positive integers.
(Here $\lfloor x\rfloor$ denotes the biggest integer which is smaller than or equal to $x$.)
#
|
The answer is 9 .
Notice that $\lfloor x\rfloor>x-1$ for all $x \in \mathbb{R}$. Therefore the given expression is strictly greater than
$$
\frac{a+b+c}{d}+\frac{b+c+d}{a}+\frac{c+d+a}{b}+\frac{d+a+b}{c}-4,
$$
which can be rewritten as
$$
\left(\frac{a}{b}+\frac{b}{a}\right)+\left(\frac{a}{c}+\frac{c}{a}\right)+\left(\frac{a}{d}+\frac{d}{a}\right)+\left(\frac{b}{c}+\frac{c}{b}\right)+\left(\frac{b}{d}+\frac{d}{b}\right)+\left(\frac{c}{d}+\frac{d}{c}\right)-4 .
$$
Since $t+\frac{1}{t} \geq 2$ for $t>0$, we get that $6 \cdot 2-4=8$ is a strict lower bound for the given expression; since it takes integral values only, we actually get that 9 is a lower bound. It remains to check that 9 can be attained; this happens for $a=b=c=5$ and $d=4$.
#
|
9
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find the smallest possible value of the expression
$$
\left\lfloor\frac{a+b+c}{d}\right\rfloor+\left\lfloor\frac{b+c+d}{a}\right\rfloor+\left\lfloor\frac{c+d+a}{b}\right\rfloor+\left\lfloor\frac{d+a+b}{c}\right\rfloor,
$$
in which $a, b, c$ and $d$ vary over the set of positive integers.
(Here $\lfloor x\rfloor$ denotes the biggest integer which is smaller than or equal to $x$.)
#
|
The answer is 9 .
Notice that $\lfloor x\rfloor>x-1$ for all $x \in \mathbb{R}$. Therefore the given expression is strictly greater than
$$
\frac{a+b+c}{d}+\frac{b+c+d}{a}+\frac{c+d+a}{b}+\frac{d+a+b}{c}-4,
$$
which can be rewritten as
$$
\left(\frac{a}{b}+\frac{b}{a}\right)+\left(\frac{a}{c}+\frac{c}{a}\right)+\left(\frac{a}{d}+\frac{d}{a}\right)+\left(\frac{b}{c}+\frac{c}{b}\right)+\left(\frac{b}{d}+\frac{d}{b}\right)+\left(\frac{c}{d}+\frac{d}{c}\right)-4 .
$$
Since $t+\frac{1}{t} \geq 2$ for $t>0$, we get that $6 \cdot 2-4=8$ is a strict lower bound for the given expression; since it takes integral values only, we actually get that 9 is a lower bound. It remains to check that 9 can be attained; this happens for $a=b=c=5$ and $d=4$.
#
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2014-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2014"
}
|
Let $k \geq 1$ be an integer.
We consider $4 k$ chips, $2 k$ of which are red and $2 k$ of which are blue. A sequence of those $4 k$ chips can be transformed into another sequence by a so-called move, consisting of interchanging a number (possibly one) of consecutive red chips with an equal number of consecutive blue chips. For example, we can move from $r \underline{b b b r} \underline{r} \underline{b} b$ to $r \underline{r} \underline{b} b \underline{b b b} b$ where $r$ denotes a red chip and $b$ denotes a blue chip.
Determine the smallest number $n$ (as a function of $k$ ) such that starting from any initial sequence of the $4 k$ chips, we need at most $n$ moves to reach the state in which the first $2 k$ chips are red.
#
|
The answer is $n=k$.
We will first show that $n \geq k$. Let us count the number $C$ of times a red chip is directly to the right of a blue chip. In the final position this number equals 0 . In the position brbrbr $\cdots b r$ this number equals $2 k$. We claim that any move reduces this number by at most 2 . Denote by $R$ the group of red chips and by $B$ the group of blue chips that are interchanged. Any reduction in $C$ must involve a red chip getting rid of its blue left neighbour or a blue chip getting rid of its red right neighbour. This can only happen with the leftmost chip of $R$ (if its left neighbour is blue) and the rightmost chip of $B$ (if its right neighbour is red), but not with the rightmost chip of $R$ (and its right neighbour) or the leftmost chip of $B$ (and its left neighbour). Hence $C$ is reduced by at most 2 in any move. Therefore the number of moves necessary to change $b r b r b r \cdots b r$ into the final position is at least $\frac{2 k}{2}=k$.
We will now show that $n \leq k$, i.e. that it is always possible to perform at most $k$ moves in order to reach the state in which the first $2 k$ chips are red. Consider the first $2 k$ chips. If at most $k$ of these chips are blue, we can perform one move for each chip, switching it with one of the red chips of the last $2 k$ chips. So then we are done in at most $k$ moves. Now suppose that of the first $2 k$ chips, at least $k+1$ are blue. Then at most $k-1$ chips are red. Hence it is possible to perform at most $k-1$ moves to reach the situation in which the last $2 k$ chips are red. We then perform one final move, switching the first $2 k$ chips and the last $2 k$ chips, ending in the situation in which the first $2 k$ chips are red. Thus, it is always possible to reach the situation in which the first $2 k$ chips are red in at most $k$ steps, hence $n \leq k$.
We have now shown that $n \geq k$ and $n \leq k$, hence $n=k$ as claimed.
#
|
k
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Let $k \geq 1$ be an integer.
We consider $4 k$ chips, $2 k$ of which are red and $2 k$ of which are blue. A sequence of those $4 k$ chips can be transformed into another sequence by a so-called move, consisting of interchanging a number (possibly one) of consecutive red chips with an equal number of consecutive blue chips. For example, we can move from $r \underline{b b b r} \underline{r} \underline{b} b$ to $r \underline{r} \underline{b} b \underline{b b b} b$ where $r$ denotes a red chip and $b$ denotes a blue chip.
Determine the smallest number $n$ (as a function of $k$ ) such that starting from any initial sequence of the $4 k$ chips, we need at most $n$ moves to reach the state in which the first $2 k$ chips are red.
#
|
The answer is $n=k$.
We will first show that $n \geq k$. Let us count the number $C$ of times a red chip is directly to the right of a blue chip. In the final position this number equals 0 . In the position brbrbr $\cdots b r$ this number equals $2 k$. We claim that any move reduces this number by at most 2 . Denote by $R$ the group of red chips and by $B$ the group of blue chips that are interchanged. Any reduction in $C$ must involve a red chip getting rid of its blue left neighbour or a blue chip getting rid of its red right neighbour. This can only happen with the leftmost chip of $R$ (if its left neighbour is blue) and the rightmost chip of $B$ (if its right neighbour is red), but not with the rightmost chip of $R$ (and its right neighbour) or the leftmost chip of $B$ (and its left neighbour). Hence $C$ is reduced by at most 2 in any move. Therefore the number of moves necessary to change $b r b r b r \cdots b r$ into the final position is at least $\frac{2 k}{2}=k$.
We will now show that $n \leq k$, i.e. that it is always possible to perform at most $k$ moves in order to reach the state in which the first $2 k$ chips are red. Consider the first $2 k$ chips. If at most $k$ of these chips are blue, we can perform one move for each chip, switching it with one of the red chips of the last $2 k$ chips. So then we are done in at most $k$ moves. Now suppose that of the first $2 k$ chips, at least $k+1$ are blue. Then at most $k-1$ chips are red. Hence it is possible to perform at most $k-1$ moves to reach the situation in which the last $2 k$ chips are red. We then perform one final move, switching the first $2 k$ chips and the last $2 k$ chips, ending in the situation in which the first $2 k$ chips are red. Thus, it is always possible to reach the situation in which the first $2 k$ chips are red in at most $k$ steps, hence $n \leq k$.
We have now shown that $n \geq k$ and $n \leq k$, hence $n=k$ as claimed.
#
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2014-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2014"
}
|
Find all positive integers $n>1$ with the following property:
for each two positive divisors $k, \ell<n$ of $n$, at least one of the numbers $2 k-\ell$ and $2 \ell-k$ is a (not necessarily positive) divisor of $n$ as well.
#
|
If $n$ is prime, then $n$ has the desired property: if $k, \ell<n$ are positive divisors of a prime $n$, we have $k=\ell=1$, in which case $2 k-\ell=1$ is a divisor of $n$ as well.
Assume now that a composite number $n$ has the desired property. Let $p$ be its smallest prime divisor and let $m=n / p$; then $m \geq p \geq 2$. Choosing $(k, \ell)=(1, m)$, we see that at least one of $2 m-1$ and $m-2$ must divide $n$. However, $m<2 m-1<2 m \leq n$; since $m$ and $n$ are the two biggest positive divisors of $n$, we conclude that $2 m-1$ cannot divide $n$. Therefore $n$ must be divisble by $m-2$. It follows that $m-2 \mid m p-p(m-2)=2 p$, hence $m-2 \in\{1,2, p, 2 p\}$.
We deal with each case separately.
- If $m-2=1$ we have $m=3$. As $p \leq m$, we have $p \in\{2,3\}$, hence $n=6$ or $n=9$.
- If $m-2=2$ we have $m=4$, hence $n$ is even and $p=2$, so $n=8$.
- If $m-2=p$, we may assume that $p>2$ (since we already discussed the case $m-2=2$ ). We have $m=p+2$, hence $n=p(p+2)$. Applying the condition in the problem to the pair $(k, \ell)=(1, p)$, we get that $p-2$ or $2 p-1$ divides $n$. If $p-2$ divides $n$, we must have $p=3$ since $p$ is the smallest prime divisor of $n$. If $2 p-1$ divides $n$, we must have $p+2=2 p-1$, since $p+2 \leq 2 p-1<p(p+2)$ and $p+2$ and $p(p+2)$ are the biggest positive divisors of $n$. Therefore $p=3$ in both cases, and we get $n=15$ as a candidate.
- If finally $m-2=2 p$ we have $m=2 p+2$, so $n$ is even. Hence $p=2$ and $n=12$.
We conclude that if a composite number $n$ satisfies the condition in the problem statement, then $n \in\{6,8,9,12,15\}$. Choosing $(k, \ell)=(1,2)$ shows that $n=8$ does not work; choosing $(k, \ell)=(3,6)$ shows that 12 is not a solution. It is easy to check that $n=6, n=9$ and $n=15$ have the desired property by checking the condition for all possible pairs $(k, \ell)$.
We conclude that the solutions are given by the prime numbers, $n=6, n=9$ and $n=15$.
#
|
n=6, n=9, n=15
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find all positive integers $n>1$ with the following property:
for each two positive divisors $k, \ell<n$ of $n$, at least one of the numbers $2 k-\ell$ and $2 \ell-k$ is a (not necessarily positive) divisor of $n$ as well.
#
|
If $n$ is prime, then $n$ has the desired property: if $k, \ell<n$ are positive divisors of a prime $n$, we have $k=\ell=1$, in which case $2 k-\ell=1$ is a divisor of $n$ as well.
Assume now that a composite number $n$ has the desired property. Let $p$ be its smallest prime divisor and let $m=n / p$; then $m \geq p \geq 2$. Choosing $(k, \ell)=(1, m)$, we see that at least one of $2 m-1$ and $m-2$ must divide $n$. However, $m<2 m-1<2 m \leq n$; since $m$ and $n$ are the two biggest positive divisors of $n$, we conclude that $2 m-1$ cannot divide $n$. Therefore $n$ must be divisble by $m-2$. It follows that $m-2 \mid m p-p(m-2)=2 p$, hence $m-2 \in\{1,2, p, 2 p\}$.
We deal with each case separately.
- If $m-2=1$ we have $m=3$. As $p \leq m$, we have $p \in\{2,3\}$, hence $n=6$ or $n=9$.
- If $m-2=2$ we have $m=4$, hence $n$ is even and $p=2$, so $n=8$.
- If $m-2=p$, we may assume that $p>2$ (since we already discussed the case $m-2=2$ ). We have $m=p+2$, hence $n=p(p+2)$. Applying the condition in the problem to the pair $(k, \ell)=(1, p)$, we get that $p-2$ or $2 p-1$ divides $n$. If $p-2$ divides $n$, we must have $p=3$ since $p$ is the smallest prime divisor of $n$. If $2 p-1$ divides $n$, we must have $p+2=2 p-1$, since $p+2 \leq 2 p-1<p(p+2)$ and $p+2$ and $p(p+2)$ are the biggest positive divisors of $n$. Therefore $p=3$ in both cases, and we get $n=15$ as a candidate.
- If finally $m-2=2 p$ we have $m=2 p+2$, so $n$ is even. Hence $p=2$ and $n=12$.
We conclude that if a composite number $n$ satisfies the condition in the problem statement, then $n \in\{6,8,9,12,15\}$. Choosing $(k, \ell)=(1,2)$ shows that $n=8$ does not work; choosing $(k, \ell)=(3,6)$ shows that 12 is not a solution. It is easy to check that $n=6, n=9$ and $n=15$ have the desired property by checking the condition for all possible pairs $(k, \ell)$.
We conclude that the solutions are given by the prime numbers, $n=6, n=9$ and $n=15$.
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2014-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2014"
}
|
Let $A B C D$ be a square. Consider a variable point $P$ inside the square for which $\angle B A P \geq 60^{\circ}$. Let $Q$ be the intersection of the line $A D$ and the perpendicular to $B P$ in $P$. Let $R$ be the intersection of the line $B Q$ and the perpendicular to $B P$ from $C$.
(a) Prove that $|B P| \geq|B R|$.
(b) For which point(s) $P$ does the inequality in (a) become an equality?
#
|
We claim that $\triangle A B P$ and $\triangle R C B$ are similar triangles. Indeed, if we denote the intersection of $B P$ and $C R$ by $S$, then $\angle R C B=\angle S C B=90^{\circ}-\angle S B C=90^{\circ}-\angle P B C=\angle A B P$. Moreover, the right angles in $P$ and $A$ imply that $A$ and $P$ lie on the circle with diameter $[B Q]$, so either $A B P Q$ or $A Q B P$ is a cyclic, convex quadrilateral. In either case, $A$ and $Q$ lie on the same side of $B P$, so $\angle P A B=\angle P Q B$. Since $C R$ and $P Q$ are perpendicular to $B P$, these lines are parallel and hence $\angle P Q B=\angle C R B$. Together with $\angle P A B=\angle P Q B$ and $\angle R C B=\angle A B P$, this implies the claim that $\triangle A B P \sim \triangle R C B$.
This similarity yields the equality $|A P| /|B R|=|B P| /|B C|$. Since $\angle B A P \geq 60^{\circ}$, we get
$$
\begin{aligned}
0 \leq & (|A B|-|A P|)^{2}=|A B|^{2}+|A P|^{2}-2 \cdot|A B| \cdot|A P| \\
& =|B P|^{2}+2(\cos \angle B A P-1) \cdot|A B| \cdot|A P| \\
& \leq|B P|^{2}-|A B| \cdot|A P|=|B P|^{2}-|B R| \cdot|B P| .
\end{aligned}
$$
This implies that $|B P| \geq|B R|$, as desired.
In order for equality to occur, one needs equality in each of the inequalities considered above: $|A B|=|A P|$ and $\angle B A P=60^{\circ}$. Hence there is exactly one point $P$ for which we have equality; this is the unique point inside the square such that $\triangle A B P$ is equilateral.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C D$ be a square. Consider a variable point $P$ inside the square for which $\angle B A P \geq 60^{\circ}$. Let $Q$ be the intersection of the line $A D$ and the perpendicular to $B P$ in $P$. Let $R$ be the intersection of the line $B Q$ and the perpendicular to $B P$ from $C$.
(a) Prove that $|B P| \geq|B R|$.
(b) For which point(s) $P$ does the inequality in (a) become an equality?
#
|
We claim that $\triangle A B P$ and $\triangle R C B$ are similar triangles. Indeed, if we denote the intersection of $B P$ and $C R$ by $S$, then $\angle R C B=\angle S C B=90^{\circ}-\angle S B C=90^{\circ}-\angle P B C=\angle A B P$. Moreover, the right angles in $P$ and $A$ imply that $A$ and $P$ lie on the circle with diameter $[B Q]$, so either $A B P Q$ or $A Q B P$ is a cyclic, convex quadrilateral. In either case, $A$ and $Q$ lie on the same side of $B P$, so $\angle P A B=\angle P Q B$. Since $C R$ and $P Q$ are perpendicular to $B P$, these lines are parallel and hence $\angle P Q B=\angle C R B$. Together with $\angle P A B=\angle P Q B$ and $\angle R C B=\angle A B P$, this implies the claim that $\triangle A B P \sim \triangle R C B$.
This similarity yields the equality $|A P| /|B R|=|B P| /|B C|$. Since $\angle B A P \geq 60^{\circ}$, we get
$$
\begin{aligned}
0 \leq & (|A B|-|A P|)^{2}=|A B|^{2}+|A P|^{2}-2 \cdot|A B| \cdot|A P| \\
& =|B P|^{2}+2(\cos \angle B A P-1) \cdot|A B| \cdot|A P| \\
& \leq|B P|^{2}-|A B| \cdot|A P|=|B P|^{2}-|B R| \cdot|B P| .
\end{aligned}
$$
This implies that $|B P| \geq|B R|$, as desired.
In order for equality to occur, one needs equality in each of the inequalities considered above: $|A B|=|A P|$ and $\angle B A P=60^{\circ}$. Hence there is exactly one point $P$ for which we have equality; this is the unique point inside the square such that $\triangle A B P$ is equilateral.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2014-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2014"
}
|
## Determine the smallest positive integer $q$ with the following property:
for every integer $m$ with $1 \leqslant m \leqslant 1006$, there exists an integer $n$ such that
$$
\frac{m}{1007} q<n<\frac{m+1}{1008} q .
$$
|
. For $m=1006$, we have
$$
q-q / 1007<n<q-q / 1008
$$
for some integer $n$. If $q \leqslant 1007$, then $q-q / 1007$ and $q-q / 1008$ are both numbers that are at least $q-1$ and smaller than $q$, so there can be no integer $n$ in between. Hence $q>1007$ and $q-q / 1008 \leqslant q-1$, implying that $n<q-1$, and that $q-q / 1007<q-2$. By rearranging terms, we find $q>2014$, and hence $q \geqslant 2015$.
Let us prove that $q=2015$ works. Indeed, $m q / 1007=2 m+m / 1007<2 m+1$ and $(m+1) q / 1008=2(m+1)-(m+1) / 1008>2 m+1$ for $1 \leqslant m \leqslant 1006$. Hence each pair of inequalities can be satisfied by taking $n=2 m+1$. This completes the proof, and shows that the smallest possible of $q$ is indeed 2015.
|
2015
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
## Determine the smallest positive integer $q$ with the following property:
for every integer $m$ with $1 \leqslant m \leqslant 1006$, there exists an integer $n$ such that
$$
\frac{m}{1007} q<n<\frac{m+1}{1008} q .
$$
|
. For $m=1006$, we have
$$
q-q / 1007<n<q-q / 1008
$$
for some integer $n$. If $q \leqslant 1007$, then $q-q / 1007$ and $q-q / 1008$ are both numbers that are at least $q-1$ and smaller than $q$, so there can be no integer $n$ in between. Hence $q>1007$ and $q-q / 1008 \leqslant q-1$, implying that $n<q-1$, and that $q-q / 1007<q-2$. By rearranging terms, we find $q>2014$, and hence $q \geqslant 2015$.
Let us prove that $q=2015$ works. Indeed, $m q / 1007=2 m+m / 1007<2 m+1$ and $(m+1) q / 1008=2(m+1)-(m+1) / 1008>2 m+1$ for $1 \leqslant m \leqslant 1006$. Hence each pair of inequalities can be satisfied by taking $n=2 m+1$. This completes the proof, and shows that the smallest possible of $q$ is indeed 2015.
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2015-zz.jsonl",
"solution_match": "\nSolution 1",
"tier": "T3",
"year": "2015"
}
|
## Determine the smallest positive integer $q$ with the following property:
for every integer $m$ with $1 \leqslant m \leqslant 1006$, there exists an integer $n$ such that
$$
\frac{m}{1007} q<n<\frac{m+1}{1008} q .
$$
|
. For $m=1, \ldots, 1006$, there must exist an integer $N$ divisible by $1007 \cdot 1008$ satisfying the double inequality
$$
1008 m q<N<1007(m+1) q .
$$
Since $N$ is divisible by 1007 and 1008 , we may write
$$
N=1008 m q+1008 k=1007(m+1) q-1007 \ell
$$
where $k, \ell>0$ are integers. Hence
$$
(1007-m) q=1008 k+1007 \ell \geqslant 2015
$$
since $k, \ell>0$. Choosing $m=1006$ in this last inequality, it follows that $q \geqslant 2015$. Conversely, for $q=2015=1008+1007,(*)$ can be satisfied by taking $k=\ell=1007-m$. (Indeed, 1007 and 1008 are coprime, and so integer divisible by 1007 and 1008 is also divisible by their product.) Thus $q=2015$ has the desired property, and we are done.
#
|
2015
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
## Determine the smallest positive integer $q$ with the following property:
for every integer $m$ with $1 \leqslant m \leqslant 1006$, there exists an integer $n$ such that
$$
\frac{m}{1007} q<n<\frac{m+1}{1008} q .
$$
|
. For $m=1, \ldots, 1006$, there must exist an integer $N$ divisible by $1007 \cdot 1008$ satisfying the double inequality
$$
1008 m q<N<1007(m+1) q .
$$
Since $N$ is divisible by 1007 and 1008 , we may write
$$
N=1008 m q+1008 k=1007(m+1) q-1007 \ell
$$
where $k, \ell>0$ are integers. Hence
$$
(1007-m) q=1008 k+1007 \ell \geqslant 2015
$$
since $k, \ell>0$. Choosing $m=1006$ in this last inequality, it follows that $q \geqslant 2015$. Conversely, for $q=2015=1008+1007,(*)$ can be satisfied by taking $k=\ell=1007-m$. (Indeed, 1007 and 1008 are coprime, and so integer divisible by 1007 and 1008 is also divisible by their product.) Thus $q=2015$ has the desired property, and we are done.
#
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2015-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2015"
}
|
Let $A B C$ be an acute triangle with circumcentre $O$. Let $\Gamma_{B}$ be the circle through $A$ and $B$ that is tangent to $A C$, and let $\Gamma_{C}$ be the circle through $A$ and $C$ that is tangent to $A B$. An arbitrary line through $A$ intersects $\Gamma_{B}$ again in $X$ and $\Gamma_{C}$ again in $Y$. Prove that $|O X|=|O Y|$.
The following solutions are valid for the configurations appearing in the diagrams.
|
. Let $O_{B}$ and $O_{C}$ denote the respective centres of $\Gamma_{B}$ and $\Gamma_{C}$. We shall show that $X O_{B} O$ and $O O_{C} Y$ are congruent. Now $A O_{B} \perp A C$ since $\Gamma_{B}$ is tangent to $A C$ and $O O_{C} \perp A C$ since $O O_{C}$ is the perpendicular bisector of $[A C]$. Hence $A O_{B} \| O O_{C}$, and similarly, $A O_{C} \| O O_{B}$. It follows that $A O_{B} O O_{C}$ is a parallelogram. In particular, $\left|O_{B} X\right|=\left|A O_{B}\right|=\left|O O_{C}\right|$ and $\left|O_{C} Y\right|=\left|O_{C} A\right|=\left|O O_{B}\right|$.
It will therefore suffice to show that the angles $\angle O O_{B} X$ and $\angle Y O_{C} O$ are equal. Noting that $\angle A O_{B} O=\angle A O_{C} O$ since $A O_{B} O O_{C}$ is a parallelogram, this follows by angle chasing:
$$
\begin{aligned}
\angle X O_{B} O & =\angle A O_{B} O-\angle A O_{B} X=\angle A O_{C} O-\left(180^{\circ}-2 \angle O_{B} A X\right) \\
& =\angle A O_{C} O-180^{\circ}+2\left(\angle O_{B} A O_{C}-\angle Y A O_{C}\right) \\
& =\angle A O_{C} O-180^{\circ}+2\left(180^{\circ}-\angle A O_{C} O\right)-\left(180^{\circ}-\angle A O_{C} Y\right) \\
& =\angle A O_{C} Y-\angle A O_{C} O=\angle O O_{C} Y .
\end{aligned}
$$
A Variant. As in the main solution, we note that $A O_{B} O O_{C}$ is a parallelogram. Notice that $O_{B}$ and $O_{C}$ lie on the respective perpendicular bisectors of $[A X]$ and $[A Y]$. The following lemma then implies that $O$ lies on the perpendicular bisector of $[X Y]$, completing the proof:
Let $P_{1}, P_{2}, P_{3}$ be three points on a line. Let $O_{1}$ be a point on the perpendicular bisector of $\left[P_{2} P_{3}\right]$, let $O_{2}$ be a point on the perpendicular bisector of $\left[P_{3} P_{1}\right]$ and let $O_{3}$ be the point in the plane such that $O_{1} P_{3} O_{2} O_{3}$ is a parallelogram. Then $O_{3}$ lies on the perpendicular bisector of $\left[P_{1} P_{2}\right]$.
Proof. One can choose coordinates such that $P_{3}=(0,0)$ and $P_{1}=(2,0)$. Then $P_{2}=(2 a, 0), O_{1}=(a, b)$ and $O_{2}=(1, c)$ for some $a, b, c \in \mathbb{R}$. Hence $O_{3}=(a+1, b+c)$ lies on the perpendicular bisector of $\left[P_{1} P_{2}\right]$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be an acute triangle with circumcentre $O$. Let $\Gamma_{B}$ be the circle through $A$ and $B$ that is tangent to $A C$, and let $\Gamma_{C}$ be the circle through $A$ and $C$ that is tangent to $A B$. An arbitrary line through $A$ intersects $\Gamma_{B}$ again in $X$ and $\Gamma_{C}$ again in $Y$. Prove that $|O X|=|O Y|$.
The following solutions are valid for the configurations appearing in the diagrams.
|
. Let $O_{B}$ and $O_{C}$ denote the respective centres of $\Gamma_{B}$ and $\Gamma_{C}$. We shall show that $X O_{B} O$ and $O O_{C} Y$ are congruent. Now $A O_{B} \perp A C$ since $\Gamma_{B}$ is tangent to $A C$ and $O O_{C} \perp A C$ since $O O_{C}$ is the perpendicular bisector of $[A C]$. Hence $A O_{B} \| O O_{C}$, and similarly, $A O_{C} \| O O_{B}$. It follows that $A O_{B} O O_{C}$ is a parallelogram. In particular, $\left|O_{B} X\right|=\left|A O_{B}\right|=\left|O O_{C}\right|$ and $\left|O_{C} Y\right|=\left|O_{C} A\right|=\left|O O_{B}\right|$.
It will therefore suffice to show that the angles $\angle O O_{B} X$ and $\angle Y O_{C} O$ are equal. Noting that $\angle A O_{B} O=\angle A O_{C} O$ since $A O_{B} O O_{C}$ is a parallelogram, this follows by angle chasing:
$$
\begin{aligned}
\angle X O_{B} O & =\angle A O_{B} O-\angle A O_{B} X=\angle A O_{C} O-\left(180^{\circ}-2 \angle O_{B} A X\right) \\
& =\angle A O_{C} O-180^{\circ}+2\left(\angle O_{B} A O_{C}-\angle Y A O_{C}\right) \\
& =\angle A O_{C} O-180^{\circ}+2\left(180^{\circ}-\angle A O_{C} O\right)-\left(180^{\circ}-\angle A O_{C} Y\right) \\
& =\angle A O_{C} Y-\angle A O_{C} O=\angle O O_{C} Y .
\end{aligned}
$$
A Variant. As in the main solution, we note that $A O_{B} O O_{C}$ is a parallelogram. Notice that $O_{B}$ and $O_{C}$ lie on the respective perpendicular bisectors of $[A X]$ and $[A Y]$. The following lemma then implies that $O$ lies on the perpendicular bisector of $[X Y]$, completing the proof:
Let $P_{1}, P_{2}, P_{3}$ be three points on a line. Let $O_{1}$ be a point on the perpendicular bisector of $\left[P_{2} P_{3}\right]$, let $O_{2}$ be a point on the perpendicular bisector of $\left[P_{3} P_{1}\right]$ and let $O_{3}$ be the point in the plane such that $O_{1} P_{3} O_{2} O_{3}$ is a parallelogram. Then $O_{3}$ lies on the perpendicular bisector of $\left[P_{1} P_{2}\right]$.
Proof. One can choose coordinates such that $P_{3}=(0,0)$ and $P_{1}=(2,0)$. Then $P_{2}=(2 a, 0), O_{1}=(a, b)$ and $O_{2}=(1, c)$ for some $a, b, c \in \mathbb{R}$. Hence $O_{3}=(a+1, b+c)$ lies on the perpendicular bisector of $\left[P_{1} P_{2}\right]$.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2015-zz.jsonl",
"solution_match": "\nSolution 1",
"tier": "T3",
"year": "2015"
}
|
Let $A B C$ be an acute triangle with circumcentre $O$. Let $\Gamma_{B}$ be the circle through $A$ and $B$ that is tangent to $A C$, and let $\Gamma_{C}$ be the circle through $A$ and $C$ that is tangent to $A B$. An arbitrary line through $A$ intersects $\Gamma_{B}$ again in $X$ and $\Gamma_{C}$ again in $Y$. Prove that $|O X|=|O Y|$.
The following solutions are valid for the configurations appearing in the diagrams.
|
. Let $\alpha=\angle B A C$. Observe that $\angle A X B=180^{\circ}-\alpha=\angle C Y A$ by tangential angles. Let $Z$ be the intersection of $B X$ and $C Y$. Thus $Z X Y$ is isosceles with, in particular, $\angle Z X Y=\angle Z Y X=\alpha$. It will thus suffice to show that $O Z$ bisects $\angle X Z Y$.
Now $\angle B Z C=2 \alpha=\angle B O C$ since $O$ is the circumcentre of $A B C$, and hence $B Z O C$ is cyclic. In particular, since $|O B|=|O C|$, it follows that $\angle O Z Y=\angle O B C=90^{\circ}-\alpha$. But $\angle X Z Y=180^{\circ}-2 \alpha$, and so $\angle X Z Y=2 \angle O Z Y$, which shows that $O Z$ bisects $\angle X Z Y$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be an acute triangle with circumcentre $O$. Let $\Gamma_{B}$ be the circle through $A$ and $B$ that is tangent to $A C$, and let $\Gamma_{C}$ be the circle through $A$ and $C$ that is tangent to $A B$. An arbitrary line through $A$ intersects $\Gamma_{B}$ again in $X$ and $\Gamma_{C}$ again in $Y$. Prove that $|O X|=|O Y|$.
The following solutions are valid for the configurations appearing in the diagrams.
|
. Let $\alpha=\angle B A C$. Observe that $\angle A X B=180^{\circ}-\alpha=\angle C Y A$ by tangential angles. Let $Z$ be the intersection of $B X$ and $C Y$. Thus $Z X Y$ is isosceles with, in particular, $\angle Z X Y=\angle Z Y X=\alpha$. It will thus suffice to show that $O Z$ bisects $\angle X Z Y$.
Now $\angle B Z C=2 \alpha=\angle B O C$ since $O$ is the circumcentre of $A B C$, and hence $B Z O C$ is cyclic. In particular, since $|O B|=|O C|$, it follows that $\angle O Z Y=\angle O B C=90^{\circ}-\alpha$. But $\angle X Z Y=180^{\circ}-2 \alpha$, and so $\angle X Z Y=2 \angle O Z Y$, which shows that $O Z$ bisects $\angle X Z Y$.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2015-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2015"
}
|
Let $A B C$ be an acute triangle with circumcentre $O$. Let $\Gamma_{B}$ be the circle through $A$ and $B$ that is tangent to $A C$, and let $\Gamma_{C}$ be the circle through $A$ and $C$ that is tangent to $A B$. An arbitrary line through $A$ intersects $\Gamma_{B}$ again in $X$ and $\Gamma_{C}$ again in $Y$. Prove that $|O X|=|O Y|$.
The following solutions are valid for the configurations appearing in the diagrams.
|
. Consider inversion $\mathscr{I}$ in a circle centred at $A$. Under $\mathscr{I}$,
$$
B \mapsto B^{\prime}, \quad C \mapsto C^{\prime}, \quad O \mapsto O^{\prime}, \quad X \mapsto X^{\prime}, \quad Y \mapsto Y^{\prime},
$$
$\Gamma_{B} \mapsto \gamma_{B}$, a line through $B^{\prime}$ parallel to $A C^{\prime}$,
$\Gamma_{C} \mapsto \gamma_{C}$, a line through $C^{\prime}$ parallel to $A B^{\prime}$,
Notice that $\mathscr{I}$ sends the circumcircle of $A B C$ to the line $B^{\prime} C^{\prime}$, and hence maps $A O$ to a line perpendicular to $B C$. Further, if $[A D]$ is a diameter of this circumcircle and $D \mapsto D^{\prime}$ under $\mathscr{I}$, then $D^{\prime}$ lies on $B C$. Also, $|A D|=2|A O|$ implies $\left|A O^{\prime}\right|=2\left|A D^{\prime}\right|$, and hence $O^{\prime}$ is the image of $A$ under reflection in $B C$. Finally, $\angle O X A=\angle X^{\prime} O^{\prime} A$ and $\angle O Y A=\angle Y^{\prime} O^{\prime} A$, and hence $|O X|=|O Y|$ if and only if $O^{\prime} A$ bissects $\angle X^{\prime} O^{\prime} Y^{\prime}$ externally. We have thus reduced the problem to the following statement:
In triangle $A B C$, let $O$ be the reflection of $A$ over $B C, \gamma_{B}$ be a line parallel to $A C$ through $B$, and $\gamma_{C}$ be a line parallel to $A B$ through $C$. For an arbitrary line $\ell$ passing through $A$, let $X$ and $Y$ be the intersections of $\ell$ with $\gamma_{B}$ and $\gamma_{C}$, respectively. Prove that $O A$ bisects $\angle X O Y$ externally.
Let $P=\gamma_{A} \cap \gamma_{B}$. By construction, $P O B C$ is an isosceles trapezoid (and therefore cyclic), $\angle O B X=\angle O B P=\angle O C P=\angle O C Y$. Further, since $X B \| A C$ and $Y C \| A B$, we have $\triangle A B X \sim \triangle Y C A$. Therefore, as $|O B|=|A B|$ and $|A C|=|O C|$ by construction,
$$
\frac{|O B|}{|B X|}=\frac{|A B|}{|B X|}=\frac{|Y C|}{|C A|}=\frac{|Y C|}{|C O|}
$$
It follows that $\triangle O B X \sim \triangle Y C O$. Hence
$$
\frac{|O X|}{|O Y|}=\frac{|X B|}{|O C|}=\frac{|X B|}{|A C|}=\frac{|X A|}{|A Y|}
$$
and so the result follows from the angle bisector theorem.
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be an acute triangle with circumcentre $O$. Let $\Gamma_{B}$ be the circle through $A$ and $B$ that is tangent to $A C$, and let $\Gamma_{C}$ be the circle through $A$ and $C$ that is tangent to $A B$. An arbitrary line through $A$ intersects $\Gamma_{B}$ again in $X$ and $\Gamma_{C}$ again in $Y$. Prove that $|O X|=|O Y|$.
The following solutions are valid for the configurations appearing in the diagrams.
|
. Consider inversion $\mathscr{I}$ in a circle centred at $A$. Under $\mathscr{I}$,
$$
B \mapsto B^{\prime}, \quad C \mapsto C^{\prime}, \quad O \mapsto O^{\prime}, \quad X \mapsto X^{\prime}, \quad Y \mapsto Y^{\prime},
$$
$\Gamma_{B} \mapsto \gamma_{B}$, a line through $B^{\prime}$ parallel to $A C^{\prime}$,
$\Gamma_{C} \mapsto \gamma_{C}$, a line through $C^{\prime}$ parallel to $A B^{\prime}$,
Notice that $\mathscr{I}$ sends the circumcircle of $A B C$ to the line $B^{\prime} C^{\prime}$, and hence maps $A O$ to a line perpendicular to $B C$. Further, if $[A D]$ is a diameter of this circumcircle and $D \mapsto D^{\prime}$ under $\mathscr{I}$, then $D^{\prime}$ lies on $B C$. Also, $|A D|=2|A O|$ implies $\left|A O^{\prime}\right|=2\left|A D^{\prime}\right|$, and hence $O^{\prime}$ is the image of $A$ under reflection in $B C$. Finally, $\angle O X A=\angle X^{\prime} O^{\prime} A$ and $\angle O Y A=\angle Y^{\prime} O^{\prime} A$, and hence $|O X|=|O Y|$ if and only if $O^{\prime} A$ bissects $\angle X^{\prime} O^{\prime} Y^{\prime}$ externally. We have thus reduced the problem to the following statement:
In triangle $A B C$, let $O$ be the reflection of $A$ over $B C, \gamma_{B}$ be a line parallel to $A C$ through $B$, and $\gamma_{C}$ be a line parallel to $A B$ through $C$. For an arbitrary line $\ell$ passing through $A$, let $X$ and $Y$ be the intersections of $\ell$ with $\gamma_{B}$ and $\gamma_{C}$, respectively. Prove that $O A$ bisects $\angle X O Y$ externally.
Let $P=\gamma_{A} \cap \gamma_{B}$. By construction, $P O B C$ is an isosceles trapezoid (and therefore cyclic), $\angle O B X=\angle O B P=\angle O C P=\angle O C Y$. Further, since $X B \| A C$ and $Y C \| A B$, we have $\triangle A B X \sim \triangle Y C A$. Therefore, as $|O B|=|A B|$ and $|A C|=|O C|$ by construction,
$$
\frac{|O B|}{|B X|}=\frac{|A B|}{|B X|}=\frac{|Y C|}{|C A|}=\frac{|Y C|}{|C O|}
$$
It follows that $\triangle O B X \sim \triangle Y C O$. Hence
$$
\frac{|O X|}{|O Y|}=\frac{|X B|}{|O C|}=\frac{|X B|}{|A C|}=\frac{|X A|}{|A Y|}
$$
and so the result follows from the angle bisector theorem.
#
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2015-zz.jsonl",
"solution_match": "\nSolution 3",
"tier": "T3",
"year": "2015"
}
|
Does there exist a prime number whose decimal representation is of the form $3811 \cdots 11$ (that is, consisting of the digits 3 and 8 in that order followed by one or more digits 1 )?
|
Write
$$
a(n)=38 \underbrace{11 \cdots 11}_{n \text { digits } 1} .
$$
There are three cases to consider, depending on the remainder of $n$ upon division by three.
- If $n=3 k+1 \equiv 1(\bmod 3)$, then the sum of the digits of $a(n)$ is equal to $3(k+4)$, i.e. divisible by 3 , and hence so is $a(n)$.
- If $n=3 k+2 \equiv 2(\bmod 3)$, then note that $a(2)=3811=3700+111$ is divisible by 37 . By induction, as $a(3 k+2)=1000 a(3 k-1)+111$, it follows that $a(3 k+2)$ is divisible by 37 for each $k \geqslant 0$.
- If $n=3 k \equiv 0(\bmod 3)$, observe that
$$
9 a(3 k)=342 \underbrace{99 \ldots 99}_{n \text { digits } 9}=\left(7 \cdot 10^{k}\right)^{3}-1
$$
which is properly divisible by $7 \cdot 10^{k}-1$, a number that is larger than 9 . Hence $a(3 k)$ admits a non-trivial factor and so is not prime.
#
|
proof
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Does there exist a prime number whose decimal representation is of the form $3811 \cdots 11$ (that is, consisting of the digits 3 and 8 in that order followed by one or more digits 1 )?
|
Write
$$
a(n)=38 \underbrace{11 \cdots 11}_{n \text { digits } 1} .
$$
There are three cases to consider, depending on the remainder of $n$ upon division by three.
- If $n=3 k+1 \equiv 1(\bmod 3)$, then the sum of the digits of $a(n)$ is equal to $3(k+4)$, i.e. divisible by 3 , and hence so is $a(n)$.
- If $n=3 k+2 \equiv 2(\bmod 3)$, then note that $a(2)=3811=3700+111$ is divisible by 37 . By induction, as $a(3 k+2)=1000 a(3 k-1)+111$, it follows that $a(3 k+2)$ is divisible by 37 for each $k \geqslant 0$.
- If $n=3 k \equiv 0(\bmod 3)$, observe that
$$
9 a(3 k)=342 \underbrace{99 \ldots 99}_{n \text { digits } 9}=\left(7 \cdot 10^{k}\right)^{3}-1
$$
which is properly divisible by $7 \cdot 10^{k}-1$, a number that is larger than 9 . Hence $a(3 k)$ admits a non-trivial factor and so is not prime.
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2015-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2015"
}
|
An arithmetic progression is a set of the form $\{a, a+d, \ldots, a+k d\}$, where $a, d, k$ are positive integers and $k \geqslant 2$. Thus an arithmetic progression has at least three elements and the successive elements have difference $d$, called the common difference of the arithmetic progression.
Let $n$ be a positive integer. For each partition of the set $\{1,2, \ldots, 3 n\}$ into arithmetic progressions, we consider the sum $S$ of the respective common differences of these arithmetic progressions. What is the maximal value $S$ that can attain?
(A partition of a set $A$ is a collection of disjoint subsets of $A$ whose union is $A$.)
|
The maximum value is $n^{2}$, which is attained for the partition into $n$ arithmetic progressions $\{1, n+1,2 n+1\}, \ldots,\{n, 2 n, 3 n\}$, each of difference $n$.
Suppose indeed that the set has been partioned into $N$ progressions, of respective lengths $\ell_{i}$, and differences $d_{i}$, for $1 \leqslant i \leqslant N$. Since $\ell_{i} \geqslant 3$,
$$
2 \sum_{i=1}^{N} d_{i} \leqslant \sum_{i=1}^{N}\left(\ell_{i}-1\right) d_{i}=\sum_{i=1}^{N} a_{i}-\sum_{i=1}^{N} b_{i}
$$
where $a_{i}$ and $b_{i}$ denote, respectively, the largest and smallest elements of progression $i$. Now
$$
\begin{aligned}
& \sum_{i=1}^{N} b_{i} \geqslant 1+2+\cdots+N=N(N+1) / 2 \\
& \sum_{i=1}^{N} a_{i} \leqslant(3 n-N+1)+\cdots+3 n=N(6 n-N+1) / 2
\end{aligned}
$$
and thus
$$
2 \sum_{i=1}^{N} d_{i} \leqslant N(3 n-N) \leqslant 2 n^{2}
$$
as $N(3 n-N)$ is an increasing of $N$ on the interval $[0,3 n / 2]$ and since $N \leqslant n$. This completes the proof.
Remark. The maximising partition is in fact unique: from the above, it is immediate that all maximal partitions must have $n_{i}=3$ and hence $n=N$. It follows that the minimal and maximal elements of the arithmetic progressions of a maximal partition are precisely $1,2, \ldots, n$ and $2 n+1,2 n+2, \ldots, 3 n$, respectively. Consider the progression $\{n+1-d, n+1, n+1+d\}$ of difference $d$. Then $n+1-d \geqslant 1$ and $n+1+d \geqslant 2 n+1$,
which implies $d=n$, and hence $\{1, n+1,2 n+1\}$ is an element of any maximal partition. By induction, it follows similarly that $\{k, n+k, 2 n+k\}$ is an element of any maximal partition for $1 \leqslant k \leqslant n$, since integers allowing for smaller or larger differences have already been used up. This proves the partition $\{1, n+1,2 n+1\}, \ldots,\{n, 2 n, 3 n\}$ is the unique maximising partition, as claimed.
|
n^2
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
An arithmetic progression is a set of the form $\{a, a+d, \ldots, a+k d\}$, where $a, d, k$ are positive integers and $k \geqslant 2$. Thus an arithmetic progression has at least three elements and the successive elements have difference $d$, called the common difference of the arithmetic progression.
Let $n$ be a positive integer. For each partition of the set $\{1,2, \ldots, 3 n\}$ into arithmetic progressions, we consider the sum $S$ of the respective common differences of these arithmetic progressions. What is the maximal value $S$ that can attain?
(A partition of a set $A$ is a collection of disjoint subsets of $A$ whose union is $A$.)
|
The maximum value is $n^{2}$, which is attained for the partition into $n$ arithmetic progressions $\{1, n+1,2 n+1\}, \ldots,\{n, 2 n, 3 n\}$, each of difference $n$.
Suppose indeed that the set has been partioned into $N$ progressions, of respective lengths $\ell_{i}$, and differences $d_{i}$, for $1 \leqslant i \leqslant N$. Since $\ell_{i} \geqslant 3$,
$$
2 \sum_{i=1}^{N} d_{i} \leqslant \sum_{i=1}^{N}\left(\ell_{i}-1\right) d_{i}=\sum_{i=1}^{N} a_{i}-\sum_{i=1}^{N} b_{i}
$$
where $a_{i}$ and $b_{i}$ denote, respectively, the largest and smallest elements of progression $i$. Now
$$
\begin{aligned}
& \sum_{i=1}^{N} b_{i} \geqslant 1+2+\cdots+N=N(N+1) / 2 \\
& \sum_{i=1}^{N} a_{i} \leqslant(3 n-N+1)+\cdots+3 n=N(6 n-N+1) / 2
\end{aligned}
$$
and thus
$$
2 \sum_{i=1}^{N} d_{i} \leqslant N(3 n-N) \leqslant 2 n^{2}
$$
as $N(3 n-N)$ is an increasing of $N$ on the interval $[0,3 n / 2]$ and since $N \leqslant n$. This completes the proof.
Remark. The maximising partition is in fact unique: from the above, it is immediate that all maximal partitions must have $n_{i}=3$ and hence $n=N$. It follows that the minimal and maximal elements of the arithmetic progressions of a maximal partition are precisely $1,2, \ldots, n$ and $2 n+1,2 n+2, \ldots, 3 n$, respectively. Consider the progression $\{n+1-d, n+1, n+1+d\}$ of difference $d$. Then $n+1-d \geqslant 1$ and $n+1+d \geqslant 2 n+1$,
which implies $d=n$, and hence $\{1, n+1,2 n+1\}$ is an element of any maximal partition. By induction, it follows similarly that $\{k, n+k, 2 n+k\}$ is an element of any maximal partition for $1 \leqslant k \leqslant n$, since integers allowing for smaller or larger differences have already been used up. This proves the partition $\{1, n+1,2 n+1\}, \ldots,\{n, 2 n, 3 n\}$ is the unique maximising partition, as claimed.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2015-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2015"
}
|
Find the greatest positive integer $N$ with the following property: there exist integers $x_{1}, \ldots, x_{N}$ such that $x_{i}^{2}-x_{i} x_{j}$ is not divisible by 1111 for any $i \neq j$.
|
We prove that the greatest $N$ with the required property is $N=1000$. First note that $x_{i}^{2}-x_{i} x_{j}=x_{i}\left(x_{i}-x_{j}\right)$, and that the prime factorisation of 1111 is $11 \cdot 101$.
We first show that we can find 1000 integers $x_{1}, x_{2}, \ldots, x_{1000}$ such that $x_{i}^{2}-x_{i} x_{j}$ is not divisible by 1111 for any $i \neq j$. Consider the set $\{1,2, \ldots, 1110\}$. This set contains 10 integers divisible by 101 , and it contains 100 integers divisible by 11 . None of the integers in the set are divisible by both 11 and 101. If we delete all of these $10+100$ integers from the set, we are left with 1000 integers. Call these $x_{1}, x_{2}, \ldots, x_{1000}$. Now we have $11 \nmid x_{i}$ and $101 \nmid x_{i}$ for all $i$. Suppose there are $i \neq j$ with $1111 \mid x_{i}\left(x_{i}-x_{j}\right)$, then we must have $1111 \mid x_{i}-x_{j}$, which is a contradiction, since $x_{i}, x_{j} \in\{1,2, \ldots, 1110\}$. So this set satisfies the requirement.
We now prove that given 1001 (or more) integers $x_{1}, x_{2}, \ldots, x_{1001}$ there are $i \neq j$ with $1111 \mid x_{i}\left(x_{i}-x_{j}\right)$. Suppose for a contradiction that for all indices $i \neq j$, we have that $x_{i}\left(x_{i}-x_{j}\right)$ is not divisible by 1111, and write $X=\left\{x_{1}, \ldots, x_{1001}\right\}$. We may (after reducing modulo 1111 if necessary) assume that $x_{i} \in\{0,1, \ldots, 1110\}$ for all $i$. Then we know that $x_{i} \neq 0$ for all $i$, and $x_{i} \neq x_{j}$ for all $i \neq j$. Suppose for some $i$ we have $11 \mid x_{i}$. (Since $x_{i} \neq 0$, we know that $101 \nmid x_{i}$.) Then any integer $a \neq x_{i}$ with $a \equiv x_{i} \bmod 101$ cannot be an element of $X$, since $1111 \mid x_{i}\left(x_{i}-a\right)$. In $\{1,2, \ldots, 1110\}$ there are 10 such integers, all of them coprime with $11 \cdot 101$. If there are exactly $k$ different values of $i$ such that $11 \mid x_{i}$, there are $10 k$ different integers from $\{1,2, \ldots, 1110\}$ that cannot be elements of $X$, all of them coprime with $11 \cdot 101$. Similarly, if there are exactly $m$ different values of $i$ such that $101 \mid x_{i}$, then there are 100 m different integers from $\{1,2, \ldots, 1110\}$ that cannot be elements of $X$, all of them coprime with $11 \cdot 101$. (Note that those $10 k$ and 100 m integers can overlap.)
In $\{1,2, \ldots, 1110\}$ there are 100 multiples of 11 , there are 10 multiples of 101 and there is no multiple of $11 \cdot 101$, so there are 1000 integers that are coprime with $11 \cdot 101$. In $X$ we have $1001-k-m$ integers that are coprime with $11 \cdot 101$, so exactly $k+m-1$ of the coprime integers in $\{1,2, \ldots, 1110\}$ are not in $X$. This implies that $10 k \leqslant k+m-1$ and $100 m \leqslant k+m-1$. Adding these two inequalities we find $8 k+98 m \leqslant-2$, a clear contradiction. So $N<1001$.
|
1000
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
Find the greatest positive integer $N$ with the following property: there exist integers $x_{1}, \ldots, x_{N}$ such that $x_{i}^{2}-x_{i} x_{j}$ is not divisible by 1111 for any $i \neq j$.
|
We prove that the greatest $N$ with the required property is $N=1000$. First note that $x_{i}^{2}-x_{i} x_{j}=x_{i}\left(x_{i}-x_{j}\right)$, and that the prime factorisation of 1111 is $11 \cdot 101$.
We first show that we can find 1000 integers $x_{1}, x_{2}, \ldots, x_{1000}$ such that $x_{i}^{2}-x_{i} x_{j}$ is not divisible by 1111 for any $i \neq j$. Consider the set $\{1,2, \ldots, 1110\}$. This set contains 10 integers divisible by 101 , and it contains 100 integers divisible by 11 . None of the integers in the set are divisible by both 11 and 101. If we delete all of these $10+100$ integers from the set, we are left with 1000 integers. Call these $x_{1}, x_{2}, \ldots, x_{1000}$. Now we have $11 \nmid x_{i}$ and $101 \nmid x_{i}$ for all $i$. Suppose there are $i \neq j$ with $1111 \mid x_{i}\left(x_{i}-x_{j}\right)$, then we must have $1111 \mid x_{i}-x_{j}$, which is a contradiction, since $x_{i}, x_{j} \in\{1,2, \ldots, 1110\}$. So this set satisfies the requirement.
We now prove that given 1001 (or more) integers $x_{1}, x_{2}, \ldots, x_{1001}$ there are $i \neq j$ with $1111 \mid x_{i}\left(x_{i}-x_{j}\right)$. Suppose for a contradiction that for all indices $i \neq j$, we have that $x_{i}\left(x_{i}-x_{j}\right)$ is not divisible by 1111, and write $X=\left\{x_{1}, \ldots, x_{1001}\right\}$. We may (after reducing modulo 1111 if necessary) assume that $x_{i} \in\{0,1, \ldots, 1110\}$ for all $i$. Then we know that $x_{i} \neq 0$ for all $i$, and $x_{i} \neq x_{j}$ for all $i \neq j$. Suppose for some $i$ we have $11 \mid x_{i}$. (Since $x_{i} \neq 0$, we know that $101 \nmid x_{i}$.) Then any integer $a \neq x_{i}$ with $a \equiv x_{i} \bmod 101$ cannot be an element of $X$, since $1111 \mid x_{i}\left(x_{i}-a\right)$. In $\{1,2, \ldots, 1110\}$ there are 10 such integers, all of them coprime with $11 \cdot 101$. If there are exactly $k$ different values of $i$ such that $11 \mid x_{i}$, there are $10 k$ different integers from $\{1,2, \ldots, 1110\}$ that cannot be elements of $X$, all of them coprime with $11 \cdot 101$. Similarly, if there are exactly $m$ different values of $i$ such that $101 \mid x_{i}$, then there are 100 m different integers from $\{1,2, \ldots, 1110\}$ that cannot be elements of $X$, all of them coprime with $11 \cdot 101$. (Note that those $10 k$ and 100 m integers can overlap.)
In $\{1,2, \ldots, 1110\}$ there are 100 multiples of 11 , there are 10 multiples of 101 and there is no multiple of $11 \cdot 101$, so there are 1000 integers that are coprime with $11 \cdot 101$. In $X$ we have $1001-k-m$ integers that are coprime with $11 \cdot 101$, so exactly $k+m-1$ of the coprime integers in $\{1,2, \ldots, 1110\}$ are not in $X$. This implies that $10 k \leqslant k+m-1$ and $100 m \leqslant k+m-1$. Adding these two inequalities we find $8 k+98 m \leqslant-2$, a clear contradiction. So $N<1001$.
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "\nProblem 1.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2016-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2016"
}
|
Let $n$ be a positive integer. Suppose that its positive divisors can be partitioned into pairs (i.e. can be split in groups of two) in such a way that the sum of each pair is a prime number. Prove that these prime numbers are distinct and that none of these are a divisor of $n$.
|
Let $d_{1}$ and $d_{2}$ be positive divisors of $n$ that form a pair as given in the problem. If $d_{1}$ and $d_{2}$ have a non-trivial prime divisor $p$ in common, then $p \mid d_{1}+d_{2}$ and $p \leqslant d_{1}<d_{1}+d_{2}$, so $d_{1}+d_{2}$ cannot be prime. Hence $\operatorname{gcd}\left(d_{1}, d_{2}\right)=1$, which implies that $d_{1} d_{2} \mid n$. Suppose the number of positive divisors of $n$ is $2 t$ (it is even since the divisors can be split into pairs). If we now multiply all divisors, then on one hand we have the product of all $d_{1} d_{2}$ where $\left\{d_{1}, d_{2}\right\}$ is a pair, so that product is at most $n^{t}$. On the other hand for every divisor $d$ there is another divisor $\frac{n}{d}$ (since the number of divisors is even, the case $d=\frac{n}{d}$ does not occur), and the product of all those is equal to $n^{t}$. Hence there must be equality in every inequality $d_{1} d_{2} \leqslant n$. So the pairs of divisors given in the problem are all of the form $\left\{d, \frac{n}{d}\right\}$.
Now we prove the two statements in the problem. Suppose that $d, d^{\prime}$ are positive divisors of $n$ such that $d+\frac{n}{d}=d^{\prime}+\frac{n}{d^{\prime}}$. Then $d^{2} d^{\prime}+n d^{\prime}=d\left(d^{\prime}\right)^{2}+n d$, so $d d^{\prime}\left(d-d^{\prime}\right)=n\left(d-d^{\prime}\right)$ and hence $\left(d d^{\prime}-n\right)\left(d-d^{\prime}\right)=0$. Therefore either $d=d^{\prime}$ or $d d^{\prime}=n$, which implies that $\left\{d, \frac{n}{d}\right\}=\left\{d^{\prime}, \frac{n}{d^{\prime}}\right\}$, as required.
Now let $d$ be a positive divisor of $n$. Every prime divisor $p$ of $n$ divides precisely one of $d$ and $\frac{n}{d}$, since $d \frac{n}{d}=n$ and $\operatorname{gcd}\left(d, \frac{n}{d}\right)=1$; so $p \nmid d+\frac{n}{d}$. Therefore $\operatorname{gcd}\left(n, d+\frac{n}{d}\right)=1$. Since $d+\frac{n}{d}>1$ we conclude that $d+\frac{n}{d}$ cannot be a divisor of $n$.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
Let $n$ be a positive integer. Suppose that its positive divisors can be partitioned into pairs (i.e. can be split in groups of two) in such a way that the sum of each pair is a prime number. Prove that these prime numbers are distinct and that none of these are a divisor of $n$.
|
Let $d_{1}$ and $d_{2}$ be positive divisors of $n$ that form a pair as given in the problem. If $d_{1}$ and $d_{2}$ have a non-trivial prime divisor $p$ in common, then $p \mid d_{1}+d_{2}$ and $p \leqslant d_{1}<d_{1}+d_{2}$, so $d_{1}+d_{2}$ cannot be prime. Hence $\operatorname{gcd}\left(d_{1}, d_{2}\right)=1$, which implies that $d_{1} d_{2} \mid n$. Suppose the number of positive divisors of $n$ is $2 t$ (it is even since the divisors can be split into pairs). If we now multiply all divisors, then on one hand we have the product of all $d_{1} d_{2}$ where $\left\{d_{1}, d_{2}\right\}$ is a pair, so that product is at most $n^{t}$. On the other hand for every divisor $d$ there is another divisor $\frac{n}{d}$ (since the number of divisors is even, the case $d=\frac{n}{d}$ does not occur), and the product of all those is equal to $n^{t}$. Hence there must be equality in every inequality $d_{1} d_{2} \leqslant n$. So the pairs of divisors given in the problem are all of the form $\left\{d, \frac{n}{d}\right\}$.
Now we prove the two statements in the problem. Suppose that $d, d^{\prime}$ are positive divisors of $n$ such that $d+\frac{n}{d}=d^{\prime}+\frac{n}{d^{\prime}}$. Then $d^{2} d^{\prime}+n d^{\prime}=d\left(d^{\prime}\right)^{2}+n d$, so $d d^{\prime}\left(d-d^{\prime}\right)=n\left(d-d^{\prime}\right)$ and hence $\left(d d^{\prime}-n\right)\left(d-d^{\prime}\right)=0$. Therefore either $d=d^{\prime}$ or $d d^{\prime}=n$, which implies that $\left\{d, \frac{n}{d}\right\}=\left\{d^{\prime}, \frac{n}{d^{\prime}}\right\}$, as required.
Now let $d$ be a positive divisor of $n$. Every prime divisor $p$ of $n$ divides precisely one of $d$ and $\frac{n}{d}$, since $d \frac{n}{d}=n$ and $\operatorname{gcd}\left(d, \frac{n}{d}\right)=1$; so $p \nmid d+\frac{n}{d}$. Therefore $\operatorname{gcd}\left(n, d+\frac{n}{d}\right)=1$. Since $d+\frac{n}{d}>1$ we conclude that $d+\frac{n}{d}$ cannot be a divisor of $n$.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "\nProblem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2016-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2016"
}
|
Find all functions $f: \mathbb{R} \rightarrow \mathbb{Z}$ such that
$$
(f(f(y)-x))^{2}+f(x)^{2}+f(y)^{2}=f(y) \cdot(1+2 f(f(y)))
$$
for all $x, y \in \mathbb{R}$.
|
Take $x=y=0$ and write $c=f(0)$, then we find $f(c)^{2}+c^{2}+c^{2}=c+2 c f(c)$, so $(f(c)-c)^{2}=c-c^{2}$. The left-hand side is non-negative, so the right-hand side must be non-negative as well, hence $c-c^{2} \geqslant 0$, so $c(1-c) \geqslant 0$. This implies $0 \leqslant c \leqslant 1$, and since $c \in \mathbb{Z}$, we get $c=0$ or $c=1$. In both cases we have $c-c^{2}=0$, so $f(c)-c=0$, hence $f(c)=c$. Now taking $y=0$ we find for all $x \in \mathbb{R}$ that
$$
(f(c-x))^{2}+f(x)^{2}+c^{2}=c+2 c^{2} .
$$
If $c=0$, then this equation reduces to $f(-x)^{2}+f(x)^{2}=0$, and since the left-hand side consists of the sum of two squares, both squares must be zero. Therefore $f(x)=0$ for all $x$. This function is indeed a solution of the given functional equation.
Now we consider the other case: $c=1$. Then (1) reduces to $f(1-x)^{2}+f(x)^{2}=2$. The left-hand side consists of two squares of integers, so they must both be 1 . Therefore for all $x$ we have $f(x)=1$ or $f(x)=-1$.
Suppose there is an $a$ with $f(a)=-1$. We take $y=a$ in the functional equation; using that $f(w)^{2}=1$ for any $w$, we find $1+1+1=-1 \cdot(1+2 f(-1))$. Both with $f(-1)=1$ and with $f(-1)=-1$ this gives a contradiction. So there exists no such $a$, and we conclude that $f(x)=1$ for all $x \in \mathbb{R}$. This is also a solution of the given functional equation.
We conclude that there are two solutions: $f(x)=0$ for all $x$, and $f(x)=1$ for all $x$.
|
proof
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Find all functions $f: \mathbb{R} \rightarrow \mathbb{Z}$ such that
$$
(f(f(y)-x))^{2}+f(x)^{2}+f(y)^{2}=f(y) \cdot(1+2 f(f(y)))
$$
for all $x, y \in \mathbb{R}$.
|
Take $x=y=0$ and write $c=f(0)$, then we find $f(c)^{2}+c^{2}+c^{2}=c+2 c f(c)$, so $(f(c)-c)^{2}=c-c^{2}$. The left-hand side is non-negative, so the right-hand side must be non-negative as well, hence $c-c^{2} \geqslant 0$, so $c(1-c) \geqslant 0$. This implies $0 \leqslant c \leqslant 1$, and since $c \in \mathbb{Z}$, we get $c=0$ or $c=1$. In both cases we have $c-c^{2}=0$, so $f(c)-c=0$, hence $f(c)=c$. Now taking $y=0$ we find for all $x \in \mathbb{R}$ that
$$
(f(c-x))^{2}+f(x)^{2}+c^{2}=c+2 c^{2} .
$$
If $c=0$, then this equation reduces to $f(-x)^{2}+f(x)^{2}=0$, and since the left-hand side consists of the sum of two squares, both squares must be zero. Therefore $f(x)=0$ for all $x$. This function is indeed a solution of the given functional equation.
Now we consider the other case: $c=1$. Then (1) reduces to $f(1-x)^{2}+f(x)^{2}=2$. The left-hand side consists of two squares of integers, so they must both be 1 . Therefore for all $x$ we have $f(x)=1$ or $f(x)=-1$.
Suppose there is an $a$ with $f(a)=-1$. We take $y=a$ in the functional equation; using that $f(w)^{2}=1$ for any $w$, we find $1+1+1=-1 \cdot(1+2 f(-1))$. Both with $f(-1)=1$ and with $f(-1)=-1$ this gives a contradiction. So there exists no such $a$, and we conclude that $f(x)=1$ for all $x \in \mathbb{R}$. This is also a solution of the given functional equation.
We conclude that there are two solutions: $f(x)=0$ for all $x$, and $f(x)=1$ for all $x$.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2016-zz.jsonl",
"solution_match": "\nSolution I.",
"tier": "T3",
"year": "2016"
}
|
Find all functions $f: \mathbb{R} \rightarrow \mathbb{Z}$ such that
$$
(f(f(y)-x))^{2}+f(x)^{2}+f(y)^{2}=f(y) \cdot(1+2 f(f(y)))
$$
for all $x, y \in \mathbb{R}$.
|
We proceed as in the first solution up to the point of deriving $f(x)= \pm 1$ for all $x \in \mathbb{R}$. Now we take $x=0$ in the original functional equation, and we find
$$
(f(f(y)))^{2}+f(0)^{2}+f(y)^{2}=f(y) \cdot(1+2 f(f(y)))
$$
We can rewrite this as
$$
(f(y)-f(f(y)))^{2}+f(0)^{2}=f(y)
$$
The left-hand side is non-negative, so $f(y) \geqslant 0$ for all $y$. If we combine this with $f(x)= \pm 1$ for all $x$, we can conclude that $f(x)=1$ for all $x \in \mathbb{R}$. And this is a solution.
|
f(x)=1
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Find all functions $f: \mathbb{R} \rightarrow \mathbb{Z}$ such that
$$
(f(f(y)-x))^{2}+f(x)^{2}+f(y)^{2}=f(y) \cdot(1+2 f(f(y)))
$$
for all $x, y \in \mathbb{R}$.
|
We proceed as in the first solution up to the point of deriving $f(x)= \pm 1$ for all $x \in \mathbb{R}$. Now we take $x=0$ in the original functional equation, and we find
$$
(f(f(y)))^{2}+f(0)^{2}+f(y)^{2}=f(y) \cdot(1+2 f(f(y)))
$$
We can rewrite this as
$$
(f(y)-f(f(y)))^{2}+f(0)^{2}=f(y)
$$
The left-hand side is non-negative, so $f(y) \geqslant 0$ for all $y$. If we combine this with $f(x)= \pm 1$ for all $x$, we can conclude that $f(x)=1$ for all $x \in \mathbb{R}$. And this is a solution.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2016-zz.jsonl",
"solution_match": "\nSolution II.",
"tier": "T3",
"year": "2016"
}
|
A circle $\omega$ passes through the two vertices $B$ and $C$ of a triangle $A B C$. Furthermore, $\omega$ intersects segment $A C$ in $D \neq C$ and segment $A B$ in $E \neq B$. On the ray from $B$ through $D$ lies a point $K$ such that $|B K|=|A C|$, and on the ray from $C$ through $E$ lies a point $L$ such that $|C L|=|A B|$. Show that the circumcentre $O$ of triangle $A K L$ lies on $\omega$.
|
Let $M$ be the midpoint of the arc $B C$ of $\omega$ that is on the same side of $B C$ as $A$. Then $|B M|=|C M|$. We also have $|B A|=|C L|$ and $\angle A B M=\angle E B M=\angle E C M=$ $\angle L C M$. Hence $\triangle A B M \cong \triangle L C M$. So $|A M|=|L M|$. (In case $M=E$ the triangles $A B M$ and $L C M$ are degenerate, but then the proof still works, since $|A M|=|A B|-|B M|=$ $|L C|-|C M|=|L M|$.) Similarly, we prove that $|A M|=|K M|$, so $M$ is the circumcentre of $\triangle A K L$. This means that $M=O$, and hence we are done as $M$ was defined to be on $\omega$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
A circle $\omega$ passes through the two vertices $B$ and $C$ of a triangle $A B C$. Furthermore, $\omega$ intersects segment $A C$ in $D \neq C$ and segment $A B$ in $E \neq B$. On the ray from $B$ through $D$ lies a point $K$ such that $|B K|=|A C|$, and on the ray from $C$ through $E$ lies a point $L$ such that $|C L|=|A B|$. Show that the circumcentre $O$ of triangle $A K L$ lies on $\omega$.
|
Let $M$ be the midpoint of the arc $B C$ of $\omega$ that is on the same side of $B C$ as $A$. Then $|B M|=|C M|$. We also have $|B A|=|C L|$ and $\angle A B M=\angle E B M=\angle E C M=$ $\angle L C M$. Hence $\triangle A B M \cong \triangle L C M$. So $|A M|=|L M|$. (In case $M=E$ the triangles $A B M$ and $L C M$ are degenerate, but then the proof still works, since $|A M|=|A B|-|B M|=$ $|L C|-|C M|=|L M|$.) Similarly, we prove that $|A M|=|K M|$, so $M$ is the circumcentre of $\triangle A K L$. This means that $M=O$, and hence we are done as $M$ was defined to be on $\omega$.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "\nProblem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2016-zz.jsonl",
"solution_match": "\nSolution I.",
"tier": "T3",
"year": "2016"
}
|
A circle $\omega$ passes through the two vertices $B$ and $C$ of a triangle $A B C$. Furthermore, $\omega$ intersects segment $A C$ in $D \neq C$ and segment $A B$ in $E \neq B$. On the ray from $B$ through $D$ lies a point $K$ such that $|B K|=|A C|$, and on the ray from $C$ through $E$ lies a point $L$ such that $|C L|=|A B|$. Show that the circumcentre $O$ of triangle $A K L$ lies on $\omega$.
|
We consider the configuration where $O$ is in the interior of triangle $A B C$. The proof for other configurations is similar. Furthermore, we exclude the case that $O=D$ or $O=E$; in those cases it is immediate that $O$ is on $\omega$.
We have $\angle A B K=\angle E B D=\angle E C D=\angle L C A$. Together with $|A B|=|C L|$ and $|A C|=$ $|B K|$ this implies $\triangle A B K \cong \triangle L C A$. Hence $|A K|=|A L|, \angle A K B=\angle L A C$ (denote this angle by $\alpha$ ) and $\angle B A K=\angle C L A$ (denote this angle by $\beta$ ). Furthermore, let $\gamma=\angle B E C=$ $\angle B D C$. Then $\angle B A C=180^{\circ}-\angle B D A-\angle A B D=\angle B D C-\angle A B D=\gamma-\angle A B D$. Therefore $\angle K A L=\angle B A K+\angle L A C-\angle B A C=\alpha+\beta-(\gamma-\angle A B D)=\alpha+\beta+\angle A B D-\gamma$. Note that in triangle $A B K$ we have $\alpha+\beta+\angle A B D=180^{\circ}$, hence $\angle K A L=180^{\circ}-\gamma$.
We have $\angle K O L=2\left(180^{\circ}-\angle K A L\right)=2 \gamma$. Since $|A K|=|A L|$, this implies $\angle A O L=\gamma$. As we also have $\angle A E L=\angle B E C=\gamma$, the quadrilateral $O E L A$ is cyclic. Analogously, $O D K A$ is cyclic. Now we have
$$
\begin{gathered}
\angle D O E=360^{\circ}-\angle D O A-\angle A O E=180^{\circ}-\angle D O A+180^{\circ}-\angle A O E \\
=\angle D K A+\angle A L E=\angle B K A+\angle A L C=\alpha+\beta
\end{gathered}
$$
On the other hand
$$
\angle D B E=\angle K B A=180^{\circ}-\angle B A K-\angle A K B=180^{\circ}-\alpha-\beta .
$$
Hence $\angle D O E+\angle D B E=180^{\circ}$, so $O$ is on the circle containing $D, B$ and $E$, which is $\omega$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
A circle $\omega$ passes through the two vertices $B$ and $C$ of a triangle $A B C$. Furthermore, $\omega$ intersects segment $A C$ in $D \neq C$ and segment $A B$ in $E \neq B$. On the ray from $B$ through $D$ lies a point $K$ such that $|B K|=|A C|$, and on the ray from $C$ through $E$ lies a point $L$ such that $|C L|=|A B|$. Show that the circumcentre $O$ of triangle $A K L$ lies on $\omega$.
|
We consider the configuration where $O$ is in the interior of triangle $A B C$. The proof for other configurations is similar. Furthermore, we exclude the case that $O=D$ or $O=E$; in those cases it is immediate that $O$ is on $\omega$.
We have $\angle A B K=\angle E B D=\angle E C D=\angle L C A$. Together with $|A B|=|C L|$ and $|A C|=$ $|B K|$ this implies $\triangle A B K \cong \triangle L C A$. Hence $|A K|=|A L|, \angle A K B=\angle L A C$ (denote this angle by $\alpha$ ) and $\angle B A K=\angle C L A$ (denote this angle by $\beta$ ). Furthermore, let $\gamma=\angle B E C=$ $\angle B D C$. Then $\angle B A C=180^{\circ}-\angle B D A-\angle A B D=\angle B D C-\angle A B D=\gamma-\angle A B D$. Therefore $\angle K A L=\angle B A K+\angle L A C-\angle B A C=\alpha+\beta-(\gamma-\angle A B D)=\alpha+\beta+\angle A B D-\gamma$. Note that in triangle $A B K$ we have $\alpha+\beta+\angle A B D=180^{\circ}$, hence $\angle K A L=180^{\circ}-\gamma$.
We have $\angle K O L=2\left(180^{\circ}-\angle K A L\right)=2 \gamma$. Since $|A K|=|A L|$, this implies $\angle A O L=\gamma$. As we also have $\angle A E L=\angle B E C=\gamma$, the quadrilateral $O E L A$ is cyclic. Analogously, $O D K A$ is cyclic. Now we have
$$
\begin{gathered}
\angle D O E=360^{\circ}-\angle D O A-\angle A O E=180^{\circ}-\angle D O A+180^{\circ}-\angle A O E \\
=\angle D K A+\angle A L E=\angle B K A+\angle A L C=\alpha+\beta
\end{gathered}
$$
On the other hand
$$
\angle D B E=\angle K B A=180^{\circ}-\angle B A K-\angle A K B=180^{\circ}-\alpha-\beta .
$$
Hence $\angle D O E+\angle D B E=180^{\circ}$, so $O$ is on the circle containing $D, B$ and $E$, which is $\omega$.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "\nProblem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2016-zz.jsonl",
"solution_match": "\nSolution II.",
"tier": "T3",
"year": "2016"
}
|
. Find all functions $f: \mathbb{Q}_{>0} \rightarrow \mathbb{Z}_{>0}$ such that
$$
f(x y) \cdot \operatorname{gcd}\left(f(x) f(y), f\left(\frac{1}{x}\right) f\left(\frac{1}{y}\right)\right)=x y f\left(\frac{1}{x}\right) f\left(\frac{1}{y}\right)
$$
for all $x, y \in \mathbb{Q}_{>0}$, where $\operatorname{gcd}(a, b)$ denotes the greatest common divisor of $a$ and $b$.
|
Let $f: \mathbb{Q}_{>0} \rightarrow \mathbb{Z}_{>0}$ be a function satisfying
$$
f(x y) \cdot \operatorname{gcd}\left(f(x) f(y), f\left(\frac{1}{x}\right) f\left(\frac{1}{y}\right)\right)=x y f\left(\frac{1}{x}\right) f\left(\frac{1}{y}\right)
$$
for all $x, y \in \mathbb{Q}_{>0}$. Taking $y=\frac{1}{x}$ in (1), we obtain
$$
f(1) \cdot \operatorname{gcd}\left(f(x) f\left(\frac{1}{x}\right), f\left(\frac{1}{x}\right) f(x)\right)=f\left(\frac{1}{x}\right) f(x),
$$
which directly implies that $f(1)=1$. Now if we take $y=1$ in (1), we get
$$
f(x) \cdot \operatorname{gcd}\left(f(x), f\left(\frac{1}{x}\right)\right)=x f\left(\frac{1}{x}\right) .
$$
Replacing $x$ with $\frac{1}{x}$ in the latter equation, we also get
$$
f\left(\frac{1}{x}\right) \cdot \operatorname{gcd}\left(f\left(\frac{1}{x}\right), f(x)\right)=\frac{1}{x} f(x) .
$$
Comparing (2) and (3), we deduce that
$$
f(x)^{2}=x^{2} f\left(\frac{1}{x}\right)^{2}
$$
which can be rewritten as
$$
f(x)=x f\left(\frac{1}{x}\right)
$$
for all $x \in \mathbb{Q}_{>0}$. We can therefore replace $f(x)$ with $x f\left(\frac{1}{x}\right)$ in (2), and this gives us
$$
\operatorname{gcd}\left(x f\left(\frac{1}{x}\right), f\left(\frac{1}{x}\right)\right)=1
$$
When $x \in \mathbb{Z}_{>0}$, the greatest common divisor of $x f\left(\frac{1}{x}\right)$ and $f\left(\frac{1}{x}\right)$ is $f\left(\frac{1}{x}\right)$, so that we find
$$
f\left(\frac{1}{x}\right)=1 \quad \text { for all } x \in \mathbb{Z}_{>0}
$$
Using (4), we then also get that
$$
f(x)=x \quad \text { for all } x \in \mathbb{Z}_{>0} .
$$
Finally, given a positive rational number $q=\frac{m}{n}$ with $m, n \in \mathbb{Z}_{>0}$, we can find the value of $f\left(\frac{m}{n}\right)$ by taking $x=m$ and $y=\frac{1}{n}$ in the initial equation (1):
$$
f\left(\frac{m}{n}\right)=\frac{m}{\operatorname{gcd}(m, n)}
$$
If $m$ and $n$ are chosen to be coprime, then we obtain the nice formula
$$
f\left(\frac{m}{n}\right)=m \quad \text { for all } m, n \in \mathbb{Z}_{>0} \text { such that } \operatorname{gcd}(m, n)=1
$$
So the only function $f: \mathbb{Q}_{>0} \rightarrow \mathbb{Z}_{>0}$ that can possibly satisfy the statement is the function defined by (7). We claim that this function indeed satisfies the statement. Indeed, if we write $x=\frac{a}{b}$ and $y=\frac{c}{d}$ with $\operatorname{gcd}(a, b)=1$ and $\operatorname{gcd}(c, d)=1$ in (1), we obtain the equality
$$
f\left(\frac{a c}{b d}\right) \cdot \operatorname{gcd}(a c, b d)=a c,
$$
which is true since
$$
f\left(\frac{a c}{b d}\right)=f\left(\frac{\frac{a c}{\operatorname{gcd}(a c, b d)}}{\frac{b d}{\operatorname{gcd}(a c, b d)}}\right)=\frac{a c}{\operatorname{gcd}(a c, b d)} .
$$
|
f\left(\frac{m}{n}\right)=m \quad \text { for all } m, n \in \mathbb{Z}_{>0} \text { such that } \operatorname{gcd}(m, n)=1
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
. Find all functions $f: \mathbb{Q}_{>0} \rightarrow \mathbb{Z}_{>0}$ such that
$$
f(x y) \cdot \operatorname{gcd}\left(f(x) f(y), f\left(\frac{1}{x}\right) f\left(\frac{1}{y}\right)\right)=x y f\left(\frac{1}{x}\right) f\left(\frac{1}{y}\right)
$$
for all $x, y \in \mathbb{Q}_{>0}$, where $\operatorname{gcd}(a, b)$ denotes the greatest common divisor of $a$ and $b$.
|
Let $f: \mathbb{Q}_{>0} \rightarrow \mathbb{Z}_{>0}$ be a function satisfying
$$
f(x y) \cdot \operatorname{gcd}\left(f(x) f(y), f\left(\frac{1}{x}\right) f\left(\frac{1}{y}\right)\right)=x y f\left(\frac{1}{x}\right) f\left(\frac{1}{y}\right)
$$
for all $x, y \in \mathbb{Q}_{>0}$. Taking $y=\frac{1}{x}$ in (1), we obtain
$$
f(1) \cdot \operatorname{gcd}\left(f(x) f\left(\frac{1}{x}\right), f\left(\frac{1}{x}\right) f(x)\right)=f\left(\frac{1}{x}\right) f(x),
$$
which directly implies that $f(1)=1$. Now if we take $y=1$ in (1), we get
$$
f(x) \cdot \operatorname{gcd}\left(f(x), f\left(\frac{1}{x}\right)\right)=x f\left(\frac{1}{x}\right) .
$$
Replacing $x$ with $\frac{1}{x}$ in the latter equation, we also get
$$
f\left(\frac{1}{x}\right) \cdot \operatorname{gcd}\left(f\left(\frac{1}{x}\right), f(x)\right)=\frac{1}{x} f(x) .
$$
Comparing (2) and (3), we deduce that
$$
f(x)^{2}=x^{2} f\left(\frac{1}{x}\right)^{2}
$$
which can be rewritten as
$$
f(x)=x f\left(\frac{1}{x}\right)
$$
for all $x \in \mathbb{Q}_{>0}$. We can therefore replace $f(x)$ with $x f\left(\frac{1}{x}\right)$ in (2), and this gives us
$$
\operatorname{gcd}\left(x f\left(\frac{1}{x}\right), f\left(\frac{1}{x}\right)\right)=1
$$
When $x \in \mathbb{Z}_{>0}$, the greatest common divisor of $x f\left(\frac{1}{x}\right)$ and $f\left(\frac{1}{x}\right)$ is $f\left(\frac{1}{x}\right)$, so that we find
$$
f\left(\frac{1}{x}\right)=1 \quad \text { for all } x \in \mathbb{Z}_{>0}
$$
Using (4), we then also get that
$$
f(x)=x \quad \text { for all } x \in \mathbb{Z}_{>0} .
$$
Finally, given a positive rational number $q=\frac{m}{n}$ with $m, n \in \mathbb{Z}_{>0}$, we can find the value of $f\left(\frac{m}{n}\right)$ by taking $x=m$ and $y=\frac{1}{n}$ in the initial equation (1):
$$
f\left(\frac{m}{n}\right)=\frac{m}{\operatorname{gcd}(m, n)}
$$
If $m$ and $n$ are chosen to be coprime, then we obtain the nice formula
$$
f\left(\frac{m}{n}\right)=m \quad \text { for all } m, n \in \mathbb{Z}_{>0} \text { such that } \operatorname{gcd}(m, n)=1
$$
So the only function $f: \mathbb{Q}_{>0} \rightarrow \mathbb{Z}_{>0}$ that can possibly satisfy the statement is the function defined by (7). We claim that this function indeed satisfies the statement. Indeed, if we write $x=\frac{a}{b}$ and $y=\frac{c}{d}$ with $\operatorname{gcd}(a, b)=1$ and $\operatorname{gcd}(c, d)=1$ in (1), we obtain the equality
$$
f\left(\frac{a c}{b d}\right) \cdot \operatorname{gcd}(a c, b d)=a c,
$$
which is true since
$$
f\left(\frac{a c}{b d}\right)=f\left(\frac{\frac{a c}{\operatorname{gcd}(a c, b d)}}{\frac{b d}{\operatorname{gcd}(a c, b d)}}\right)=\frac{a c}{\operatorname{gcd}(a c, b d)} .
$$
|
{
"exam": "Benelux_MO",
"problem_label": null,
"problem_match": null,
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2017-zz.jsonl",
"solution_match": null,
"tier": "T3",
"year": "2017"
}
|
. Let $n \geqslant 2$ be an integer. Alice and Bob play a game concerning a country made of $n$ islands. Exactly two of those $n$ islands have a factory. Initially there is no bridge in the country. Alice and Bob take turns in the following way. In each turn, the player must build a bridge between two different islands $I_{1}$ and $I_{2}$ such that:
- $I_{1}$ and $I_{2}$ are not already connected by a bridge;
- at least one of the two islands $I_{1}$ and $I_{2}$ is connected by a series of bridges to an island with a factory (or has a factory itself). (Indeed, access to a factory is needed for the construction.)
As soon as a player builds a bridge that makes it possible to go from one factory to the other, this player loses the game. (Indeed, it triggers an industrial battle between both factories.) If Alice starts, then determine (for each $n \geqslant 2$ ) who has a winning strategy.
(Note: It is allowed to construct a bridge passing above another bridge.)
|
The only configurations in which a player can only lose are the ones where there are $k$ islands (including one with a factory) all connected to each other, $n-k$ islands (including the one with the other factory) all connected to each other, and no bridge between these two sets of islands. Indeed, in this situation the player can only connect an island from the first component to an island to the other component and thus loses. Let us call such a situation a ( $k, n-k)$-critical configuration (for $k \in\{1,2, \ldots, n-1\}$ ). In all other configurations, it is possible to construct a bridge that does not connect the two factories.
Let us count the number of bridges that exist in a $(k, n-k)$-critical configuration. We have $k$ islands connected to each other and $n-k$ islands connected to each other, so the total number of bridges is
$$
N(k, n-k)=\left(\begin{array}{c}
k \\
2
\end{array}\right)+\left(\begin{array}{c}
n-k \\
2
\end{array}\right)=\frac{k(k-1)}{2}+\frac{(n-k)(n-k-1)}{2} .
$$
We are interested in the parity of this number, in order to know which turn it is (Alice's or Bob's turn) when a ( $k, n-k)$-critical configuration appears. We observe easily that the number $\left(\begin{array}{c}m \\ 2\end{array}\right)$ is even when $m \equiv 0$ or $1(\bmod 4)$, and odd when $m \equiv 2$ or $3(\bmod 4)$. Now let us distinguish some cases:
(a) If $n \equiv 1(\bmod 4)$, then for any value of $k \in\{1, \ldots, n-1\}$ the numbers $k$ and $n-k$ will always be both equal to 0 or 1 modulo 4 , or both equal to 2 or 3 modulo 4 . This means that $\left(\begin{array}{l}k \\ 2\end{array}\right)$ and $\left(\begin{array}{c}n-k \\ 2\end{array}\right)$ always have the same parity in this case, and hence that $N(k, n-k)$ is even for any value of $k$. This implies that a $(k, n-k)$-critical configuration can only appear when it is Alice's turn. So Bob will never face such a situation and he will always be able to choose a bridge that does not connect the factories. Thus Bob has a winning strategy: he just needs to avoid the bridges that make him directly lose. At some point Alice will then be faced with a $(k, n-k)$-critical configuration for some $k$.
(b) If $n \equiv 3(\bmod 4)$, then $n-k \equiv 2$ or $3(\bmod 4)$ as soon as $k \equiv 1$ or $0(\bmod 4)$, and vice versa. So $\left(\begin{array}{c}k \\ 2\end{array}\right)$ and $\left(\begin{array}{c}n-k \\ 2\end{array}\right)$ always have different parities, and $N(k, n-k)$ is odd for any value of $k$. Hence, a $(k, n-k)$-critical configuration can only appear when it is Bob's turn, which means that Alice has the winning strategy.
(c) If $n$ is even, then a similar reasoning does not work. However, we can see that Bob has an easy winning strategy in this case: the mirror strategy. This strategy can be explained as follows. Before starting the game, let us partition the $n$ islands into $\frac{n}{2}$ pairs of islands, so that the two islands with a factory belong to the same pair. Given an island $I$, we denote by $m(I)$ the island belonging to the same pair as $I$ (and we call $m(I)$ the mirror of $I$ ). Now the strategy of Bob is simple: if Alice constructs a bridge between islands $I_{1}$ and $I_{2}$, then Bob constructs a bridge between $m\left(I_{1}\right)$ and $m\left(I_{2}\right)$. In order to show that this is a winning strategy, we just need to observe that the configuration will always be symmetric after Bob's turn:
- If there is a bridge between two islands $X$ and $Y$, then there is a bridge between $m(X)$ and $m(Y)$;
- If an island $X$ is connected by a series of bridges to an island $F$ with a factory, then $m(X)$ is connected by a series of bridges (the mirror bridges) to $m(F)$, which is the other island with a factory.
Hence, when Alice constructs a bridge between $I_{1}$ and $I_{2}$ that does not make her lose (in particular $I_{2} \neq m\left(I_{1}\right)$ ), we conclude that the bridge between $m\left(I_{1}\right)$ and $m\left(I_{2}\right)$ does not already exist and that it does not make Bob lose as well.
As a conclusion, Alice has a winning strategy when $n \equiv 3(\bmod 4)$ and Bob has a winning strategy when $n \not \equiv 3(\bmod 4)$.[^0]
|
Alice \text{ has a winning strategy when } n \equiv 3(\bmod 4) \text{ and Bob has a winning strategy when } n \not \equiv 3(\bmod 4)
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
. Let $n \geqslant 2$ be an integer. Alice and Bob play a game concerning a country made of $n$ islands. Exactly two of those $n$ islands have a factory. Initially there is no bridge in the country. Alice and Bob take turns in the following way. In each turn, the player must build a bridge between two different islands $I_{1}$ and $I_{2}$ such that:
- $I_{1}$ and $I_{2}$ are not already connected by a bridge;
- at least one of the two islands $I_{1}$ and $I_{2}$ is connected by a series of bridges to an island with a factory (or has a factory itself). (Indeed, access to a factory is needed for the construction.)
As soon as a player builds a bridge that makes it possible to go from one factory to the other, this player loses the game. (Indeed, it triggers an industrial battle between both factories.) If Alice starts, then determine (for each $n \geqslant 2$ ) who has a winning strategy.
(Note: It is allowed to construct a bridge passing above another bridge.)
|
The only configurations in which a player can only lose are the ones where there are $k$ islands (including one with a factory) all connected to each other, $n-k$ islands (including the one with the other factory) all connected to each other, and no bridge between these two sets of islands. Indeed, in this situation the player can only connect an island from the first component to an island to the other component and thus loses. Let us call such a situation a ( $k, n-k)$-critical configuration (for $k \in\{1,2, \ldots, n-1\}$ ). In all other configurations, it is possible to construct a bridge that does not connect the two factories.
Let us count the number of bridges that exist in a $(k, n-k)$-critical configuration. We have $k$ islands connected to each other and $n-k$ islands connected to each other, so the total number of bridges is
$$
N(k, n-k)=\left(\begin{array}{c}
k \\
2
\end{array}\right)+\left(\begin{array}{c}
n-k \\
2
\end{array}\right)=\frac{k(k-1)}{2}+\frac{(n-k)(n-k-1)}{2} .
$$
We are interested in the parity of this number, in order to know which turn it is (Alice's or Bob's turn) when a ( $k, n-k)$-critical configuration appears. We observe easily that the number $\left(\begin{array}{c}m \\ 2\end{array}\right)$ is even when $m \equiv 0$ or $1(\bmod 4)$, and odd when $m \equiv 2$ or $3(\bmod 4)$. Now let us distinguish some cases:
(a) If $n \equiv 1(\bmod 4)$, then for any value of $k \in\{1, \ldots, n-1\}$ the numbers $k$ and $n-k$ will always be both equal to 0 or 1 modulo 4 , or both equal to 2 or 3 modulo 4 . This means that $\left(\begin{array}{l}k \\ 2\end{array}\right)$ and $\left(\begin{array}{c}n-k \\ 2\end{array}\right)$ always have the same parity in this case, and hence that $N(k, n-k)$ is even for any value of $k$. This implies that a $(k, n-k)$-critical configuration can only appear when it is Alice's turn. So Bob will never face such a situation and he will always be able to choose a bridge that does not connect the factories. Thus Bob has a winning strategy: he just needs to avoid the bridges that make him directly lose. At some point Alice will then be faced with a $(k, n-k)$-critical configuration for some $k$.
(b) If $n \equiv 3(\bmod 4)$, then $n-k \equiv 2$ or $3(\bmod 4)$ as soon as $k \equiv 1$ or $0(\bmod 4)$, and vice versa. So $\left(\begin{array}{c}k \\ 2\end{array}\right)$ and $\left(\begin{array}{c}n-k \\ 2\end{array}\right)$ always have different parities, and $N(k, n-k)$ is odd for any value of $k$. Hence, a $(k, n-k)$-critical configuration can only appear when it is Bob's turn, which means that Alice has the winning strategy.
(c) If $n$ is even, then a similar reasoning does not work. However, we can see that Bob has an easy winning strategy in this case: the mirror strategy. This strategy can be explained as follows. Before starting the game, let us partition the $n$ islands into $\frac{n}{2}$ pairs of islands, so that the two islands with a factory belong to the same pair. Given an island $I$, we denote by $m(I)$ the island belonging to the same pair as $I$ (and we call $m(I)$ the mirror of $I$ ). Now the strategy of Bob is simple: if Alice constructs a bridge between islands $I_{1}$ and $I_{2}$, then Bob constructs a bridge between $m\left(I_{1}\right)$ and $m\left(I_{2}\right)$. In order to show that this is a winning strategy, we just need to observe that the configuration will always be symmetric after Bob's turn:
- If there is a bridge between two islands $X$ and $Y$, then there is a bridge between $m(X)$ and $m(Y)$;
- If an island $X$ is connected by a series of bridges to an island $F$ with a factory, then $m(X)$ is connected by a series of bridges (the mirror bridges) to $m(F)$, which is the other island with a factory.
Hence, when Alice constructs a bridge between $I_{1}$ and $I_{2}$ that does not make her lose (in particular $I_{2} \neq m\left(I_{1}\right)$ ), we conclude that the bridge between $m\left(I_{1}\right)$ and $m\left(I_{2}\right)$ does not already exist and that it does not make Bob lose as well.
As a conclusion, Alice has a winning strategy when $n \equiv 3(\bmod 4)$ and Bob has a winning strategy when $n \not \equiv 3(\bmod 4)$.[^0]
|
{
"exam": "Benelux_MO",
"problem_label": null,
"problem_match": null,
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2017-zz.jsonl",
"solution_match": null,
"tier": "T3",
"year": "2017"
}
|
. In the convex quadrilateral $A B C D$ we have $\angle B=\angle C$ and $\angle D=90^{\circ}$. Suppose that $|A B|=2|C D|$. Prove that the angle bisector of $\angle A C B$ is perpendicular to $C D$.
|
. Let $P$ be the reflection of $C$ in $A D$; note that $C, D, P$ are collinear as $\angle D=90^{\circ}$. Then $|A B|=2|C D|=|C P|$, and since $\angle A B C=\angle B C P$ we have that $A B C P$ is an isosceles trapezoid. Hence $A P \| B C$. In particular, we have $\angle P A C=\angle A C B$ and the bisectors of these two angles are parallel. Since triangle $A C P$ is isosceles with $D$ being the midpoint of segment $C P$, the bisector of $\angle P A C$ is $A D$. Hence, the bisector of $\angle A C B$ is parallel to $A D$ and therefore perpendicular to $C D$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
. In the convex quadrilateral $A B C D$ we have $\angle B=\angle C$ and $\angle D=90^{\circ}$. Suppose that $|A B|=2|C D|$. Prove that the angle bisector of $\angle A C B$ is perpendicular to $C D$.
|
. Let $P$ be the reflection of $C$ in $A D$; note that $C, D, P$ are collinear as $\angle D=90^{\circ}$. Then $|A B|=2|C D|=|C P|$, and since $\angle A B C=\angle B C P$ we have that $A B C P$ is an isosceles trapezoid. Hence $A P \| B C$. In particular, we have $\angle P A C=\angle A C B$ and the bisectors of these two angles are parallel. Since triangle $A C P$ is isosceles with $D$ being the midpoint of segment $C P$, the bisector of $\angle P A C$ is $A D$. Hence, the bisector of $\angle A C B$ is parallel to $A D$ and therefore perpendicular to $C D$.
|
{
"exam": "Benelux_MO",
"problem_label": null,
"problem_match": null,
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2017-zz.jsonl",
"solution_match": null,
"tier": "T3",
"year": "2017"
}
|
. In the convex quadrilateral $A B C D$ we have $\angle B=\angle C$ and $\angle D=90^{\circ}$. Suppose that $|A B|=2|C D|$. Prove that the angle bisector of $\angle A C B$ is perpendicular to $C D$.
|
. Let $M$ be the midpoint of segment $A B$ and $T$ be the intersection of lines $A C$ and $M D$. We know that $|M B|=|C D|$ and that $\angle M B C=\angle B C D$, so $M B C D$ is an isosceles trapezoid. Hence $M D \| B C$, so it is a midline of $\triangle A B C$. It follows that $T$ is the midpoint of segment $A C$. As $\angle A D C=90^{\circ}$ this implies that $T$ is the circumcentre of $\triangle A C D$. Now we have $\angle A C D=\angle T C D=\angle T D C=180^{\circ}-\angle B C D$. If we denote by $\ell$ the perpendicular to $C D$ through $C$, then the latter equality implies that $C B$ is the reflection of $C A$ through $\ell$. Hence $\ell$ is the bisector of $\angle A C B$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
. In the convex quadrilateral $A B C D$ we have $\angle B=\angle C$ and $\angle D=90^{\circ}$. Suppose that $|A B|=2|C D|$. Prove that the angle bisector of $\angle A C B$ is perpendicular to $C D$.
|
. Let $M$ be the midpoint of segment $A B$ and $T$ be the intersection of lines $A C$ and $M D$. We know that $|M B|=|C D|$ and that $\angle M B C=\angle B C D$, so $M B C D$ is an isosceles trapezoid. Hence $M D \| B C$, so it is a midline of $\triangle A B C$. It follows that $T$ is the midpoint of segment $A C$. As $\angle A D C=90^{\circ}$ this implies that $T$ is the circumcentre of $\triangle A C D$. Now we have $\angle A C D=\angle T C D=\angle T D C=180^{\circ}-\angle B C D$. If we denote by $\ell$ the perpendicular to $C D$ through $C$, then the latter equality implies that $C B$ is the reflection of $C A$ through $\ell$. Hence $\ell$ is the bisector of $\angle A C B$.
|
{
"exam": "Benelux_MO",
"problem_label": null,
"problem_match": null,
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2017-zz.jsonl",
"solution_match": null,
"tier": "T3",
"year": "2017"
}
|
. In the convex quadrilateral $A B C D$ we have $\angle B=\angle C$ and $\angle D=90^{\circ}$. Suppose that $|A B|=2|C D|$. Prove that the angle bisector of $\angle A C B$ is perpendicular to $C D$.
|
. Let $S$ be the intersection of $B C$ and $A D$ and let $M$ be the midpoint of segment $A B$. (Note that $S$ exists, since if $B C \| A D$ then $A B C D$ must be a rectangle, contradicting $|A B|=2|C D|$.) We know that $|M B|=|C D|$ and that $\angle M B C=\angle B C D$, so $M B C D$ is an isosceles trapezoid. Hence $M D \| B C$, so it is a midline of $\triangle A B S$. In particular $D$ is the midpoint of segment $A S$, and triangles $A D C$ and $S D C$ are congruent. Hence $\angle S C D=\angle A C D$, so $C D$ is the angle bisector of $\angle A C S$ and is thus perpendicular to the angle bisector of $\angle A C B$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
. In the convex quadrilateral $A B C D$ we have $\angle B=\angle C$ and $\angle D=90^{\circ}$. Suppose that $|A B|=2|C D|$. Prove that the angle bisector of $\angle A C B$ is perpendicular to $C D$.
|
. Let $S$ be the intersection of $B C$ and $A D$ and let $M$ be the midpoint of segment $A B$. (Note that $S$ exists, since if $B C \| A D$ then $A B C D$ must be a rectangle, contradicting $|A B|=2|C D|$.) We know that $|M B|=|C D|$ and that $\angle M B C=\angle B C D$, so $M B C D$ is an isosceles trapezoid. Hence $M D \| B C$, so it is a midline of $\triangle A B S$. In particular $D$ is the midpoint of segment $A S$, and triangles $A D C$ and $S D C$ are congruent. Hence $\angle S C D=\angle A C D$, so $C D$ is the angle bisector of $\angle A C S$ and is thus perpendicular to the angle bisector of $\angle A C B$.
|
{
"exam": "Benelux_MO",
"problem_label": null,
"problem_match": null,
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2017-zz.jsonl",
"solution_match": null,
"tier": "T3",
"year": "2017"
}
|
. In the convex quadrilateral $A B C D$ we have $\angle B=\angle C$ and $\angle D=90^{\circ}$. Suppose that $|A B|=2|C D|$. Prove that the angle bisector of $\angle A C B$ is perpendicular to $C D$.
|
. Let $S$ be the intersection of $B C$ and $A D$ and let $F$ be the intersection of $B C$ with the line through $A$ parallel to $C D$. Then $\angle A F B=\angle A F C=180^{\circ}-\angle F C D=180^{\circ}-\angle A B C=$ $\angle A B F$, so triangle $A B F$ is isosceles with $|A B|=|A F|$. Hence $|A F|=2|C D|$. Since $A F$ is parallel to $C D$, we find that $C D$ is a midline of $\triangle A S F$, so $D$ is the midpoint of segment $A S$. Now $C D$ must be the perpendicular bisector of $A S$ and therefore it is also the angle bisector of $\angle A C S$. This implies that it is perpendicular to the angle bisector of $\angle A C B$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
. In the convex quadrilateral $A B C D$ we have $\angle B=\angle C$ and $\angle D=90^{\circ}$. Suppose that $|A B|=2|C D|$. Prove that the angle bisector of $\angle A C B$ is perpendicular to $C D$.
|
. Let $S$ be the intersection of $B C$ and $A D$ and let $F$ be the intersection of $B C$ with the line through $A$ parallel to $C D$. Then $\angle A F B=\angle A F C=180^{\circ}-\angle F C D=180^{\circ}-\angle A B C=$ $\angle A B F$, so triangle $A B F$ is isosceles with $|A B|=|A F|$. Hence $|A F|=2|C D|$. Since $A F$ is parallel to $C D$, we find that $C D$ is a midline of $\triangle A S F$, so $D$ is the midpoint of segment $A S$. Now $C D$ must be the perpendicular bisector of $A S$ and therefore it is also the angle bisector of $\angle A C S$. This implies that it is perpendicular to the angle bisector of $\angle A C B$.
|
{
"exam": "Benelux_MO",
"problem_label": null,
"problem_match": null,
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2017-zz.jsonl",
"solution_match": null,
"tier": "T3",
"year": "2017"
}
|
. A Benelux $n$-square (with $n \geqslant 2$ ) is an $n \times n$ grid consisting of $n^{2}$ cells, each of them containing a positive integer, satisfying the following conditions:
- the $n^{2}$ positive integers are pairwise distinct;
- if for each row and each column we compute the greatest common divisor of the $n$ numbers in that row/column, then we obtain $2 n$ different outcomes.
(a) Prove that, in each Benelux $n$-square (with $n \geqslant 2$ ), there exists a cell containing a number which is at least $2 n^{2}$.
(b) Call a Benelux $n$-square minimal if all $n^{2}$ numbers in the cells are at most $2 n^{2}$. Determine all $n \geqslant 2$ for which there exists a minimal Benelux $n$-square.
|
Let us associate to each row and each column of a Benelux $n$-square the greatest common divisor of the $n$ numbers in that row/column, and call it the index of the row/column. By definition of a Benelux $n$-square, we know that these $2 n$ indices are different. In particular, there is a row/column whose index is $k \geqslant 2 n$. The $n$ numbers in that row/column are distinct multiples of $k$, so the greatest of them is $\geqslant n k \geqslant 2 n^{2}$, which proves (a).
Let us now consider a minimal Benelux $n$-square, and first assume that $n \geqslant 3$. From the previous paragraph it is clear that the $2 n$ indices must exactly be $\{1,2, \ldots, 2 n\}$, otherwise we would get a number $\geqslant(2 n+1) n$ with the same argument. We can assume without loss of generality that $2 n$ is the index of a column. In order to have all numbers $\leqslant 2 n^{2}$, the numbers in that column must exactly be the $n$ smallest multiple of $2 n$, i.e. $\left\{2 n, 4 n, \ldots, 2 n^{2}\right\}$. We now argue that the index $2 n-1$ must correspond to a column. Indeed, if some row had index $2 n-1$, then the cell at the intersection of this row and the column indexed by $2 n$ would contain a number $x$ which is both a multiple of $2 n$ and $2 n-1$. Since $\operatorname{gcd}(2 n, 2 n-1)=1$, this would imply $x \geqslant 2 n(2 n-1)>2 n^{2}$, contradicting the fact that the Benelux $n$-square is minimal. With the same argument, $2 n-2$ cannot be the index of a row because $(2 n-1)(2 n-2)>2 n^{2}$ when $n \geqslant 3$. We now distinguish the cases $n$ odd and $n$ even.
- Suppose $n$ is odd. Then consider the row/column $A$ whose index is $n$. It must contain multiples of $n$, and we know that all multiples of $2 n$ are in the column indexed by $2 n$. First assume that $A$ is a column. Then we deduce that the numbers in $A$ are exactly $n, 3 n, \ldots,(2 n-1) n$. But all these numbers are odd, so this implies that the indices of all rows are odd, i.e. they must exactly be $1,3, \ldots, 2 n-1$. This is a contradiction with the fact that $2 n-1$ is the index of a column. Now assume that $A$ is a row. It has an intersection with the column indexed by $2 n$, but the other $n-1$ numbers in $A$ must belong to $\{n, 3 n, \ldots,(2 n-1) n\}$. This implies that the indices of the corresponding $n-1$ columns are all odd, but this is a contradiction with the fact that $2 n-2$ is the index of a column. Hence, there does not exist a minimal Benelux $n$-square when $n$ is odd.
- Suppose $n$ is even and assume moreover that $n \geqslant 8$. With the same argument as earlier, we can deduce that $2 n-3$ and then $2 n-4$ are indices of a column (because
$(2 n-3)(2 n-4)>2 n^{2}$ when $\left.n \geqslant 8\right)$. Now we do the same reasoning as for $n$ odd but with multiples of $n-1$ instead of $n$. In the column whose index is $2 n-2$, we have $n$ multiples of $2 n-2$. There are exactly $n+1$ multiples of $2 n-2$ which are $\leqslant 2 n^{2}$, since $(n+1)(2 n-2)=2 n^{2}-2$. Hence, this implies that there is only one multiple of $2 n-2$ which is small enough to appear in the square and which is not already in the column indexed by $2 n-2$. Consider the row/column $A$ whose index is $n-1$. If $A$ is a column, then $A$ contains at most one even number (the remaining multiple of $2 n-2$ ) and this implies that at least $n-1$ indices of rows are odd. This is a contradiction with the fact that $2 n-1$ and $2 n-3$ are indices of a column. Finally, if $A$ is a row, then we get at most one column different from the one indexed by $2 n-2$ which can be indexed by an even number. This is a contradiction with the fact that $2 n$ and $2 n-4$ are indices of columns. So there does not exist a minimal Benelux $n$-square when $n$ is even and $\geqslant 8$.
The remaining cases are $n \in\{2,4,6\}$ :
- For $n=6$, we know as above that 12,11 and 10 are indices of columns. But then 9,8 and 7 cannot be indices of rows since $9 \cdot 11,8 \cdot 11,7 \cdot 11$ cannot appear in the square. So they also are indices of columns. We can therefore do the same argumentation as for $n \geqslant 8$ above to prove that there is no minimal Benelux 6 -square.
- For $n=4$, we have the following minimal Benelux 4-square (numbers between parentheses are indices):
| 5 | 6 | 7 | 8 | $(1)$ |
| :---: | :---: | :---: | :---: | :---: |
| 10 | 30 | 14 | 16 | $(2)$ |
| 15 | 18 | 21 | 24 | $(3)$ |
| 20 | 12 | 28 | 32 | $(4)$ |
| $(5)$ | $(6)$ | $(7)$ | $(8)$ | |
- For $n=2$, we have the following minimal Benelux 2-square:
| 3 | 4 | $(1)$ |
| :---: | :---: | :---: |
| 6 | 8 | $(2)$ |
| $(3)$ | $(4)$ | |
So there exist minimal Benelux $n$-squares only for $n \in\{2,4\}$.
[^0]: Alternative for $n$ even. Another strategy for Bob to win when $n$ is even is to ensure that, before each of Alice's turns, the number of islands connected to the island with the first factory is equal to the number of islands connected to the island with the other factory. Let us say that the country is balanced when this is the case. Remark that the country is balanced at the beginning of the game. Let us show that if the country is balanced before some turn of Alice and if she constructs a bridge without losing, then Bob can always play without losing and such that the country remains balanced. There are two different choices that Alice can make:
- Alice builds a bridge between an island connected to a factory and an island which is not connected to anything. Then, since $n$ is even and as the country was balanced before Alice's turn, there exists at least one island $I$ which is still not connected to anything. Bob can therefore simply build a bridge between $I$ and an island connected to the other factory. The country will then be balanced again.
- Alice builds a bridge between two islands connected to the same factory. We claim that, in this case, is is always possible for Bob to build a bridge between two islands connected to the same factory (so that the country remains balanced). Indeed, the only situation where Bob could not do so is the situation where all $k$ islands connected to the first factory are connected to each other and all $k$ islands connected to the second factory are connected to each other. But there are $2 \cdot\left(\begin{array}{l}k \\ 2\end{array}\right)$ bridges in such a situation, and so it cannot occur after Alice's turn.
|
proof
|
Yes
|
Incomplete
|
proof
|
Combinatorics
|
. A Benelux $n$-square (with $n \geqslant 2$ ) is an $n \times n$ grid consisting of $n^{2}$ cells, each of them containing a positive integer, satisfying the following conditions:
- the $n^{2}$ positive integers are pairwise distinct;
- if for each row and each column we compute the greatest common divisor of the $n$ numbers in that row/column, then we obtain $2 n$ different outcomes.
(a) Prove that, in each Benelux $n$-square (with $n \geqslant 2$ ), there exists a cell containing a number which is at least $2 n^{2}$.
(b) Call a Benelux $n$-square minimal if all $n^{2}$ numbers in the cells are at most $2 n^{2}$. Determine all $n \geqslant 2$ for which there exists a minimal Benelux $n$-square.
|
Let us associate to each row and each column of a Benelux $n$-square the greatest common divisor of the $n$ numbers in that row/column, and call it the index of the row/column. By definition of a Benelux $n$-square, we know that these $2 n$ indices are different. In particular, there is a row/column whose index is $k \geqslant 2 n$. The $n$ numbers in that row/column are distinct multiples of $k$, so the greatest of them is $\geqslant n k \geqslant 2 n^{2}$, which proves (a).
Let us now consider a minimal Benelux $n$-square, and first assume that $n \geqslant 3$. From the previous paragraph it is clear that the $2 n$ indices must exactly be $\{1,2, \ldots, 2 n\}$, otherwise we would get a number $\geqslant(2 n+1) n$ with the same argument. We can assume without loss of generality that $2 n$ is the index of a column. In order to have all numbers $\leqslant 2 n^{2}$, the numbers in that column must exactly be the $n$ smallest multiple of $2 n$, i.e. $\left\{2 n, 4 n, \ldots, 2 n^{2}\right\}$. We now argue that the index $2 n-1$ must correspond to a column. Indeed, if some row had index $2 n-1$, then the cell at the intersection of this row and the column indexed by $2 n$ would contain a number $x$ which is both a multiple of $2 n$ and $2 n-1$. Since $\operatorname{gcd}(2 n, 2 n-1)=1$, this would imply $x \geqslant 2 n(2 n-1)>2 n^{2}$, contradicting the fact that the Benelux $n$-square is minimal. With the same argument, $2 n-2$ cannot be the index of a row because $(2 n-1)(2 n-2)>2 n^{2}$ when $n \geqslant 3$. We now distinguish the cases $n$ odd and $n$ even.
- Suppose $n$ is odd. Then consider the row/column $A$ whose index is $n$. It must contain multiples of $n$, and we know that all multiples of $2 n$ are in the column indexed by $2 n$. First assume that $A$ is a column. Then we deduce that the numbers in $A$ are exactly $n, 3 n, \ldots,(2 n-1) n$. But all these numbers are odd, so this implies that the indices of all rows are odd, i.e. they must exactly be $1,3, \ldots, 2 n-1$. This is a contradiction with the fact that $2 n-1$ is the index of a column. Now assume that $A$ is a row. It has an intersection with the column indexed by $2 n$, but the other $n-1$ numbers in $A$ must belong to $\{n, 3 n, \ldots,(2 n-1) n\}$. This implies that the indices of the corresponding $n-1$ columns are all odd, but this is a contradiction with the fact that $2 n-2$ is the index of a column. Hence, there does not exist a minimal Benelux $n$-square when $n$ is odd.
- Suppose $n$ is even and assume moreover that $n \geqslant 8$. With the same argument as earlier, we can deduce that $2 n-3$ and then $2 n-4$ are indices of a column (because
$(2 n-3)(2 n-4)>2 n^{2}$ when $\left.n \geqslant 8\right)$. Now we do the same reasoning as for $n$ odd but with multiples of $n-1$ instead of $n$. In the column whose index is $2 n-2$, we have $n$ multiples of $2 n-2$. There are exactly $n+1$ multiples of $2 n-2$ which are $\leqslant 2 n^{2}$, since $(n+1)(2 n-2)=2 n^{2}-2$. Hence, this implies that there is only one multiple of $2 n-2$ which is small enough to appear in the square and which is not already in the column indexed by $2 n-2$. Consider the row/column $A$ whose index is $n-1$. If $A$ is a column, then $A$ contains at most one even number (the remaining multiple of $2 n-2$ ) and this implies that at least $n-1$ indices of rows are odd. This is a contradiction with the fact that $2 n-1$ and $2 n-3$ are indices of a column. Finally, if $A$ is a row, then we get at most one column different from the one indexed by $2 n-2$ which can be indexed by an even number. This is a contradiction with the fact that $2 n$ and $2 n-4$ are indices of columns. So there does not exist a minimal Benelux $n$-square when $n$ is even and $\geqslant 8$.
The remaining cases are $n \in\{2,4,6\}$ :
- For $n=6$, we know as above that 12,11 and 10 are indices of columns. But then 9,8 and 7 cannot be indices of rows since $9 \cdot 11,8 \cdot 11,7 \cdot 11$ cannot appear in the square. So they also are indices of columns. We can therefore do the same argumentation as for $n \geqslant 8$ above to prove that there is no minimal Benelux 6 -square.
- For $n=4$, we have the following minimal Benelux 4-square (numbers between parentheses are indices):
| 5 | 6 | 7 | 8 | $(1)$ |
| :---: | :---: | :---: | :---: | :---: |
| 10 | 30 | 14 | 16 | $(2)$ |
| 15 | 18 | 21 | 24 | $(3)$ |
| 20 | 12 | 28 | 32 | $(4)$ |
| $(5)$ | $(6)$ | $(7)$ | $(8)$ | |
- For $n=2$, we have the following minimal Benelux 2-square:
| 3 | 4 | $(1)$ |
| :---: | :---: | :---: |
| 6 | 8 | $(2)$ |
| $(3)$ | $(4)$ | |
So there exist minimal Benelux $n$-squares only for $n \in\{2,4\}$.
[^0]: Alternative for $n$ even. Another strategy for Bob to win when $n$ is even is to ensure that, before each of Alice's turns, the number of islands connected to the island with the first factory is equal to the number of islands connected to the island with the other factory. Let us say that the country is balanced when this is the case. Remark that the country is balanced at the beginning of the game. Let us show that if the country is balanced before some turn of Alice and if she constructs a bridge without losing, then Bob can always play without losing and such that the country remains balanced. There are two different choices that Alice can make:
- Alice builds a bridge between an island connected to a factory and an island which is not connected to anything. Then, since $n$ is even and as the country was balanced before Alice's turn, there exists at least one island $I$ which is still not connected to anything. Bob can therefore simply build a bridge between $I$ and an island connected to the other factory. The country will then be balanced again.
- Alice builds a bridge between two islands connected to the same factory. We claim that, in this case, is is always possible for Bob to build a bridge between two islands connected to the same factory (so that the country remains balanced). Indeed, the only situation where Bob could not do so is the situation where all $k$ islands connected to the first factory are connected to each other and all $k$ islands connected to the second factory are connected to each other. But there are $2 \cdot\left(\begin{array}{l}k \\ 2\end{array}\right)$ bridges in such a situation, and so it cannot occur after Alice's turn.
|
{
"exam": "Benelux_MO",
"problem_label": null,
"problem_match": null,
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2017-zz.jsonl",
"solution_match": null,
"tier": "T3",
"year": "2017"
}
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
empty
| null |
Yes
|
Incomplete
|
math-word-problem
|
Algebra
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
empty
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2018"
}
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
. By the inequality between arithmetic and quadratic means,
$$
\left(x+\frac{1}{y}\right)^{2}+\left(y+\frac{1}{x}\right)^{2} \geqslant \frac{1}{2}\left(x+\frac{1}{y}+y+\frac{1}{x}\right)^{2}
$$
with equality if and only if $x+1 / y=y+1 / x$, which holds if $x=y$. It follows that
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y} \pm 2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x} \pm 2018\right) \geqslant \frac{1}{2}\left(x+\frac{1}{y}+y+\frac{1}{x}\right)^{2} \pm 2018\left(x+\frac{1}{y}+y+\frac{1}{x}\right) .
$$
The parabola $f(X)=\frac{1}{2} X^{2} \pm 2018 X$ attains its minimal value at $X=\mp 2018$, and increases monotonically away from this minimal value. By the inequality between arithmetic and geometric means, $(x+1 / x)+(y+1 / y) \geqslant 4$ with equality iff $x=y=1$. Hence
(a) $\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right) \geqslant f(2018)=-\frac{2018^{2}}{2}$,
and equality is attained if $x=y=u$, where $u+1 / u=1009$, a quadratic equation with discriminant $1009^{2}-4>0$, and that therefore has two real solutions which are clearly positive.
(b) $\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right) \geqslant f(4)=8080$,
with equality if and only if $x=y=1$.
Remark. It is easy to see that equality is attained in the first inequality if and only if $x=y$. Indeed, if $x \leqslant y$, then $1 / y \leqslant 1 / x$, and so $x+1 / y \lessgtr y+1 / x$. Thus $x+1 / y=y+1 / x$ if and only if $x=y$. This is not required for the solution.
|
-\frac{2018^2}{2}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
. By the inequality between arithmetic and quadratic means,
$$
\left(x+\frac{1}{y}\right)^{2}+\left(y+\frac{1}{x}\right)^{2} \geqslant \frac{1}{2}\left(x+\frac{1}{y}+y+\frac{1}{x}\right)^{2}
$$
with equality if and only if $x+1 / y=y+1 / x$, which holds if $x=y$. It follows that
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y} \pm 2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x} \pm 2018\right) \geqslant \frac{1}{2}\left(x+\frac{1}{y}+y+\frac{1}{x}\right)^{2} \pm 2018\left(x+\frac{1}{y}+y+\frac{1}{x}\right) .
$$
The parabola $f(X)=\frac{1}{2} X^{2} \pm 2018 X$ attains its minimal value at $X=\mp 2018$, and increases monotonically away from this minimal value. By the inequality between arithmetic and geometric means, $(x+1 / x)+(y+1 / y) \geqslant 4$ with equality iff $x=y=1$. Hence
(a) $\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right) \geqslant f(2018)=-\frac{2018^{2}}{2}$,
and equality is attained if $x=y=u$, where $u+1 / u=1009$, a quadratic equation with discriminant $1009^{2}-4>0$, and that therefore has two real solutions which are clearly positive.
(b) $\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right) \geqslant f(4)=8080$,
with equality if and only if $x=y=1$.
Remark. It is easy to see that equality is attained in the first inequality if and only if $x=y$. Indeed, if $x \leqslant y$, then $1 / y \leqslant 1 / x$, and so $x+1 / y \lessgtr y+1 / x$. Thus $x+1 / y=y+1 / x$ if and only if $x=y$. This is not required for the solution.
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 1",
"tier": "T3",
"year": "2018"
}
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
. By the inequality between arithmetic and geometric means, $x / y+y / x \geqslant 2$, and hence
$$
\left(x+\frac{1}{y}\right)^{2}+\left(y+\frac{1}{x}\right)^{2}=x^{2}+\frac{1}{y^{2}}+y^{2}+\frac{1}{x^{2}}+2\left(\frac{x}{y}+\frac{y}{x}\right) \geqslant x^{2}+\frac{1}{x^{2}}+y^{2}+\frac{1}{y^{2}}+4=\left(x+\frac{1}{x}\right)^{2}+\left(y+\frac{1}{y}\right)^{2}
$$
with equality if and only if $x=y$. It follows that
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-K\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-K\right) \geqslant\left[\left(x+\frac{1}{x}\right)^{2}-K\left(x+\frac{1}{x}\right)\right]+\left[\left(y+\frac{1}{y}\right)^{2}-K\left(y+\frac{1}{y}\right)\right] .
$$
## BxMO 2018: Problems and Solutions
Notice that the parabola $f(X)=X^{2}-K X=(X-K / 2)^{2}-K^{2} / 4$ attains its minimum value at $X=K / 2$, and increases monotonically away from this minimal value. Now $x+1 / x, y+1 / y \geqslant 2$, so it follows that
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-K\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-K\right) \geqslant\left\{\begin{array}{cl}
2 f(K / 2)=-K^{2} / 2 & \text { if } K / 2 \geqslant 2 \Longleftrightarrow K \geqslant 4 \\
2 f(2)=4(2-K) & \text { if } K / 2 \leqslant 2 \Longleftrightarrow K \leqslant 4
\end{array}\right.
$$
Equality is attained if (and only if)
$$
x=y=\frac{K}{4} \pm \sqrt{\frac{K^{2}}{16}-1} \quad(\text { if } K \geqslant 4), \quad x=y=1 \quad(\text { if } K \leqslant 4)
$$
and so these lower bounds indeed represent the minimal values. Taking (a) $K=2018$ and (b) $K=-2018$ in this result completes the proof.
|
2018^2 / 2
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
. By the inequality between arithmetic and geometric means, $x / y+y / x \geqslant 2$, and hence
$$
\left(x+\frac{1}{y}\right)^{2}+\left(y+\frac{1}{x}\right)^{2}=x^{2}+\frac{1}{y^{2}}+y^{2}+\frac{1}{x^{2}}+2\left(\frac{x}{y}+\frac{y}{x}\right) \geqslant x^{2}+\frac{1}{x^{2}}+y^{2}+\frac{1}{y^{2}}+4=\left(x+\frac{1}{x}\right)^{2}+\left(y+\frac{1}{y}\right)^{2}
$$
with equality if and only if $x=y$. It follows that
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-K\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-K\right) \geqslant\left[\left(x+\frac{1}{x}\right)^{2}-K\left(x+\frac{1}{x}\right)\right]+\left[\left(y+\frac{1}{y}\right)^{2}-K\left(y+\frac{1}{y}\right)\right] .
$$
## BxMO 2018: Problems and Solutions
Notice that the parabola $f(X)=X^{2}-K X=(X-K / 2)^{2}-K^{2} / 4$ attains its minimum value at $X=K / 2$, and increases monotonically away from this minimal value. Now $x+1 / x, y+1 / y \geqslant 2$, so it follows that
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-K\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-K\right) \geqslant\left\{\begin{array}{cl}
2 f(K / 2)=-K^{2} / 2 & \text { if } K / 2 \geqslant 2 \Longleftrightarrow K \geqslant 4 \\
2 f(2)=4(2-K) & \text { if } K / 2 \leqslant 2 \Longleftrightarrow K \leqslant 4
\end{array}\right.
$$
Equality is attained if (and only if)
$$
x=y=\frac{K}{4} \pm \sqrt{\frac{K^{2}}{16}-1} \quad(\text { if } K \geqslant 4), \quad x=y=1 \quad(\text { if } K \leqslant 4)
$$
and so these lower bounds indeed represent the minimal values. Taking (a) $K=2018$ and (b) $K=-2018$ in this result completes the proof.
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2018"
}
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
for part (a). Completing squares,
$$
\begin{aligned}
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right) & =\left(x+\frac{1}{y}-1009\right)^{2}+\left(y+\frac{1}{x}-1009\right)^{2}-2 \cdot 1009^{2} \\
& \geqslant-2 \cdot 1009^{2}
\end{aligned}
$$
with equality if $x+1 / y=y+1 / x=1009$, which holds if $x=y=u$, where $u+1 / u=1009$, a quadratic equation with discriminant $1009^{2}-4>0$, and that therefore has two real solutions which are clearly positive.
Remark. As in Solution 1, equality holds if and only if $x=y$, because, if $x \lessgtr y$, then $1 / y \lessgtr 1 / x$, and so $x+1 / y \lessgtr y+1 / x$. Thus $x+1 / y=y+1 / x$ if and only if $x=y$. This is not required for the solution.
|
-2 \cdot 1009^{2}
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
for part (a). Completing squares,
$$
\begin{aligned}
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right) & =\left(x+\frac{1}{y}-1009\right)^{2}+\left(y+\frac{1}{x}-1009\right)^{2}-2 \cdot 1009^{2} \\
& \geqslant-2 \cdot 1009^{2}
\end{aligned}
$$
with equality if $x+1 / y=y+1 / x=1009$, which holds if $x=y=u$, where $u+1 / u=1009$, a quadratic equation with discriminant $1009^{2}-4>0$, and that therefore has two real solutions which are clearly positive.
Remark. As in Solution 1, equality holds if and only if $x=y$, because, if $x \lessgtr y$, then $1 / y \lessgtr 1 / x$, and so $x+1 / y \lessgtr y+1 / x$. Thus $x+1 / y=y+1 / x$ if and only if $x=y$. This is not required for the solution.
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 3",
"tier": "T3",
"year": "2018"
}
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
for part (b). Using the inequality between arithmetic and geometric means,
$$
\begin{aligned}
\left(x+\frac{1}{y}\right)(x+ & \left.\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right) \\
& =\left(x+\frac{1}{y}\right)^{2}+\left(y+\frac{1}{x}\right)^{2}+2018\left[\left(x+\frac{1}{x}\right)+\left(y+\frac{1}{y}\right)\right] \geqslant 4 \frac{x}{y}+4 \frac{y}{x}+2018(2+2)
\end{aligned}
$$
But $x / y+y / x \geqslant 2$ by the same inequality, and hence
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right) \geqslant 8080
$$
with equality attained if and only if $x=y=1$.
## BxMO 2018: Problems and Solutions
#
|
8080
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
(a) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}-2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}-2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(b) Determine the minimal value of
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right)
$$
where $x$ and $y$ vary over the positive reals.
(Pierre Haas, Luxembourg)
#
|
for part (b). Using the inequality between arithmetic and geometric means,
$$
\begin{aligned}
\left(x+\frac{1}{y}\right)(x+ & \left.\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right) \\
& =\left(x+\frac{1}{y}\right)^{2}+\left(y+\frac{1}{x}\right)^{2}+2018\left[\left(x+\frac{1}{x}\right)+\left(y+\frac{1}{y}\right)\right] \geqslant 4 \frac{x}{y}+4 \frac{y}{x}+2018(2+2)
\end{aligned}
$$
But $x / y+y / x \geqslant 2$ by the same inequality, and hence
$$
\left(x+\frac{1}{y}\right)\left(x+\frac{1}{y}+2018\right)+\left(y+\frac{1}{x}\right)\left(y+\frac{1}{x}+2018\right) \geqslant 8080
$$
with equality attained if and only if $x=y=1$.
## BxMO 2018: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 4",
"tier": "T3",
"year": "2018"
}
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
Let the denominations of the coins and notes be $C_{1}<C_{2}<C_{3}<C_{4}$ and $N_{1}<N_{2}<N_{3}$, respectively. Define $C=C_{1}+C_{2}+C_{3}+C_{4}$ to be the largest amount that can be payed with coins only. The condition of the problem is thus $C<N_{1}$.
(a) Suppose to the contrary that, whatever the price of the book, the tourist can pay for it in no more than one way.
|
proof
|
Yes
|
Yes
|
proof
|
Combinatorics
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
Let the denominations of the coins and notes be $C_{1}<C_{2}<C_{3}<C_{4}$ and $N_{1}<N_{2}<N_{3}$, respectively. Define $C=C_{1}+C_{2}+C_{3}+C_{4}$ to be the largest amount that can be payed with coins only. The condition of the problem is thus $C<N_{1}$.
(a) Suppose to the contrary that, whatever the price of the book, the tourist can pay for it in no more than one way.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2018"
}
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Consider the hands of one or two notes and any number of (or possibly no) coins. Each of them has one of the $N_{2}+N_{3}$ different values $v$ with $N_{1} \leqslant v<N_{1}+N_{2}+N_{3}$, since $C<N_{1}$. There are $\left(\binom{3}{1}+\binom{3}{2}\right) \cdot 2^{4}=96$ such hands. Hence $95=47+48>N_{2}+N_{3} \geqslant 96$, which is a contradiction.
|
proof
|
Yes
|
Incomplete
|
proof
|
Combinatorics
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Consider the hands of one or two notes and any number of (or possibly no) coins. Each of them has one of the $N_{2}+N_{3}$ different values $v$ with $N_{1} \leqslant v<N_{1}+N_{2}+N_{3}$, since $C<N_{1}$. There are $\left(\binom{3}{1}+\binom{3}{2}\right) \cdot 2^{4}=96$ such hands. Hence $95=47+48>N_{2}+N_{3} \geqslant 96$, which is a contradiction.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 1",
"tier": "T3",
"year": "2018"
}
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Consider the hands of exactly one note and any number of (or possibly no) coins, as well as the hand consisting of the two smallest notes only, of value $N_{1}+N_{2}$. Each of these has one of the $N_{3}$ different values $v$ with $N_{1} \leqslant v<N_{3}+N_{1}$, since $C<N_{1}$ and $N_{1}<N_{1}+N_{2}<N_{1}+N_{3}$. Now the number of hands considered above is $3 \cdot 2^{4}+1=49$, so $N_{3} \geqslant 49$, a contradiction.
|
proof
|
Yes
|
Incomplete
|
proof
|
Combinatorics
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Consider the hands of exactly one note and any number of (or possibly no) coins, as well as the hand consisting of the two smallest notes only, of value $N_{1}+N_{2}$. Each of these has one of the $N_{3}$ different values $v$ with $N_{1} \leqslant v<N_{3}+N_{1}$, since $C<N_{1}$ and $N_{1}<N_{1}+N_{2}<N_{1}+N_{3}$. Now the number of hands considered above is $3 \cdot 2^{4}+1=49$, so $N_{3} \geqslant 49$, a contradiction.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2018"
}
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Consider the $3 \cdot 2^{4}=48$ hands of exactly two notes and any number of (or possibly no) coins. Each of these has one of the $N_{3}$ different values $v$ with $N_{1}+N_{2} \leqslant v<N_{1}+N_{2}+N_{3}$, since $C<N_{1}$. Hence $48 \leqslant N_{3}<49$, so $N_{3}=48$. Next consider the $3 \cdot 2^{4}=48$ hands of exactly one note and any number of coins. By the above, these cannot have a value greater than or equal to $N_{1}+N_{2}$, since these can be realised using two notes and some coins. Hence they must each have one of the $N_{2}$ different values $v$ with $N_{1} \leqslant v<N_{1}+N_{2}$. This implies $48 \leqslant N_{2}<N_{3}=48$, which is a contradiction.
(b) Consider the denominations
$$
C_{1}=3, \quad C_{2}=6, \quad C_{3}=12, \quad C_{4}=24, \quad N_{1}=47, \quad N_{2}=48, \quad N_{3}=49
$$
These satisfy the conditions of the problem, with $C=45<N_{1}$.
|
proof
|
Yes
|
Yes
|
proof
|
Combinatorics
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Consider the $3 \cdot 2^{4}=48$ hands of exactly two notes and any number of (or possibly no) coins. Each of these has one of the $N_{3}$ different values $v$ with $N_{1}+N_{2} \leqslant v<N_{1}+N_{2}+N_{3}$, since $C<N_{1}$. Hence $48 \leqslant N_{3}<49$, so $N_{3}=48$. Next consider the $3 \cdot 2^{4}=48$ hands of exactly one note and any number of coins. By the above, these cannot have a value greater than or equal to $N_{1}+N_{2}$, since these can be realised using two notes and some coins. Hence they must each have one of the $N_{2}$ different values $v$ with $N_{1} \leqslant v<N_{1}+N_{2}$. This implies $48 \leqslant N_{2}<N_{3}=48$, which is a contradiction.
(b) Consider the denominations
$$
C_{1}=3, \quad C_{2}=6, \quad C_{3}=12, \quad C_{4}=24, \quad N_{1}=47, \quad N_{2}=48, \quad N_{3}=49
$$
These satisfy the conditions of the problem, with $C=45<N_{1}$.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 3",
"tier": "T3",
"year": "2018"
}
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Any two amounts that can be obtained using some (or possible no) coins are different, and they are multiples of 3 since each of the coin denominations is. Hence any two such amounts differ by at least 3 . Since $N_{3}-N_{1}=2$, it follows that any two hands using one note and some coins each have a different value (and the same is true for hands using more than one note, since at least one note appears at least twice in any two such
## BxMO 2018: Problems and Solutions
hands). Finally, $N_{3}+C<N_{1}+N_{2}$, and hence any hand using one note and some coins has a different value from any hand using two notes and some coins. Hence there is no price that the tourist can pay for in more than one way.
|
proof
|
Yes
|
Incomplete
|
proof
|
Combinatorics
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Any two amounts that can be obtained using some (or possible no) coins are different, and they are multiples of 3 since each of the coin denominations is. Hence any two such amounts differ by at least 3 . Since $N_{3}-N_{1}=2$, it follows that any two hands using one note and some coins each have a different value (and the same is true for hands using more than one note, since at least one note appears at least twice in any two such
## BxMO 2018: Problems and Solutions
hands). Finally, $N_{3}+C<N_{1}+N_{2}$, and hence any hand using one note and some coins has a different value from any hand using two notes and some coins. Hence there is no price that the tourist can pay for in more than one way.
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 1",
"tier": "T3",
"year": "2018"
}
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Suppose to the contrary that there are two hands of coins and notes that sum to the same amount. Up to removing coins or notes that appear in both of these hands to obtain two smaller hands summing to the same amount, we may assume that no coin or note appears in both of these hands. Notice that all the denominations, except for $N_{1} \equiv-1(\bmod 3)$ and $N_{3} \equiv 1(\bmod 3)$, are divisible by 3 . Hence, if $N_{1}$ appears in one hand, $N_{3}$ must appear in the same hand, and vice versa. Hence these two hands are two disjoint subsets of $\left\{C_{1}, C_{2}, C_{3}, C_{4}, N_{2}, N_{1}+N_{3}\right\}=\{3,6,12,24,48,96\}=3\{1,2,4,8,16,32\}$ that sum to the same amount, which contradicts the uniqueness of the binary expansion of these two amounts. Hence there is no price that the tourist can pay for in more than one way.
Remark. It is natural to ask whether there are other choices of coins and notes with $N_{3}=49$ in (b) that force the tourist to leave the shop empty-handed. It turns out that the choice in (b) is unique. The argument runs as follows: the inequality $N_{2}+N_{3} \geqslant 96$ implies that $N_{2}=47$ or $N_{2}=48$. Further, strengthening the bound in (a), we must have
$$
\left(N_{2}+N_{3}+C\right)-\left(N_{1}+N_{2}\right)+1 \geqslant 48 \quad \Longrightarrow \quad C \geqslant 47+N_{1}-N_{3}=N_{1}-2
$$
But $C<N_{1}$, and so $C=N_{1}-1$ or $C=N_{1}-2$. If $N_{2}=47$, then $C=N_{1}-2$ implies $N_{1}+N_{2}=N_{3}+C$, a contradiction. Thus $C=N_{1}-1$ if $N_{2}=47$, and, similarly, $C=N_{1}-2$ if $N_{2}=48$.
In the first case, $N_{3}+C=48+N_{1}=N_{1}+N_{2}+1$ (*). Hence, by the argument in (a), all the $N_{2}=47$ values $v$ with $N_{1} \leqslant v<N_{1}+N_{2}$ can be represented (using one note and some coins). Now $C_{1} \neq 1$ by (*). Since $N_{1}+1$ can be represented, it follows that $N_{2}=N_{1}+1$ and hence $N_{1}=46$. Then $N_{3}=N_{2}+2=N_{1}+3$ implies that $C_{1}>3$. Considering $50=N_{1}+4$ yields $C_{1}=4$. Now $53=N_{3}+4=N_{2}+6,52=N_{2}+5=N_{1}+6$. Hence $C_{2}=6$ is not possible, so $C_{2}=5$. Then $51=N_{2}+C_{1}=N_{1}+C_{2}$, a contradiction.
In the second case, notice that $N_{2}=48$ implies, by the argument in (a), that all the $N_{2}=48$ values $v$ with $N_{1} \leqslant v<N_{1}+N_{2}$ can be represented. Clearly, $N_{1}+1$ can only be represented if $C_{1}=1$ or $N_{2}=N_{1}+1$. In the former case, $N_{3}=N_{2}+C_{1}$, a contradiction. Hence $N_{1}=N_{2}-1=47$, and so $C=45$. Considering $N_{1}+3, \ldots, N_{1}+12$ then successively yields $C_{1}=3, C_{2}=6, C_{3}=12$. Finally, $C_{4}=C-C_{1}-C_{2}-C_{3}=24$, completing the proof.
One might also ask about other choices of coins and notes, with different values of $N_{3}$, forcing the tourist to leave the shop empty-handed. Numerically, it is easy to tabulate all such choices of coins and notes for small $N_{3}$ :
| $C_{1}$ | $C_{2}$ | $C_{3}$ | $C_{4}$ | $N_{1}$ | $N_{2}$ | $N_{3}$ |
| :---: | :---: | :---: | :---: | :---: | :---: | :---: |
| 3 | 6 | 12 | 24 | 47 | 48 | 49 |
| 1 | 6 | 12 | 24 | 46 | 48 | 50 |
| 3 | 6 | 12 | 24 | 46 | 48 | 50 |
| 3 | 6 | 12 | 24 | 48 | 49 | 50 |
| 3 | 6 | 12 | 25 | 48 | 49 | 50 |
| 1 | 6 | 12 | 24 | 47 | 49 | 51 |
| 1 | 6 | 12 | 25 | 47 | 49 | 51 |
| 3 | 6 | 12 | 24 | 49 | 50 | 51 |
| 3 | 6 | 12 | 25 | 49 | 50 | 51 |
| 3 | 6 | 12 | 26 | 49 | 50 | 51 |
| 3 | 6 | 13 | 25 | 49 | 50 | 51 |
## BxMO 2018: Problems and Solutions
#
|
proof
|
Yes
|
Yes
|
proof
|
Combinatorics
|
In the land of Heptanomisma, four different coins and three different banknotes are used, and their denominations are seven different (non-zero) natural numbers. The denomination of the smallest banknote is greater than the sum of the denominations of the four different coins. A tourist has exactly one coin of each denomination and exactly one banknote of each denomination, but he cannot afford the book on numismatics he wishes to buy. However, the mathematically inclined shopkeeper offers to sell the book to the tourist at a price of his choosing, provided that he can pay this price in more than one way.
(The tourist can pay a price in more than one way if there are two different subsets of his coins and notes, the denominations of which both add up to this price.)
(a) Prove that the tourist can purchase the book if the denomination of each banknote is smaller than 49.
(b) Show that the tourist may have to leave the shop empty-handed if the denomination of the largest banknote is 49.
(Stijn Cambie, Belgium)
#
|
. Suppose to the contrary that there are two hands of coins and notes that sum to the same amount. Up to removing coins or notes that appear in both of these hands to obtain two smaller hands summing to the same amount, we may assume that no coin or note appears in both of these hands. Notice that all the denominations, except for $N_{1} \equiv-1(\bmod 3)$ and $N_{3} \equiv 1(\bmod 3)$, are divisible by 3 . Hence, if $N_{1}$ appears in one hand, $N_{3}$ must appear in the same hand, and vice versa. Hence these two hands are two disjoint subsets of $\left\{C_{1}, C_{2}, C_{3}, C_{4}, N_{2}, N_{1}+N_{3}\right\}=\{3,6,12,24,48,96\}=3\{1,2,4,8,16,32\}$ that sum to the same amount, which contradicts the uniqueness of the binary expansion of these two amounts. Hence there is no price that the tourist can pay for in more than one way.
Remark. It is natural to ask whether there are other choices of coins and notes with $N_{3}=49$ in (b) that force the tourist to leave the shop empty-handed. It turns out that the choice in (b) is unique. The argument runs as follows: the inequality $N_{2}+N_{3} \geqslant 96$ implies that $N_{2}=47$ or $N_{2}=48$. Further, strengthening the bound in (a), we must have
$$
\left(N_{2}+N_{3}+C\right)-\left(N_{1}+N_{2}\right)+1 \geqslant 48 \quad \Longrightarrow \quad C \geqslant 47+N_{1}-N_{3}=N_{1}-2
$$
But $C<N_{1}$, and so $C=N_{1}-1$ or $C=N_{1}-2$. If $N_{2}=47$, then $C=N_{1}-2$ implies $N_{1}+N_{2}=N_{3}+C$, a contradiction. Thus $C=N_{1}-1$ if $N_{2}=47$, and, similarly, $C=N_{1}-2$ if $N_{2}=48$.
In the first case, $N_{3}+C=48+N_{1}=N_{1}+N_{2}+1$ (*). Hence, by the argument in (a), all the $N_{2}=47$ values $v$ with $N_{1} \leqslant v<N_{1}+N_{2}$ can be represented (using one note and some coins). Now $C_{1} \neq 1$ by (*). Since $N_{1}+1$ can be represented, it follows that $N_{2}=N_{1}+1$ and hence $N_{1}=46$. Then $N_{3}=N_{2}+2=N_{1}+3$ implies that $C_{1}>3$. Considering $50=N_{1}+4$ yields $C_{1}=4$. Now $53=N_{3}+4=N_{2}+6,52=N_{2}+5=N_{1}+6$. Hence $C_{2}=6$ is not possible, so $C_{2}=5$. Then $51=N_{2}+C_{1}=N_{1}+C_{2}$, a contradiction.
In the second case, notice that $N_{2}=48$ implies, by the argument in (a), that all the $N_{2}=48$ values $v$ with $N_{1} \leqslant v<N_{1}+N_{2}$ can be represented. Clearly, $N_{1}+1$ can only be represented if $C_{1}=1$ or $N_{2}=N_{1}+1$. In the former case, $N_{3}=N_{2}+C_{1}$, a contradiction. Hence $N_{1}=N_{2}-1=47$, and so $C=45$. Considering $N_{1}+3, \ldots, N_{1}+12$ then successively yields $C_{1}=3, C_{2}=6, C_{3}=12$. Finally, $C_{4}=C-C_{1}-C_{2}-C_{3}=24$, completing the proof.
One might also ask about other choices of coins and notes, with different values of $N_{3}$, forcing the tourist to leave the shop empty-handed. Numerically, it is easy to tabulate all such choices of coins and notes for small $N_{3}$ :
| $C_{1}$ | $C_{2}$ | $C_{3}$ | $C_{4}$ | $N_{1}$ | $N_{2}$ | $N_{3}$ |
| :---: | :---: | :---: | :---: | :---: | :---: | :---: |
| 3 | 6 | 12 | 24 | 47 | 48 | 49 |
| 1 | 6 | 12 | 24 | 46 | 48 | 50 |
| 3 | 6 | 12 | 24 | 46 | 48 | 50 |
| 3 | 6 | 12 | 24 | 48 | 49 | 50 |
| 3 | 6 | 12 | 25 | 48 | 49 | 50 |
| 1 | 6 | 12 | 24 | 47 | 49 | 51 |
| 1 | 6 | 12 | 25 | 47 | 49 | 51 |
| 3 | 6 | 12 | 24 | 49 | 50 | 51 |
| 3 | 6 | 12 | 25 | 49 | 50 | 51 |
| 3 | 6 | 12 | 26 | 49 | 50 | 51 |
| 3 | 6 | 13 | 25 | 49 | 50 | 51 |
## BxMO 2018: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
(a) Solution 1. Since $F$ is the midpoint of $[A H]$ and $[B P], B H P A$ is a parallelogram. Similarly, $C A Q H$ is a parallelogram, too. Let $O$ denote the circumcentre of triangle $A B C$ and let $R$ be the reflection of $A$ in $O$, so that $R$ lies on the circumcircle of $A B C$. Since $[A R]$ is a diameter of the circumcircle of $A B C, C R \perp A C$. But $B H \perp A C$, and so $C R \| B H$. Similarly, $B R \| C H$, and thus $B R C H$ is a parallelogram. Since $B H P A$ is a parallelogram, $R C P A$ is a parallelogram, too. In particular, the midpoint $E$ of its diagonal $[A C]$ lies on $[P R]$. Similarly, $D$ lies on $[Q R]$, and so $P E$ and $Q D$ meet at $R$.
Remark. Since $A P$ is parallel to the altitude $B H, A P \perp A C$. Further, $P H \| A B$ since $A P H B$ is a parallelogram. But $C H \perp A B$, so $P H \perp C H$. Hence $A P C H$ is cyclic. Similarly, $A H B Q$ is cyclic, too.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
(a) Solution 1. Since $F$ is the midpoint of $[A H]$ and $[B P], B H P A$ is a parallelogram. Similarly, $C A Q H$ is a parallelogram, too. Let $O$ denote the circumcentre of triangle $A B C$ and let $R$ be the reflection of $A$ in $O$, so that $R$ lies on the circumcircle of $A B C$. Since $[A R]$ is a diameter of the circumcircle of $A B C, C R \perp A C$. But $B H \perp A C$, and so $C R \| B H$. Similarly, $B R \| C H$, and thus $B R C H$ is a parallelogram. Since $B H P A$ is a parallelogram, $R C P A$ is a parallelogram, too. In particular, the midpoint $E$ of its diagonal $[A C]$ lies on $[P R]$. Similarly, $D$ lies on $[Q R]$, and so $P E$ and $Q D$ meet at $R$.
Remark. Since $A P$ is parallel to the altitude $B H, A P \perp A C$. Further, $P H \| A B$ since $A P H B$ is a parallelogram. But $C H \perp A B$, so $P H \perp C H$. Hence $A P C H$ is cyclic. Similarly, $A H B Q$ is cyclic, too.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Let $O$ denote the circumcentre of triangle $A B C$. By construction, $D O \perp A B$ and $F E \| C H \perp A B$, and so $D O \| E F$. Similarly, $O E \| D F$, so $D O E F$ is a parallelogram. Since $F$ is the midpoint of $[A H]$ and $[B P], B H P A$ is a parallelogram, and so $A P\|B H\| D F \| O E$ and $|A P|=|B H|=2|D F|=2|O E|$. Extending this argument, it follows that triangles $D O E$ and $Q A P$ and have pairwise parallel sides and the ratio of their sides is $1: 2$. Hence there is a homothety with ratio 2 mapping $D O E$ to $Q A P$. The centre $R$ of this homothety is the reflection of $A$ in $O$, which lies on the circumcircle of $A B C$, and also the intersection of lines $P E, Q D$, and $A O$.
## BxMO 2018: Problems and Solutions
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Let $O$ denote the circumcentre of triangle $A B C$. By construction, $D O \perp A B$ and $F E \| C H \perp A B$, and so $D O \| E F$. Similarly, $O E \| D F$, so $D O E F$ is a parallelogram. Since $F$ is the midpoint of $[A H]$ and $[B P], B H P A$ is a parallelogram, and so $A P\|B H\| D F \| O E$ and $|A P|=|B H|=2|D F|=2|O E|$. Extending this argument, it follows that triangles $D O E$ and $Q A P$ and have pairwise parallel sides and the ratio of their sides is $1: 2$. Hence there is a homothety with ratio 2 mapping $D O E$ to $Q A P$. The centre $R$ of this homothety is the reflection of $A$ in $O$, which lies on the circumcircle of $A B C$, and also the intersection of lines $P E, Q D$, and $A O$.
## BxMO 2018: Problems and Solutions
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Since $F$ is the midpoint of $[B P]$ and $[C Q], B C P Q$ is a parallelogram. As $D$ and $E$ are the respective midpoints of $[A B]$ and $[A C]$, it follows that $P Q\|B C\| D E$ and $|P Q|=|B C|=2|D E|$. Let $R$ denote the intersection of $P E$ and $Q D$. Then $D$ and $E$ are the midpoints of $[R Q]$ and $[R P]$, respectively. In particular, $B R A Q$ is a parallelogram. But $F$ is the midpoint of $[A H]$ and $[C Q]$, so $A Q C H$ is a parallelogram. Hence $B R C H$ is a parallelogram, too, so $R$ is the reflection of $H$ in the midpoint of $[B C]$, which is well-known to lie on the circumcircle of $A B C$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Since $F$ is the midpoint of $[B P]$ and $[C Q], B C P Q$ is a parallelogram. As $D$ and $E$ are the respective midpoints of $[A B]$ and $[A C]$, it follows that $P Q\|B C\| D E$ and $|P Q|=|B C|=2|D E|$. Let $R$ denote the intersection of $P E$ and $Q D$. Then $D$ and $E$ are the midpoints of $[R Q]$ and $[R P]$, respectively. In particular, $B R A Q$ is a parallelogram. But $F$ is the midpoint of $[A H]$ and $[C Q]$, so $A Q C H$ is a parallelogram. Hence $B R C H$ is a parallelogram, too, so $R$ is the reflection of $H$ in the midpoint of $[B C]$, which is well-known to lie on the circumcircle of $A B C$.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 3",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Since $F$ is the midpoint of $[B P]$ and $[C Q], B C P Q$ is a parallelogram. Let $R$ be the image of $A$ under the translation that accordingly maps $P, Q$ onto $C, B$, respectively. By construction, $A P C R$ is a parallelogram, and so the midpoint $E$ of $[A C]$ lies on its other diagonal $P R$. Similarly, $D$ lies on $Q R$, and so $R$ is the intersection of $P E$ and $Q D$. Moreover, $F$ is the midpoint of $[A H]$ and $[B P]$, so $A P B H$ is a parallelogram. Hence $C R\|A P\| B H \perp A C$, so $\angle A C R=90^{\circ}$. Similarly, $\angle A B R=90^{\circ}$, so $A B R C$ is cyclic, and thus $R$ lies on the circumcircle of $A B C$, as required.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Since $F$ is the midpoint of $[B P]$ and $[C Q], B C P Q$ is a parallelogram. Let $R$ be the image of $A$ under the translation that accordingly maps $P, Q$ onto $C, B$, respectively. By construction, $A P C R$ is a parallelogram, and so the midpoint $E$ of $[A C]$ lies on its other diagonal $P R$. Similarly, $D$ lies on $Q R$, and so $R$ is the intersection of $P E$ and $Q D$. Moreover, $F$ is the midpoint of $[A H]$ and $[B P]$, so $A P B H$ is a parallelogram. Hence $C R\|A P\| B H \perp A C$, so $\angle A C R=90^{\circ}$. Similarly, $\angle A B R=90^{\circ}$, so $A B R C$ is cyclic, and thus $R$ lies on the circumcircle of $A B C$, as required.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 4",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Let $M$ be the midpoint of $[B C]$. Note that triangle $P H Q$ is the reflection of triangle $B A C$ in $F$. By construction, the sides of triangle $D E M$ are parallel to those of $C B A$, and hence $D E\|B C\| Q P$, and, similarly, $D M \| Q H$ and $E M \| P H$. Hence triangles $Q H P$ and $D M E$ have pairwise parallel sides and the ratio of their sides is $2: 1$. This implies that there is homothety mapping one onto the other. Its centre is the intersection of $Q D$ and $P E$ and is also the reflection of $H$ in $M$, which is well-known to lie on the circumcircle of $A B C$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Let $M$ be the midpoint of $[B C]$. Note that triangle $P H Q$ is the reflection of triangle $B A C$ in $F$. By construction, the sides of triangle $D E M$ are parallel to those of $C B A$, and hence $D E\|B C\| Q P$, and, similarly, $D M \| Q H$ and $E M \| P H$. Hence triangles $Q H P$ and $D M E$ have pairwise parallel sides and the ratio of their sides is $2: 1$. This implies that there is homothety mapping one onto the other. Its centre is the intersection of $Q D$ and $P E$ and is also the reflection of $H$ in $M$, which is well-known to lie on the circumcircle of $A B C$.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 5",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Let $G$ be the centroid of $A B C$, and let $\mathscr{H}$ be the well-known homothety with ratio -2 and centre $G$ that maps the nine-point circle of $A B C$ onto its circumcircle. Under $\mathscr{H}, D \mapsto C, E \mapsto B$. Denote by $R$ the image of the Euler point $F$ under $\mathscr{H}$; by construction, $R$ lies on the circumcircle of $A B C$. Further, $\overrightarrow{D F}=\frac{1}{2} \overrightarrow{R C}$ and $\overrightarrow{E F}=\frac{1}{2} \overrightarrow{R B}$. Hence the points of intersection of the pairs of lines $B F, R E$ and $C F, R D$ are $P$ and $Q$, respectively. This completes the proof.
## BxMO 2018: Problems and Solutions
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Let $G$ be the centroid of $A B C$, and let $\mathscr{H}$ be the well-known homothety with ratio -2 and centre $G$ that maps the nine-point circle of $A B C$ onto its circumcircle. Under $\mathscr{H}, D \mapsto C, E \mapsto B$. Denote by $R$ the image of the Euler point $F$ under $\mathscr{H}$; by construction, $R$ lies on the circumcircle of $A B C$. Further, $\overrightarrow{D F}=\frac{1}{2} \overrightarrow{R C}$ and $\overrightarrow{E F}=\frac{1}{2} \overrightarrow{R B}$. Hence the points of intersection of the pairs of lines $B F, R E$ and $C F, R D$ are $P$ and $Q$, respectively. This completes the proof.
## BxMO 2018: Problems and Solutions
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 6",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Let $M, N, K$ denote the respective midpoints of $[B C],[D E],[P Q]$. Thus the intersection $R$ of $P E$ and $Q D$ is the reflection of $K$ in $N$. Under reflection in $F, H \mapsto A$ and $M \mapsto K$. Hence $A K H M$ is a parallelogram, and so $\overrightarrow{M N}=\frac{1}{2} \overrightarrow{M A}=\frac{1}{2} \overrightarrow{H K}$. Hence the intersection of $K N$ and $H M$ is $R$, and $R$ is the reflection of $H$ in $M$, which is well-known to lie on the circumcircle of $A B C$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Let $M, N, K$ denote the respective midpoints of $[B C],[D E],[P Q]$. Thus the intersection $R$ of $P E$ and $Q D$ is the reflection of $K$ in $N$. Under reflection in $F, H \mapsto A$ and $M \mapsto K$. Hence $A K H M$ is a parallelogram, and so $\overrightarrow{M N}=\frac{1}{2} \overrightarrow{M A}=\frac{1}{2} \overrightarrow{H K}$. Hence the intersection of $K N$ and $H M$ is $R$, and $R$ is the reflection of $H$ in $M$, which is well-known to lie on the circumcircle of $A B C$.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 7",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Take Cartesian coordinates $B(0,0), C(1,0), A(a, b), H(a, c)$. Then the coordinates of $D, E, F, P, Q$ are successively found to be
$$
D\left(\frac{a}{2}, \frac{b}{2}\right), \quad E\left(\frac{1+a}{2}, \frac{b}{2}\right), \quad F\left(a, \frac{b+c}{2}\right), \quad P(2 a, b+c), \quad Q(2 a-1, b+c)
$$
Hence the coordinates of the intersection $R(x, y)$ of $Q D$ and $P E$ satisfy
$$
\frac{y-\frac{b}{2}}{b+c-\frac{b}{2}}=\frac{x-\frac{a}{2}}{2 a-1-\frac{a}{2}}=\frac{x-\frac{a+1}{2}}{2 a-\frac{a+1}{2}} \quad \Longrightarrow \quad R(1-a,-c) .
$$
Hence $R$ is the reflection of $H$ in the midpoint $M\left(\frac{1}{2}, 0\right)$ of $[B C]$, and so lies on the circumcircle of $A B C$.
(b) Solution 1. Lines $A F$ and $Q E$ are medians of triangle $C A Q$, and so, by the properties of the centroid, intersect at a point $S$ of $[A F]$ such that $|A S|=2|S F|$. Similarly, lines $A F$ and $P D$ are medians of triangle $B A P$, and so intersect at the same point $S$. Hence $P D$ and $Q E$ intersect on $[A H]$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. Take Cartesian coordinates $B(0,0), C(1,0), A(a, b), H(a, c)$. Then the coordinates of $D, E, F, P, Q$ are successively found to be
$$
D\left(\frac{a}{2}, \frac{b}{2}\right), \quad E\left(\frac{1+a}{2}, \frac{b}{2}\right), \quad F\left(a, \frac{b+c}{2}\right), \quad P(2 a, b+c), \quad Q(2 a-1, b+c)
$$
Hence the coordinates of the intersection $R(x, y)$ of $Q D$ and $P E$ satisfy
$$
\frac{y-\frac{b}{2}}{b+c-\frac{b}{2}}=\frac{x-\frac{a}{2}}{2 a-1-\frac{a}{2}}=\frac{x-\frac{a+1}{2}}{2 a-\frac{a+1}{2}} \quad \Longrightarrow \quad R(1-a,-c) .
$$
Hence $R$ is the reflection of $H$ in the midpoint $M\left(\frac{1}{2}, 0\right)$ of $[B C]$, and so lies on the circumcircle of $A B C$.
(b) Solution 1. Lines $A F$ and $Q E$ are medians of triangle $C A Q$, and so, by the properties of the centroid, intersect at a point $S$ of $[A F]$ such that $|A S|=2|S F|$. Similarly, lines $A F$ and $P D$ are medians of triangle $B A P$, and so intersect at the same point $S$. Hence $P D$ and $Q E$ intersect on $[A H]$.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 8",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. By construction, a homothety with ratio 2 centred at $A$ maps $[D F]$ and $[E F]$ onto $[B H]$ and $[C H]$, respectively, which are mapped in turn onto $[P A]$ and $[Q A]$ under reflection in $F$ by the results of (a). The composition of these maps is a homothety with centre $S$ and ratio -2 that maps $D$ and $E$ onto $P$ and $Q$, respectively. Hence $P D$ and $Q E$ intersect at $S$. Since this homothety leaves $A H$ invariant, $S$ lies on this line. Since the homothety has negative ratio, the centre lies on the line segment $[A F]$, completing the proof.
Remark. This is a projective result: triangles $D F E$ and $P A Q$ are in axial perspective (at $\infty$ ). Hence, by Desargues' theorem, they are in central perspective, and so lines $P D, Q E$, and $A F$ are concurrent.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. By construction, a homothety with ratio 2 centred at $A$ maps $[D F]$ and $[E F]$ onto $[B H]$ and $[C H]$, respectively, which are mapped in turn onto $[P A]$ and $[Q A]$ under reflection in $F$ by the results of (a). The composition of these maps is a homothety with centre $S$ and ratio -2 that maps $D$ and $E$ onto $P$ and $Q$, respectively. Hence $P D$ and $Q E$ intersect at $S$. Since this homothety leaves $A H$ invariant, $S$ lies on this line. Since the homothety has negative ratio, the centre lies on the line segment $[A F]$, completing the proof.
Remark. This is a projective result: triangles $D F E$ and $P A Q$ are in axial perspective (at $\infty$ ). Hence, by Desargues' theorem, they are in central perspective, and so lines $P D, Q E$, and $A F$ are concurrent.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. The intersection $S$ of $P D$ and $Q E$ is the centroid of triangle $P Q R$, where $R$ is the intersection of $P E$ and $Q D$, as in (a). Hence, if $M, N, K$ denote the respective midpoints of $[B C],[D E],[P Q]$, then, by part (a), $\overrightarrow{K S}=2 \overrightarrow{S N}$. Moreover, since $K$ is the reflection of $M$ in $F, d(K, A H)=d(M, A H)=2 d(N, A H)$. It follows that $S$ lies on $A H$; since $K$ and $R$ lie on either side of $A M, S$ lies on [AH].
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. The intersection $S$ of $P D$ and $Q E$ is the centroid of triangle $P Q R$, where $R$ is the intersection of $P E$ and $Q D$, as in (a). Hence, if $M, N, K$ denote the respective midpoints of $[B C],[D E],[P Q]$, then, by part (a), $\overrightarrow{K S}=2 \overrightarrow{S N}$. Moreover, since $K$ is the reflection of $M$ in $F, d(K, A H)=d(M, A H)=2 d(N, A H)$. It follows that $S$ lies on $A H$; since $K$ and $R$ lie on either side of $A M, S$ lies on [AH].
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 3",
"tier": "T3",
"year": "2018"
}
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. In Cartesian coordinates and using the results of (a), the coordinates of the intersection $S\left(x^{\prime}, y^{\prime}\right)$ of $Q E$ and $P D$ satisfy
$$
\frac{y^{\prime}-\frac{b}{2}}{b+c-\frac{b}{2}}=\frac{x^{\prime}-\frac{a}{2}}{2 a-\frac{a}{2}}=\frac{x^{\prime}-\frac{a+1}{2}}{2 a-1-\frac{a+1}{2}}
$$
Hence $x^{\prime}=a$, so $S$ lies on line $A H$. Further, $y^{\prime}=\frac{1}{3}(2 b+c)$. Without loss of generality, $b>0$. Then $c>0$ by definition, and so $c<y^{\prime}<b$ or $c>y^{\prime}>b$. Hence $S$ lies on line segment $[A H]$.
Remark 1. Solutions 1 and 2 for part (b) have not used the fact that $H$ is the orthocentre of triangle $A B C$, and therefore show that the result of (b) remains true if $H$ is replaced with a general point $X$. The first part of the problem is in some sense independent of $H$, too. The argument of solutions 3,5 , and 7 for part (a) can be extended to yield the following result:
Let $A B C$ be a triangle, and let $X$ be a point of the plane. Let $D, E$, and $Y$ denote the respective midpoints of $[A B],[A C]$, and $[A X]$. The reflections of $B$ and $C$ in $Y$ are $P$ and $Q$, respectively. Lines $P E$ and $Q D$ intersect on the circumcircle $\omega$ of $A B C$ if and only if $X$ lies on the reflection of $\omega$ in $[B C]$.
## BxMO 2018: Problems and Solutions
Remark 2. The intersection points of $P E, Q D$ and $P D, Q E$ are not well-defined if $P, Q, D, E$ lie on a line. In the notation of the analytic solution, this happens when $\frac{b}{2}=b+c$, i.e. $c=-\frac{b}{2}$. Computing the coordinates of $H$ explicitly using $B H \perp A C$ yields $c=a(1-a) / b$, and so $P, Q, D, E$ are aligned if and only if $b^{2}=2 a(a-1)$, which is the equation of a hyperbola passing through $B$ and $C$. (These triangles have an obtuse angle, so this configuration cannot appear for acute-angled triangles.)
## BxMO 2018: Problems and Solutions
#
|
proof
|
Yes
|
Incomplete
|
proof
|
Geometry
|
Let $A B C$ be a triangle with orthocentre $H$, and let $D, E$, and $F$ denote the respective midpoints of line segments $A B, A C$, and $A H$. The reflections of $B$ and $C$ in $F$ are $P$ and $Q$, respectively.
(a) Show that lines $P E$ and $Q D$ intersect on the circumcircle of triangle $A B C$.
(b) Prove that lines $P D$ and $Q E$ intersect on line segment $A H$.
(Merlijn Staps, the Netherlands)
#
|
. In Cartesian coordinates and using the results of (a), the coordinates of the intersection $S\left(x^{\prime}, y^{\prime}\right)$ of $Q E$ and $P D$ satisfy
$$
\frac{y^{\prime}-\frac{b}{2}}{b+c-\frac{b}{2}}=\frac{x^{\prime}-\frac{a}{2}}{2 a-\frac{a}{2}}=\frac{x^{\prime}-\frac{a+1}{2}}{2 a-1-\frac{a+1}{2}}
$$
Hence $x^{\prime}=a$, so $S$ lies on line $A H$. Further, $y^{\prime}=\frac{1}{3}(2 b+c)$. Without loss of generality, $b>0$. Then $c>0$ by definition, and so $c<y^{\prime}<b$ or $c>y^{\prime}>b$. Hence $S$ lies on line segment $[A H]$.
Remark 1. Solutions 1 and 2 for part (b) have not used the fact that $H$ is the orthocentre of triangle $A B C$, and therefore show that the result of (b) remains true if $H$ is replaced with a general point $X$. The first part of the problem is in some sense independent of $H$, too. The argument of solutions 3,5 , and 7 for part (a) can be extended to yield the following result:
Let $A B C$ be a triangle, and let $X$ be a point of the plane. Let $D, E$, and $Y$ denote the respective midpoints of $[A B],[A C]$, and $[A X]$. The reflections of $B$ and $C$ in $Y$ are $P$ and $Q$, respectively. Lines $P E$ and $Q D$ intersect on the circumcircle $\omega$ of $A B C$ if and only if $X$ lies on the reflection of $\omega$ in $[B C]$.
## BxMO 2018: Problems and Solutions
Remark 2. The intersection points of $P E, Q D$ and $P D, Q E$ are not well-defined if $P, Q, D, E$ lie on a line. In the notation of the analytic solution, this happens when $\frac{b}{2}=b+c$, i.e. $c=-\frac{b}{2}$. Computing the coordinates of $H$ explicitly using $B H \perp A C$ yields $c=a(1-a) / b$, and so $P, Q, D, E$ are aligned if and only if $b^{2}=2 a(a-1)$, which is the equation of a hyperbola passing through $B$ and $C$. (These triangles have an obtuse angle, so this configuration cannot appear for acute-angled triangles.)
## BxMO 2018: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 4",
"tier": "T3",
"year": "2018"
}
|
An integer $n \geqslant 2$ having exactly $s$ positive divisors $1=d_{1}<d_{2}<\cdots<d_{s}=n$ is said to be good if there exists an integer $k$, with $2 \leqslant k \leqslant s$, such that $d_{k}>1+d_{1}+\cdots+d_{k-1}$. An integer $n \geqslant 2$ is said to be bad if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than 2 , there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
(Gerhard Woeginger, Luxembourg)
#
|
(a) Solution 1. We note that $n=2^{m}$ has $m+1$ divisors, $d_{k}=2^{k-1}$ for $1 \leqslant k \leqslant m+1$. Thus
$$
1+d_{1}+\cdots+d_{k-1}=1+\left(2^{k-1}-1\right)=2^{k-1}=d_{k}
$$
for each $k \geqslant 2$, and hence each power of 2 is a bad integer. This exhibits infinitely many bad integers.
Remark. It is true more generally that
If $n=2^{r} m$, where $m$ is a product of (odd) primes each less than $2^{r+1}$, then $n$ is bad.
This is an immediate corollary of the previous result and the following observation:
If $n=2^{r} m$ is bad, where $m$ is odd, then so is $p n$ for any odd prime $p<2^{r+1}$.
Proof. Let $D_{K}>1$ be a divisor of $p n$, so $D_{K}=p$ or $D_{K}=d_{k}$ or $D_{K}=p d_{k}$, where $d_{k}>1$ is a divisor of $n$. In the first case, observe that there exists $t<r+1$ such that $2^{t}<p<2^{t+1}$ by assumption. Then $\left\{1,2, \ldots, 2^{t}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$, and so
$$
D_{K}=p<2^{t+1}=1+\left(1+2+\cdots+2^{t}\right) \leqslant 1+D_{1}+\cdots+D_{K-1}
$$
In the final case, $\left\{1,2, \ldots, 2^{t}, p d_{1}, \ldots, p d_{k-1}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$, and so
$$
\begin{aligned}
D_{K} & =p d_{k} \leqslant p\left(1+d_{1}+\cdots+d_{k-1}\right)=p+p d_{1}+\cdots+p d_{k} \\
& <2^{t+1}+p d_{1}+\cdots+p d_{k-1}=1+\left(1+\cdots+2^{t}\right)+p d_{1}+\cdots+p d_{k-1}<1+\left(D_{1}+\cdots+D_{K-1}\right)
\end{aligned}
$$
In the second case, $\left\{d_{1}, \ldots, d_{k-1}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$ immediately implies the required inequality, and so $p n$ is indeed bad.
This result is weak, however: only 57931 (6.99\%) of the 829157 bad numbers not larger than $10^{7}$ are of this form.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
An integer $n \geqslant 2$ having exactly $s$ positive divisors $1=d_{1}<d_{2}<\cdots<d_{s}=n$ is said to be good if there exists an integer $k$, with $2 \leqslant k \leqslant s$, such that $d_{k}>1+d_{1}+\cdots+d_{k-1}$. An integer $n \geqslant 2$ is said to be bad if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than 2 , there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
(Gerhard Woeginger, Luxembourg)
#
|
(a) Solution 1. We note that $n=2^{m}$ has $m+1$ divisors, $d_{k}=2^{k-1}$ for $1 \leqslant k \leqslant m+1$. Thus
$$
1+d_{1}+\cdots+d_{k-1}=1+\left(2^{k-1}-1\right)=2^{k-1}=d_{k}
$$
for each $k \geqslant 2$, and hence each power of 2 is a bad integer. This exhibits infinitely many bad integers.
Remark. It is true more generally that
If $n=2^{r} m$, where $m$ is a product of (odd) primes each less than $2^{r+1}$, then $n$ is bad.
This is an immediate corollary of the previous result and the following observation:
If $n=2^{r} m$ is bad, where $m$ is odd, then so is $p n$ for any odd prime $p<2^{r+1}$.
Proof. Let $D_{K}>1$ be a divisor of $p n$, so $D_{K}=p$ or $D_{K}=d_{k}$ or $D_{K}=p d_{k}$, where $d_{k}>1$ is a divisor of $n$. In the first case, observe that there exists $t<r+1$ such that $2^{t}<p<2^{t+1}$ by assumption. Then $\left\{1,2, \ldots, 2^{t}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$, and so
$$
D_{K}=p<2^{t+1}=1+\left(1+2+\cdots+2^{t}\right) \leqslant 1+D_{1}+\cdots+D_{K-1}
$$
In the final case, $\left\{1,2, \ldots, 2^{t}, p d_{1}, \ldots, p d_{k-1}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$, and so
$$
\begin{aligned}
D_{K} & =p d_{k} \leqslant p\left(1+d_{1}+\cdots+d_{k-1}\right)=p+p d_{1}+\cdots+p d_{k} \\
& <2^{t+1}+p d_{1}+\cdots+p d_{k-1}=1+\left(1+\cdots+2^{t}\right)+p d_{1}+\cdots+p d_{k-1}<1+\left(D_{1}+\cdots+D_{K-1}\right)
\end{aligned}
$$
In the second case, $\left\{d_{1}, \ldots, d_{k-1}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$ immediately implies the required inequality, and so $p n$ is indeed bad.
This result is weak, however: only 57931 (6.99\%) of the 829157 bad numbers not larger than $10^{7}$ are of this form.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2018"
}
|
An integer $n \geqslant 2$ having exactly $s$ positive divisors $1=d_{1}<d_{2}<\cdots<d_{s}=n$ is said to be good if there exists an integer $k$, with $2 \leqslant k \leqslant s$, such that $d_{k}>1+d_{1}+\cdots+d_{k-1}$. An integer $n \geqslant 2$ is said to be bad if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than 2 , there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
(Gerhard Woeginger, Luxembourg)
#
|
. We claim that $n=m$ ! is bad for each integer $m \geqslant 2$. The proof proceeds by induction on $m$, the case $m=2$ being clear. If $D_{K}>1$ is a divisor of $m$ !, then $D_{K}=d_{k}$ or $D_{K}=q$ or $D_{K}=q d_{k}$, where $d_{k}>1$ is a divisor of $(m-1)$ ! and $q>1$ is a divisor of $m$. In the first case, $\left\{d_{1}, \ldots, d_{k-1}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$, so, invoking the inductive hypothesis, $D_{K}=d_{k} \leqslant 1+\left(d_{1}+\cdots+d_{k-1}\right) \leqslant 1+\left(D_{1}+\cdots+D_{K-1}\right)$. In the second case, $q \leqslant m+1$, so $1,2, \ldots, q-1 \mid m$ ! and $\{1,2, \ldots, q-1\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$. But $q^{2}-3 q+2 \geqslant 0$ for $q \geqslant 2$, and hence
$$
D_{K}=q \leqslant \frac{q^{2}-q+2}{2}=1+(1+\cdots+q-1) \leqslant 1+\left(D_{1}+\cdots+D_{K-1}\right)
$$
In the final case, $\left\{1,2, \ldots, q-1, q d_{1}, \ldots, q d_{k-1}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$, and so
$$
D_{K}=q d_{k} \leqslant q\left(1+d_{1}+\cdots+d_{k-1}\right) \leqslant 1+(1+\cdots+q-1)+\left(q d_{1}+\cdots+q d_{k-1}\right)
$$
and so $D_{K} \leqslant 1+\left(D_{1}+\cdots+D_{K-1}\right)$, completing the inductive step.
## BxMO 2018: Problems and Solutions
(b) If $n$ is odd, then $d_{1}=1, d_{2}>2=1+d_{1}$, and $n$ is good. Among any seven consecutive positive integers, there are either four odd integers and three even ones, or four even ones and three odd ones. In the first case, these four odd integers are good. In the second case, we have to show that one of the consecutive even integers $n=2 m, n+2=2(m+1), n+4=2(m+2), n+6=2(m+3)$ is good. Notice that even integers of the form $n=2(6 \ell \pm 1)$, for $\ell \geqslant 1$, are good, since $d_{2}=2<n$ as $\ell \geqslant 1$, but $d_{3}>4=1+1+2$, since they are divisible by neither 3 nor 4 . But at least one $m, m+1, m+2, m+3$ is congruent to $\pm 1(\bmod 6)($ and larger than 1 by assumption); this completes the proof.
(c) Solution 1. Let $n=12 q$, an even number. By part (b), $n-3, n-2=2(6 q-1), n-1, n+1, n+2=2(6 q+1), n+3$ are good integers. Take $q>29$ to be prime. Then the divisors of $n$ less than $q$ are precisely the divisors of 12 . Now $q>1+(1+2+3+4+6+12)=29$, and so $n$ is good, too. Since there are infinitely many choices of the prime $q$, there are infinitely many sequences of seven consecutive good integers.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
An integer $n \geqslant 2$ having exactly $s$ positive divisors $1=d_{1}<d_{2}<\cdots<d_{s}=n$ is said to be good if there exists an integer $k$, with $2 \leqslant k \leqslant s$, such that $d_{k}>1+d_{1}+\cdots+d_{k-1}$. An integer $n \geqslant 2$ is said to be bad if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than 2 , there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
(Gerhard Woeginger, Luxembourg)
#
|
. We claim that $n=m$ ! is bad for each integer $m \geqslant 2$. The proof proceeds by induction on $m$, the case $m=2$ being clear. If $D_{K}>1$ is a divisor of $m$ !, then $D_{K}=d_{k}$ or $D_{K}=q$ or $D_{K}=q d_{k}$, where $d_{k}>1$ is a divisor of $(m-1)$ ! and $q>1$ is a divisor of $m$. In the first case, $\left\{d_{1}, \ldots, d_{k-1}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$, so, invoking the inductive hypothesis, $D_{K}=d_{k} \leqslant 1+\left(d_{1}+\cdots+d_{k-1}\right) \leqslant 1+\left(D_{1}+\cdots+D_{K-1}\right)$. In the second case, $q \leqslant m+1$, so $1,2, \ldots, q-1 \mid m$ ! and $\{1,2, \ldots, q-1\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$. But $q^{2}-3 q+2 \geqslant 0$ for $q \geqslant 2$, and hence
$$
D_{K}=q \leqslant \frac{q^{2}-q+2}{2}=1+(1+\cdots+q-1) \leqslant 1+\left(D_{1}+\cdots+D_{K-1}\right)
$$
In the final case, $\left\{1,2, \ldots, q-1, q d_{1}, \ldots, q d_{k-1}\right\} \subseteq\left\{D_{1}, \ldots, D_{K-1}\right\}$, and so
$$
D_{K}=q d_{k} \leqslant q\left(1+d_{1}+\cdots+d_{k-1}\right) \leqslant 1+(1+\cdots+q-1)+\left(q d_{1}+\cdots+q d_{k-1}\right)
$$
and so $D_{K} \leqslant 1+\left(D_{1}+\cdots+D_{K-1}\right)$, completing the inductive step.
## BxMO 2018: Problems and Solutions
(b) If $n$ is odd, then $d_{1}=1, d_{2}>2=1+d_{1}$, and $n$ is good. Among any seven consecutive positive integers, there are either four odd integers and three even ones, or four even ones and three odd ones. In the first case, these four odd integers are good. In the second case, we have to show that one of the consecutive even integers $n=2 m, n+2=2(m+1), n+4=2(m+2), n+6=2(m+3)$ is good. Notice that even integers of the form $n=2(6 \ell \pm 1)$, for $\ell \geqslant 1$, are good, since $d_{2}=2<n$ as $\ell \geqslant 1$, but $d_{3}>4=1+1+2$, since they are divisible by neither 3 nor 4 . But at least one $m, m+1, m+2, m+3$ is congruent to $\pm 1(\bmod 6)($ and larger than 1 by assumption); this completes the proof.
(c) Solution 1. Let $n=12 q$, an even number. By part (b), $n-3, n-2=2(6 q-1), n-1, n+1, n+2=2(6 q+1), n+3$ are good integers. Take $q>29$ to be prime. Then the divisors of $n$ less than $q$ are precisely the divisors of 12 . Now $q>1+(1+2+3+4+6+12)=29$, and so $n$ is good, too. Since there are infinitely many choices of the prime $q$, there are infinitely many sequences of seven consecutive good integers.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2018"
}
|
An integer $n \geqslant 2$ having exactly $s$ positive divisors $1=d_{1}<d_{2}<\cdots<d_{s}=n$ is said to be good if there exists an integer $k$, with $2 \leqslant k \leqslant s$, such that $d_{k}>1+d_{1}+\cdots+d_{k-1}$. An integer $n \geqslant 2$ is said to be bad if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than 2 , there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
(Gerhard Woeginger, Luxembourg)
#
|
. Let $m=2^{3} \cdot 3^{2} \cdot 5 \cdot 7 \cdot 11 \cdot 13$. For any integer $k>0$, the seven consecutive integers $m k+1, m k+2, \ldots, m k+7$ are good. Indeed, the four odd numbers $m k+1, m k+3, m k+5, m k+7$ are good by part (b). Moreover,
| $n$ | $d_{1}$ | $d_{2}$ | $d_{3}$ | $d_{4}$ | $d_{5}$ | |
| :---: | :---: | :---: | :---: | :---: | :---: | :---: |
| $m k+2$ | 1 | 2 | $\geqslant 16$ | | | $\Longrightarrow$ |
| $m k+4$ | 1 | 2 | 4 | $\geqslant 16$ | | $\Longrightarrow$ |
| $m k+6$ | 1 | 2 | 3 | 6 | $\geqslant 16$ | $\Longrightarrow$ |
| $d_{4}>1+d_{1}+d_{2}$, | | | | | | |
| $m+d_{2}+d_{3}$, | | | | | | |
| $d_{5}>1+d_{1}+d_{2}+d_{3}+d_{4}$, | | | | | | |
and so $m k+2, m k+4, m k+6$ are good integers, too. Hence there are infinitely many choices of seven consecutive good integers.
Remark. This solution can also be phrased more indirectly in terms of congruence conditions modulo small remainders; the existence of infinitely many appropriate solutions is then guaranteed by the Chinese Remainder Theorem.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
An integer $n \geqslant 2$ having exactly $s$ positive divisors $1=d_{1}<d_{2}<\cdots<d_{s}=n$ is said to be good if there exists an integer $k$, with $2 \leqslant k \leqslant s$, such that $d_{k}>1+d_{1}+\cdots+d_{k-1}$. An integer $n \geqslant 2$ is said to be bad if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than 2 , there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
(Gerhard Woeginger, Luxembourg)
#
|
. Let $m=2^{3} \cdot 3^{2} \cdot 5 \cdot 7 \cdot 11 \cdot 13$. For any integer $k>0$, the seven consecutive integers $m k+1, m k+2, \ldots, m k+7$ are good. Indeed, the four odd numbers $m k+1, m k+3, m k+5, m k+7$ are good by part (b). Moreover,
| $n$ | $d_{1}$ | $d_{2}$ | $d_{3}$ | $d_{4}$ | $d_{5}$ | |
| :---: | :---: | :---: | :---: | :---: | :---: | :---: |
| $m k+2$ | 1 | 2 | $\geqslant 16$ | | | $\Longrightarrow$ |
| $m k+4$ | 1 | 2 | 4 | $\geqslant 16$ | | $\Longrightarrow$ |
| $m k+6$ | 1 | 2 | 3 | 6 | $\geqslant 16$ | $\Longrightarrow$ |
| $d_{4}>1+d_{1}+d_{2}$, | | | | | | |
| $m+d_{2}+d_{3}$, | | | | | | |
| $d_{5}>1+d_{1}+d_{2}+d_{3}+d_{4}$, | | | | | | |
and so $m k+2, m k+4, m k+6$ are good integers, too. Hence there are infinitely many choices of seven consecutive good integers.
Remark. This solution can also be phrased more indirectly in terms of congruence conditions modulo small remainders; the existence of infinitely many appropriate solutions is then guaranteed by the Chinese Remainder Theorem.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 2",
"tier": "T3",
"year": "2018"
}
|
An integer $n \geqslant 2$ having exactly $s$ positive divisors $1=d_{1}<d_{2}<\cdots<d_{s}=n$ is said to be good if there exists an integer $k$, with $2 \leqslant k \leqslant s$, such that $d_{k}>1+d_{1}+\cdots+d_{k-1}$. An integer $n \geqslant 2$ is said to be bad if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than 2 , there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
(Gerhard Woeginger, Luxembourg)
#
|
. Let $m=29$ !. For any integer $k>0$, the seven consecutive integers $m k+1, m k+2, \ldots, m k+7$ are good. Indeed, the divisors of these numbers are either at most 7 or at least 30 . But $30>1+(1+2+\cdots+7)=29$, and so these seven integers are good, giving infinitely many sequences of seven consecutive good integers.
Remark. The ideas underlying these different solutions can be extended to show that there are arbitrarily long runs of consecutive good integers:
For each integer $N$, there exist $N$ consecutive good integers.
Proof 1 . Let $M=2+(1+2+\cdots+N)$, and let $m=M$ !. Any divisor of any of the $N$ consecutive integers $m+1, m+2, \ldots, m+N$ is either at most $N$ or at least $M$. But $M>1+(1+2+\cdots+N)$, and so these $N$ consecutive integers are good.
Proof 2. Let $2=p_{1}<p_{2}<\cdots$ denote the prime numbers, and choose positive integers $s$ and $\alpha_{1}, \ldots, \alpha_{s}$ such that $1,2, \ldots, N$ divide $P=p_{1}^{\alpha_{1}} p_{2}^{\alpha_{2}} \cdots p_{s}^{\alpha_{s}}$. Let $\sigma(n)$ denote the sum of the divisors of $n$. Choose an integer $t$ such that $p_{t}>\sigma(P)$, let $m=p_{1} p_{2} \cdots p_{t} P$. The $N$ consecutive integers $m+1, m+2, \ldots, m+N$ are all good. Indeed, for $1 \leqslant k \leqslant N$, any divisor of $m+k$ is either at most $k$ or at least $p_{t+1}$. But $p_{t+1}>1+p_{t}>1+\sigma(P)>1+\sigma(k)$, since $k \mid P$. This completes the proof.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
An integer $n \geqslant 2$ having exactly $s$ positive divisors $1=d_{1}<d_{2}<\cdots<d_{s}=n$ is said to be good if there exists an integer $k$, with $2 \leqslant k \leqslant s$, such that $d_{k}>1+d_{1}+\cdots+d_{k-1}$. An integer $n \geqslant 2$ is said to be bad if it is not good.
(a) Show that there are infinitely many bad integers.
(b) Prove that, among any seven consecutive integers all greater than 2 , there are always at least four good integers.
(c) Show that there are infinitely many sequences of seven consecutive good integers.
(Gerhard Woeginger, Luxembourg)
#
|
. Let $m=29$ !. For any integer $k>0$, the seven consecutive integers $m k+1, m k+2, \ldots, m k+7$ are good. Indeed, the divisors of these numbers are either at most 7 or at least 30 . But $30>1+(1+2+\cdots+7)=29$, and so these seven integers are good, giving infinitely many sequences of seven consecutive good integers.
Remark. The ideas underlying these different solutions can be extended to show that there are arbitrarily long runs of consecutive good integers:
For each integer $N$, there exist $N$ consecutive good integers.
Proof 1 . Let $M=2+(1+2+\cdots+N)$, and let $m=M$ !. Any divisor of any of the $N$ consecutive integers $m+1, m+2, \ldots, m+N$ is either at most $N$ or at least $M$. But $M>1+(1+2+\cdots+N)$, and so these $N$ consecutive integers are good.
Proof 2. Let $2=p_{1}<p_{2}<\cdots$ denote the prime numbers, and choose positive integers $s$ and $\alpha_{1}, \ldots, \alpha_{s}$ such that $1,2, \ldots, N$ divide $P=p_{1}^{\alpha_{1}} p_{2}^{\alpha_{2}} \cdots p_{s}^{\alpha_{s}}$. Let $\sigma(n)$ denote the sum of the divisors of $n$. Choose an integer $t$ such that $p_{t}>\sigma(P)$, let $m=p_{1} p_{2} \cdots p_{t} P$. The $N$ consecutive integers $m+1, m+2, \ldots, m+N$ are all good. Indeed, for $1 \leqslant k \leqslant N$, any divisor of $m+k$ is either at most $k$ or at least $p_{t+1}$. But $p_{t+1}>1+p_{t}>1+\sigma(P)>1+\sigma(k)$, since $k \mid P$. This completes the proof.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2018-zz.jsonl",
"solution_match": "\nSolution 3",
"tier": "T3",
"year": "2018"
}
|
a) Let $a, b, c, d$ be real numbers with $0 \leqslant a, b, c, d \leqslant 1$. Prove that
$$
a b(a-b)+b c(b-c)+c d(c-d)+d a(d-a) \leqslant \frac{8}{27}
$$
b) Find all quadruples $(a, b, c, d)$ of real numbers with $0 \leqslant a, b, c, d \leqslant 1$ for which equality holds in the above inequality.
|
Denote the left-hand side by $S$. We have
$$
\begin{aligned}
S & =a b(a-b)+b c(b-c)+c d(c-d)+d a(d-a) \\
& =a^{2} b-a b^{2}+b^{2} c-b c^{2}+c^{2} d-c d^{2}+d^{2} a-d a^{2} \\
& =a^{2}(b-d)+b^{2}(c-a)+c^{2}(d-b)+d^{2}(a-c) \\
& =(b-d)\left(a^{2}-c^{2}\right)+(c-a)\left(b^{2}-d^{2}\right) \\
& =(b-d)(a-c)(a+c)+(c-a)(b-d)(b+d) \\
& =(b-d)(a-c)(a+c-b-d) .
\end{aligned}
$$
Assume without loss of generality that $a \geqslant c$, then $a-c \geqslant 0$. Now we consider two cases.
- Suppose $b-d \geqslant 0$. Then if $a+c-b-d<0$ we have $S \leqslant 0$, so we're done. If $a+c-b-d \geqslant 0$, we use the AM-GM inequality on $a-c, b-d$ and $a+c-b-d$, which yields
$$
\sqrt[3]{S}=\sqrt[3]{(b-d)(a-c)(a+c-b-d)} \leqslant \frac{b-d+a-c+a+c-b-d}{3}=\frac{2 a-2 d}{3} \leqslant \frac{2}{3}
$$
so $S \leqslant \frac{8}{27}$.
- Suppose $b-d<0$. Then if $a+c-b-d \geqslant 0$ we have $S \leqslant 0$, so we're done. If $a+c-b-d<0$, we use the AM-GM inequality on $a-c, d-b$ and $b+d-a-c$, which yields
$$
\sqrt[3]{S}=\sqrt[3]{(d-b)(a-c)(b+d-a-c)} \leqslant \frac{d-b+a-c+b+d-a-c}{3}=\frac{2 d-2 c}{3} \leqslant \frac{2}{3}
$$
so $S \leqslant \frac{8}{27}$.
Equality in the first case occurs when $a-c=b-d=a+c-b-d$ and $a=1, d=0$. Then $1-c=b=1+c-b$, which implies $2 c=b=1-c$ and hence $c=\frac{1}{3}$. This results in $(a, b, c, d)=\left(1, \frac{2}{3}, \frac{1}{3}, 0\right)$. Similarly, equality in the second case occurs when $a-c=d-b=b+d-a-c$ and $d=1, c=0$. This yields $(a, b, c, d)=\left(\frac{2}{3}, \frac{1}{3}, 0,1\right)$. The case $a \leqslant c$ gives the other two cyclic variants, which gives all quadruples satisfying the equality.
|
proof
|
Yes
|
Yes
|
proof
|
Inequalities
|
a) Let $a, b, c, d$ be real numbers with $0 \leqslant a, b, c, d \leqslant 1$. Prove that
$$
a b(a-b)+b c(b-c)+c d(c-d)+d a(d-a) \leqslant \frac{8}{27}
$$
b) Find all quadruples $(a, b, c, d)$ of real numbers with $0 \leqslant a, b, c, d \leqslant 1$ for which equality holds in the above inequality.
|
Denote the left-hand side by $S$. We have
$$
\begin{aligned}
S & =a b(a-b)+b c(b-c)+c d(c-d)+d a(d-a) \\
& =a^{2} b-a b^{2}+b^{2} c-b c^{2}+c^{2} d-c d^{2}+d^{2} a-d a^{2} \\
& =a^{2}(b-d)+b^{2}(c-a)+c^{2}(d-b)+d^{2}(a-c) \\
& =(b-d)\left(a^{2}-c^{2}\right)+(c-a)\left(b^{2}-d^{2}\right) \\
& =(b-d)(a-c)(a+c)+(c-a)(b-d)(b+d) \\
& =(b-d)(a-c)(a+c-b-d) .
\end{aligned}
$$
Assume without loss of generality that $a \geqslant c$, then $a-c \geqslant 0$. Now we consider two cases.
- Suppose $b-d \geqslant 0$. Then if $a+c-b-d<0$ we have $S \leqslant 0$, so we're done. If $a+c-b-d \geqslant 0$, we use the AM-GM inequality on $a-c, b-d$ and $a+c-b-d$, which yields
$$
\sqrt[3]{S}=\sqrt[3]{(b-d)(a-c)(a+c-b-d)} \leqslant \frac{b-d+a-c+a+c-b-d}{3}=\frac{2 a-2 d}{3} \leqslant \frac{2}{3}
$$
so $S \leqslant \frac{8}{27}$.
- Suppose $b-d<0$. Then if $a+c-b-d \geqslant 0$ we have $S \leqslant 0$, so we're done. If $a+c-b-d<0$, we use the AM-GM inequality on $a-c, d-b$ and $b+d-a-c$, which yields
$$
\sqrt[3]{S}=\sqrt[3]{(d-b)(a-c)(b+d-a-c)} \leqslant \frac{d-b+a-c+b+d-a-c}{3}=\frac{2 d-2 c}{3} \leqslant \frac{2}{3}
$$
so $S \leqslant \frac{8}{27}$.
Equality in the first case occurs when $a-c=b-d=a+c-b-d$ and $a=1, d=0$. Then $1-c=b=1+c-b$, which implies $2 c=b=1-c$ and hence $c=\frac{1}{3}$. This results in $(a, b, c, d)=\left(1, \frac{2}{3}, \frac{1}{3}, 0\right)$. Similarly, equality in the second case occurs when $a-c=d-b=b+d-a-c$ and $d=1, c=0$. This yields $(a, b, c, d)=\left(\frac{2}{3}, \frac{1}{3}, 0,1\right)$. The case $a \leqslant c$ gives the other two cyclic variants, which gives all quadruples satisfying the equality.
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2019-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2019"
}
|
Pawns and rooks are placed on a $2019 \times 2019$ chessboard, with at most one piece on each of the $2019^{2}$ squares. A rook can see another rook if they are in the same row or column and all squares between them are empty. What is the maximal number $p$ for which $p$ pawns and $p+2019$ rooks can be placed on the chessboard in such a way that no two rooks can see each other?
|
Answer: the maximal $p$ equals $1009^{2}$.
Write $n=2019$ and $k=1009$; then $n=2 k+1$. We first show that we can place $k^{2}$ pawns and $n+k^{2}$ rooks. Each cell of the chess board has coordinates $(x, y)$ with $1 \leqslant x, y \leqslant n$. We colour each cell black or white depending on whether $x+y$ is even or odd.
Let $A$ be cell $(1, k+1), B$ be cell $(k+1,1), C$ be cell $(2 k+1, k+1)$ and $D$ be cell $(k+1,2 k+1)$, and consider the skew square $A B C D$. We place rooks on the cells of this square which have the same colour as $A$, and we place pawns on the other cells of this square. In this way, no rook can see another rook. Now we have placed $p=k^{2}$ pawns and $(k+1)^{2}=k^{2}+(2 k+1)=p+n$ rooks.
Now we show that we can not place more pawns. Observe that in every row the number of rooks exceeds the number of pawns by at most 1 , since there has to be a pawn between every two neighbouring rooks. So the total number of rooks exceeds the number of pawns by at most $n$. On the other hand we are to place $p$ pawns and $p+n$ rooks, so the number of rooks in every row exceeds the number of pawns by exactly 1. This means that the rooks and pawns alternate, with rooks at the two ends. For the columns the same holds.
Consider the $\ell$-th row. Let $a$ be the number of pawns in this row and let $b$ be the number of pawns above the $\ell$-th row. For all these pawns, a rook must be somewhere above it. Counting the rooks directly above these $a+b$ pawns, we conclude that there must be at least $a+b$ rooks in the first $\ell-1$ rows. In every row the number of rooks exceeds the number of pawns by 1 , so in these first $\ell-1$ rows we have at least $a+b-(\ell-1)$ pawns. So $b \geqslant a+b-(\ell-1)$, yielding $a \leqslant \ell-1$. We conclude that the $\ell$-th row contains at most $\ell-1$ pawns. The same holds for the $\ell$-th row counted from below (row $(n+1)-\ell$ ): also in this row, there are at most $\ell-1$ pawns. As $n=2 k+1$, the maximal number $p$ is
$$
\sum_{\ell=1}^{k}(\ell-1)+\sum_{\ell=1}^{k+1}(\ell-1)=k+2 \cdot \frac{1}{2} k(k-1)=k+k(k-1)=k^{2}
$$
|
1009^2
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Pawns and rooks are placed on a $2019 \times 2019$ chessboard, with at most one piece on each of the $2019^{2}$ squares. A rook can see another rook if they are in the same row or column and all squares between them are empty. What is the maximal number $p$ for which $p$ pawns and $p+2019$ rooks can be placed on the chessboard in such a way that no two rooks can see each other?
|
Answer: the maximal $p$ equals $1009^{2}$.
Write $n=2019$ and $k=1009$; then $n=2 k+1$. We first show that we can place $k^{2}$ pawns and $n+k^{2}$ rooks. Each cell of the chess board has coordinates $(x, y)$ with $1 \leqslant x, y \leqslant n$. We colour each cell black or white depending on whether $x+y$ is even or odd.
Let $A$ be cell $(1, k+1), B$ be cell $(k+1,1), C$ be cell $(2 k+1, k+1)$ and $D$ be cell $(k+1,2 k+1)$, and consider the skew square $A B C D$. We place rooks on the cells of this square which have the same colour as $A$, and we place pawns on the other cells of this square. In this way, no rook can see another rook. Now we have placed $p=k^{2}$ pawns and $(k+1)^{2}=k^{2}+(2 k+1)=p+n$ rooks.
Now we show that we can not place more pawns. Observe that in every row the number of rooks exceeds the number of pawns by at most 1 , since there has to be a pawn between every two neighbouring rooks. So the total number of rooks exceeds the number of pawns by at most $n$. On the other hand we are to place $p$ pawns and $p+n$ rooks, so the number of rooks in every row exceeds the number of pawns by exactly 1. This means that the rooks and pawns alternate, with rooks at the two ends. For the columns the same holds.
Consider the $\ell$-th row. Let $a$ be the number of pawns in this row and let $b$ be the number of pawns above the $\ell$-th row. For all these pawns, a rook must be somewhere above it. Counting the rooks directly above these $a+b$ pawns, we conclude that there must be at least $a+b$ rooks in the first $\ell-1$ rows. In every row the number of rooks exceeds the number of pawns by 1 , so in these first $\ell-1$ rows we have at least $a+b-(\ell-1)$ pawns. So $b \geqslant a+b-(\ell-1)$, yielding $a \leqslant \ell-1$. We conclude that the $\ell$-th row contains at most $\ell-1$ pawns. The same holds for the $\ell$-th row counted from below (row $(n+1)-\ell$ ): also in this row, there are at most $\ell-1$ pawns. As $n=2 k+1$, the maximal number $p$ is
$$
\sum_{\ell=1}^{k}(\ell-1)+\sum_{\ell=1}^{k+1}(\ell-1)=k+2 \cdot \frac{1}{2} k(k-1)=k+k(k-1)=k^{2}
$$
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "\nProblem 2.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2019-zz.jsonl",
"solution_match": "\nSolution.",
"tier": "T3",
"year": "2019"
}
|
Two circles $\Gamma_{1}$ and $\Gamma_{2}$ intersect at points $A$ and $Z$ (with $A \neq Z$ ). Let $B$ be the centre of $\Gamma_{1}$ and let $C$ be the centre of $\Gamma_{2}$. The exterior angle bisector of $\angle B A C$ intersects $\Gamma_{1}$ again at $X$ and $\Gamma_{2}$ again at $Y$. Prove that the interior angle bisector of $\angle B Z C$ passes through the circumcentre of $\triangle X Y Z$.
For points $P, Q, R$ that lie on a line $\ell$ in that order, and a point $S$ not on $\ell$, the interior angle bisector of $\angle P Q S$ is the line that divides $\angle P Q S$ into two equal angles, while the exterior angle bisector of $\angle P Q S$ is the line that divides $\angle R Q S$ into two equal angles.
|
We first prove that $\angle A Z X=\angle Y Z A$. Since the triangles $\triangle B A X, \triangle C A Y$ are isosceles, and $X Y$ is the external bisector of $\angle B A C$, we see that
$$
\angle B X A=\angle X A B=\angle C A Y=\angle A Y C .
$$
Using these equalities, we find that
$$
\angle X B A=180^{\circ}-\angle B A X-\angle A X B=180^{\circ}-\angle C Y A-\angle Y A C=\angle A C Y
$$
Since $B, C$ are the centres of respectively $\Gamma_{1}, \Gamma_{2}$, this implies that
$$
\angle A Z X=\frac{1}{2} \angle A B X=\frac{1}{2} \angle Y C A=\angle Y Z A .
$$
Let $O$ be the circumcentre of $\triangle X Y Z$, next we will prove that $\angle B Z O=\angle A Z Y$. Consider the configuration where $\angle Z X A$ is sharp, then $\angle A B Z=2 \angle A X Z=2 \angle Y X Z=\angle Y O Z$. Since $\triangle B Z A$ and $\triangle O Z Y$ are isosceles, this implies $\angle B Z A=\angle O Z Y$. Subtracting $\angle O Z A$ (or adding, depending on the configuration) yields $\angle B Z O=\angle A Z Y$.
Together with the analogous result $\angle C Z O=\angle A Z X$, we conclude $\angle B Z O=\angle A Z Y=\angle X Z A=$ $\angle O Z C$, so $O$ lies indeed on the internal bisector of $\angle B Z C$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Two circles $\Gamma_{1}$ and $\Gamma_{2}$ intersect at points $A$ and $Z$ (with $A \neq Z$ ). Let $B$ be the centre of $\Gamma_{1}$ and let $C$ be the centre of $\Gamma_{2}$. The exterior angle bisector of $\angle B A C$ intersects $\Gamma_{1}$ again at $X$ and $\Gamma_{2}$ again at $Y$. Prove that the interior angle bisector of $\angle B Z C$ passes through the circumcentre of $\triangle X Y Z$.
For points $P, Q, R$ that lie on a line $\ell$ in that order, and a point $S$ not on $\ell$, the interior angle bisector of $\angle P Q S$ is the line that divides $\angle P Q S$ into two equal angles, while the exterior angle bisector of $\angle P Q S$ is the line that divides $\angle R Q S$ into two equal angles.
|
We first prove that $\angle A Z X=\angle Y Z A$. Since the triangles $\triangle B A X, \triangle C A Y$ are isosceles, and $X Y$ is the external bisector of $\angle B A C$, we see that
$$
\angle B X A=\angle X A B=\angle C A Y=\angle A Y C .
$$
Using these equalities, we find that
$$
\angle X B A=180^{\circ}-\angle B A X-\angle A X B=180^{\circ}-\angle C Y A-\angle Y A C=\angle A C Y
$$
Since $B, C$ are the centres of respectively $\Gamma_{1}, \Gamma_{2}$, this implies that
$$
\angle A Z X=\frac{1}{2} \angle A B X=\frac{1}{2} \angle Y C A=\angle Y Z A .
$$
Let $O$ be the circumcentre of $\triangle X Y Z$, next we will prove that $\angle B Z O=\angle A Z Y$. Consider the configuration where $\angle Z X A$ is sharp, then $\angle A B Z=2 \angle A X Z=2 \angle Y X Z=\angle Y O Z$. Since $\triangle B Z A$ and $\triangle O Z Y$ are isosceles, this implies $\angle B Z A=\angle O Z Y$. Subtracting $\angle O Z A$ (or adding, depending on the configuration) yields $\angle B Z O=\angle A Z Y$.
Together with the analogous result $\angle C Z O=\angle A Z X$, we conclude $\angle B Z O=\angle A Z Y=\angle X Z A=$ $\angle O Z C$, so $O$ lies indeed on the internal bisector of $\angle B Z C$.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2019-zz.jsonl",
"solution_match": "\nSolution I.",
"tier": "T3",
"year": "2019"
}
|
Two circles $\Gamma_{1}$ and $\Gamma_{2}$ intersect at points $A$ and $Z$ (with $A \neq Z$ ). Let $B$ be the centre of $\Gamma_{1}$ and let $C$ be the centre of $\Gamma_{2}$. The exterior angle bisector of $\angle B A C$ intersects $\Gamma_{1}$ again at $X$ and $\Gamma_{2}$ again at $Y$. Prove that the interior angle bisector of $\angle B Z C$ passes through the circumcentre of $\triangle X Y Z$.
For points $P, Q, R$ that lie on a line $\ell$ in that order, and a point $S$ not on $\ell$, the interior angle bisector of $\angle P Q S$ is the line that divides $\angle P Q S$ into two equal angles, while the exterior angle bisector of $\angle P Q S$ is the line that divides $\angle R Q S$ into two equal angles.
|
Let $O$ the circumcentre of $\triangle X Y Z$, then we see that $O X=O Z$. Since $B$ is the centre of $\Gamma_{1}$, we also see that $B X=B Z$, so $O B$ is the perpendicular bisector of $X Z$. Therefore $\angle B Z O=\angle B X O$, and analogously we find $\angle C Z O=\angle C Y O$. Note that $B, C$ lie on the same side of $X Y$; we will consider the configuration where $O$ is on the opposite side of $X Y$. Then $\angle B X O=\angle B X A+\angle A X O$. Now the isosceles triangles $\triangle B X A, \triangle C A Y, \triangle O X Y$, and $X Y$ being the external bisector of $\angle B A C$ give
$$
\begin{aligned}
& \angle B X A=\angle X A B=\angle C A Y=\angle A Y C, \\
& \angle A X O=\angle Y X O=\angle O Y X=\angle O Y A,
\end{aligned}
$$
so we find that $\angle B Z O=\angle B X O=\angle A Y C+\angle O Y A=\angle O Y C=\angle O Z C$. Hence $O$ lies on the internal bisector of $\angle B Z C$.
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Two circles $\Gamma_{1}$ and $\Gamma_{2}$ intersect at points $A$ and $Z$ (with $A \neq Z$ ). Let $B$ be the centre of $\Gamma_{1}$ and let $C$ be the centre of $\Gamma_{2}$. The exterior angle bisector of $\angle B A C$ intersects $\Gamma_{1}$ again at $X$ and $\Gamma_{2}$ again at $Y$. Prove that the interior angle bisector of $\angle B Z C$ passes through the circumcentre of $\triangle X Y Z$.
For points $P, Q, R$ that lie on a line $\ell$ in that order, and a point $S$ not on $\ell$, the interior angle bisector of $\angle P Q S$ is the line that divides $\angle P Q S$ into two equal angles, while the exterior angle bisector of $\angle P Q S$ is the line that divides $\angle R Q S$ into two equal angles.
|
Let $O$ the circumcentre of $\triangle X Y Z$, then we see that $O X=O Z$. Since $B$ is the centre of $\Gamma_{1}$, we also see that $B X=B Z$, so $O B$ is the perpendicular bisector of $X Z$. Therefore $\angle B Z O=\angle B X O$, and analogously we find $\angle C Z O=\angle C Y O$. Note that $B, C$ lie on the same side of $X Y$; we will consider the configuration where $O$ is on the opposite side of $X Y$. Then $\angle B X O=\angle B X A+\angle A X O$. Now the isosceles triangles $\triangle B X A, \triangle C A Y, \triangle O X Y$, and $X Y$ being the external bisector of $\angle B A C$ give
$$
\begin{aligned}
& \angle B X A=\angle X A B=\angle C A Y=\angle A Y C, \\
& \angle A X O=\angle Y X O=\angle O Y X=\angle O Y A,
\end{aligned}
$$
so we find that $\angle B Z O=\angle B X O=\angle A Y C+\angle O Y A=\angle O Y C=\angle O Z C$. Hence $O$ lies on the internal bisector of $\angle B Z C$.
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "\nProblem 3.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2019-zz.jsonl",
"solution_match": "\nSolution II.",
"tier": "T3",
"year": "2019"
}
|
An integer $m>1$ is rich if for any positive integer $n$, there exist positive integers $x, y, z$ such that $n=m x^{2}-y^{2}-z^{2}$. An integer $m>1$ is poor if it is not rich.
a) Find a poor integer.
b) Find a rich integer.
a) Solution I. We will show that $m=4$ is poor. If $y$ and $z$ are both even, we have $4 x^{2}-y^{2}-z^{2} \equiv$ $0-0-0=0(\bmod 4)$. If $y$ is even and $z$ is odd or the other way around, then $4 x^{2}-y^{2}-z^{2} \equiv$ $0-0-1 \equiv 3(\bmod 4)$. If $y$ and $z$ are both odd, we have $4 x^{2}-y^{2}-z^{2} \equiv 0-1-1 \equiv 2(\bmod 4)$. Hence it is impossible to write any integer $n \equiv 1(\bmod 4)$ as $n=m x^{2}-y^{2}-z^{2}$. So $m=4$ is poor.
|
We will show that $m=3$ is poor, by proving that it is impossible to write any integer $n \equiv 5(\bmod 8)$ as $n=3 x^{2}-y^{2}-z^{2}$. We consider the equation modulo 8 . If $4 \mid x$, then $n \equiv-y^{2}-z^{2}(\bmod 8)$. So if $n \equiv 5(\bmod 8)$, we need to have $y^{2}+z^{2} \equiv 3(\bmod 8)$. As $y^{2}$ and $z^{2}$ can only be 0,1 or $4 \bmod 8$, this is impossible. If $x \equiv 2(\bmod 4)$, then $3 x^{2} \equiv 4(\bmod 8)$, so for $n \equiv 5(\bmod 8)$ we need to have $y^{2}+z^{2} \equiv 7(\bmod 8)$. Again, this is impossible. Finally, if $x$ is odd, then $3 x^{2} \equiv 3(\bmod 8)$, so for $n \equiv 5(\bmod 8)$ we need to have $y^{2}+z^{2} \equiv 6(\bmod 8)$. This is impossible as well. So $m=3$ is poor.
b) Solution I. We will show that $m=5$ is rich. For any integer $x \geqslant 2$ we can take $y=2 x-2$ and $z=x+3$, then
$$
5 x^{2}-y^{2}-z^{2}=5 x^{2}-\left(4 x^{2}-8 x+4\right)-\left(x^{2}+6 x+9\right)=2 x-13
$$
For $x \geqslant 7$, this gives us all odd positive integers.
For any integer $x \geqslant 1$ we can take $y=2 x-1$ and $z=x+1$, then
$$
5 x^{2}-y^{2}-z^{2}=5 x^{2}-\left(4 x^{2}-4 x+1\right)-\left(x^{2}+2 x+1\right)=2 x-2
$$
For $x \geqslant 2$, this gives us all even positive integers. So $m=5$ is rich.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
An integer $m>1$ is rich if for any positive integer $n$, there exist positive integers $x, y, z$ such that $n=m x^{2}-y^{2}-z^{2}$. An integer $m>1$ is poor if it is not rich.
a) Find a poor integer.
b) Find a rich integer.
a) Solution I. We will show that $m=4$ is poor. If $y$ and $z$ are both even, we have $4 x^{2}-y^{2}-z^{2} \equiv$ $0-0-0=0(\bmod 4)$. If $y$ is even and $z$ is odd or the other way around, then $4 x^{2}-y^{2}-z^{2} \equiv$ $0-0-1 \equiv 3(\bmod 4)$. If $y$ and $z$ are both odd, we have $4 x^{2}-y^{2}-z^{2} \equiv 0-1-1 \equiv 2(\bmod 4)$. Hence it is impossible to write any integer $n \equiv 1(\bmod 4)$ as $n=m x^{2}-y^{2}-z^{2}$. So $m=4$ is poor.
|
We will show that $m=3$ is poor, by proving that it is impossible to write any integer $n \equiv 5(\bmod 8)$ as $n=3 x^{2}-y^{2}-z^{2}$. We consider the equation modulo 8 . If $4 \mid x$, then $n \equiv-y^{2}-z^{2}(\bmod 8)$. So if $n \equiv 5(\bmod 8)$, we need to have $y^{2}+z^{2} \equiv 3(\bmod 8)$. As $y^{2}$ and $z^{2}$ can only be 0,1 or $4 \bmod 8$, this is impossible. If $x \equiv 2(\bmod 4)$, then $3 x^{2} \equiv 4(\bmod 8)$, so for $n \equiv 5(\bmod 8)$ we need to have $y^{2}+z^{2} \equiv 7(\bmod 8)$. Again, this is impossible. Finally, if $x$ is odd, then $3 x^{2} \equiv 3(\bmod 8)$, so for $n \equiv 5(\bmod 8)$ we need to have $y^{2}+z^{2} \equiv 6(\bmod 8)$. This is impossible as well. So $m=3$ is poor.
b) Solution I. We will show that $m=5$ is rich. For any integer $x \geqslant 2$ we can take $y=2 x-2$ and $z=x+3$, then
$$
5 x^{2}-y^{2}-z^{2}=5 x^{2}-\left(4 x^{2}-8 x+4\right)-\left(x^{2}+6 x+9\right)=2 x-13
$$
For $x \geqslant 7$, this gives us all odd positive integers.
For any integer $x \geqslant 1$ we can take $y=2 x-1$ and $z=x+1$, then
$$
5 x^{2}-y^{2}-z^{2}=5 x^{2}-\left(4 x^{2}-4 x+1\right)-\left(x^{2}+2 x+1\right)=2 x-2
$$
For $x \geqslant 2$, this gives us all even positive integers. So $m=5$ is rich.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "\nProblem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2019-zz.jsonl",
"solution_match": "\nSolution II.",
"tier": "T3",
"year": "2019"
}
|
An integer $m>1$ is rich if for any positive integer $n$, there exist positive integers $x, y, z$ such that $n=m x^{2}-y^{2}-z^{2}$. An integer $m>1$ is poor if it is not rich.
a) Find a poor integer.
b) Find a rich integer.
a) Solution I. We will show that $m=4$ is poor. If $y$ and $z$ are both even, we have $4 x^{2}-y^{2}-z^{2} \equiv$ $0-0-0=0(\bmod 4)$. If $y$ is even and $z$ is odd or the other way around, then $4 x^{2}-y^{2}-z^{2} \equiv$ $0-0-1 \equiv 3(\bmod 4)$. If $y$ and $z$ are both odd, we have $4 x^{2}-y^{2}-z^{2} \equiv 0-1-1 \equiv 2(\bmod 4)$. Hence it is impossible to write any integer $n \equiv 1(\bmod 4)$ as $n=m x^{2}-y^{2}-z^{2}$. So $m=4$ is poor.
|
We will show that $m=2$ is rich. For any integer $x \geqslant 3$ we can take $y=x+1$ and $z=x-2$, then
$$
2 x^{2}-y^{2}-z^{2}=2 x^{2}-\left(x^{2}+2 x+1\right)-\left(x^{2}-4 x+4\right)=2 x-5 .
$$
As $x$ can take any positive integer value that is at least 3 , this gives us all odd positive integers.
For any integer $x \geqslant 5$ we can take $y=x+2$ and $z=x-4$, then
$$
2 x^{2}-y^{2}-z^{2}=2 x^{2}-\left(x^{2}+4 x+4\right)-\left(x^{2}-8 x+16\right)=4 x-20 .
$$
For $x \geqslant 6$, this gives us all positive integers divisible by 4 .
For any integer $x \geqslant 6$ we can take $y=x+3$ and $z=x-5$, then
$$
2 x^{2}-y^{2}-z^{2}=2 x^{2}-\left(x^{2}+6 x+9\right)-\left(x^{2}-10 x+25\right)=4 x-34
$$
For $x \geqslant 9$, this gives us all positive integers in the residue class $2(\bmod 4)$. So $m=2$ is rich.
Remark. Considering the equation modulo 8 and 9 , we can show that $m$ is poor when $m \equiv 0,3(\bmod 4)$ or $m \equiv 0(\bmod 3)$. This shows that $6,7,8,9,11,12$ are also poor. Further you can find a construction showing that $m=10$ is rich.
|
proof
|
Yes
|
Yes
|
proof
|
Number Theory
|
An integer $m>1$ is rich if for any positive integer $n$, there exist positive integers $x, y, z$ such that $n=m x^{2}-y^{2}-z^{2}$. An integer $m>1$ is poor if it is not rich.
a) Find a poor integer.
b) Find a rich integer.
a) Solution I. We will show that $m=4$ is poor. If $y$ and $z$ are both even, we have $4 x^{2}-y^{2}-z^{2} \equiv$ $0-0-0=0(\bmod 4)$. If $y$ is even and $z$ is odd or the other way around, then $4 x^{2}-y^{2}-z^{2} \equiv$ $0-0-1 \equiv 3(\bmod 4)$. If $y$ and $z$ are both odd, we have $4 x^{2}-y^{2}-z^{2} \equiv 0-1-1 \equiv 2(\bmod 4)$. Hence it is impossible to write any integer $n \equiv 1(\bmod 4)$ as $n=m x^{2}-y^{2}-z^{2}$. So $m=4$ is poor.
|
We will show that $m=2$ is rich. For any integer $x \geqslant 3$ we can take $y=x+1$ and $z=x-2$, then
$$
2 x^{2}-y^{2}-z^{2}=2 x^{2}-\left(x^{2}+2 x+1\right)-\left(x^{2}-4 x+4\right)=2 x-5 .
$$
As $x$ can take any positive integer value that is at least 3 , this gives us all odd positive integers.
For any integer $x \geqslant 5$ we can take $y=x+2$ and $z=x-4$, then
$$
2 x^{2}-y^{2}-z^{2}=2 x^{2}-\left(x^{2}+4 x+4\right)-\left(x^{2}-8 x+16\right)=4 x-20 .
$$
For $x \geqslant 6$, this gives us all positive integers divisible by 4 .
For any integer $x \geqslant 6$ we can take $y=x+3$ and $z=x-5$, then
$$
2 x^{2}-y^{2}-z^{2}=2 x^{2}-\left(x^{2}+6 x+9\right)-\left(x^{2}-10 x+25\right)=4 x-34
$$
For $x \geqslant 9$, this gives us all positive integers in the residue class $2(\bmod 4)$. So $m=2$ is rich.
Remark. Considering the equation modulo 8 and 9 , we can show that $m$ is poor when $m \equiv 0,3(\bmod 4)$ or $m \equiv 0(\bmod 3)$. This shows that $6,7,8,9,11,12$ are also poor. Further you can find a construction showing that $m=10$ is rich.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "\nProblem 4.",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2019-zz.jsonl",
"solution_match": "\nSolution II.",
"tier": "T3",
"year": "2019"
}
|
Find all positive integers $d$ with the following property: there exists a polynomial $P$ of degree $d$ with integer coefficients such that $|P(m)|=1$ for at least $d+1$ different integers $m$.
#
|
Note that $P(x)=c$ for a fixed constant has at most $d$ solutions, since the polynomial $P(x)-c$ of degree $d$ cancels at most $d$ times. This implies that there are integers $m$ satisfying $P(m)=1$, as well as integers $m$ such that $P(m)=-1$.
Next, we prove the following lemma.
Lemma. If $a$ and $b$ are integers such that $P(a)=-1$ and $P(b)=1$, then $|b-a| \leq 2$.
Proof Since $b-a \mid P(b)-P(a)$ by a well-known lemma (corollary of $a-b \mid a^{n}-b^{n}$ for every integer $n \geq 0$ ), the conclusion follows.
Let us first consider the case that $d \geq 4$, and assume that there exists a polynomial P with at least $d+1 \geq 5$ solutions to $|P(m)|=1$. Let $a$ and $b$ be the smallest and largest solution respectively. Since $b-a \geq 4$, we need $P(a)=P(b)$ by the lemma. Without loss of generality (by switching $P$ with $-P$ if necessary) we can assume $P(a)=P(b)=1$. Take a value $m$ such that $P(m)=-1$. Due to the lemma, we need $b-m$ and $m-a$ to be both at most 2 . Since $b-a \geq 4$, there is only one possibility left in which case $b-a=4$ and thus $d=4$. By considering $P(x-m)$, we can assume $P( \pm 2)=P( \pm 1)=1$ and $P(0)=-1$. The unique fourth degree polynomial satisfying these equalities is $P(x)=-0.5\left(x^{2}-4\right)\left(x^{2}-1\right)+1$ which is not a polynomial with integer coefficients.
For $1 \leq d \leq 3$, there exist polynomials satisfying the conditions.
For $d=1$ we can take $P_{1}(X)=X$ as $P_{1}(-1)=-1$ and $P_{1}(1)=1$.
For $d=2, P_{2}(X)=2 X(X-2)+1$ satisfies $P_{2}(0)=1, P_{2}(1)=-1$ and $P_{2}(2)=1$.
For $d=3$, the polynomial ; $P_{3}(X)=(X+1) X(X-2)+1$ satisfies $P_{3}(-1)=1=P_{3}(0)=P_{3}(2)=1$ and $P_{3}(1)=-1$. So $\left|P_{3}(m)\right|=1$ for $m \in\{-1,0,1,2\}$.
Thus the integers with the required property are precisely $d=1,2,3$. This completes the proof.
## BxMO 2020: Problems and Solutions
#
|
d=1,2,3
|
Yes
|
Yes
|
math-word-problem
|
Algebra
|
Find all positive integers $d$ with the following property: there exists a polynomial $P$ of degree $d$ with integer coefficients such that $|P(m)|=1$ for at least $d+1$ different integers $m$.
#
|
Note that $P(x)=c$ for a fixed constant has at most $d$ solutions, since the polynomial $P(x)-c$ of degree $d$ cancels at most $d$ times. This implies that there are integers $m$ satisfying $P(m)=1$, as well as integers $m$ such that $P(m)=-1$.
Next, we prove the following lemma.
Lemma. If $a$ and $b$ are integers such that $P(a)=-1$ and $P(b)=1$, then $|b-a| \leq 2$.
Proof Since $b-a \mid P(b)-P(a)$ by a well-known lemma (corollary of $a-b \mid a^{n}-b^{n}$ for every integer $n \geq 0$ ), the conclusion follows.
Let us first consider the case that $d \geq 4$, and assume that there exists a polynomial P with at least $d+1 \geq 5$ solutions to $|P(m)|=1$. Let $a$ and $b$ be the smallest and largest solution respectively. Since $b-a \geq 4$, we need $P(a)=P(b)$ by the lemma. Without loss of generality (by switching $P$ with $-P$ if necessary) we can assume $P(a)=P(b)=1$. Take a value $m$ such that $P(m)=-1$. Due to the lemma, we need $b-m$ and $m-a$ to be both at most 2 . Since $b-a \geq 4$, there is only one possibility left in which case $b-a=4$ and thus $d=4$. By considering $P(x-m)$, we can assume $P( \pm 2)=P( \pm 1)=1$ and $P(0)=-1$. The unique fourth degree polynomial satisfying these equalities is $P(x)=-0.5\left(x^{2}-4\right)\left(x^{2}-1\right)+1$ which is not a polynomial with integer coefficients.
For $1 \leq d \leq 3$, there exist polynomials satisfying the conditions.
For $d=1$ we can take $P_{1}(X)=X$ as $P_{1}(-1)=-1$ and $P_{1}(1)=1$.
For $d=2, P_{2}(X)=2 X(X-2)+1$ satisfies $P_{2}(0)=1, P_{2}(1)=-1$ and $P_{2}(2)=1$.
For $d=3$, the polynomial ; $P_{3}(X)=(X+1) X(X-2)+1$ satisfies $P_{3}(-1)=1=P_{3}(0)=P_{3}(2)=1$ and $P_{3}(1)=-1$. So $\left|P_{3}(m)\right|=1$ for $m \in\{-1,0,1,2\}$.
Thus the integers with the required property are precisely $d=1,2,3$. This completes the proof.
## BxMO 2020: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2020-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2020"
}
|
Let $N$ be a positive integer. A collection of $4 N^{2}$ unit tiles with two segments drawn on them as shown is assembled into a $2 N \times 2 N$ board. Tiles can be rotated.
The segments on the tiles define paths on the board. Determine the least possible number and the largest possible number of such paths.
#
|
Let $p$ denote the number of paths. Notice that there are two types of paths: (1) those that start and end at a point on the boundary of the board and (2) closed paths in the interior of the board. Let $p_{1}, p_{2}$ denote the respective numbers of paths of either type. There are $8 N$ points on the boundary of the board, and each of these is the starting point or endpoint of exactly one path, so $p_{1}=4 \mathrm{~N}$. Trivially, $p_{2} \geqslant 0$, so $p=p_{1}+p_{2} \geqslant 4 N$.
The paths on the board are made up of $8 N^{2}$ segments in total. There are only 4 possible paths of one segment, in the corners of the board. All other paths on the boundary of the board therefore consist of at least 2 segments. Moreover, all closed paths in the interior of the board consist of at least 4 segments. Hence
$$
8 N^{2} \geqslant 4 \cdot 1+\left(p_{1}-4\right) \cdot 2+p_{2} \cdot 4 \Longleftrightarrow p_{2} \leqslant N^{2}+(N-1)^{2}, \text { so } p=p_{1}+p_{2} \leqslant N^{2}+(N+1)^{2}
$$
We have thus shown that $4 N \leqslant p \leqslant N^{2}+(N+1)^{2}$. These minimum and maximum values can indeed be attained, as shown below for $N=3$.
The constructions generalise easily.The constructions clearly attain the required bounds because they satisfy the equalities in our arguments showing the two bounds. Indeed the board on the left has $p_{2}=0$ so give the lower bound. The one on the right has exactly 4 boundary paths with one segment, all other $4 N-4$ boundary paths with 2 segments, and all remaining paths with 4 segments.
Remark. The same ideas solve the analogous problem for a $(2 N+1) \times(2 N+1)$ assembled from $(2 N+1)^{2}$ such tiles. For this board, $p \geqslant p_{1}=2(2 N+1)$. Next, there are $2(2 N+1)^{2}$ segments, so, again,
$$
2(2 N+1)^{2} \geqslant 4 \cdot 1+\left(p_{1}-4\right) \cdot 2+p_{2} \cdot 4 \Longleftrightarrow p_{2} \leqslant 2 N^{2}+\frac{1}{2}
$$
But $p_{2}$ is an integer, so $p_{2} \leqslant 2 N^{2}$, and hence $p \leqslant 2(N+1)^{2}$. We have thus shown that $2(2 N+1) \leqslant p \leqslant 2(N+1)^{2}$. The construction for the lower bound is the same as for the $2 N \times 2 N$ board; the construction for the upper bound, shown for $N=3$, is a small modification of that for the $2 N \times 2 N$ board and again generalises easily.
## BxMO 2020: Problems and Solutions
#
|
4 N \leqslant p \leqslant N^{2}+(N+1)^{2}
|
Incomplete
|
Yes
|
math-word-problem
|
Combinatorics
|
Let $N$ be a positive integer. A collection of $4 N^{2}$ unit tiles with two segments drawn on them as shown is assembled into a $2 N \times 2 N$ board. Tiles can be rotated.
The segments on the tiles define paths on the board. Determine the least possible number and the largest possible number of such paths.
#
|
Let $p$ denote the number of paths. Notice that there are two types of paths: (1) those that start and end at a point on the boundary of the board and (2) closed paths in the interior of the board. Let $p_{1}, p_{2}$ denote the respective numbers of paths of either type. There are $8 N$ points on the boundary of the board, and each of these is the starting point or endpoint of exactly one path, so $p_{1}=4 \mathrm{~N}$. Trivially, $p_{2} \geqslant 0$, so $p=p_{1}+p_{2} \geqslant 4 N$.
The paths on the board are made up of $8 N^{2}$ segments in total. There are only 4 possible paths of one segment, in the corners of the board. All other paths on the boundary of the board therefore consist of at least 2 segments. Moreover, all closed paths in the interior of the board consist of at least 4 segments. Hence
$$
8 N^{2} \geqslant 4 \cdot 1+\left(p_{1}-4\right) \cdot 2+p_{2} \cdot 4 \Longleftrightarrow p_{2} \leqslant N^{2}+(N-1)^{2}, \text { so } p=p_{1}+p_{2} \leqslant N^{2}+(N+1)^{2}
$$
We have thus shown that $4 N \leqslant p \leqslant N^{2}+(N+1)^{2}$. These minimum and maximum values can indeed be attained, as shown below for $N=3$.
The constructions generalise easily.The constructions clearly attain the required bounds because they satisfy the equalities in our arguments showing the two bounds. Indeed the board on the left has $p_{2}=0$ so give the lower bound. The one on the right has exactly 4 boundary paths with one segment, all other $4 N-4$ boundary paths with 2 segments, and all remaining paths with 4 segments.
Remark. The same ideas solve the analogous problem for a $(2 N+1) \times(2 N+1)$ assembled from $(2 N+1)^{2}$ such tiles. For this board, $p \geqslant p_{1}=2(2 N+1)$. Next, there are $2(2 N+1)^{2}$ segments, so, again,
$$
2(2 N+1)^{2} \geqslant 4 \cdot 1+\left(p_{1}-4\right) \cdot 2+p_{2} \cdot 4 \Longleftrightarrow p_{2} \leqslant 2 N^{2}+\frac{1}{2}
$$
But $p_{2}$ is an integer, so $p_{2} \leqslant 2 N^{2}$, and hence $p \leqslant 2(N+1)^{2}$. We have thus shown that $2(2 N+1) \leqslant p \leqslant 2(N+1)^{2}$. The construction for the lower bound is the same as for the $2 N \times 2 N$ board; the construction for the upper bound, shown for $N=3$, is a small modification of that for the $2 N \times 2 N$ board and again generalises easily.
## BxMO 2020: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2020-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2020"
}
|
Let $A B C$ be a triangle. The circle $\omega_{A}$ through $A$ is tangent to line $B C$ at $B$. The circle $\omega_{C}$ through $C$ is tangent to line $A B$ at $B$. Let $\omega_{A}$ and $\omega_{C}$ meet again at $D$. Let $M$ be the midpoint of line segment [ $B C]$, and let $E$ be the intersection of lines $M D$ and $A C$. Show that $E$ lies on $\omega_{A}$.
#
|
Let $N$ be the midpoint of $[A B]$. By tangential angles, $\angle C B D=\angle B A D$ and $\angle D B A=\angle D C B$, so triangles $D A B$ and $D B C$ are similar. By definition of the midpoints $M, N$, so are triangles $A N D$ and $B M D$. In particular, $\angle B N D=180^{\circ}-\angle D N A=180^{\circ}-\angle D M B$, so $B N D M$ is cyclic. But $M N \| A C$ by construction, so $\angle D B A=\angle D B N=\angle D M N=\angle E M N=\angle M E A=\angle D E A$, hence $E A D B$ is cyclic, completing the proof.
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle. The circle $\omega_{A}$ through $A$ is tangent to line $B C$ at $B$. The circle $\omega_{C}$ through $C$ is tangent to line $A B$ at $B$. Let $\omega_{A}$ and $\omega_{C}$ meet again at $D$. Let $M$ be the midpoint of line segment [ $B C]$, and let $E$ be the intersection of lines $M D$ and $A C$. Show that $E$ lies on $\omega_{A}$.
#
|
Let $N$ be the midpoint of $[A B]$. By tangential angles, $\angle C B D=\angle B A D$ and $\angle D B A=\angle D C B$, so triangles $D A B$ and $D B C$ are similar. By definition of the midpoints $M, N$, so are triangles $A N D$ and $B M D$. In particular, $\angle B N D=180^{\circ}-\angle D N A=180^{\circ}-\angle D M B$, so $B N D M$ is cyclic. But $M N \| A C$ by construction, so $\angle D B A=\angle D B N=\angle D M N=\angle E M N=\angle M E A=\angle D E A$, hence $E A D B$ is cyclic, completing the proof.
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2020-zz.jsonl",
"solution_match": "# Solution 1",
"tier": "T3",
"year": "2020"
}
|
Let $A B C$ be a triangle. The circle $\omega_{A}$ through $A$ is tangent to line $B C$ at $B$. The circle $\omega_{C}$ through $C$ is tangent to line $A B$ at $B$. Let $\omega_{A}$ and $\omega_{C}$ meet again at $D$. Let $M$ be the midpoint of line segment [ $B C]$, and let $E$ be the intersection of lines $M D$ and $A C$. Show that $E$ lies on $\omega_{A}$.
#
|
Let $S$ be the point on $\omega_{C}$ such that $B S$ is parallel to $A C$, and let $E^{\prime}$ be the reflection of $S$ in $M$ (such that $B S C E^{\prime}$ is a parallellogram and $E^{\prime}$ lies on $A C$ ). Now we do some (directed) angle chasing:
$$
\begin{aligned}
\angle A E^{\prime} B & =\angle C E^{\prime} B\left(\text { since } A, E^{\prime} \text { and } C \text { are collineair }\right) \\
& =\angle B S C\left(B S C E^{\prime} \text { is a parallellogram }\right) \\
& =\angle A B C\left(\text { inscribed angles on } \omega_{C}\right) \\
& =\angle A D B\left(\text { inscribed angles on } \omega_{A}\right) .
\end{aligned}
$$
Hence $E^{\prime}$ lies on $\omega_{A}$. Further $\angle A E^{\prime} D=\angle A B D=\angle B S D$, and because $A E^{\prime}$ is parallel to $B S$ we find that $E^{\prime} D$ is parallel to $S D$. This means that $E^{\prime}$ lies on $M D$, so $E^{\prime}=E$ and $E$ lies on $\omega_{A}$.
# BxMO 2020: Problems and Solutions
#
|
proof
|
Yes
|
Yes
|
proof
|
Geometry
|
Let $A B C$ be a triangle. The circle $\omega_{A}$ through $A$ is tangent to line $B C$ at $B$. The circle $\omega_{C}$ through $C$ is tangent to line $A B$ at $B$. Let $\omega_{A}$ and $\omega_{C}$ meet again at $D$. Let $M$ be the midpoint of line segment [ $B C]$, and let $E$ be the intersection of lines $M D$ and $A C$. Show that $E$ lies on $\omega_{A}$.
#
|
Let $S$ be the point on $\omega_{C}$ such that $B S$ is parallel to $A C$, and let $E^{\prime}$ be the reflection of $S$ in $M$ (such that $B S C E^{\prime}$ is a parallellogram and $E^{\prime}$ lies on $A C$ ). Now we do some (directed) angle chasing:
$$
\begin{aligned}
\angle A E^{\prime} B & =\angle C E^{\prime} B\left(\text { since } A, E^{\prime} \text { and } C \text { are collineair }\right) \\
& =\angle B S C\left(B S C E^{\prime} \text { is a parallellogram }\right) \\
& =\angle A B C\left(\text { inscribed angles on } \omega_{C}\right) \\
& =\angle A D B\left(\text { inscribed angles on } \omega_{A}\right) .
\end{aligned}
$$
Hence $E^{\prime}$ lies on $\omega_{A}$. Further $\angle A E^{\prime} D=\angle A B D=\angle B S D$, and because $A E^{\prime}$ is parallel to $B S$ we find that $E^{\prime} D$ is parallel to $S D$. This means that $E^{\prime}$ lies on $M D$, so $E^{\prime}=E$ and $E$ lies on $\omega_{A}$.
# BxMO 2020: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "3",
"problem_match": "# Problem 3",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2020-zz.jsonl",
"solution_match": "# Solution 2",
"tier": "T3",
"year": "2020"
}
|
A divisor $d$ of a positive integer $n$ is said to be a close divisor of $n$ if $\sqrt{n}<d<2 \sqrt{n}$. Does there exist a positive integer with exactly 2020 close divisors?
#
|
Let $m$ be an odd integer with exactly 2020 positive divisors and which is (automatically) not a square. For example, $m=3^{2019}$ suffices, but of course there are many alternatives. Now consider $n=2^{k} m$, for some integer $k$ such that $2^{k}>m$. Any divisor of $n$ is then of the form $2^{\ell} d$ where $d$ is a divisor of $m$. We will now show that for every such divisor $d$, there exists a unique $\ell$ such that $2^{\ell} d$ is a close divisor. Because $\sqrt{n}$ is not an integer, there certainly is a unique integer $a$ such that $\sqrt{n}<2^{a} d<2 \sqrt{n}$. Because $2^{k}>m$, we have $m<\sqrt{n}<2^{k}$. Combining with $1 \leq d \leq m$, we find $1<\frac{\sqrt{n}}{d}<2^{a}<\frac{2 \sqrt{n}}{d}<2 \cdot 2^{k}$ and so we see that $0<a \leqslant k$. So $2^{a} d$ is indeed a close divisor. Because $m$ has exactly 2020 divisors, we find that $n$ has exactly 2020 close divisors.
|
proof
|
Yes
|
Yes
|
math-word-problem
|
Number Theory
|
A divisor $d$ of a positive integer $n$ is said to be a close divisor of $n$ if $\sqrt{n}<d<2 \sqrt{n}$. Does there exist a positive integer with exactly 2020 close divisors?
#
|
Let $m$ be an odd integer with exactly 2020 positive divisors and which is (automatically) not a square. For example, $m=3^{2019}$ suffices, but of course there are many alternatives. Now consider $n=2^{k} m$, for some integer $k$ such that $2^{k}>m$. Any divisor of $n$ is then of the form $2^{\ell} d$ where $d$ is a divisor of $m$. We will now show that for every such divisor $d$, there exists a unique $\ell$ such that $2^{\ell} d$ is a close divisor. Because $\sqrt{n}$ is not an integer, there certainly is a unique integer $a$ such that $\sqrt{n}<2^{a} d<2 \sqrt{n}$. Because $2^{k}>m$, we have $m<\sqrt{n}<2^{k}$. Combining with $1 \leq d \leq m$, we find $1<\frac{\sqrt{n}}{d}<2^{a}<\frac{2 \sqrt{n}}{d}<2 \cdot 2^{k}$ and so we see that $0<a \leqslant k$. So $2^{a} d$ is indeed a close divisor. Because $m$ has exactly 2020 divisors, we find that $n$ has exactly 2020 close divisors.
|
{
"exam": "Benelux_MO",
"problem_label": "4",
"problem_match": "# Problem 4",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2020-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2020"
}
|
(a) Prove that for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$,
$$
\max (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\max (c, d) \geqslant 0
$$
(b) Find the largest non-negative integer $k$ such that it is possible to replace $k$ of the six maxima in this inequality by minima in such a way that the inequality still holds for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$.
#
|
The left-hand-side of the inequality is invariant under permutations of $a, b, c, d$. We may therefore suppose that $a \geqslant b \geqslant c \geqslant d$, so that the inequality reduces to
$$
0 \leqslant 3 a+2 b+c=a+(a+b)+(a+b+c)
$$
We claim that each of the terms on the right-hand side is non-negative; this will prove the inequality. Indeed, if $a<0$, then $a, b, c, d<0$, and so $a+b+c+d<0$, a contradiction. Also, if $a+b<0$, then, as $b \leqslant a$, $0>b \geqslant c, d$ so $(a+b)+c+d<0$, another contradiction. Finally, if $a+b+c<0$, then, as above, $0>c \geqslant d$, so $(a+b+c)+d<0$, a final contradiction.
Next, we claim that it is impossible to replace $k \geqslant 3$ maxima by minima in the inequality. Indeed, if $k \geqslant 3$, one number, say $d$, appears in two of the terms changed to minima. Take $a=b=c=1, d=-3$, so that $a+b+c+d=0$. Then the sum is at most $4 \cdot 1+2 \cdot(-3)<0$. Hence $k<3$.
Finally, we prove that the required inequality holds if $k=2$ and the terms involving the complementary sets $\{a, b\},\{c, d\}$ are changed to minima. We will assume again that $a \geqslant b \geqslant c \geqslant d$, and prove that the inequality holds for any change of the terms involving permutations of these sets to minima (rather than proving that it holds for all orderings of $a, b, c, d$ for this one change). There are three cases:
(1) change terms $\{a, b\},\{c, d\}$, so the inequality becomes $2 a+3 b+d \geqslant 0 \Longleftrightarrow a+b+(b-c) \geqslant 0$;
(2) change terms $\{a, c\},\{b, d\}$, so the inequality becomes $2 a+b+2 c+d \geqslant 0 \Longleftrightarrow a+c \geqslant 0$;
(3) change terms $\{a, d\},\{b, c\}$, so the inequality becomes $2 a+b+2 c+d \geqslant 0 \Longleftrightarrow a+c \geqslant 0$,
where we have used $a+b+c+d=0$. In the first case, inequality holds since $a+b \geqslant 0$ as proved earlier and $b \geqslant c$. In the other cases, suppose that $a+c<0$. Then $c<-a$ and hence $d<-a$ as $d \leqslant c$. Hence $c+d<-2 a \leqslant-a-b$ as $a \geqslant b$, so $a+b+c+d<0$, a final contradiction, completing the proof.
#
|
proof
|
Yes
|
Yes
|
proof
|
Inequalities
|
(a) Prove that for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$,
$$
\max (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\max (c, d) \geqslant 0
$$
(b) Find the largest non-negative integer $k$ such that it is possible to replace $k$ of the six maxima in this inequality by minima in such a way that the inequality still holds for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$.
#
|
The left-hand-side of the inequality is invariant under permutations of $a, b, c, d$. We may therefore suppose that $a \geqslant b \geqslant c \geqslant d$, so that the inequality reduces to
$$
0 \leqslant 3 a+2 b+c=a+(a+b)+(a+b+c)
$$
We claim that each of the terms on the right-hand side is non-negative; this will prove the inequality. Indeed, if $a<0$, then $a, b, c, d<0$, and so $a+b+c+d<0$, a contradiction. Also, if $a+b<0$, then, as $b \leqslant a$, $0>b \geqslant c, d$ so $(a+b)+c+d<0$, another contradiction. Finally, if $a+b+c<0$, then, as above, $0>c \geqslant d$, so $(a+b+c)+d<0$, a final contradiction.
Next, we claim that it is impossible to replace $k \geqslant 3$ maxima by minima in the inequality. Indeed, if $k \geqslant 3$, one number, say $d$, appears in two of the terms changed to minima. Take $a=b=c=1, d=-3$, so that $a+b+c+d=0$. Then the sum is at most $4 \cdot 1+2 \cdot(-3)<0$. Hence $k<3$.
Finally, we prove that the required inequality holds if $k=2$ and the terms involving the complementary sets $\{a, b\},\{c, d\}$ are changed to minima. We will assume again that $a \geqslant b \geqslant c \geqslant d$, and prove that the inequality holds for any change of the terms involving permutations of these sets to minima (rather than proving that it holds for all orderings of $a, b, c, d$ for this one change). There are three cases:
(1) change terms $\{a, b\},\{c, d\}$, so the inequality becomes $2 a+3 b+d \geqslant 0 \Longleftrightarrow a+b+(b-c) \geqslant 0$;
(2) change terms $\{a, c\},\{b, d\}$, so the inequality becomes $2 a+b+2 c+d \geqslant 0 \Longleftrightarrow a+c \geqslant 0$;
(3) change terms $\{a, d\},\{b, c\}$, so the inequality becomes $2 a+b+2 c+d \geqslant 0 \Longleftrightarrow a+c \geqslant 0$,
where we have used $a+b+c+d=0$. In the first case, inequality holds since $a+b \geqslant 0$ as proved earlier and $b \geqslant c$. In the other cases, suppose that $a+c<0$. Then $c<-a$ and hence $d<-a$ as $d \leqslant c$. Hence $c+d<-2 a \leqslant-a-b$ as $a \geqslant b$, so $a+b+c+d<0$, a final contradiction, completing the proof.
#
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2021-zz.jsonl",
"solution_match": "# Solution 1",
"tier": "T3",
"year": "2021"
}
|
(a) Prove that for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$,
$$
\max (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\max (c, d) \geqslant 0
$$
(b) Find the largest non-negative integer $k$ such that it is possible to replace $k$ of the six maxima in this inequality by minima in such a way that the inequality still holds for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$.
#
|
Using the inequality $\max (x, y) \geqslant \frac{1}{2}(x+y)$, we find that
$$
\max (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\max (c, d) \geqslant \frac{3}{2}(a+b+c+d)=0
$$
For $k=3$, we take the same counterexample as in Solution 1. Now it remains to prove the inequality where $\max (a, b)$ and $\max (c, d)$ are replaced by $\min (a, b)$ and $\min (c, d)$. We can assume without loss of generality that $\min (a, b)=a$ and $\min (c, d)=c$. Now we find
$$
\begin{aligned}
& \min (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\min (c, d) \geqslant \\
& a+\frac{1}{2}(a+c)+d+b+\frac{1}{2}(b+d)+c=\frac{3}{2}(a+b+c+d)=0
\end{aligned}
$$
## BxMO 2021: Problems and Solutions
#
|
proof
|
Yes
|
Yes
|
proof
|
Inequalities
|
(a) Prove that for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$,
$$
\max (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\max (c, d) \geqslant 0
$$
(b) Find the largest non-negative integer $k$ such that it is possible to replace $k$ of the six maxima in this inequality by minima in such a way that the inequality still holds for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$.
#
|
Using the inequality $\max (x, y) \geqslant \frac{1}{2}(x+y)$, we find that
$$
\max (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\max (c, d) \geqslant \frac{3}{2}(a+b+c+d)=0
$$
For $k=3$, we take the same counterexample as in Solution 1. Now it remains to prove the inequality where $\max (a, b)$ and $\max (c, d)$ are replaced by $\min (a, b)$ and $\min (c, d)$. We can assume without loss of generality that $\min (a, b)=a$ and $\min (c, d)=c$. Now we find
$$
\begin{aligned}
& \min (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\min (c, d) \geqslant \\
& a+\frac{1}{2}(a+c)+d+b+\frac{1}{2}(b+d)+c=\frac{3}{2}(a+b+c+d)=0
\end{aligned}
$$
## BxMO 2021: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2021-zz.jsonl",
"solution_match": "# Solution 2",
"tier": "T3",
"year": "2021"
}
|
(a) Prove that for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$,
$$
\max (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\max (c, d) \geqslant 0
$$
(b) Find the largest non-negative integer $k$ such that it is possible to replace $k$ of the six maxima in this inequality by minima in such a way that the inequality still holds for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$.
#
|
We present another proof for the inequality where $\max (a, b)$ and $\max (c, d)$ are replaced by $\min (a, b)$ and $\min (c, d)$. By substituting $\max (x, y)=\frac{1}{2}(x+y+|x-y|)$ and $\min (x, y)=\frac{1}{2}(x+y-|x-y|)$ everywhere and using $a+b+c+d=0$, the inequality may be rewritten as:
$$
|a-c|+|a-d|+|b-c|+|b-d| \stackrel{?}{\geqslant}|a-b|+|c-d| .
$$
By the triangle inequality, we have
$$
|a-c|+|a-d|+|b-c|+|b-d| \geqslant|(a-c)-(b-c)|+|(a-d)-(b-d)|=2|a-b|,
$$
and similarly, $|a-c|+|a-d|+|b-c|+|b-d| \geqslant 2|c-d|$. Adding these and dividing by 2 yields the desired inequality.
# BxMO 2021: Problems and Solutions
#
|
proof
|
Yes
|
Yes
|
proof
|
Inequalities
|
(a) Prove that for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$,
$$
\max (a, b)+\max (a, c)+\max (a, d)+\max (b, c)+\max (b, d)+\max (c, d) \geqslant 0
$$
(b) Find the largest non-negative integer $k$ such that it is possible to replace $k$ of the six maxima in this inequality by minima in such a way that the inequality still holds for all $a, b, c, d \in \mathbb{R}$ with $a+b+c+d=0$.
#
|
We present another proof for the inequality where $\max (a, b)$ and $\max (c, d)$ are replaced by $\min (a, b)$ and $\min (c, d)$. By substituting $\max (x, y)=\frac{1}{2}(x+y+|x-y|)$ and $\min (x, y)=\frac{1}{2}(x+y-|x-y|)$ everywhere and using $a+b+c+d=0$, the inequality may be rewritten as:
$$
|a-c|+|a-d|+|b-c|+|b-d| \stackrel{?}{\geqslant}|a-b|+|c-d| .
$$
By the triangle inequality, we have
$$
|a-c|+|a-d|+|b-c|+|b-d| \geqslant|(a-c)-(b-c)|+|(a-d)-(b-d)|=2|a-b|,
$$
and similarly, $|a-c|+|a-d|+|b-c|+|b-d| \geqslant 2|c-d|$. Adding these and dividing by 2 yields the desired inequality.
# BxMO 2021: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "1",
"problem_match": "# Problem 1",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2021-zz.jsonl",
"solution_match": "# Solution 3",
"tier": "T3",
"year": "2021"
}
|
Pebbles are placed on a $2021 \times 2021$ board in such a way that each square contains at most one pebble. The pebble set of a square of the board is the collection of all pebbles which are in the same row or column as this square. Determine the least number of pebbles that can be placed on the board in such a way that no two squares have the same pebble set.
#
|
Let $N \geqslant 1$ be a positive integer. We claim that the least number of pebbles that can be placed on a $(2 N+1) \times(2 N+1)$ chessboard in such a way that no two squares of the board have the same pebble set is $3 N+1$. The problem has $N=1010$, so at least 3031 pebbles are needed.
We begin by placing $(2 N+1)+N=3 N+1$ pebbles on the board as shown. The construction extends to all values of $N$, and one checks that no two squares on the board have the same pebble set.
We are left to show that the number of pebbles, $P$, that must be placed on the board is at least $3 N+1$. Suppose that there exists an empty row. Any other row must then contain at least two pebbles. Indeed, if another row is empty, Figure [1], or contains exactly one pebble, Figure [2], then there are two squares (shaded in the figures below) with the same pebble set. So in this case there are at least $P \geqslant 2(2 N+1-1)=4 N \geqslant 3 N+1$ pebbles on the board. The same argument applies, mutatis mutandis, to the columns of the board.
On the other hand, suppose that each each row and each column contains at least one pebble. Let $k$ the number of rows containing precisely one pebble. Counting the number of pebbles per row shows that $P \geqslant k+2(2 N+1-k)$. To count the number of pebbles per column, note that the $k$ pebbles that are the only ones in their row must be in $k$ distinct columns, Figure [3]. Furthermore, at most one of these $k$ columns only has one pebble in it, Figure [4]. So these $k$ columns contain a total of at least $2 k-1$ pebbles, while the remaining columns contain at least one each. Hence $P \geqslant(2 k-1)+(2 N+1-k)$. Adding these two inequalities we get $2 P \geqslant 6 N+2$.
Remark. For a $2 N \times 2 N$ board, at least $3 N$ pebbles are needed. The proof is similar: if there is an empty line, then $P \geqslant 2(2 N-1) \geqslant 3 N$ for $N \geqslant 2$. If there is no empty line, then $2 P \geqslant 6 N-1$. A construction similar to that of the odd boards works. While the construction is unique in the odd case, up to permutation of rows and columns, that is not true for even boards.
## BxMO 2021: Problems and Solutions
#
|
3031
|
Yes
|
Yes
|
math-word-problem
|
Combinatorics
|
Pebbles are placed on a $2021 \times 2021$ board in such a way that each square contains at most one pebble. The pebble set of a square of the board is the collection of all pebbles which are in the same row or column as this square. Determine the least number of pebbles that can be placed on the board in such a way that no two squares have the same pebble set.
#
|
Let $N \geqslant 1$ be a positive integer. We claim that the least number of pebbles that can be placed on a $(2 N+1) \times(2 N+1)$ chessboard in such a way that no two squares of the board have the same pebble set is $3 N+1$. The problem has $N=1010$, so at least 3031 pebbles are needed.
We begin by placing $(2 N+1)+N=3 N+1$ pebbles on the board as shown. The construction extends to all values of $N$, and one checks that no two squares on the board have the same pebble set.
We are left to show that the number of pebbles, $P$, that must be placed on the board is at least $3 N+1$. Suppose that there exists an empty row. Any other row must then contain at least two pebbles. Indeed, if another row is empty, Figure [1], or contains exactly one pebble, Figure [2], then there are two squares (shaded in the figures below) with the same pebble set. So in this case there are at least $P \geqslant 2(2 N+1-1)=4 N \geqslant 3 N+1$ pebbles on the board. The same argument applies, mutatis mutandis, to the columns of the board.
On the other hand, suppose that each each row and each column contains at least one pebble. Let $k$ the number of rows containing precisely one pebble. Counting the number of pebbles per row shows that $P \geqslant k+2(2 N+1-k)$. To count the number of pebbles per column, note that the $k$ pebbles that are the only ones in their row must be in $k$ distinct columns, Figure [3]. Furthermore, at most one of these $k$ columns only has one pebble in it, Figure [4]. So these $k$ columns contain a total of at least $2 k-1$ pebbles, while the remaining columns contain at least one each. Hence $P \geqslant(2 k-1)+(2 N+1-k)$. Adding these two inequalities we get $2 P \geqslant 6 N+2$.
Remark. For a $2 N \times 2 N$ board, at least $3 N$ pebbles are needed. The proof is similar: if there is an empty line, then $P \geqslant 2(2 N-1) \geqslant 3 N$ for $N \geqslant 2$. If there is no empty line, then $2 P \geqslant 6 N-1$. A construction similar to that of the odd boards works. While the construction is unique in the odd case, up to permutation of rows and columns, that is not true for even boards.
## BxMO 2021: Problems and Solutions
#
|
{
"exam": "Benelux_MO",
"problem_label": "2",
"problem_match": "# Problem 2",
"resource_path": "Benelux_MO/segmented/Benelux_en-olympiad_en-bxmo-problems-2021-zz.jsonl",
"solution_match": "# Solution\n",
"tier": "T3",
"year": "2021"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.