add apmo 2025
Browse files
APMO/download_script/download.py
CHANGED
|
@@ -5,7 +5,7 @@
|
|
| 5 |
'''
|
| 6 |
Download script for APMO
|
| 7 |
To run:
|
| 8 |
-
`python APMO
|
| 9 |
'''
|
| 10 |
|
| 11 |
import requests
|
|
|
|
| 5 |
'''
|
| 6 |
Download script for APMO
|
| 7 |
To run:
|
| 8 |
+
`python APMO/download_script/download.py`
|
| 9 |
'''
|
| 10 |
|
| 11 |
import requests
|
APMO/md/en-apmo2025_sol.md
ADDED
|
@@ -0,0 +1,273 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
|
| 2 |
+
## Problem 1
|
| 3 |
+
|
| 4 |
+
Let \(A B C\) be an acute triangle inscribed in a circle \(\Gamma\) . Let \(A_{1}\) be the orthogonal projection of \(A\) onto \(B C\) so that \(A A_{1}\) is an altitude. Let \(B_{1}\) and \(C_{1}\) be the orthogonal projections of \(A_{1}\) onto \(A B\) and \(A C\) , respectively. Point \(P\) is such that quadrilateral \(A B_{1}P C_{1}\) is convex and has the same area as triangle \(A B C\) . Is it possible that \(P\) strictly lies in the interior of circle \(\Gamma\) ? Justify your answer.
|
| 5 |
+
|
| 6 |
+
Answer: No.
|
| 7 |
+
|
| 8 |
+
## Solution
|
| 9 |
+
|
| 10 |
+
First notice that, since angles \(\angle A A_{1}B_{1}\) and \(\angle A A_{1}C_{1}\) are both right, the points \(B_{1}\) and \(C_{1}\) lie on the circle with \(A A_{1}\) as a diameter. Therefore, \(A C_{1} = A A_{1}\sin \angle A A_{1}C_{1} = A A_{1}\sin (90^{\circ}-\) \(\angle A_{1}A C) = A A_{1}\sin \angle C\) , similarly \(A B_{1} = A A_{1}\sin \angle B\) , and \(B_{1}C_{1} = A A_{1}\sin \angle A\) . Hence; triangles \(A C_{1}B_{1}\) and \(A B C\) are similar.
|
| 11 |
+
|
| 12 |
+
|
| 13 |
+
|
| 14 |
+
|
| 15 |
+
Let \(O\) be the circumcenter of \(A B C\) and \(A D\) be one of its diameters. Since \(\angle O A C = \frac{1}{2} (180^{\circ}-\) \(\angle A O C) = 90^{\circ} - \angle B = 90^{\circ} - \angle A C_{1}B_{1}\) , it follows that \(A D\) is perpendicular to \(B_{1}C_{1}\) . Let \(A D = 2R\) ; recall that, from the law of sines, \(\frac{B C}{\sin\angle A} = 2R\iff B C = 2R\sin \angle A\) . The area of quadrilateral \(A B_{1}D C_{1}\) is
|
| 16 |
+
|
| 17 |
+
\[\frac{B_{1}C_{1}\cdot A D}{2} = \frac{A A_{1}\sin\angle A\cdot 2R}{2} = \frac{A A_{1}\cdot B C}{2},\]
|
| 18 |
+
|
| 19 |
+
which is indeed the area of \(A B C\) .
|
| 20 |
+
|
| 21 |
+
Since \(B_{1}\) and \(C_{1}\) are fixed points, the loci of the points \(P\) such that \(A B_{1}P C_{1}\) is a convex quadrilateral with the same area as \(A B C\) is a line parallel to \(B_{1}C_{1}\) . That is, perpendicular to \(A D\) . Since the area of \(A B_{1}D C_{1}\) is the same as the area of \(A B C\) , this locus is the line perpendicular to \(A D\) through \(D\) , which is tangent to the circumcircle of \(A B C\) . Therefore, it is not possible that the point \(P\) lies inside the circumcircle of \(A B C\) .
|
| 22 |
+
|
| 23 |
+
|
| 24 |
+
|
| 25 |
+
## Problem 2
|
| 26 |
+
|
| 27 |
+
Let \(\alpha\) and \(\beta\) be positive real numbers. Emerald makes a trip in the coordinate plane, starting off from the origin \((0,0)\) . Each minute she moves one unit up or one unit to the right, restricting herself to the region \(|x - y|< 2025\) , in the coordinate plane. By the time she visits a point \((x,y)\) she writes down the integer \(\lfloor x\alpha +y\beta \rfloor\) on it. It turns out that Emerald wrote each non- negative integer exactly once. Find all the possible pairs \((\alpha ,\beta)\) for which such a trip would be possible.
|
| 28 |
+
|
| 29 |
+
Answer: \((\alpha ,\beta)\) such that \(\alpha +\beta = 2\)
|
| 30 |
+
|
| 31 |
+
## Solution
|
| 32 |
+
|
| 33 |
+
Let \((x_{n},y_{n})\) be the point that Emerald visits after \(n\) minutes. Then \((x_{n + 1},y_{n + 1})\in \{(x_{n}+\) \(1,y_{n}),(x_{n},y_{n} + 1)\}\) . Either way, \(x_{n + 1} + y_{n + 1} = x_{n} + y_{n} + 1\) , and since \(x_{0} + y_{0} = 0 + 0 = 0\) \(x_{n} + y_{n} = n\)
|
| 34 |
+
|
| 35 |
+
The \(n\) - th number would be then
|
| 36 |
+
|
| 37 |
+
\[z_{n} = \lfloor x_{n}\alpha +(n - x_{n})\beta \rfloor \Longrightarrow n\beta +x_{n}(\alpha -\beta) - 1< z_{n}< n\beta +x_{n}(\alpha -\beta),\]
|
| 38 |
+
|
| 39 |
+
in which
|
| 40 |
+
|
| 41 |
+
\[-2025< x_{n} - y_{n}< 2025\iff \frac{n - 2025}{2} < x_{n}< \frac{n + 2025}{2}.\]
|
| 42 |
+
|
| 43 |
+
Suppose without loss of generality that \(\alpha \geq \beta\) . Then
|
| 44 |
+
|
| 45 |
+
\[n\beta +\frac{n - 2025}{2} (\alpha -\beta) - 1< z_{n}< n\beta +\frac{n + 2025}{2} (\alpha -\beta),\]
|
| 46 |
+
|
| 47 |
+
which reduces to
|
| 48 |
+
|
| 49 |
+
\[\left|z_{n} - \frac{\alpha + \beta}{2} n\right|< \frac{2025}{2} (\alpha -\beta) + 1.\]
|
| 50 |
+
|
| 51 |
+
On the other hand, \(z_{n + 1} = \lfloor x_{n + 1}\alpha +y_{n + 1}\beta \rfloor \in \{\lfloor x_{n}\alpha +y_{n}\beta +\alpha \rfloor ,\lfloor x_{n}\alpha +y_{n}\beta +\beta \rfloor \}\) , which implies \(z_{n + 1}\geq z_{n}\) . Since every non- negative integer appears exactly once, in increasing order, it follows that \(z_{n} = n\) .
|
| 52 |
+
|
| 53 |
+
Therefore, for all positive integers \(n\)
|
| 54 |
+
|
| 55 |
+
\[\left|n - \frac{\alpha + \beta}{2} n\right|< \frac{2025}{2} (\alpha -\beta) + 1,\]
|
| 56 |
+
|
| 57 |
+
which can only be possible if \(\alpha +\beta = 2\) ; otherwise, the left hand side would be unbounded. If \(\alpha +\beta = 2\) , consider \(x_{n} = \left\lfloor \frac{n}{2}\right\rfloor\) and \(y_{n} = \left\lfloor \frac{n}{2}\right\rfloor\) . If \(n\) is even,
|
| 58 |
+
|
| 59 |
+
\[z_{n} = \left\lfloor \frac{n}{2}\alpha +\frac{n}{2}\beta \right\rfloor = n;\]
|
| 60 |
+
|
| 61 |
+
if \(n\) is odd,
|
| 62 |
+
|
| 63 |
+
\[z_{n} = \left\lfloor \frac{n + 1}{2}\alpha +\frac{n - 1}{2}\beta \right\rfloor = n + \left\lfloor \frac{\alpha - \beta}{2}\right\rfloor ,\]
|
| 64 |
+
|
| 65 |
+
which equals \(n\) because \(0< \beta \leq \alpha < \alpha +\beta = 2\Longrightarrow 0\leq \alpha -\beta < 2\)
|
| 66 |
+
|
| 67 |
+
|
| 68 |
+
|
| 69 |
+
## Problem 3
|
| 70 |
+
|
| 71 |
+
Let \(P(x)\) be a non- constant polynomial with integer coefficients such that \(P(0) \neq 0\) . Let \(a_{1}, a_{2}, a_{3}, \ldots\) be an infinite sequence of integers such that \(P(i - j)\) divides \(a_{i} - a_{j}\) for all distinct positive integers \(i, j\) . Prove that the sequence \(a_{1}, a_{2}, a_{3}, \ldots\) must be constant, that is, \(a_{n}\) equals a constant \(c\) for all \(n\) positive integer.
|
| 72 |
+
|
| 73 |
+
## Solution
|
| 74 |
+
|
| 75 |
+
Let \(a_{0} = P(0) \neq 0\) be the independent coefficient, i.e., the constant term of \(P(x)\) . Then there are infinitely many primes \(p\) such that \(p\) divides \(P(k)\) but \(p\) does not divide \(k\) . In fact, since \(P(k) - a_{0}\) is a multiple of \(k\) , \(\gcd (P(k), k) = \gcd (k, a_{0}) \leq a_{0}\) is bounded, so pick, say, \(k\) with prime factors each larger than \(a_{0}\) .
|
| 76 |
+
|
| 77 |
+
Since \(P(k)\) divides \(a_{i + k} - a_{i}\) , \(p\) divides \(a_{i + k} - a_{i}\) . Moreover, since \(P(k + p) \equiv P(k) \equiv 0\) (mod \(p\) ), \(p\) also divides \(a_{i + k + p} - a_{i}\) . Therefore, \(a_{i}\) mod \(p\) is periodic with periods \(k + p\) and \(k\) . By Bezout's theorem, \(\gcd (k + p, k) = 1\) is also a period, that is, \(p\) divides \(a_{i + 1} - a_{i}\) for all \(i\) and \(p\) such that \(p \mid P(k)\) and \(p \nmid k\) for some \(k\) . Since there are infinitely many such primes \(p\) , \(a_{i + 1} - a_{i}\) is divisible by infinitely many primes, which implies \(a_{i + 1} = a_{i}\) , that is, the sequence is constant.
|
| 78 |
+
|
| 79 |
+
|
| 80 |
+
|
| 81 |
+
## Problem 4
|
| 82 |
+
|
| 83 |
+
Let \(n \geq 3\) be an integer. There are \(n\) cells on a circle, and each cell is assigned either 0 or 1. There is a rooster on one of these cells, and it repeats the following operations:
|
| 84 |
+
|
| 85 |
+
If the rooster is on a cell assigned 0, it changes the assigned number to 1 and moves to the next cell counterclockwise. If the rooster is on a cell assigned 1, it changes the assigned number to 0 and moves to the cell after the next cell counterclockwise.
|
| 86 |
+
|
| 87 |
+
Prove that the following statement holds true after sufficiently many operations:
|
| 88 |
+
|
| 89 |
+
If the rooster is on a cell \(C\) , then the rooster would go around the circle exactly three times, stopping again at \(C\) . Moreover, every cell would be assigned the same number as it was assigned right before the rooster went around the circle 3 times.
|
| 90 |
+
|
| 91 |
+
## Solution 1
|
| 92 |
+
|
| 93 |
+
Reformulate the problem as a \(n\) - string of numbers in \(\{0,1\}\) and a position at which the action described in the problem is performed, and add 1 or 2 modulo \(n\) to the position according to the action. Say that a lap is complete for each time the position resets to 0 or 1. We will prove that the statement claim holds after at most two laps, after which the \(n\) - tuple cycles every three laps.
|
| 94 |
+
|
| 95 |
+
Say the rooster stops at a position in a certain lap if it performs an action at that position on that lap; otherwise, the rooster bypasses that position. We start with some immediate claims:
|
| 96 |
+
|
| 97 |
+
The rooster has to stop at at least one of each two consecutive positions. The rooster stops at every position preceded by a 0. Indeed, if the numbers preceding that position are 00 then the rooster will definitely stop at the second zero, and it the numbers preceding that position are 10 then the rooster will either stop at 1 and go directly to the position or bypass 1 and stop at the second zero, and then stop at the position. Therefore, if the rooster bypasses a position, then it is preceded by a 1, and that 1 must be changed to a 0. This means that the rooster never bypasses a position in two consecutive laps. The rooster bypasses every position preceded by 01. Indeed, the rooster stops at either 1 or at 0, after which it will move to 1; at any rate, it stops at 1 and bypasses the position.
|
| 98 |
+
|
| 99 |
+
Our goal is to prove that, eventually, for every three consecutive laps, each position is bypassed exactly once. Then each position changes states exactly twice, so it gets back to its initial state after three laps. The following two lemmata achieve this goal:
|
| 100 |
+
|
| 101 |
+
Lemma 1. If the rooster stops at a certain position in two laps in a row, it bypasses it on the next lap, except for the \(n\) - string \(1010\ldots 10\) , for which the problem statement holds.
|
| 102 |
+
|
| 103 |
+
Proof. If the rooster stopped at a position in lap \(t\) , then it is preceded by either (A) a 0 that was changed to 1, (B) a 11 that was changed to 01, or (C) a 10 in which the rooster stopped at 1. In case (A), the position must be preceded by 11 in the lap \(t + 1\) , which becomes 01, so the rooster will bypass the position in the lap \(t + 2\) . In case (B), the position will be bypassed in lap \(t + 1\) .
|
| 104 |
+
|
| 105 |
+
Now we deal with case (C): suppose that the position was preceded by \(m\) occurrences of 10, that is, \((10)^{m}\) , on lap \(t\) and take \(m \leq \frac{n}{2}\) maximal. The rooster stopped at the 1 from each occurrence of 10, except possibly the first one.
|
| 106 |
+
|
| 107 |
+
|
| 108 |
+
|
| 109 |
+
First, suppose that \(n \geq 2m + 2\) . After lap \(t\) , \((10)^{m}\) becomes either \((00)^{m}\) or \(11(00)^{m - 1}\) in lap \(t + 1\) . In the latter case, initially we had \(1(10)^{m}\) , which became \(011(00)^{m - 1}\) . It will then become \(a01(11)^{m - 1}\) in lap \(t + 2\) , in which the rooster will bypass the position. In the former case, \((10)^{m}\) becomes \((00)^{m}\) , so it was either \(00(10)^{m}\) or \(11(10)^{m}\) in lap \(t\) , which becomes respectively \(a1(00)^{m}\) and \(01(00)^{m}\) in lap \(t + 1\) , respectively. In the second sub- case, it becomes \(b001(11)^{m - 1}\) in lap \(t + 2\) , and the position will be bypassed. In the first sub- case, it must be \(11(00)^{m}\) after which it becomes either \(01(11)^{m}\) or \(1001(11)^{m - 1}\) . In any case, the position will be bypassed in lap \(t + 2\) . If \(n = 2m + 1\) , the possible configurations are
|
| 110 |
+
|
| 111 |
+
\[(10)^{m}0\rightarrow (00)^{m}1\rightarrow (11)^{m}0\rightarrow (10)^{m}0,\]
|
| 112 |
+
|
| 113 |
+
the rooster stops at the 1 from the first 10 because it was preceded by a 0.
|
| 114 |
+
|
| 115 |
+
\[(10)^{m}1\rightarrow (00)^{m}0\rightarrow 0(11)^{m}\rightarrow 1(01)^{m},\]
|
| 116 |
+
|
| 117 |
+
or
|
| 118 |
+
|
| 119 |
+
\[(10)^{m}1\rightarrow 11(00)^{m - 1}0\rightarrow 01(11)^{m - 1}1\rightarrow (10)^{m}1,\]
|
| 120 |
+
|
| 121 |
+
In any case, the position is bypassed in lap \(t + 2\) .
|
| 122 |
+
|
| 123 |
+
If \(n = 2m\) , the entire configuration is \((10)^{m}\) , \(m \geq 2\) . If the rooster did not stop at the first 1, it becomes \(11(00)^{m - 1}\) in the lap \(t + 1\) , then \(01(11)^{m - 1}\) in the lap \(t + 2\) , so the position is bypassed in this last lap. If the rooster stopped at the first 1, it becomes \((00)^{m}\) , then \((11)^{m}\) , then \((01)^{m}\) , then \(10(00)^{m - 1}\) , then \((11)^{m}\) , and then it cycles between \((11)^{m}\) , \((01)^{m}\) and \(10(00)^{m - 1}\) .
|
| 124 |
+
|
| 125 |
+
So, apart from this specific string, the rooster will stop at most two laps in a row at each position.
|
| 126 |
+
|
| 127 |
+
Lemma 2. If the rooster bypasses one position on a lap, then it stops at that position on the next two laps, with the same exception as lemma 1.
|
| 128 |
+
|
| 129 |
+
Proof. The position must be preceded by 1 in lap \(t\) . If it is preceded by 11, it changes to 10 in lap \(t + 1\) . Then it becomes 00 because the 1 was already skipped in the previous lap, and the rooster will stop at the position in the lap \(t + 2\) .
|
| 130 |
+
|
| 131 |
+
Now suppose that the position was preceded by \((01)^{m}\) on lap \(t\) and take \(m \leq \frac{n}{2}\) maximal. It becomes \(10(00)^{m - 1}\) or \((00)^{m}\) in lap \(t + 1\) . In the former case, in lap \(t + 2\) it becomes either \(00(11)^{m - 1}\) , after which the rooster stops at the position again, or \((11)^{m}\) , which we'll study later. In the former case, \((00)^{m}\) becomes \((11)^{m}\) or \(01(11)^{m - 1}\) . In the latter case, the 0 was bypassed, so it must be sopped in the next lap, becoming \((10)^{m}\) . In the \((11)^{m}\) case, in order to bypass the position in lap \(t + 2\) , it must become \((10)^{m}\) . All in all, the preceding terms are \((01)^{m}\) . Then, either \(10(00)^{m - 1}\) or \((00)^{m}\) , then either \((11)^{m}\) or \(01(11)^{m - 1}\) , then \((10)^{m}\) . Then the second term in \((01)^{m}\) is 1, then 0, then 1, and then 0, that is, it changed three times. So we fall under the exception to lemma 1. \(\square\)
|
| 132 |
+
|
| 133 |
+
The result then immediately follows from lemmata 1 and 2.
|
| 134 |
+
|
| 135 |
+
## Solution 2
|
| 136 |
+
|
| 137 |
+
Define positions, laps, stoppings, and bypassing as in Solution 1. This other pair of lemmata also solves the problem.
|
| 138 |
+
|
| 139 |
+
Lemma 3. There is a position and a lap in which the rooster stops twice and bypasses once (in some order) in the next three laps.
|
| 140 |
+
|
| 141 |
+
Proof. There is a position \(j\) the rooster stops for infinitely many times. Each time it stops at \(j\) , it changes between stopping and bypassing \(j + 1\) . So the rooster stops and bypasses \(j + 1\) infinitely many times. Then there is a lap in which the rooster stops at \(j + 1\) , and bypasses it in the next. As in solution 1, it cannot bypass \(j + 1\) two times in a row, so it stops at \(j + 1\) in the next lap. \(\square\)
|
| 142 |
+
|
| 143 |
+
|
| 144 |
+
|
| 145 |
+
Lemma 4. If the rooster stops twice and bypasses once (in some order) at some position in three consecutive laps, it also stops twice and bypasses once at the next position (in some order) in the same laps (or in the next laps, in case the lap changes from one position to the other).
|
| 146 |
+
|
| 147 |
+
Proof. When the rooster bypasses the position, it must stop at the next one. In the two times it stops at the position, the cell has different numbers on it, so the rooster will stop once and bypass once at the next position. \(\square\)
|
| 148 |
+
|
| 149 |
+
By lemmata 3 and 4, there would be a moment that the rooster stops twice and bypasses once (in some order) at any position after this moment. After this moment, if the rooster is in a cell \(C\) in lap \(t\) , we know that it stopped; stopped- bypassed; and bypassed- stopped at \(C\) in laps \(t, t + 1, t + 2\) . Since it stopped twice and bypassed once (in some order) in laps \(t + 1, t + 2, t + 3\) , it must stop at \(C\) in lap \(t + 3\) . Moreover, the rooster stopped twice and bypassed once (in some order) each cell between stopping at \(C\) in laps \(t\) and \(t + 3\) , so every cell has the same assigned number before and after going around the circle three times.
|
| 150 |
+
|
| 151 |
+
## Solution 3
|
| 152 |
+
|
| 153 |
+
Let us reformulate the problem in terms of Graphs: we have a directed graph \(G\) with \(V = \{v_{1}, v_{2}, \ldots , v_{n}\}\) representing positions and \(E = \{v_{i} \to v_{i + 1}, v_{i} \to v_{i + 2} \mid 1 \le i \le n\}\) representing moves. Indices are taken mod \(n\) . Note that each vertex has in- degree and out- degree both equal to 2. We say that the edge \(v_{i} \to v_{i + 1}\) is active and \(v_{i} \to v_{i + 2}\) is inactive if the number on \(v_{i}\) is 0, or the edge \(v_{i} \to v_{i + 2}\) is active and \(v_{i} \to v_{i + 1}\) is inactive if the number on \(v_{i}\) is 1. The rooster then traces an infinite trail on the graph in the following manner;
|
| 154 |
+
|
| 155 |
+
- it starts at \(v_{1}\) ;
|
| 156 |
+
|
| 157 |
+
- if the rooster is at \(v_{i}\) , it uses the active edge going out of \(v_{i}\) to continue the path, and changes the number on \(v_{i}\) .
|
| 158 |
+
|
| 159 |
+
Take the first vertex that appears 3 times on the rooster's trail, and suppose without any loss of generality that it is \(v_{1}\) (otherwise, just ignore the path before the first time that this vertex appears). Consider the sub- trail from the first to the third time \(v_{1}\) appears: \(C = v_{1} \to \dots \to v_{1} \to \dots \to v_{1}\) . Trail \(C\) induces a circuit \(C^{*}\) on \(G\) that passes through \(v_{1}\) twice.
|
| 160 |
+
|
| 161 |
+
In between two occurrences of \(v_{1}\) , the rooster must have completed at least one lap. Vertex \(v_{1}\) appears three times at \(C\) , so \(C\) contains at least two laps. Since (as per Solution 1) no vertex is bypassed twice in a row, \(C^{*}\) must contain every vertex. Moreover, \(v_{1}\) is the first (and only) vertex that appeared three times on the rooster's path, so each vertex appear at most twice on \(C^{*}\) .
|
| 162 |
+
|
| 163 |
+
Lemma 5. Take \(V^{\prime}\) to be the subset of \(V\) containing the vertices that only appears once on \(C^{*}\) and \(E^{\prime}\) to be the edges of \(G\) that don't appear on \(C^{*}\) . So \(G^{\prime} = (V^{\prime}, E^{\prime})\) is a simple cycle or \(V^{\prime} = E^{\prime} = \emptyset\) .
|
| 164 |
+
|
| 165 |
+
Proof. We will first prove that each edge in \(C^{*}\) appears exactly one. Suppose, for the sake of contradiction, that there is an edge \(u \to v\) that appears twice on \(C^{*}\) . So \(u\) must appear times in \(C\) , because the active edge going out of \(u\) changes at each visit to it. So \(u = v_{1}\) , but the rooster only goes out of \(v_{1}\) twice in \(C\) , which is a contradiction.
|
| 166 |
+
|
| 167 |
+
Now, since \(C^{*}\) does not have repeated edges, all four edges through \(v\) are in \(C^{*}\) if \(v\) is visited twice in this cycle. So the edges on \(E^{\prime}\) cannot pass through vertices in \(V \setminus V^{\prime}\) , then \(G^{\prime}\) is well- defined.
|
| 168 |
+
|
| 169 |
+
Since \(v \in V^{\prime}\) is visited once on \(C^{*}\) , it has \(\deg_{in}(v) = \deg_{out}(v) = 1\) in \(G^{\prime}\) , so \(G^{\prime}\) is a union of disjoint simple cycles. Each of these cycles completes at least one lap, and \(v_{1}\) is skipped on these laps, so all cycles must use the edge \(v_{n} \to v_{2}\) . But the cycles are disjoint, so there is at most one cycle. \(\square\)
|
| 170 |
+
|
| 171 |
+
Lemma 6. The rooster eventually traverses a contiguous Eulerian circuit of \(G\) .
|
| 172 |
+
|
| 173 |
+
|
| 174 |
+
|
| 175 |
+
Proof. If \(V^{\prime} = E^{\prime} = \emptyset\) , \(C^{*}\) is already an Eulerian circuit traversed in \(C\) . If not, take \(u_{1}\) to be the first vertex of \(C\) that is in \(V^{\prime}\) . Let \(U = u_{1}\to \dots \to u_{k}\to u_{1}\) be the cycle determined by \(G^{\prime}\) by Lemma 5, \(C_{1} = v_{1}\to \dots \to u_{1}\) be the sub- path of \(C\) from the first \(v_{1}\) to \(u_{1}\) , and \(C_{2} = u_{1}\to \dots \to v_{1}\) be the rest of \(C\) .
|
| 176 |
+
|
| 177 |
+
Each vertex on \(V\backslash V^{\prime}\) has been changed twice, so they would be in their initial states after \(C\) ; every vertex on \(V^{\prime}\) has been changed only once, and therefore are not on their initial states. Let us trace the rooster's trail after it traversed \(C\) . By the minimality of \(u_{1}\) , all the edges of \(C_{1}\) are active after \(C\) , so the rooster traverses \(C_{1}\) after \(C\) . Moreover, each \(u_{i}\) was visited exactly once in \(C\) and has not yet used the edge \(u_{i}\to u_{i + 1}\) . Since all their states have changed, all edges of \(U\) are active after \(C\) . Therefore, the rooster traverse \(U\) after \(C_{1}\) , flipping all the vertices in \(U\) to their initial states. Then, since every state in \(U\) was changed, the rooster traverses \(C_{2}\) instead of \(U\) . The trail is then \(C\to C_{1}\to U\to C_{2}\) , and hen \(C_{1}\to U\to C_{2}\) is an Eulerian circuit. \(\square\)
|
| 178 |
+
|
| 179 |
+
Having this in mind, after the rooster completes an Eulerian circuit, it has passed through each vertex twice and returned to its initial vertex, so the state of the rooster and of the edges are the same before and after the Eulerian cycle. The rooster will then traverse the Eulerian circuit repeatedly.
|
| 180 |
+
|
| 181 |
+
The edges \(v_{i}\to v_{i + 1}\) move forward by one position and the edges \(v_{i}\to v_{i + 2}\) move forward by two positions. Since all edges are used, each time the rooster traverses the Eulerian circuit, it moves forward a total of \(n(1 + 2) = 3n\) positions, which corresponds to three laps. The proof is now complete.
|
| 182 |
+
|
| 183 |
+
Comment: Solution 1 presents a somewhat brute- force case analysis; the main ideas are
|
| 184 |
+
|
| 185 |
+
- Lemma 1: The rooster stops at one position in at most two consecutive laps, with one notable exception.
|
| 186 |
+
|
| 187 |
+
- Lemma 2: If the rooster bypasses one position then it stops at it in the next two laps, with the same notable exception.
|
| 188 |
+
|
| 189 |
+
- Solution 2 has a recursive nature; the main ideas are
|
| 190 |
+
|
| 191 |
+
- Lemma 3: Proving that one position changes states exactly two out of three laps.
|
| 192 |
+
|
| 193 |
+
- Lemma 4: Given that this happens to one position, it also happens to the next position in the same laps, so it happens to every position.
|
| 194 |
+
|
| 195 |
+
- Solution 3 cleverly identifies the moves the rooster performs within a graph theoretical framework. The main goal is to prove that the rooster traces an Eulerian circuit in a graph.
|
| 196 |
+
|
| 197 |
+
- Lemma 5: Analyzing what happens after the rooster first visits a position three times.
|
| 198 |
+
|
| 199 |
+
- Lemma 6: Proving that the rooster traces an Eulerian circuit.
|
| 200 |
+
|
| 201 |
+
|
| 202 |
+
|
| 203 |
+
## Problem 5
|
| 204 |
+
|
| 205 |
+
Consider an infinite sequence \(a_{1},a_{2},\ldots\) of positive integers such that
|
| 206 |
+
|
| 207 |
+
\[100!(a_{m} + a_{m + 1} + \cdot \cdot \cdot +a_{n})\quad \mathrm{is~a~multiple~of}\quad a_{n - m + 1}a_{n + m}\]
|
| 208 |
+
|
| 209 |
+
for all positive integers \(m,n\) such that \(m\leq n\)
|
| 210 |
+
|
| 211 |
+
Prove that the sequence is either bounded or linear.
|
| 212 |
+
|
| 213 |
+
Observation: A sequence of positive integers is bounded if there exists a constant \(N\) such that \(a_{n}< N\) for all \(n\in \mathbb{Z}_{>0}\) . A sequence is linear if \(a_{n} = n\cdot a_{1}\) for all \(n\in \mathbb{Z}_{>0}\)
|
| 214 |
+
|
| 215 |
+
## Solution
|
| 216 |
+
|
| 217 |
+
Let \(c = 100!\) . Suppose that \(n\geq m + 2\) . Then \(a_{m + n} = a_{(m + 1) + (n - 1)}\) divides both \(c(a_{m} + a_{m + 1}+\) \(\cdot \cdot \cdot +a_{n - 1} + a_{n})\) and \(c(a_{m + 1} + \cdot \cdot \cdot +a_{n - 1})\) , so it also divides the difference \(c(a_{m} + a_{n})\) . Notice that if \(n = m + 1\) then \(a_{m + n}\) divides \(c(a_{m} + a_{m + 1}) = c(a_{m} + a_{n})\) , and if \(n = m\) then \(a_{m + n}\) divides both \(c a_{m}\) and \(2c a_{m} = c(a_{m} + a_{n})\) . In either cases; \(a_{m + n}\) divides \(c(a_{m} + a_{n})\)
|
| 218 |
+
|
| 219 |
+
Analogously, one can prove that if \(m > n\) , \(a_{m - n} = a_{(m - 1) - (n - 1)}\) divides \(c(a_{m} - a_{n})\) , as it divides both \(c(a_{n + 1} + \cdot \cdot \cdot +a_{m})\) and \(c(a_{n} + \cdot \cdot \cdot +a_{m - 1})\)
|
| 220 |
+
|
| 221 |
+
From now on, drop the original divisibility statement and keep the statements " \(a_{m + n}\) divides \(c(a_{m} + a_{n})\) " and " \(a_{m - n}\) divides \(c(a_{m} - a_{n})\) . Now, all conditions are linear, and we can suppose without loss of generality that there is no integer \(D > 1\) that divides every term of the sequence; if there is such an integer \(D\) , divide all terms by \(D\) .
|
| 222 |
+
|
| 223 |
+
Having this in mind, notice that \(a_{m} = a_{m + n - n}\) divides \(c(a_{m + n} - a_{n})\) and also \(c(a_{m + n} - a_{m} - a_{n})\) analogously, \(a_{n}\) also divides \(c(a_{m + n} - a_{m} - a_{n})\) , and since \(a_{m + n}\) divides \(c(a_{m} + a_{n})\) , it also divides \(c(a_{m + n} - a_{m} - a_{n})\) . Therefore, \(c(a_{m + n} - a_{m} - a_{n})\) is divisible by \(a_{m}\) , \(a_{n}\) , and \(a_{m + n}\) , and therefore also by \(\operatorname {lcm}(a_{m},a_{n},a_{m + n})\) . In particular, \(c a_{m + n}\equiv c(a_{m} + a_{n})\pmod {\operatorname {lcm}(a_{m},a_{n})}\)
|
| 224 |
+
|
| 225 |
+
Since \(a_{m + n}\) divides \(c(a_{m} + a_{n})\) , \(a_{m + n}\leq c(a_{m} + a_{n})\)
|
| 226 |
+
|
| 227 |
+
From now on, we divide the problem in two cases.
|
| 228 |
+
|
| 229 |
+
Case 1: there exist \(m,n\) such that \(\operatorname {lcm}(a_{m},a_{n}) > c^{2}(a_{m} + a_{n})\)
|
| 230 |
+
|
| 231 |
+
If \(\operatorname {lcm}(a_{m},a_{n}) > c^{2}(a_{m} + a_{n}) > c(a_{m} + a_{n})\) then both \(c(a_{m} + a_{n})\) and \(c a_{m + n}\) are less than
|
| 232 |
+
|
| 233 |
+
\(c a_{m + n}\leq c^{2}(a_{m} + a_{n})< \operatorname {lcm}(a_{m},a_{n})\) . This implies \(c a_{m + n} = c(a_{m} + a_{n})\iff a_{m + n} = a_{m} + a_{n}\) Now we can extend this further: since \(\gcd (a_{m},a_{m + n}) = \gcd (a_{m},a_{m} + a_{n}) = \gcd (a_{m},a_{n})\) , it follows that
|
| 234 |
+
|
| 235 |
+
\[\operatorname {lcm}(a_{m},a_{m + n}) = \frac{a_{m}a_{m + n}}{\gcd (a_{m},a_{n})} = \frac{a_{m + n}}{a_{n}}\operatorname {lcm}(a_{m},a_{n}) > \frac{c^{2}(a_{m} + a_{n})^{2}}{a_{n}}\] \[\qquad >\frac{c^{2}(2a_{m}a_{n} + a_{n}^{2})}{a_{n}} = c^{2}(2a_{m} + a_{n}) = c^{2}(a_{m} + a_{m + n}).\]
|
| 236 |
+
|
| 237 |
+
We can iterate this reasoning to obtain that \(a_{k m + n} = k a_{m} + a_{n}\) , for all \(k\in \mathbb{Z}_{>0}\) . In fact, if the condition \(\operatorname {lcm}(a_{m},a_{n}) > c^{2}(a_{m} + a_{n})\) holds for the pair \((n,m)\) , then it also holds for the pairs \((m + n,m)\) , \((2m + n,m)\) , ..., \(((k - 1)m + n,m)\) , which implies \(a_{k m + n} = a_{(k - 1)m + n} + a_{m} =\) \(a_{(k - 2)m + n} + 2a_{m} = \cdot \cdot \cdot = a_{n} + k a_{m}\)
|
| 238 |
+
|
| 239 |
+
Similarly, \(a_{m + k n} = a_{m} + k a_{n}\)
|
| 240 |
+
|
| 241 |
+
Now, \(a_{m + n + m n} = a_{n + (n + 1)m} = a_{m + (m + 1)n}\implies a_{n} + (n + 1)a_{m} = a_{m} + (m + 1)a_{n}\iff m a_{n} =\) \(n a_{m}\) . If \(d = \gcd (m,n)\) then \(\frac{n}{d} a_{m} = \frac{m}{d} a_{n}\)
|
| 242 |
+
|
| 243 |
+
Therefore, since \(\gcd (\frac{m}{d},\frac{n}{d}) = 1\) , \(\frac{m}{d}\) divides \(a_{m}\) and \(\frac{n}{d}\) divides \(a_{n}\) , which means that
|
| 244 |
+
|
| 245 |
+
\[a_{n} = \frac{m}{d}\cdot t = \frac{t}{d} m\quad \mathrm{and}\quad a_{m} = \frac{n}{d}\cdot t = \frac{t}{d} n,\quad \mathrm{for~some~}t\in \mathbb{Z}_{>0},\]
|
| 246 |
+
|
| 247 |
+
which also implies
|
| 248 |
+
|
| 249 |
+
\[a_{k m + n} = \frac{t}{d} (k m + n)\quad \mathrm{and}\quad a_{m + k n} = \frac{t}{d} (m + k n),\quad \mathrm{for~all~}k\in \mathbb{Z}_{>0}.\]
|
| 250 |
+
|
| 251 |
+
|
| 252 |
+
|
| 253 |
+
Now let's prove that \(a_{kd} = tk = \frac{t}{d} (kd)\) for all \(k \in \mathbb{Z}_{>0}\) . In fact, there exist arbitrarily large positive integers \(R\) , \(S\) such that \(kd = Rm - Sn = (n + (R + 1)m) - (m + (S + 1)n)\) (for instance, let \(u\) , \(v \in \mathbb{Z}\) such that \(kd = mu - nv\) and take \(R = u + Qn\) and \(S = v + Qm\) for \(Q\) sufficiently large.)
|
| 254 |
+
|
| 255 |
+
Let \(x = n + (R + 1)m\) and \(y = m + (S + 1)n\) . Then \(kd = x - y \iff x = y + kd\) , \(a_{x} = \frac{t}{d} x\) , and \(a_{y} = \frac{t}{d} y = \frac{t}{d} (x - kd) = a_{x} - tk\) . Thus \(a_{x}\) divides \(c(a_{y} + a_{kd}) = c(a_{kd} + a_{x} - tk)\) , and therefore also \(c(a_{kd} - tk)\) . Since \(a_{x} = \frac{t}{d} x\) can be arbitrarily large, \(a_{kd} = tk = \frac{t}{d} (kd)\) . In particular, \(a_{d} = t\) , so \(a_{kd} = ka_{d}\) .
|
| 256 |
+
|
| 257 |
+
Since \(ka_{d} = a_{kd} = a_{1 + (kd - 1)}\) divides \(c(a_{1} + a_{kd - 1})\) , \(b_{k} = a_{kd - 1}\) is unbounded. Pick \(p > a_{kd - 1}\) a large prime and consider \(a_{pd} = pa_{d}\) . Then
|
| 258 |
+
|
| 259 |
+
\[\operatorname {lcm}(a_{pd},a_{kd - 1})\geq \operatorname {lcm}(p,a_{kd - 1}) = pa_{kd - 1}.\]
|
| 260 |
+
|
| 261 |
+
We can pick \(a_{kd - 1}\) and \(p\) large enough so that their product is larger than a particular linear combination of them, that is,
|
| 262 |
+
|
| 263 |
+
\[\operatorname {lcm}(p,a_{kd - 1}) = pa_{kd - 1} > c^{2}(pa_{d} + a_{kd - 1}) = c^{2}(a_{pd} + a_{kd - 1}).\]
|
| 264 |
+
|
| 265 |
+
Then all the previous facts can be applied, and since \(\gcd (pd, kd - 1) = 1\) , \(a_{k} = a_{k\gcd (pd, kd - 1)} = ka_{\gcd (pd, kd - 1)}\) , that is, the sequence is linear. Also, since \(a_{1}\) divides all terms, \(a_{1} = 1\) .
|
| 266 |
+
|
| 267 |
+
Case 2: \(\operatorname {lcm}(a_{m}, a_{n}) \leq c^{2}(a_{m} + a_{n})\) for all \(m, n\) .
|
| 268 |
+
|
| 269 |
+
Suppose that \(a_{m} \leq a_{n}\) ; then \(\operatorname {lcm}(a_{m}, a_{n}) = Ma_{n} \leq c^{2}(a_{m} + a_{n}) \leq 2c^{2}a_{n} \Rightarrow M \leq 2c^{2}\) , that is, the factor in the smaller term that is not in the larger term is at most \(2c^{2}\) .
|
| 270 |
+
|
| 271 |
+
We prove that in this case the sequence must be bounded. Suppose on the contrary; then there is a term \(a_{m}\) that is divisible by a large prime power \(p^{d}\) . Then every larger term \(a_{n}\) is divisible by a factor larger than \(\frac{p^{d}}{2c^{2}}\) . So we pick \(p^{d} > (2c^{2})^{2}\) , so that every large term \(a_{n}\) is divisible by the prime power \(p^{e} > 2c^{2}\) . Finally, fix \(a_{k}\) for any \(k\) . It follows from \(a_{k + n} \mid c(a_{k} + a_{n})\) that \((a_{n})\) is unbounded, so we can pick \(a_{n}\) and \(a_{k + n}\) large enough such that both are divisible by \(p^{e}\) . Hence any \(a_{k}\) is divisible by \(p\) , which is a contradiction to the fact that there is no \(D > 1\) that divides every term in the sequence.
|
| 272 |
+
|
| 273 |
+
|
APMO/raw/en-apmo2025_sol.pdf
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:585ebd34ba2b6177fa450b4b08af313133b84d293c3bd0f76038551a7863fee3
|
| 3 |
+
size 193727
|
APMO/segmented/en-apmo2025_sol.jsonl
ADDED
|
@@ -0,0 +1,7 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"year": "2025", "tier": "T1", "problem_label": "1", "problem_type": null, "exam": "APMO", "problem": "Let \\(A B C\\) be an acute triangle inscribed in a circle \\(\\Gamma\\) . Let \\(A_{1}\\) be the orthogonal projection of \\(A\\) onto \\(B C\\) so that \\(A A_{1}\\) is an altitude. Let \\(B_{1}\\) and \\(C_{1}\\) be the orthogonal projections of \\(A_{1}\\) onto \\(A B\\) and \\(A C\\) , respectively. Point \\(P\\) is such that quadrilateral \\(A B_{1}P C_{1}\\) is convex and has the same area as triangle \\(A B C\\) . Is it possible that \\(P\\) strictly lies in the interior of circle \\(\\Gamma\\) ? Justify your answer. \n\nAnswer: No.", "solution": "First notice that, since angles \\(\\angle A A_{1}B_{1}\\) and \\(\\angle A A_{1}C_{1}\\) are both right, the points \\(B_{1}\\) and \\(C_{1}\\) lie on the circle with \\(A A_{1}\\) as a diameter. Therefore, \\(A C_{1} = A A_{1}\\sin \\angle A A_{1}C_{1} = A A_{1}\\sin (90^{\\circ}-\\) \\(\\angle A_{1}A C) = A A_{1}\\sin \\angle C\\) , similarly \\(A B_{1} = A A_{1}\\sin \\angle B\\) , and \\(B_{1}C_{1} = A A_{1}\\sin \\angle A\\) . Hence; triangles \\(A C_{1}B_{1}\\) and \\(A B C\\) are similar. \n\n\n \n\nLet \\(O\\) be the circumcenter of \\(A B C\\) and \\(A D\\) be one of its diameters. Since \\(\\angle O A C = \\frac{1}{2} (180^{\\circ}-\\) \\(\\angle A O C) = 90^{\\circ} - \\angle B = 90^{\\circ} - \\angle A C_{1}B_{1}\\) , it follows that \\(A D\\) is perpendicular to \\(B_{1}C_{1}\\) . Let \\(A D = 2R\\) ; recall that, from the law of sines, \\(\\frac{B C}{\\sin\\angle A} = 2R\\iff B C = 2R\\sin \\angle A\\) . The area of quadrilateral \\(A B_{1}D C_{1}\\) is \n\n\\[\\frac{B_{1}C_{1}\\cdot A D}{2} = \\frac{A A_{1}\\sin\\angle A\\cdot 2R}{2} = \\frac{A A_{1}\\cdot B C}{2},\\] \n\nwhich is indeed the area of \\(A B C\\) . \n\nSince \\(B_{1}\\) and \\(C_{1}\\) are fixed points, the loci of the points \\(P\\) such that \\(A B_{1}P C_{1}\\) is a convex quadrilateral with the same area as \\(A B C\\) is a line parallel to \\(B_{1}C_{1}\\) . That is, perpendicular to \\(A D\\) . Since the area of \\(A B_{1}D C_{1}\\) is the same as the area of \\(A B C\\) , this locus is the line perpendicular to \\(A D\\) through \\(D\\) , which is tangent to the circumcircle of \\(A B C\\) . Therefore, it is not possible that the point \\(P\\) lies inside the circumcircle of \\(A B C\\) .", "metadata": {"resource_path": "APMO/segmented/en-apmo2025_sol.jsonl", "problem_match": "# Problem 1 ", "solution_match": "# Solution \n\n"}}
|
| 2 |
+
{"year": "2025", "tier": "T1", "problem_label": "2", "problem_type": null, "exam": "APMO", "problem": "Let \\(\\alpha\\) and \\(\\beta\\) be positive real numbers. Emerald makes a trip in the coordinate plane, starting off from the origin \\((0,0)\\) . Each minute she moves one unit up or one unit to the right, restricting herself to the region \\(|x - y|< 2025\\) , in the coordinate plane. By the time she visits a point \\((x,y)\\) she writes down the integer \\(\\lfloor x\\alpha +y\\beta \\rfloor\\) on it. It turns out that Emerald wrote each non- negative integer exactly once. Find all the possible pairs \\((\\alpha ,\\beta)\\) for which such a trip would be possible. \n\nAnswer: \\((\\alpha ,\\beta)\\) such that \\(\\alpha +\\beta = 2\\)", "solution": "Let \\((x_{n},y_{n})\\) be the point that Emerald visits after \\(n\\) minutes. Then \\((x_{n + 1},y_{n + 1})\\in \\{(x_{n}+\\) \\(1,y_{n}),(x_{n},y_{n} + 1)\\}\\) . Either way, \\(x_{n + 1} + y_{n + 1} = x_{n} + y_{n} + 1\\) , and since \\(x_{0} + y_{0} = 0 + 0 = 0\\) \\(x_{n} + y_{n} = n\\) \n\nThe \\(n\\) - th number would be then \n\n\\[z_{n} = \\lfloor x_{n}\\alpha +(n - x_{n})\\beta \\rfloor \\Longrightarrow n\\beta +x_{n}(\\alpha -\\beta) - 1< z_{n}< n\\beta +x_{n}(\\alpha -\\beta),\\] \n\nin which \n\n\\[-2025< x_{n} - y_{n}< 2025\\iff \\frac{n - 2025}{2} < x_{n}< \\frac{n + 2025}{2}.\\] \n\nSuppose without loss of generality that \\(\\alpha \\geq \\beta\\) . Then \n\n\\[n\\beta +\\frac{n - 2025}{2} (\\alpha -\\beta) - 1< z_{n}< n\\beta +\\frac{n + 2025}{2} (\\alpha -\\beta),\\] \n\nwhich reduces to \n\n\\[\\left|z_{n} - \\frac{\\alpha + \\beta}{2} n\\right|< \\frac{2025}{2} (\\alpha -\\beta) + 1.\\] \n\nOn the other hand, \\(z_{n + 1} = \\lfloor x_{n + 1}\\alpha +y_{n + 1}\\beta \\rfloor \\in \\{\\lfloor x_{n}\\alpha +y_{n}\\beta +\\alpha \\rfloor ,\\lfloor x_{n}\\alpha +y_{n}\\beta +\\beta \\rfloor \\}\\) , which implies \\(z_{n + 1}\\geq z_{n}\\) . Since every non- negative integer appears exactly once, in increasing order, it follows that \\(z_{n} = n\\) . \n\nTherefore, for all positive integers \\(n\\) \n\n\\[\\left|n - \\frac{\\alpha + \\beta}{2} n\\right|< \\frac{2025}{2} (\\alpha -\\beta) + 1,\\] \n\nwhich can only be possible if \\(\\alpha +\\beta = 2\\) ; otherwise, the left hand side would be unbounded. If \\(\\alpha +\\beta = 2\\) , consider \\(x_{n} = \\left\\lfloor \\frac{n}{2}\\right\\rfloor\\) and \\(y_{n} = \\left\\lfloor \\frac{n}{2}\\right\\rfloor\\) . If \\(n\\) is even, \n\n\\[z_{n} = \\left\\lfloor \\frac{n}{2}\\alpha +\\frac{n}{2}\\beta \\right\\rfloor = n;\\] \n\nif \\(n\\) is odd, \n\n\\[z_{n} = \\left\\lfloor \\frac{n + 1}{2}\\alpha +\\frac{n - 1}{2}\\beta \\right\\rfloor = n + \\left\\lfloor \\frac{\\alpha - \\beta}{2}\\right\\rfloor ,\\] \n\nwhich equals \\(n\\) because \\(0< \\beta \\leq \\alpha < \\alpha +\\beta = 2\\Longrightarrow 0\\leq \\alpha -\\beta < 2\\)", "metadata": {"resource_path": "APMO/segmented/en-apmo2025_sol.jsonl", "problem_match": "# Problem 2 ", "solution_match": "# Solution \n\n"}}
|
| 3 |
+
{"year": "2025", "tier": "T1", "problem_label": "3", "problem_type": null, "exam": "APMO", "problem": "Let \\(P(x)\\) be a non- constant polynomial with integer coefficients such that \\(P(0) \\neq 0\\) . Let \\(a_{1}, a_{2}, a_{3}, \\ldots\\) be an infinite sequence of integers such that \\(P(i - j)\\) divides \\(a_{i} - a_{j}\\) for all distinct positive integers \\(i, j\\) . Prove that the sequence \\(a_{1}, a_{2}, a_{3}, \\ldots\\) must be constant, that is, \\(a_{n}\\) equals a constant \\(c\\) for all \\(n\\) positive integer.", "solution": "Let \\(a_{0} = P(0) \\neq 0\\) be the independent coefficient, i.e., the constant term of \\(P(x)\\) . Then there are infinitely many primes \\(p\\) such that \\(p\\) divides \\(P(k)\\) but \\(p\\) does not divide \\(k\\) . In fact, since \\(P(k) - a_{0}\\) is a multiple of \\(k\\) , \\(\\gcd (P(k), k) = \\gcd (k, a_{0}) \\leq a_{0}\\) is bounded, so pick, say, \\(k\\) with prime factors each larger than \\(a_{0}\\) . \n\nSince \\(P(k)\\) divides \\(a_{i + k} - a_{i}\\) , \\(p\\) divides \\(a_{i + k} - a_{i}\\) . Moreover, since \\(P(k + p) \\equiv P(k) \\equiv 0\\) (mod \\(p\\) ), \\(p\\) also divides \\(a_{i + k + p} - a_{i}\\) . Therefore, \\(a_{i}\\) mod \\(p\\) is periodic with periods \\(k + p\\) and \\(k\\) . By Bezout's theorem, \\(\\gcd (k + p, k) = 1\\) is also a period, that is, \\(p\\) divides \\(a_{i + 1} - a_{i}\\) for all \\(i\\) and \\(p\\) such that \\(p \\mid P(k)\\) and \\(p \\nmid k\\) for some \\(k\\) . Since there are infinitely many such primes \\(p\\) , \\(a_{i + 1} - a_{i}\\) is divisible by infinitely many primes, which implies \\(a_{i + 1} = a_{i}\\) , that is, the sequence is constant.", "metadata": {"resource_path": "APMO/segmented/en-apmo2025_sol.jsonl", "problem_match": "# Problem 3 ", "solution_match": "# Solution \n\n"}}
|
| 4 |
+
{"year": "2025", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "APMO", "problem": "Let \\(n \\geq 3\\) be an integer. There are \\(n\\) cells on a circle, and each cell is assigned either 0 or 1. There is a rooster on one of these cells, and it repeats the following operations: \n\nIf the rooster is on a cell assigned 0, it changes the assigned number to 1 and moves to the next cell counterclockwise. If the rooster is on a cell assigned 1, it changes the assigned number to 0 and moves to the cell after the next cell counterclockwise. \n\nProve that the following statement holds true after sufficiently many operations: \n\nIf the rooster is on a cell \\(C\\) , then the rooster would go around the circle exactly three times, stopping again at \\(C\\) . Moreover, every cell would be assigned the same number as it was assigned right before the rooster went around the circle 3 times.", "solution": "Reformulate the problem as a \\(n\\) - string of numbers in \\(\\{0,1\\}\\) and a position at which the action described in the problem is performed, and add 1 or 2 modulo \\(n\\) to the position according to the action. Say that a lap is complete for each time the position resets to 0 or 1. We will prove that the statement claim holds after at most two laps, after which the \\(n\\) - tuple cycles every three laps. \n\nSay the rooster stops at a position in a certain lap if it performs an action at that position on that lap; otherwise, the rooster bypasses that position. We start with some immediate claims: \n\nThe rooster has to stop at at least one of each two consecutive positions. The rooster stops at every position preceded by a 0. Indeed, if the numbers preceding that position are 00 then the rooster will definitely stop at the second zero, and it the numbers preceding that position are 10 then the rooster will either stop at 1 and go directly to the position or bypass 1 and stop at the second zero, and then stop at the position. Therefore, if the rooster bypasses a position, then it is preceded by a 1, and that 1 must be changed to a 0. This means that the rooster never bypasses a position in two consecutive laps. The rooster bypasses every position preceded by 01. Indeed, the rooster stops at either 1 or at 0, after which it will move to 1; at any rate, it stops at 1 and bypasses the position. \n\nOur goal is to prove that, eventually, for every three consecutive laps, each position is bypassed exactly once. Then each position changes states exactly twice, so it gets back to its initial state after three laps. The following two lemmata achieve this goal: \n\nLemma 1. If the rooster stops at a certain position in two laps in a row, it bypasses it on the next lap, except for the \\(n\\) - string \\(1010\\ldots 10\\) , for which the problem statement holds. \n\nProof. If the rooster stopped at a position in lap \\(t\\) , then it is preceded by either (A) a 0 that was changed to 1, (B) a 11 that was changed to 01, or (C) a 10 in which the rooster stopped at 1. In case (A), the position must be preceded by 11 in the lap \\(t + 1\\) , which becomes 01, so the rooster will bypass the position in the lap \\(t + 2\\) . In case (B), the position will be bypassed in lap \\(t + 1\\) . \n\nNow we deal with case (C): suppose that the position was preceded by \\(m\\) occurrences of 10, that is, \\((10)^{m}\\) , on lap \\(t\\) and take \\(m \\leq \\frac{n}{2}\\) maximal. The rooster stopped at the 1 from each occurrence of 10, except possibly the first one.\n\n\n\nFirst, suppose that \\(n \\geq 2m + 2\\) . After lap \\(t\\) , \\((10)^{m}\\) becomes either \\((00)^{m}\\) or \\(11(00)^{m - 1}\\) in lap \\(t + 1\\) . In the latter case, initially we had \\(1(10)^{m}\\) , which became \\(011(00)^{m - 1}\\) . It will then become \\(a01(11)^{m - 1}\\) in lap \\(t + 2\\) , in which the rooster will bypass the position. In the former case, \\((10)^{m}\\) becomes \\((00)^{m}\\) , so it was either \\(00(10)^{m}\\) or \\(11(10)^{m}\\) in lap \\(t\\) , which becomes respectively \\(a1(00)^{m}\\) and \\(01(00)^{m}\\) in lap \\(t + 1\\) , respectively. In the second sub- case, it becomes \\(b001(11)^{m - 1}\\) in lap \\(t + 2\\) , and the position will be bypassed. In the first sub- case, it must be \\(11(00)^{m}\\) after which it becomes either \\(01(11)^{m}\\) or \\(1001(11)^{m - 1}\\) . In any case, the position will be bypassed in lap \\(t + 2\\) . If \\(n = 2m + 1\\) , the possible configurations are \n\n\\[(10)^{m}0\\rightarrow (00)^{m}1\\rightarrow (11)^{m}0\\rightarrow (10)^{m}0,\\] \n\nthe rooster stops at the 1 from the first 10 because it was preceded by a 0. \n\n\\[(10)^{m}1\\rightarrow (00)^{m}0\\rightarrow 0(11)^{m}\\rightarrow 1(01)^{m},\\] \n\nor \n\n\\[(10)^{m}1\\rightarrow 11(00)^{m - 1}0\\rightarrow 01(11)^{m - 1}1\\rightarrow (10)^{m}1,\\] \n\nIn any case, the position is bypassed in lap \\(t + 2\\) . \n\nIf \\(n = 2m\\) , the entire configuration is \\((10)^{m}\\) , \\(m \\geq 2\\) . If the rooster did not stop at the first 1, it becomes \\(11(00)^{m - 1}\\) in the lap \\(t + 1\\) , then \\(01(11)^{m - 1}\\) in the lap \\(t + 2\\) , so the position is bypassed in this last lap. If the rooster stopped at the first 1, it becomes \\((00)^{m}\\) , then \\((11)^{m}\\) , then \\((01)^{m}\\) , then \\(10(00)^{m - 1}\\) , then \\((11)^{m}\\) , and then it cycles between \\((11)^{m}\\) , \\((01)^{m}\\) and \\(10(00)^{m - 1}\\) . \n\nSo, apart from this specific string, the rooster will stop at most two laps in a row at each position. \n\nLemma 2. If the rooster bypasses one position on a lap, then it stops at that position on the next two laps, with the same exception as lemma 1. \n\nProof. The position must be preceded by 1 in lap \\(t\\) . If it is preceded by 11, it changes to 10 in lap \\(t + 1\\) . Then it becomes 00 because the 1 was already skipped in the previous lap, and the rooster will stop at the position in the lap \\(t + 2\\) . \n\nNow suppose that the position was preceded by \\((01)^{m}\\) on lap \\(t\\) and take \\(m \\leq \\frac{n}{2}\\) maximal. It becomes \\(10(00)^{m - 1}\\) or \\((00)^{m}\\) in lap \\(t + 1\\) . In the former case, in lap \\(t + 2\\) it becomes either \\(00(11)^{m - 1}\\) , after which the rooster stops at the position again, or \\((11)^{m}\\) , which we'll study later. In the former case, \\((00)^{m}\\) becomes \\((11)^{m}\\) or \\(01(11)^{m - 1}\\) . In the latter case, the 0 was bypassed, so it must be sopped in the next lap, becoming \\((10)^{m}\\) . In the \\((11)^{m}\\) case, in order to bypass the position in lap \\(t + 2\\) , it must become \\((10)^{m}\\) . All in all, the preceding terms are \\((01)^{m}\\) . Then, either \\(10(00)^{m - 1}\\) or \\((00)^{m}\\) , then either \\((11)^{m}\\) or \\(01(11)^{m - 1}\\) , then \\((10)^{m}\\) . Then the second term in \\((01)^{m}\\) is 1, then 0, then 1, and then 0, that is, it changed three times. So we fall under the exception to lemma 1. \\(\\square\\) \n\nThe result then immediately follows from lemmata 1 and 2.", "metadata": {"resource_path": "APMO/segmented/en-apmo2025_sol.jsonl", "problem_match": "# Problem 4 ", "solution_match": "# Solution 1"}}
|
| 5 |
+
{"year": "2025", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "APMO", "problem": "Let \\(n \\geq 3\\) be an integer. There are \\(n\\) cells on a circle, and each cell is assigned either 0 or 1. There is a rooster on one of these cells, and it repeats the following operations: \n\nIf the rooster is on a cell assigned 0, it changes the assigned number to 1 and moves to the next cell counterclockwise. If the rooster is on a cell assigned 1, it changes the assigned number to 0 and moves to the cell after the next cell counterclockwise. \n\nProve that the following statement holds true after sufficiently many operations: \n\nIf the rooster is on a cell \\(C\\) , then the rooster would go around the circle exactly three times, stopping again at \\(C\\) . Moreover, every cell would be assigned the same number as it was assigned right before the rooster went around the circle 3 times.", "solution": "Define positions, laps, stoppings, and bypassing as in Solution 1. This other pair of lemmata also solves the problem. \n\nLemma 3. There is a position and a lap in which the rooster stops twice and bypasses once (in some order) in the next three laps. \n\nProof. There is a position \\(j\\) the rooster stops for infinitely many times. Each time it stops at \\(j\\) , it changes between stopping and bypassing \\(j + 1\\) . So the rooster stops and bypasses \\(j + 1\\) infinitely many times. Then there is a lap in which the rooster stops at \\(j + 1\\) , and bypasses it in the next. As in solution 1, it cannot bypass \\(j + 1\\) two times in a row, so it stops at \\(j + 1\\) in the next lap. \\(\\square\\)\n\n\n\nLemma 4. If the rooster stops twice and bypasses once (in some order) at some position in three consecutive laps, it also stops twice and bypasses once at the next position (in some order) in the same laps (or in the next laps, in case the lap changes from one position to the other). \n\nProof. When the rooster bypasses the position, it must stop at the next one. In the two times it stops at the position, the cell has different numbers on it, so the rooster will stop once and bypass once at the next position. \\(\\square\\) \n\nBy lemmata 3 and 4, there would be a moment that the rooster stops twice and bypasses once (in some order) at any position after this moment. After this moment, if the rooster is in a cell \\(C\\) in lap \\(t\\) , we know that it stopped; stopped- bypassed; and bypassed- stopped at \\(C\\) in laps \\(t, t + 1, t + 2\\) . Since it stopped twice and bypassed once (in some order) in laps \\(t + 1, t + 2, t + 3\\) , it must stop at \\(C\\) in lap \\(t + 3\\) . Moreover, the rooster stopped twice and bypassed once (in some order) each cell between stopping at \\(C\\) in laps \\(t\\) and \\(t + 3\\) , so every cell has the same assigned number before and after going around the circle three times.", "metadata": {"resource_path": "APMO/segmented/en-apmo2025_sol.jsonl", "problem_match": "# Problem 4 ", "solution_match": "# Solution 2"}}
|
| 6 |
+
{"year": "2025", "tier": "T1", "problem_label": "4", "problem_type": null, "exam": "APMO", "problem": "Let \\(n \\geq 3\\) be an integer. There are \\(n\\) cells on a circle, and each cell is assigned either 0 or 1. There is a rooster on one of these cells, and it repeats the following operations: \n\nIf the rooster is on a cell assigned 0, it changes the assigned number to 1 and moves to the next cell counterclockwise. If the rooster is on a cell assigned 1, it changes the assigned number to 0 and moves to the cell after the next cell counterclockwise. \n\nProve that the following statement holds true after sufficiently many operations: \n\nIf the rooster is on a cell \\(C\\) , then the rooster would go around the circle exactly three times, stopping again at \\(C\\) . Moreover, every cell would be assigned the same number as it was assigned right before the rooster went around the circle 3 times.", "solution": "Let us reformulate the problem in terms of Graphs: we have a directed graph \\(G\\) with \\(V = \\{v_{1}, v_{2}, \\ldots , v_{n}\\}\\) representing positions and \\(E = \\{v_{i} \\to v_{i + 1}, v_{i} \\to v_{i + 2} \\mid 1 \\le i \\le n\\}\\) representing moves. Indices are taken mod \\(n\\) . Note that each vertex has in- degree and out- degree both equal to 2. We say that the edge \\(v_{i} \\to v_{i + 1}\\) is active and \\(v_{i} \\to v_{i + 2}\\) is inactive if the number on \\(v_{i}\\) is 0, or the edge \\(v_{i} \\to v_{i + 2}\\) is active and \\(v_{i} \\to v_{i + 1}\\) is inactive if the number on \\(v_{i}\\) is 1. The rooster then traces an infinite trail on the graph in the following manner; \n\n- it starts at \\(v_{1}\\) ; \n\n- if the rooster is at \\(v_{i}\\) , it uses the active edge going out of \\(v_{i}\\) to continue the path, and changes the number on \\(v_{i}\\) . \n\nTake the first vertex that appears 3 times on the rooster's trail, and suppose without any loss of generality that it is \\(v_{1}\\) (otherwise, just ignore the path before the first time that this vertex appears). Consider the sub- trail from the first to the third time \\(v_{1}\\) appears: \\(C = v_{1} \\to \\dots \\to v_{1} \\to \\dots \\to v_{1}\\) . Trail \\(C\\) induces a circuit \\(C^{*}\\) on \\(G\\) that passes through \\(v_{1}\\) twice. \n\nIn between two occurrences of \\(v_{1}\\) , the rooster must have completed at least one lap. Vertex \\(v_{1}\\) appears three times at \\(C\\) , so \\(C\\) contains at least two laps. Since (as per Solution 1) no vertex is bypassed twice in a row, \\(C^{*}\\) must contain every vertex. Moreover, \\(v_{1}\\) is the first (and only) vertex that appeared three times on the rooster's path, so each vertex appear at most twice on \\(C^{*}\\) . \n\nLemma 5. Take \\(V^{\\prime}\\) to be the subset of \\(V\\) containing the vertices that only appears once on \\(C^{*}\\) and \\(E^{\\prime}\\) to be the edges of \\(G\\) that don't appear on \\(C^{*}\\) . So \\(G^{\\prime} = (V^{\\prime}, E^{\\prime})\\) is a simple cycle or \\(V^{\\prime} = E^{\\prime} = \\emptyset\\) . \n\nProof. We will first prove that each edge in \\(C^{*}\\) appears exactly one. Suppose, for the sake of contradiction, that there is an edge \\(u \\to v\\) that appears twice on \\(C^{*}\\) . So \\(u\\) must appear times in \\(C\\) , because the active edge going out of \\(u\\) changes at each visit to it. So \\(u = v_{1}\\) , but the rooster only goes out of \\(v_{1}\\) twice in \\(C\\) , which is a contradiction. \n\nNow, since \\(C^{*}\\) does not have repeated edges, all four edges through \\(v\\) are in \\(C^{*}\\) if \\(v\\) is visited twice in this cycle. So the edges on \\(E^{\\prime}\\) cannot pass through vertices in \\(V \\setminus V^{\\prime}\\) , then \\(G^{\\prime}\\) is well- defined. \n\nSince \\(v \\in V^{\\prime}\\) is visited once on \\(C^{*}\\) , it has \\(\\deg_{in}(v) = \\deg_{out}(v) = 1\\) in \\(G^{\\prime}\\) , so \\(G^{\\prime}\\) is a union of disjoint simple cycles. Each of these cycles completes at least one lap, and \\(v_{1}\\) is skipped on these laps, so all cycles must use the edge \\(v_{n} \\to v_{2}\\) . But the cycles are disjoint, so there is at most one cycle. \\(\\square\\) \n\nLemma 6. The rooster eventually traverses a contiguous Eulerian circuit of \\(G\\) .\n\n\n\nProof. If \\(V^{\\prime} = E^{\\prime} = \\emptyset\\) , \\(C^{*}\\) is already an Eulerian circuit traversed in \\(C\\) . If not, take \\(u_{1}\\) to be the first vertex of \\(C\\) that is in \\(V^{\\prime}\\) . Let \\(U = u_{1}\\to \\dots \\to u_{k}\\to u_{1}\\) be the cycle determined by \\(G^{\\prime}\\) by Lemma 5, \\(C_{1} = v_{1}\\to \\dots \\to u_{1}\\) be the sub- path of \\(C\\) from the first \\(v_{1}\\) to \\(u_{1}\\) , and \\(C_{2} = u_{1}\\to \\dots \\to v_{1}\\) be the rest of \\(C\\) . \n\nEach vertex on \\(V\\backslash V^{\\prime}\\) has been changed twice, so they would be in their initial states after \\(C\\) ; every vertex on \\(V^{\\prime}\\) has been changed only once, and therefore are not on their initial states. Let us trace the rooster's trail after it traversed \\(C\\) . By the minimality of \\(u_{1}\\) , all the edges of \\(C_{1}\\) are active after \\(C\\) , so the rooster traverses \\(C_{1}\\) after \\(C\\) . Moreover, each \\(u_{i}\\) was visited exactly once in \\(C\\) and has not yet used the edge \\(u_{i}\\to u_{i + 1}\\) . Since all their states have changed, all edges of \\(U\\) are active after \\(C\\) . Therefore, the rooster traverse \\(U\\) after \\(C_{1}\\) , flipping all the vertices in \\(U\\) to their initial states. Then, since every state in \\(U\\) was changed, the rooster traverses \\(C_{2}\\) instead of \\(U\\) . The trail is then \\(C\\to C_{1}\\to U\\to C_{2}\\) , and hen \\(C_{1}\\to U\\to C_{2}\\) is an Eulerian circuit. \\(\\square\\) \n\nHaving this in mind, after the rooster completes an Eulerian circuit, it has passed through each vertex twice and returned to its initial vertex, so the state of the rooster and of the edges are the same before and after the Eulerian cycle. The rooster will then traverse the Eulerian circuit repeatedly. \n\nThe edges \\(v_{i}\\to v_{i + 1}\\) move forward by one position and the edges \\(v_{i}\\to v_{i + 2}\\) move forward by two positions. Since all edges are used, each time the rooster traverses the Eulerian circuit, it moves forward a total of \\(n(1 + 2) = 3n\\) positions, which corresponds to three laps. The proof is now complete. \n\nComment: Solution 1 presents a somewhat brute- force case analysis; the main ideas are \n\n- Lemma 1: The rooster stops at one position in at most two consecutive laps, with one notable exception. \n\n- Lemma 2: If the rooster bypasses one position then it stops at it in the next two laps, with the same notable exception. \n\n- Solution 2 has a recursive nature; the main ideas are \n\n- Lemma 3: Proving that one position changes states exactly two out of three laps. \n\n- Lemma 4: Given that this happens to one position, it also happens to the next position in the same laps, so it happens to every position. \n\n- Solution 3 cleverly identifies the moves the rooster performs within a graph theoretical framework. The main goal is to prove that the rooster traces an Eulerian circuit in a graph. \n\n- Lemma 5: Analyzing what happens after the rooster first visits a position three times. \n\n- Lemma 6: Proving that the rooster traces an Eulerian circuit.", "metadata": {"resource_path": "APMO/segmented/en-apmo2025_sol.jsonl", "problem_match": "# Problem 4 ", "solution_match": "# Solution 3"}}
|
| 7 |
+
{"year": "2025", "tier": "T1", "problem_label": "5", "problem_type": null, "exam": "APMO", "problem": "Consider an infinite sequence \\(a_{1},a_{2},\\ldots\\) of positive integers such that \n\n\\[100!(a_{m} + a_{m + 1} + \\cdot \\cdot \\cdot +a_{n})\\quad \\mathrm{is~a~multiple~of}\\quad a_{n - m + 1}a_{n + m}\\] \n\nfor all positive integers \\(m,n\\) such that \\(m\\leq n\\) \n\nProve that the sequence is either bounded or linear. \n\nObservation: A sequence of positive integers is bounded if there exists a constant \\(N\\) such that \\(a_{n}< N\\) for all \\(n\\in \\mathbb{Z}_{>0}\\) . A sequence is linear if \\(a_{n} = n\\cdot a_{1}\\) for all \\(n\\in \\mathbb{Z}_{>0}\\)", "solution": "Let \\(c = 100!\\) . Suppose that \\(n\\geq m + 2\\) . Then \\(a_{m + n} = a_{(m + 1) + (n - 1)}\\) divides both \\(c(a_{m} + a_{m + 1}+\\) \\(\\cdot \\cdot \\cdot +a_{n - 1} + a_{n})\\) and \\(c(a_{m + 1} + \\cdot \\cdot \\cdot +a_{n - 1})\\) , so it also divides the difference \\(c(a_{m} + a_{n})\\) . Notice that if \\(n = m + 1\\) then \\(a_{m + n}\\) divides \\(c(a_{m} + a_{m + 1}) = c(a_{m} + a_{n})\\) , and if \\(n = m\\) then \\(a_{m + n}\\) divides both \\(c a_{m}\\) and \\(2c a_{m} = c(a_{m} + a_{n})\\) . In either cases; \\(a_{m + n}\\) divides \\(c(a_{m} + a_{n})\\) \n\nAnalogously, one can prove that if \\(m > n\\) , \\(a_{m - n} = a_{(m - 1) - (n - 1)}\\) divides \\(c(a_{m} - a_{n})\\) , as it divides both \\(c(a_{n + 1} + \\cdot \\cdot \\cdot +a_{m})\\) and \\(c(a_{n} + \\cdot \\cdot \\cdot +a_{m - 1})\\) \n\nFrom now on, drop the original divisibility statement and keep the statements \" \\(a_{m + n}\\) divides \\(c(a_{m} + a_{n})\\) \" and \" \\(a_{m - n}\\) divides \\(c(a_{m} - a_{n})\\) . Now, all conditions are linear, and we can suppose without loss of generality that there is no integer \\(D > 1\\) that divides every term of the sequence; if there is such an integer \\(D\\) , divide all terms by \\(D\\) . \n\nHaving this in mind, notice that \\(a_{m} = a_{m + n - n}\\) divides \\(c(a_{m + n} - a_{n})\\) and also \\(c(a_{m + n} - a_{m} - a_{n})\\) analogously, \\(a_{n}\\) also divides \\(c(a_{m + n} - a_{m} - a_{n})\\) , and since \\(a_{m + n}\\) divides \\(c(a_{m} + a_{n})\\) , it also divides \\(c(a_{m + n} - a_{m} - a_{n})\\) . Therefore, \\(c(a_{m + n} - a_{m} - a_{n})\\) is divisible by \\(a_{m}\\) , \\(a_{n}\\) , and \\(a_{m + n}\\) , and therefore also by \\(\\operatorname {lcm}(a_{m},a_{n},a_{m + n})\\) . In particular, \\(c a_{m + n}\\equiv c(a_{m} + a_{n})\\pmod {\\operatorname {lcm}(a_{m},a_{n})}\\) \n\nSince \\(a_{m + n}\\) divides \\(c(a_{m} + a_{n})\\) , \\(a_{m + n}\\leq c(a_{m} + a_{n})\\) \n\nFrom now on, we divide the problem in two cases. \n\nCase 1: there exist \\(m,n\\) such that \\(\\operatorname {lcm}(a_{m},a_{n}) > c^{2}(a_{m} + a_{n})\\) \n\nIf \\(\\operatorname {lcm}(a_{m},a_{n}) > c^{2}(a_{m} + a_{n}) > c(a_{m} + a_{n})\\) then both \\(c(a_{m} + a_{n})\\) and \\(c a_{m + n}\\) are less than \n\n\\(c a_{m + n}\\leq c^{2}(a_{m} + a_{n})< \\operatorname {lcm}(a_{m},a_{n})\\) . This implies \\(c a_{m + n} = c(a_{m} + a_{n})\\iff a_{m + n} = a_{m} + a_{n}\\) Now we can extend this further: since \\(\\gcd (a_{m},a_{m + n}) = \\gcd (a_{m},a_{m} + a_{n}) = \\gcd (a_{m},a_{n})\\) , it follows that \n\n\\[\\operatorname {lcm}(a_{m},a_{m + n}) = \\frac{a_{m}a_{m + n}}{\\gcd (a_{m},a_{n})} = \\frac{a_{m + n}}{a_{n}}\\operatorname {lcm}(a_{m},a_{n}) > \\frac{c^{2}(a_{m} + a_{n})^{2}}{a_{n}}\\] \\[\\qquad >\\frac{c^{2}(2a_{m}a_{n} + a_{n}^{2})}{a_{n}} = c^{2}(2a_{m} + a_{n}) = c^{2}(a_{m} + a_{m + n}).\\] \n\nWe can iterate this reasoning to obtain that \\(a_{k m + n} = k a_{m} + a_{n}\\) , for all \\(k\\in \\mathbb{Z}_{>0}\\) . In fact, if the condition \\(\\operatorname {lcm}(a_{m},a_{n}) > c^{2}(a_{m} + a_{n})\\) holds for the pair \\((n,m)\\) , then it also holds for the pairs \\((m + n,m)\\) , \\((2m + n,m)\\) , ..., \\(((k - 1)m + n,m)\\) , which implies \\(a_{k m + n} = a_{(k - 1)m + n} + a_{m} =\\) \\(a_{(k - 2)m + n} + 2a_{m} = \\cdot \\cdot \\cdot = a_{n} + k a_{m}\\) \n\nSimilarly, \\(a_{m + k n} = a_{m} + k a_{n}\\) \n\nNow, \\(a_{m + n + m n} = a_{n + (n + 1)m} = a_{m + (m + 1)n}\\implies a_{n} + (n + 1)a_{m} = a_{m} + (m + 1)a_{n}\\iff m a_{n} =\\) \\(n a_{m}\\) . If \\(d = \\gcd (m,n)\\) then \\(\\frac{n}{d} a_{m} = \\frac{m}{d} a_{n}\\) \n\nTherefore, since \\(\\gcd (\\frac{m}{d},\\frac{n}{d}) = 1\\) , \\(\\frac{m}{d}\\) divides \\(a_{m}\\) and \\(\\frac{n}{d}\\) divides \\(a_{n}\\) , which means that \n\n\\[a_{n} = \\frac{m}{d}\\cdot t = \\frac{t}{d} m\\quad \\mathrm{and}\\quad a_{m} = \\frac{n}{d}\\cdot t = \\frac{t}{d} n,\\quad \\mathrm{for~some~}t\\in \\mathbb{Z}_{>0},\\] \n\nwhich also implies \n\n\\[a_{k m + n} = \\frac{t}{d} (k m + n)\\quad \\mathrm{and}\\quad a_{m + k n} = \\frac{t}{d} (m + k n),\\quad \\mathrm{for~all~}k\\in \\mathbb{Z}_{>0}.\\]\n\n\n\nNow let's prove that \\(a_{kd} = tk = \\frac{t}{d} (kd)\\) for all \\(k \\in \\mathbb{Z}_{>0}\\) . In fact, there exist arbitrarily large positive integers \\(R\\) , \\(S\\) such that \\(kd = Rm - Sn = (n + (R + 1)m) - (m + (S + 1)n)\\) (for instance, let \\(u\\) , \\(v \\in \\mathbb{Z}\\) such that \\(kd = mu - nv\\) and take \\(R = u + Qn\\) and \\(S = v + Qm\\) for \\(Q\\) sufficiently large.) \n\nLet \\(x = n + (R + 1)m\\) and \\(y = m + (S + 1)n\\) . Then \\(kd = x - y \\iff x = y + kd\\) , \\(a_{x} = \\frac{t}{d} x\\) , and \\(a_{y} = \\frac{t}{d} y = \\frac{t}{d} (x - kd) = a_{x} - tk\\) . Thus \\(a_{x}\\) divides \\(c(a_{y} + a_{kd}) = c(a_{kd} + a_{x} - tk)\\) , and therefore also \\(c(a_{kd} - tk)\\) . Since \\(a_{x} = \\frac{t}{d} x\\) can be arbitrarily large, \\(a_{kd} = tk = \\frac{t}{d} (kd)\\) . In particular, \\(a_{d} = t\\) , so \\(a_{kd} = ka_{d}\\) . \n\nSince \\(ka_{d} = a_{kd} = a_{1 + (kd - 1)}\\) divides \\(c(a_{1} + a_{kd - 1})\\) , \\(b_{k} = a_{kd - 1}\\) is unbounded. Pick \\(p > a_{kd - 1}\\) a large prime and consider \\(a_{pd} = pa_{d}\\) . Then \n\n\\[\\operatorname {lcm}(a_{pd},a_{kd - 1})\\geq \\operatorname {lcm}(p,a_{kd - 1}) = pa_{kd - 1}.\\] \n\nWe can pick \\(a_{kd - 1}\\) and \\(p\\) large enough so that their product is larger than a particular linear combination of them, that is, \n\n\\[\\operatorname {lcm}(p,a_{kd - 1}) = pa_{kd - 1} > c^{2}(pa_{d} + a_{kd - 1}) = c^{2}(a_{pd} + a_{kd - 1}).\\] \n\nThen all the previous facts can be applied, and since \\(\\gcd (pd, kd - 1) = 1\\) , \\(a_{k} = a_{k\\gcd (pd, kd - 1)} = ka_{\\gcd (pd, kd - 1)}\\) , that is, the sequence is linear. Also, since \\(a_{1}\\) divides all terms, \\(a_{1} = 1\\) . \n\nCase 2: \\(\\operatorname {lcm}(a_{m}, a_{n}) \\leq c^{2}(a_{m} + a_{n})\\) for all \\(m, n\\) . \n\nSuppose that \\(a_{m} \\leq a_{n}\\) ; then \\(\\operatorname {lcm}(a_{m}, a_{n}) = Ma_{n} \\leq c^{2}(a_{m} + a_{n}) \\leq 2c^{2}a_{n} \\Rightarrow M \\leq 2c^{2}\\) , that is, the factor in the smaller term that is not in the larger term is at most \\(2c^{2}\\) . \n\nWe prove that in this case the sequence must be bounded. Suppose on the contrary; then there is a term \\(a_{m}\\) that is divisible by a large prime power \\(p^{d}\\) . Then every larger term \\(a_{n}\\) is divisible by a factor larger than \\(\\frac{p^{d}}{2c^{2}}\\) . So we pick \\(p^{d} > (2c^{2})^{2}\\) , so that every large term \\(a_{n}\\) is divisible by the prime power \\(p^{e} > 2c^{2}\\) . Finally, fix \\(a_{k}\\) for any \\(k\\) . It follows from \\(a_{k + n} \\mid c(a_{k} + a_{n})\\) that \\((a_{n})\\) is unbounded, so we can pick \\(a_{n}\\) and \\(a_{k + n}\\) large enough such that both are divisible by \\(p^{e}\\) . Hence any \\(a_{k}\\) is divisible by \\(p\\) , which is a contradiction to the fact that there is no \\(D > 1\\) that divides every term in the sequence.", "metadata": {"resource_path": "APMO/segmented/en-apmo2025_sol.jsonl", "problem_match": "# Problem 5 ", "solution_match": "# Solution \n\n"}}
|