{"year": "2020", "tier": "T3", "problem_label": "1", "problem_type": null, "exam": "INMO", "problem": "Let $\\Gamma_{1}$ and $\\Gamma_{2}$ be two circles of unequal radii, with centres $O_{1}$ and $O_{2}$ respectively, in the plane intersecting in two distinct points $A$ and $B$. Assume that the centre of each of the circles $\\Gamma_{1}$ and $\\Gamma_{2}$ is outside the other. The tangent to $\\Gamma_{1}$ at $B$ intersects $\\Gamma_{2}$ again in $C$, different from $B$; the tangent to $\\Gamma_{2}$ at $B$ intersects $\\Gamma_{1}$ again in $D$, different from $B$. The bisectors of $\\angle D A B$ and $\\angle C A B$ meet $\\Gamma_{1}$ and $\\Gamma_{2}$ again in $X$ and $Y$, respectively, different from $A$. Let $P$ and $Q$ be the circumcentres of triangles $A C D$ and $X A Y$, respectively. Prove that $P Q$ is the perpendicular bisector of the line segment $O_{1} O_{2}$.", "solution": "![](https://cdn.mathpix.com/cropped/2024_06_05_03afab29f9db7b1e4488g-1.jpg?height=672&width=783&top_left_y=794&top_left_x=693)\n\nLet $\\angle C B A=\\alpha$ and $\\angle D B A=\\beta$. Then $\\angle B D A=\\alpha$ and $\\angle B C A=\\beta$. We also observe that $\\angle A O_{1} O_{2}=\\left(\\angle A O_{1} B / 2\\right)=\\alpha$ and, simiarly, $\\angle A O_{2} O_{1}=\\beta$. Hence\n\n$$\n\\angle O_{1} A O_{2}=180^{\\circ}-(\\alpha+\\beta)\n$$\n\nWe also have\n\n$$\n\\angle P O_{1} A=\\frac{\\angle D O_{1} A}{2}=\\frac{2 \\angle D B A}{2}=\\angle D B A=\\beta\n$$\n\nHence $\\angle P O_{1} O_{2}=\\angle P O_{1} A+\\angle A O_{1} O_{2}=\\beta+\\alpha$. Similarly, we can get $\\angle P O_{2} O_{1}=\\alpha+\\beta$. It follows that $P$ lies on the perpendicular bisector of $\\mathrm{O}_{1} \\mathrm{O}_{2}$.\n\nNow we observe that\n\n$$\n\\angle X Q Y=360^{\\circ}-2 \\angle X A Y=360^{\\circ}-2\\left(180^{\\circ}-\\alpha-\\beta\\right)=2(\\alpha+\\beta)\n$$\n\nThis gives\n\n$$\n\\angle O_{1} Q O_{2}=\\frac{1}{2}(\\angle X Q A+\\angle Y Q A)=\\frac{\\angle X Q Y}{2}=\\alpha+\\beta\n$$\n\nThis shows that $A, O_{1}, O_{2}, Q$ are concyclic. We also have\n\n$$\n\\begin{aligned}\n& \\angle A B X=\\angle A B D+\\angle D B X=\\beta+\\angle D A X=\\beta+\\frac{\\angle D A B}{2} \\\\\n& \\angle A B Y=\\angle A B C+\\angle C B Y=\\alpha+\\angle C A Y=\\alpha+\\frac{\\angle B A C}{2}\n\\end{aligned}\n$$\n\nAdding we obtain\n\n$$\n\\angle A B X+\\angle A B Y=\\alpha+\\beta+\\frac{1}{2}(\\angle D A B+\\angle B A C)=\\alpha+\\beta+\\left(180^{\\circ}-\\alpha-\\beta\\right)=180^{\\circ}\n$$\n\nHence $X, B, Y$ are collinear. Now\n\n$$\n\\begin{gathered}\n\\angle Q A X=\\frac{1}{2}\\left(180^{\\circ}-\\angle A Q X\\right)=90^{\\circ}-\\beta \\\\\n\\angle X A O_{1}=\\frac{1}{2}\\left(180^{\\circ}-\\angle X O_{1} A\\right)=90^{\\circ}-\\frac{1}{2}\\left(360^{\\circ}-2 \\angle A B X\\right)=\\angle A B X-90^{\\circ}\n\\end{gathered}\n$$\n\nHence\n\n$$\n\\angle Q A O_{1}=90^{\\circ}-\\beta+\\angle A B X-90^{\\circ}=\\angle A B X-\\beta=\\frac{\\angle D A B}{2}=\\frac{\\angle O_{1} A O_{2}}{2}\n$$\n\nThis shows that $A Q$ bisects $\\angle O_{1} A O_{2}$ and therefore the chords $Q O_{1}$ and $Q O_{2}$ subtend equal angles on the circumference of the circle passing through $Q O_{2} A O_{1}$. Hence $Q O_{2}=Q O_{1}$. This means $Q$ lies on the perpendicular bisector of $\\mathrm{O}_{1} \\mathrm{O}_{2}$.\n\nCombining, we get that $P Q$ is the perpendicular bisector of $O_{1} O_{2}$.", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo-20.jsonl", "problem_match": "\n1.", "solution_match": "## Solution:"}}
{"year": "2020", "tier": "T3", "problem_label": "2", "problem_type": null, "exam": "INMO", "problem": "Suppose $P(x)$ is a polynomial with real coefficients satsfying the condition $P(\\cos \\theta+\\sin \\theta)=$ $P(\\cos \\theta-\\sin \\theta)$, for every real $\\theta$. Prove that $P(x)$ can be expressed in the form\n\n$$\nP(x)=a_{0}+a_{1}\\left(1-x^{2}\\right)^{2}+a_{2}\\left(1-x^{2}\\right)^{4}+\\cdots+a_{n}\\left(1-x^{2}\\right)^{2 n}\n$$\n\nfor some real numbers $a_{0}, a_{1}, a_{2}, \\ldots, a_{n}$ and nonnegative integer $n$.", "solution": "Changing $\\theta$ to $\\theta-\\pi / 2$, we see that\n\n$$\nP(\\sin \\theta+\\cos \\theta)=P(\\sin \\theta-\\cos \\theta)\n$$\n\nThis shows that $P(x)=P(-x)$ for all $x \\in[-\\sqrt{2}, \\sqrt{2}]$ and as $\\mathrm{P}$ is a polynomial, in fact,\n\n$$\nP(x)=P(-x)\n$$\n\nfor all $x \\in \\mathbb{R}$. Hence $P(x)$ is an even polynomial; $P(x)=Q\\left(x^{2}\\right)$ for some polynomial $Q(x)$. This gives\n\n$$\nQ(1+\\sin (2 \\theta))=P(\\cos \\theta+\\sin \\theta)=P(\\cos \\theta-\\sin \\theta)=Q(1-\\sin (2 \\theta))\n$$\n\nTaking $t=\\sin (2 \\theta)$, we see that $Q(1+t)=Q(1-t)$. Hence $Q(0)=Q(2)$\n\nConsider $Q(t)-Q(0)$. This vanishes both at $t=0$ and $t=2$. Hence $t(2-t)$ is a factor of $Q(t)-Q(0)$. We obtain\n\n$$\nQ(t)-Q(0)=t(2-t) h(t)\n$$\n\nfor some polynomial $h(t)$. Using $Q(1+t)=Q(1-t)$, it follows that $h(1+t)=h(1-t)$. Hence by induction we get\n\n$$\nQ(t)=\\sum_{k=0}^{n} b_{k} t^{k}(2-t)^{k}\n$$\n\nHence\n\n$$\nP(x)=Q\\left(x^{2}\\right)=\\sum_{k=0}^{n} b_{k}\\left(x^{2}\\left(2-x^{2}\\right)\\right)^{k}=\\sum_{k=0}^{n} b_{k}\\left(1-\\left(1-x^{2}\\right)^{2}\\right)^{k}\n$$\n\nUsing binomial theorem, we can write this as\n\n$$\nP(x)=\\sum_{k=0}^{n} a_{k}\\left(1-x^{2}\\right)^{2 k}\n$$\n\nfor some coefficients $a_{k}, 0 \\leq k \\leq n$.", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo-20.jsonl", "problem_match": "\n2.", "solution_match": "\nSolution:"}}
{"year": "2020", "tier": "T3", "problem_label": "3", "problem_type": null, "exam": "INMO", "problem": "Let $X=\\{0,1,2,3,4,5,6,7,8,9\\}$. Let $S \\subseteq X$ be such that any nonnegative integer $n$ can be written as $p+q$ where the nonnegative integers $p, q$ have all their digits in $S$. Find the smallest possible number of elements in $S$.", "solution": "We show that 5 numbers will suffice. Take $S=\\{0,1,3,4,6\\}$. Observe the following splitting:\n\n| $n$ | $a$ | $b$ |\n| :--- | :--- | :--- |\n| 0 | 0 | 0 |\n| 1 | 0 | 1 |\n| 2 | 1 | 1 |\n| 3 | 0 | 3 |\n| 4 | 1 | 3 |\n| 5 | 1 | 4 |\n| 6 | 3 | 3 |\n| 7 | 3 | 4 |\n| 8 | 4 | 4 |\n| 9 | 3 | 6 |\n\nThus each digit in a given nonnegative integer is split according to the above and can be written as a sum of two numbers each having digits in $S$.\n\nWe show that $|S|>4$. Suppose $|S| \\leq 4$. We may take $|S|=4$ as adding extra numbers to $S$ does not alter our argument. Let $S=\\{a, b, c, d\\}$. Since the last digit can be any one of the numbers $0,1,2, \\ldots, 9$, we must be able to write this as a sum of digits from $S$, modulo 10. Thus the collection\n\n$$\nA=\\{x+y \\quad(\\bmod 10) \\mid x, y \\in S\\}\n$$\n\nmust contain $\\{0,1,2, \\ldots, 9\\}$ as a subset. But $A$ has at most 10 elements $\\left(\\binom{4}{2}+4\\right)$. Thus each element of the form $x+y(\\bmod 10)$, as $x, y$ vary over $S$, must give different numbers from $\\{0,1,2, \\ldots, 9\\}$.\n\nConsider $a+a, b+b, c+c, d+d$ modulo 10. They must give 4 even numbers. Hence the remaining even number must be from the remaining 6 elements obtained by adding two distinct members of $S$. We may assume that even number is $a+b(\\bmod 10)$. Then $a, b$ must have same parity. If any one of $c, d$ has same parity as that of $a$, then its sum with $a$ gives an even number, which is impossible. Hence $c, d$ must have same parity, in which case $c+d(\\bmod 10)$ is even, which leads to a contradiction. We conclude that $|S| \\geq 5$.", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo-20.jsonl", "problem_match": "\n3.", "solution_match": "\nSolution:"}}
{"year": "2020", "tier": "T3", "problem_label": "4", "problem_type": null, "exam": "INMO", "problem": "Let $n \\geq 3$ be an integer and let $1<a_{1} \\leq a_{2} \\leq a_{3} \\leq \\cdots \\leq a_{n}$ be $n$ real numbers such that $a_{1}+a_{2}+a_{3}+\\cdots+a_{n}=2 n$. Prove that\n\n$$\na_{1} a_{2} \\cdots a_{n-1}+a_{1} a_{2} \\cdots a_{n-2}+\\cdots+a_{1} a_{2}+a_{1}+2 \\leq a_{1} a_{2} \\cdots a_{n}\n$$", "solution": "We use Chebyshev's inequality. Observe\n\n$$\n\\begin{aligned}\n& n\\left(a_{1} a_{2} \\cdots a_{n-1}+a_{1} a_{2} \\cdots a_{n-2}+\\cdots+a_{1}+1\\right) \\\\\n& \\quad=\\left(a_{1} a_{2} \\cdots a_{n-1}+a_{1} a_{2} \\cdots a_{n-2}+\\cdots+a_{1}+1\\right)\\left(\\left(a_{n}-1\\right)+\\left(a_{n-1}-1\\right)+\\cdots+\\left(a_{1}-1\\right)\\right) \\\\\n& \\quad \\leq n\\left(a_{1} a_{2} \\cdots a_{n-1}\\left(a_{n}-1\\right)+\\cdots+a_{1}\\left(a_{2}-1\\right)+1\\left(a_{1}-1\\right)\\right) \\\\\n& \\quad \\leq n\\left(a_{1} a_{2} \\cdots a_{n}-1\\right)\n\\end{aligned}\n$$\n\nIt follows that\n\n$$\na_{1} a_{2} \\cdots a_{n-1}+a_{1} a_{2} \\cdots a_{n-2}+\\cdots+a_{1}+1 \\leq a_{1} a_{2} \\cdots a_{n}-1\n$$\n\nThis gives the required inequality.", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo-20.jsonl", "problem_match": "\n4.", "solution_match": "\nSolution:"}}
{"year": "2020", "tier": "T3", "problem_label": "5", "problem_type": null, "exam": "INMO", "problem": "Infinitely many equidistant parallel lines are drawn in the plane. A positive integer $n \\geq 3$ is called frameable if it is possible to draw a regular polygon with $n$ sides all whose vertices lie on these lines and no line contains more than one vertex of the polygon.\n\n(a) Show that $3,4,6$ are frameable.\n\n(b) Show that any integer $n \\geq 7$ is not frameable.\n(c) Determine whether 5 is frameable.", "solution": "For $n=3,4,6$ it is possible to draw regular polygons with vertices on the parallel lines (note that when we show a regular hexagon is a framed polygon, it includes the equilateral triangle case).\n\n![](https://cdn.mathpix.com/cropped/2024_06_05_03afab29f9db7b1e4488g-4.jpg?height=472&width=634&top_left_y=596&top_left_x=716)\n\nFigure 1:\n\n![](https://cdn.mathpix.com/cropped/2024_06_05_03afab29f9db7b1e4488g-4.jpg?height=504&width=914&top_left_y=1320&top_left_x=581)\n\nFigure 2:\n\n![](https://cdn.mathpix.com/cropped/2024_06_05_03afab29f9db7b1e4488g-4.jpg?height=355&width=398&top_left_y=2061&top_left_x=842)\n\nFigure 3:\n\nWe will prove that it is not possible for $n \\geq 7$. In fact, we prove a stronger statement that we can not draw other polygons with vertices on the lines (even if we allow more than one vertex to lie on the same line).\n\nFirst observe that if $A, B$ are points on the lines and $C$ is another point on a line, if we locate\n![](https://cdn.mathpix.com/cropped/2024_06_05_03afab29f9db7b1e4488g-5.jpg?height=366&width=788&top_left_y=603&top_left_x=622)\n\nFigure 4:\n![](https://cdn.mathpix.com/cropped/2024_06_05_03afab29f9db7b1e4488g-5.jpg?height=418&width=864&top_left_y=1271&top_left_x=596)\n\nFigure 5:\n\npoint $D$ such that $C D$ is parallel and equal to $A B$, then $D$ also lies on a line. Suppose that we have a regular polygon $A_{1} A_{2} \\ldots A_{n}$, where $n \\geq 6$, with all the vertices on the grid lines. Choose a point $O$ on a grid line and draw segments $O B_{i}$ equal and parallel to $A_{i} A_{i+1}$, for $i=1,2, \\ldots, n-1$ and $O B_{n}$ parallel and equal to $A_{n} A_{1}$. The points $B_{i}$ also lie on the grid lines and form a regular polygon with $n$ sides. Consider the ratio $k=\\frac{B_{1} B_{2}}{A_{1} A_{2}}$. Since $n>6$, the $\\angle B_{1} O B_{2}<360^{\\circ} / 6$ and hence is the smallest angle in the triangle $B_{1} O B_{2}$ (note that the triangle $B_{1} O B_{2}$ is isosceles). Thus $k<1$. Hence starting with a polygon with vertices on grid lines, we obtain another polygon with ratio of side lengths $k<1$. Repeating this process, we obtain a polygon with vertices on grid lines with ratio of sides $k^{m}$ for any $m$. This is a contradiction since the length of the side of a polygon with vertices on grid lines can not be less than the distance between the parallel lines. Thus for $n>6$, we can not draw a polygon with vertices on the grid lines.\n\nThe above proof fails for $n=5$. In this case, draw $O B_{1}, O B_{1}^{\\prime}$ parallel and equal to $A_{1} A_{2}$, in opposite directions (see Figure 5), and similarly for other sides. Then we obtain a regular decagon with vertices on the grid lines and we have proved that this is impossible.", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo-20.jsonl", "problem_match": "\n5.", "solution_match": "\nSolution:"}}
{"year": "2020", "tier": "T3", "problem_label": "6", "problem_type": null, "exam": "INMO", "problem": "A stromino is a $3 \\times 1$ rectangle. Show that a $5 \\times 5$ board divided into twenty-five $1 \\times 1$ squares\ncannot be covered by 16 strominos such that each stromino covers exactly three unit squares of the board and every unit square is covered by either one or two strominos. (A stromino can be placed either horizontally or vertically on the board.)", "solution": "Suppose on the contrary that it is possible to cover the board with 16 strominos such that each unit square is covered by either one or two strominos. If there are $k$ squares that are covered by exactly one stromino then $2(25-k)+k=163=48$ and hence $k=2$. Thus there are exactly two squares which are covered by only one stromino. We colour the board with three colours red, blue, green as follows. The square corresponding to the $i$-th row and the $j$-th column is coloured red if $i+j \\equiv 0(\\bmod 3)$, green if $i+j \\equiv 1(\\bmod 3)$ and blue otherwise. Then there are 9 red squares, 8 green squares and 8 blue squares. Note that each stromino covers exactly one square of each colour. Therefore the two squares that are covered by only one stromino are both red. For each such square $i+j \\equiv 0(\\bmod 3)$ where $i$ and $j$ are its row and column number.\n\nWe now colour the board with a different scheme. We colour the square corresponding to the $i$-th row and the $j$-th column red if $i-j \\equiv(\\bmod 3)$, green if $i-j \\equiv 1(\\bmod 3)$ and blue otherwise. Again, there are 9 red squares and hence the two squares covered by only one stromino are both red. For each such square $i-j \\equiv 0(\\bmod 3)$ where $i$ and $j$ are its row and columne number Thus, each of the two squares covered by only one stromino satisfies $i+j \\equiv 0(\\bmod 3)$ and $i-j \\equiv 0$ $(\\bmod 3)$ where $i$ and $j$ are its row and column number. This implies that $i=j=3$. This is a contradiction because there is only one such square.", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo-20.jsonl", "problem_match": "\n6.", "solution_match": "\nSolution:"}}