{"year": "2017", "tier": "T3", "problem_label": "1", "problem_type": null, "exam": "INMO", "problem": "In the given figure, $A B C D$ is a square paper. It is folded along $E F$ such that $A$ goes to a point $A^{\\prime} \\neq C, B$ on the side $B C$ and $D$ goes to $D^{\\prime}$. The line $A^{\\prime} D^{\\prime}$ cuts $C D$ in $G$. Show that the inradius of the triangle $G C A^{\\prime}$ is the sum of the inradii of the triangles $G D^{\\prime} F$ and $A^{\\prime} B E$.\n\n", "solution": "Observe that the triangles $G C A^{\\prime}$ and $A^{\\prime} B E$ are similar to the triangle $G D^{\\prime} F$. If $G F=u, G D^{\\prime}=v$ and $D^{\\prime} F=w$, then we have\n\n$$\nA^{\\prime} G=p u, C G=p v, A^{\\prime} C=p w, \\quad A^{\\prime} E=q u, B E=q w, A^{\\prime} B=q v\n$$\n\nIf $r$ is the inradius of $\\triangle G D^{\\prime} F$, then $p r$ and $q r$ are respectively the inradii of triangles $G C A^{\\prime}$ and $A^{\\prime} B E$. We have to show that $p r=r+q r$. We also observe that\n\n$$\nA E=E A^{\\prime}, \\quad D F=F D^{\\prime}\n$$\n\nTherefore\n\n$$\np w+q v=q w+q u=w+u+p v=v+p u\n$$\n\nThe last two equalities give $(p-1)(u-v)=w$. The first two equalities give $(p-q) w=q(u-v)$. Hence\n\n$$\n\\frac{p-q}{q}=\\frac{u-v}{w}=\\frac{1}{p-1}\n$$\n\nThis simplifies to $p(p-q-1)=0$. Since $p \\neq 0$, we get $p=q+1$. This implies that $p r=q r+r$.", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo_17.jsonl", "problem_match": "\n1.", "solution_match": "\nSolution:"}}
{"year": "2017", "tier": "T3", "problem_label": "2", "problem_type": null, "exam": "INMO", "problem": "Suppose $n \\geq 0$ is an integer and all the roots of $x^{3}+\\alpha x+4-\\left(2 \\times 2016^{n}\\right)=0$ are integers. Find all possible values of $\\alpha$.", "solution": "Let $u, v, w$ be the roots of $x^{3}+\\alpha x+4-\\left(2 \\times 2016^{n}\\right)=0$. Then $u+v+w=0$ and $u v w=-4+\\left(2 \\times 2016^{n}\\right)$. Therefore we obtain\n\n$$\nu v(u+v)=4-\\left(2 \\times 2016^{n}\\right)\n$$\n\nSuppose $n \\geq 1$. Then we see that $u v(u+v) \\equiv 4\\left(\\bmod 2016^{n}\\right)$. Therefore $u v(u+v) \\equiv 1$ $(\\bmod 3)$ and $u v(u+v) \\equiv 1(\\bmod 9)$. This implies that $u \\equiv 2(\\bmod 3)$ and $v \\equiv 2(\\bmod 3)$. This shows that modulo 9 the pair $(u, v)$ could be any one of the following:\n\n$$\n(2,2),(2,5),(2,8),(5,2),(5,5),(5,8),(8,2),(8,5),(8,8)\n$$\n\nIn each case it is easy to check that $u v(u+v) \\not \\equiv 4(\\bmod 9)$. Hence $n=0$ and $u v(u+v)=2$. It follows that $(u, v)=(1,1),(1,-2)$ or $(-2,1)$. Thus\n\n$$\n\\alpha=u v+v w+w u=u v-(u+v)^{2}=-3\n$$\n\nfor every pair $(u, v)$.", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo_17.jsonl", "problem_match": "\n2.", "solution_match": "\nSolution 1:"}}
{"year": "2017", "tier": "T3", "problem_label": "2", "problem_type": null, "exam": "INMO", "problem": "Suppose $n \\geq 0$ is an integer and all the roots of $x^{3}+\\alpha x+4-\\left(2 \\times 2016^{n}\\right)=0$ are integers. Find all possible values of $\\alpha$.", "solution": "Let $a, b, c \\in \\mathbb{Z}$ be the roots of the given equation for some $n \\in \\mathbb{N}_{0}$. By Vieta Theorem, we know that\n\n$$\n\\begin{gathered}\na+b+c=0 \\\\\na b+b c+c a=\\alpha \\\\\na b c=2 \\times 2016^{n}-4\n\\end{gathered}\n$$\n\nIf possible, let us have $n \\geq 1$. Since $7 \\mid 2016$, we have that\n\n$$\n7|a b c+4 \\Longrightarrow 7| 3(a b c+4) \\Longrightarrow 7|3 a b c+12 \\Longrightarrow 7| 3 a b c+5\n$$\n\nSince we have $a+b+c=0$, we get that $3 a b c=a^{3}+b^{3}+c^{3}$. Substituting this in the earlier expression, we get that\n\n$$\na^{3}+b^{3}+c^{3}+5 \\equiv 0 \\quad(\\bmod 7)\n$$\n\nConsider below, a table calculating the residues of cubes modulo 7 .\n\n| $x$ | 0 | 1 | 2 | 3 | 4 | 5 | 6 |\n| :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: |\n| $x^{3}$ | 0 | 1 | 1 | -1 | 1 | -1 | -1 |\n\nHence, we know that if $x \\in \\mathbb{N}$, then we have $x^{3} \\equiv 0,1,-1(\\bmod 7)$. Since $a^{3}+b^{3}+c^{3} \\equiv 2$ $(\\bmod 7)$, we see that we must have one of the numbers divisible by 7 and the other two numbers, when cubed, must leave 1 as remainder modulo 7. Without of generality, let us assume that\n\n$$\na \\equiv 0 \\quad(\\bmod 7), \\quad b^{3}, c^{3} \\equiv 1 \\quad(\\bmod 7)\n$$\n\nHence, we have $b, c \\equiv 1,2,4(\\bmod 7)$. We will consider all possible values of $b+c$ modulo 7 . Since the expression is symmetric in $b, c$, modulo 7 , we will consider $b \\leq c$.\n\n| $b$ | 1 | 1 | 1 | 2 | 2 | 4 |\n| :---: | :---: | :---: | :---: | :---: | :---: | :---: |\n| $c$ | 1 | 2 | 4 | 2 | 4 | 4 |\n| $b+c$ | 2 | 3 | 5 | 4 | 6 | 1 |\n\nWe see that, in all the above cases, we get $7 \\nmid\\langle b+c$. But this is a contradiction, since 7$| a+b+c$ and $7 \\mid a$ together imply that $7 \\mid b+c$. Hence, we cannot have $n \\geq 1$. Hence, the only possible value is $n=0$. Substituting this value in the original equation, the equation becomes\n\n$$\nx^{3}+\\alpha x+2=0\n$$\n\nSolving the equations $a+b+c=0$ and $a b c=-2$ in integers, we see that the only possible solutions $(a, b, c)$ are permutations of $(1,1,-2)$. In case of any permutation, $\\alpha=-3$. Substituting this value of $\\alpha$ back in the equation, we see that we indeed, get integer roots. Hence, the only possible value for $\\alpha$ is -3 .", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo_17.jsonl", "problem_match": "\n2.", "solution_match": "\nSolution 2:"}}
{"year": "2017", "tier": "T3", "problem_label": "3", "problem_type": null, "exam": "INMO", "problem": "Find the number of triples $(x, a, b)$ where $x$ is a real number and $a, b$ belong to the set $\\{1,2,3,4,5,6,7,8,9\\}$ such that\n\n$$\nx^{2}-a\\{x\\}+b=0\n$$\n\nwhere $\\{x\\}$ denotes the fractional part of the real number $x$. (For example $\\{1.1\\}=0.1=$ $\\{-0.9\\}$.", "solution": "Let us write $x=n+f$ where $n=[x]$ and $f=\\{x\\}$. Then\n\n$$\nf^{2}+(2 n-a) f+n^{2}+b=0\n$$\n\nObserve that the product of the roots of (1) is $n^{2}+b \\geq 1$. If this equation has to have a solution $0 \\leq f<1$, the larger root of (1) is greater 1 . We conclude that the equation (1) has a real root less than 1 only if $P(1)<0$ where $P(y)=y^{2}+(2 n-a) y+n^{2}+2 b$. This gives\n\n$$\n1+2 n-a+n^{2}+2 b<0\n$$\n\nTherefore we have $(n+1)^{2}+ba$. Hence $n \\leq 1$. If $n \\leq-4$, then again $(n+1)^{2}+b \\geq 10>a$. Thus we have the range for $n:-3,-2,-1,0,1$. If $n=-3$ or $n=1$, we have $(n+1)^{2}=4$. Thus we must have $4+b1$. For $a=9$, we get 7 values of $b$; for $a=8$ we get 6 values of $b$ and so on. Thus we get $2(7+6+5+4+3+2+1)=56$ values for the triple $(x, a, b)$.\n\nSuppose $n=-1$ so that $(n+1)^{2}=0$. In this case we require $b2 x_{n}+1$. If possible, let the converse hold. Then, we see that we must have $4 x_{n}-1 \\leq 2 x_{n}+1$, which implies that $x_{n} \\leq 1$. But we see that even for the smallest value of $n=1$, we have that $x_{n}>1$. Hence, the numbers are indeed sides of a triangle.\n\nLet $\\Delta_{n}, r_{n}, s_{n}$ denote respectively, the area, inradius and semiperimeter of the triangle with sides $2 x_{n}-1,2 x_{n}, 2 x_{n}+1$. By Heron's Formula for the area of a triangle, we see that\n\n$$\n\\Delta_{n}=\\sqrt{3 x_{n}\\left(x_{n}-1\\right) x_{n}\\left(x_{n}+1\\right)}=x_{n} \\sqrt{3\\left(x_{n}^{2}-1\\right)}\n$$\n\nIf possible, let $\\Delta_{n}$ be an integer for all $n \\in \\mathbb{N}$. We see that due to the presence of the first term $\\binom{n}{0} 2^{n}$, we have $3 \\nmid x_{n}, \\forall n \\in \\mathbb{N}$. Hence, we get that $3 \\mid x_{n}^{2}-1$. Hence, we can write $x_{n}^{2}-1$ as $3 m$ for some $m \\in \\mathbb{N}$. Then, we can also write\n\n$$\n\\Delta_{n}=3 x_{n} \\sqrt{m}\n$$\n\nNote that we have assumed that $\\Delta_{n}$ is an integer. Hence, we see that we must have $m$ to be a perfect square. Consequently, we get that\n\n$$\nr_{n}=\\frac{\\Delta_{n}}{s_{n}}=\\frac{\\Delta_{n}}{3 x_{n}}=\\sqrt{m} \\in \\mathbb{Z}\n$$\n\nHence, it only remains to show that $\\Delta_{n} \\in \\mathbb{Z}, \\forall n \\in \\mathbb{N}$. In other words, it suffices to show that $3\\left(x_{n}^{2}-1\\right)$ is a perfect square for all $n \\in \\mathbb{N}$.\n\nWe see that we can write $x_{n}$ as\n\n$$\n\\begin{aligned}\nx_{n} & =\\frac{1}{2}\\left(2 \\sum_{k \\geq 0}\\binom{n}{2 k} 2^{n-2 k} 3^{k}\\right) \\\\\n& =\\frac{1}{2}\\left((2+\\sqrt{3})^{n}+(2-\\sqrt{3})^{n}\\right) \\\\\n3 x_{n}^{2}-3 & =\\frac{3}{4}\\left((2+\\sqrt{3})^{2 n}+(2-\\sqrt{3})^{2 n}+2(2+\\sqrt{3})^{n}(2-\\sqrt{3})^{n}\\right)-3 \\\\\n& =\\frac{3}{4}\\left((2+\\sqrt{3})^{2 n}+(2-\\sqrt{3})^{2 n}-2(2+\\sqrt{3})^{n}(2-\\sqrt{3})^{n}\\right) \\\\\n& =\\left(\\frac{\\sqrt{3}}{2}\\left((2+\\sqrt{3})^{n}-(2-\\sqrt{3})^{n}\\right)\\right)^{2}\n\\end{aligned}\n$$\n\nWe are left to show that the quantity obtained in the above equation is an integer. But we see that if we define\n\n$$\na_{n}=\\frac{\\sqrt{3}}{2}\\left((2+\\sqrt{3})^{n}-(2-\\sqrt{3})^{n}\\right), \\quad \\forall n \\in \\mathbb{N}\n$$\n\nthe sequence $\\left\\langle a_{k}\\right\\rangle_{k=1}^{\\infty}$ thus obtained is exactly the solution for the recursion given by\n\n$$\na_{n+2}=4 a_{n+1}-a_{n}, \\quad \\forall n \\in \\mathbb{N}, \\quad a_{1}=3, a_{2}=12\n$$\n\nHence, clearly, each $a_{n}$ is obviously an integer, thus completing the proof. $\\qquad$", "metadata": {"resource_path": "INMO/segmented/en-sol-inmo_17.jsonl", "problem_match": "\n6.", "solution_match": "\nSolution 2:"}}