problem: Let $A B C$ be a triangle and $\Gamma$ the circle with diameter $A B$. The bisectors of $\angle B A C$ and $\angle A B C$ intersect $\Gamma$ (also) at $D$ and $E$, respectively. The incircle of $A B C$ meets $B C$ and $A C$ at $F$ and $G$, respectively. Prove that $D, E, F$ and $G$ are collinear.

solution:
Let the line $E D$ meet $A C$ at $G^{\prime}$ and $B C$ at $F^{\prime} . A D$ and $B E$ intersect at $I$, the incenter of $A B C$. As angles subtending the same arc $\widehat{B D}$, $\angle D A B=\angle D E B=\angle G^{\prime} E I$. But $\angle D A B=\angle C A D=$ $\angle G^{\prime} A I$. This means that $E, A, I$ and $G^{\prime}$ are concyclic, and $\angle A E I=\angle A G^{\prime} I$ as angles subtending the same chord $A I$. But $A B$ is a diameter of $\Gamma$, and so $\angle A E B=$ $\angle A E I$ is a right angle. So $I G^{\prime} \perp A C$, or $G^{\prime}$ is the foot of the perpendicular from $I$ to $A C$. This implies $G^{\prime}=G$. In a similar manner we prove that $F^{\prime}=F$, and the proof is complete.

![](https://cdn.mathpix.com/cropped/2024_06_06_85fe7edff05a163ce91fg-1.jpg?height=568&width=588&top_left_y=921&top_left_x=1271)

problem_match: ## Problem 1.

solution_match: Solution 1.


solution: (Read the attached figure so that $F^{\prime}$ and $G^{\prime}$ are as $F$ and $G$ in the problem text.) The angles $\angle A E I=\angle A E B$ and $\angle A G I$ are right angles. This means that $A I G E$ is a cyclic quadrilateral. But then $\angle B E G=\angle I E G=\angle I A G=\angle D A C=\angle D A B=\angle B E D$, implying that $G$ and $D$ are on the same line through $E$. The same argument shows $F$ and $E$ are on the same line through $D$. So the points $G$ and $F$ are on the line $E D$.

solution_match: Solution 2.


problem: Find the primes $p, q, r$, given that one of the numbers $p q r$ and $p+q+r$ is 101 times the other.

solution: We may assume $r=\max \{p, q, r\}$. Then $p+q+r \leq 3 r$ and $p q r \geq 4 r$. So the sum of the three primes is always less than their product. The only relevant requirement thus is $p q r=101(p+q+r)$. We observe that 101 is a prime. So one of $p, q, r$ must be 101. Assume $r=101$. Then $p q=p+q+101$. This can be written as $(p-1)(q-1)=102$. Since $102=1 \cdot 102=2 \cdot 51=3 \cdot 34=6 \cdot 17$, the possibilities for $\{p, q\}$ are $\{2,103\},\{3,52\},\{4,35\},\{7,18\}$ The only case, where both the numbers are primes, is $\{2,103\}$. So the only solution to the problem is $\{p, q, r\}=\{2,101,103\}$.

problem_match: ## Problem 2.

solution_match: Solution.


problem:
Let $n>1$ and $p(x)=x^{n}+a_{n-1} x^{n-1}+\cdots+a_{0}$ be a polynomial with $n$ real roots (counted with multiplicity). Let the polynomial $q$ be defined by

$$
q(x)=\prod_{j=1}^{2015} p(x+j)
$$

We know that $p(2015)=2015$. Prove that $q$ has at least 1970 different roots $r_{1}, \ldots, r_{1970}$ such that $\left|r_{j}\right|<2015$ for all $j=1, \ldots, 1970$.

solution: Let $h_{j}(x)=p(x+j)$. Consider $h_{2015}$. Like $p$, it has $n$ real roots $s_{1}, s_{2}, \ldots, s_{n}$, and $h_{2015}(0)=p(2015)=2015$. By Viète, the product $\left|s_{1} s_{2} \cdots s_{n}\right|$ equals 2015. Since $n \geq 2$, there is at least one $s_{j}$ such that $\left|s_{j}\right| \leq \sqrt{2015}<\sqrt{2025}=45$. Denote this $s_{j}$ by $m$. Now for all $j=0,1, \ldots, 2014, h_{2015-j}(m+j)=p(m+j+2015-j)=p(m+2015)=$ $h_{2015}(m)=0$. So $m, m+1, \ldots, m+2014$ are all roots of $q$. Since $0 \leq|m|<45$, the condition $|m+j|<2015$ is satisfied by at least 1970 different $j, 0 \leq j \leq 2014$, and we are done.

problem_match: ## Problem 3.


problem:
An encyclopedia consists of 2000 numbered volumes. The volumes are stacked in order with number 1 on top and 2000 in the bottom. One may perform two operations with the stack:

(i) For $n$ even, one may take the top $n$ volumes and put them in the bottom of the stack without changing the order.

(ii) For $n$ odd, one may take the top $n$ volumes, turn the order around and put them on top of the stack again.

How many different permutations of the volumes can be obtained by using these two operations repeatedly?

solution:
(By the proposer.) Let the positions of the books in the stack be $1,2,3, \ldots, 2000$ from the top (and consider them modulo 2000). Notice that both operations fix the parity of the number of the book at a any given position. Operation (i) subtracts an even integer from the number of the book at each position. If $A$ is an operation of type (i), and $B$ is an operation of type (ii), then the operation $A^{-1} B A$ changes the order of the books in the positions $n+1$ to $n+m$ where $n$ is even and $m$ is odd. This is called turning the interval.

Now we prove that all the volumes in odd positions can be placed in the odd positions in every way we like: If the volume we want in position 1 is in position $m_{1}$, we turn the interval 1 to $m_{1}$. Now if the volume we want in position 3 is in position $m_{3}$, we turn the interval 3 to $m_{3}$, and so on. In this way we can permute the volumes in odd positions exactly as we want to.

Now we prove that we can permute the volumes in even positions exactly as we want without changing the positions of the volumes in the odd positions: We can make a transposition of the two volumes in position $2 n$ and $2 n+2 m$ by turning the interval $2 n+1$ to $2 n+2 m-1$, then turning the interval $2 n+2 m+1$ to $2 n-1$, then turning the interval $2 n+1$ to $2 n-1$, and finally adding $2 m$ to the number of the volume in each position.

Since there are 1000! permutations of the volumes in the odd positions, and 1000! permutations of the volumes in the even positions, altogether we have (1000!) ${ }^{2}$ different permutations.

problem_match: ## Problem 4.


solution:
We show that the volumes can be permuted so that the volumes with odd numbers are in an arbitrary order in the odd-numbered palaces and the volumes with even numbers are in an arbitrary order in the even-numbered places. The main idea is to construct two combinations of the allowed operations. The first one turns the volumes in a specified interval, starting and ending in an odd-numbered place, in the opposite order while keeping everything outside this interval fixed, or keeps everything fixed in an interval while turning the order of the volumes outside this interval in the opposite direction, when the counting starts below that interval and is continued from the top after reaching the bottom volume. The second combined operation just exchanges two volumes in evennumbered places while keeping everything else fixed. - It is clear that 2000 is not a special number, and it could be replaced by a generic even integer. However, we formulate the proof according to the problem text.

Let $E=\{1,2, \ldots, 2000\}$. We formulate the operations described in conditions (i) and (ii), depending on an even integer $n$ and odd integer $m$ as functions $f_{n}: E \rightarrow E$ and $g_{m}: E \rightarrow E$, defined by

$$
f_{n}(p)=\left\{\begin{array}{ll}
2000+p-n & \text { for } p \geq n, \\
p-n & \text { for } n<p
\end{array} \quad \text { and } \quad g_{m}(p)= \begin{cases}m-p+1 & \text { for } p \leq m \\
p & \text { for } m<p\end{cases}\right.
$$

We immediately see that $f_{n}$ and $g_{m}$ map even numbers into even numbers and odd numbers into odd numbers. So the volumes can never be permuted so that an odd-numbered volume would be in an even place or an even-numbered would be in an odd place. The observation $f([1, n])=[2000-(n+1), 2000]$ easily leads to $f_{n}^{-1}=f_{2000-n}$.

Now let $n$ be even and $m$ odd and $n+m<2000$. Consider the combined mapping $f_{n}^{-1} \circ g_{m} \circ f_{n}$. If $n<n+p \leq n+m$, then $f_{n}(n+p)=p \leq m, g_{m}(p)=m-p+1<2000-n$ and $f_{n}^{-1}(m-p+1)=f_{2000-n}(m-p+1)=2000+m-p+1-2000+n=n+m+1-p$. Because $f_{n}([n+1, n+m])=[1, m], f_{n}$ maps numbers $p$ outside the interval $[n+1, n+m]$ into numbers outside the interval $[1, m] ; g_{m}$ keeps these numbers fixed and $f_{n}^{-1}$ returns $f_{n}(p)$ into $p$. So we have shown that for any interval $[s, t] \subset E$ with $s$ and $t$ odd, there is a function $h_{s, t}$, combined of functions of the $f$ type and $g$ type such that $h_{s, t}$ reverses the order of numbers in the interval $[s, t]$ and is the identity function outside this interval.

The functions $h_{s, t}$ allow us to order the odd numbers in an arbitrary manner. If $p_{1}$ ought to be in position 1 , then apply (if needed) $h_{1, p_{1}}$; if the number $p_{2}$ which ought to be in position 3 now is in position $x$, the $x \geq 3$ and we may apply (if needed) $h_{3, x}$. Continuing this way, we eventually arrive at the desired order of the odd numbers.

To construct the second one of the desired operations, we have to obtain a counterpart for $h_{s, t}$ for $t<s$. To this end, consider $f_{n}^{-1} \circ g_{m} \circ f_{n}$ for $m+n>2000$. By the definition of $f_{n}$, $f_{n}(n+m-2000)=2000+(n+m-2000)-n=m$, and so $f_{n}[n+m-2000+1, n]=[m+$ 1, 2000] Consequently, $f_{n}^{-1} \circ g_{m} \circ f_{n}$ keeps numbers in the interval $[n+m-2000+1, n]$ (with even endpoints) fixed. Since $g_{m}$ turns the order around in $[1, m]$ and $f_{n}^{-1}=f_{2000-n}$ maps $[1, m]$ onto the complement of $[n+m-2000+1, n]$ in such a way that $f_{2000-1}(1)=n+1$, the
order of numbers in the complement is reversed in the desired manner. - We have shown that for odd $s$ and $t$ such that $t<s$ there exists a function $h_{s, t}$, combined of functions of the $f$ type and $g$ type such that $h_{s, t}$ is the identity on the interval $[t+1, s-1]$, but reverses the order of the numbers outside this interval, when counting is started from $s$ and continued through over 2000 and 1 over to $t$, in other words modulo 2000 .

To finish the proof, we show that two numbers in the even positions can be exchanged while everything else is fixed. This clearly allows us to put the even numbers in an arbitrary order without violating the order of the odd numbers. To achieve this, we take two even numbers $p$ and $q, p<q$, and consider the function $\phi_{p, q}=f_{2000+p-q} \circ h_{p+1, p-1} \circ h_{q+1, p-1} \circ h_{p+1, q-1}$. The innermost function $h_{p+1, q-1}$ reverses the order on $[p+1, q-1]$ and fixes everything else, the next function $h_{q+1, p-1}$ fixes numbers in $[p, q], h_{p+1, p-1}$ fixes $p$ and reverses the order $(\bmod 2000)$ in $E \backslash\{p\}$, and $f_{2000+p-q}(p)=q$. The two innermost components of $\phi_{p, q}$ fix $q, h_{p+1, p-1}$ takes $q$ to a position $x q-p$ steps ahead of $p(\bmod 2000)$ and $f_{2000+p-q}=f_{q-p}^{-1}$ moves $x q-p$ positions back, i.e. to $p$. If $p+k$ is between $p$ and $q$, then the innermost function maps it to $q-k$, the next one fixes $q-k$, the third function maps $q-k$ to $p-(q-k-p)=2 p-q+k(\bmod 2000)$, and $f_{q-p}^{-1}$ maps $2 p-q+k$ back to $p+k$. A similar reasoning shows that $\phi_{p, q}$ also fixes numbers in $E \backslash[p, q]$.

Since both even and odd numbers have 1000! different permutations, the volumes can be permuted into (1000!) $)^{2}$ different orders by using the given operations repeatedly.


solution:
We show by induction, that if in an ordered sequence one may exchange two consecutive elements without changing the places of any other element, then any two elements can be exchanged so that all other elements remain in place. We assume that this is true for elements which are at most $k$ steps away from each other in the sequence. Assuming that $a$ precedes $b$ by $k+1$ steps and that $c$ is immediately behind $a$, the following sequence of exchanges is allowed: $\ldots, a, c, \ldots, b, \ldots \rightarrow \ldots, a, b, \ldots, c, \ldots \rightarrow$ $\ldots, b, a, \ldots, c, \ldots \rightarrow \ldots, b, c, \ldots, a, \ldots .$. By assumption, all elements in the places indicated by three dots remain on their places, as does $c$.

If any two elements can be exchanged without violating the other elements, then the elements in the sequence can be arranged to any order. One just gets the desired first element to its place by (at most) one exchange, and if the first $k$ elements already are in their desired places, then the one wanted to be in place $k+1$ is not among the first $k$ elements, and it can be moved to its place by at most one exchange, no violating the order of the first $k$ elements.

We now show, that any two volumes in consecutive odd places can be exchanged. The volumes on top and in place 3 can be exchanged by operation (ii) applied to the three topmost volumes. The volumes in places $2 n+1$ and $2 n+3$ can be exchanged by first applying operation (i) to the $2 n$ topmost volumes, which moves them in the bottom but preserves their order, then applying (ii) to the three topmost volumes and finally operation (i) to the $2000-2 n$ topmost volumes. The last operation returns the $2 n$ volumes to top preserving the order and returns the remaining $2000-2 n$ volumes to the bottom, preserving the order, save the volumes in places $2 n+1$ and $2 n+3$, which have changed places. By the general remarks above, it is now clear that operations (i) and (ii) can be used to arrange the volumes in odd positions into any order while the volumes in even positions remain in their places.

We still need to show, that a similar procedure is possible for volumes in even positions. First of all, the volumes in positions 1 to 5 can be moved to order $5,4,3,2,1$ by performing operation (ii) to the five topmost volumes. Then it is possible to exchange the volumes in positions 1 and 5 without changing anything else. So the volumes in even positions closest to the top can be exchanged. For volumes on positions $2 n$ and $2 n+2$ one can first perform operation (i) to the $2 n-2$ topmost volumes. The volumes in places $2 n$ and $2 n+2$ will be taken to places 2 and 4 , and they can be exchanged. Performing operation (i) to the $2000-(2 n-1)$ topmost volumes then returns everything to their previous places, except that the volumes in positions $2 n$ and $2 n+2$ have changed places. So all volumes in even positions can be put into any order by using the operations (i) and (ii), and the total number of possible orderings is $(1000 \text { ! })^{2}$.

(We note that operation (ii) can be replaced by a weaker operation: "It is possible to turn the order around for the 3 and 5 topmost volumes.")

solution_match: Solution 3.