A polynomial $P$ has integer coefficients and $P(3)=4$ and $P(4)=3$. For how many $x$ we might have $P(x)=x$?

Let $\vartriangle ABC$ have $AB = 15$, $AC = 20$, and $BC = 21$. Suppose $\omega$ is a circle passing through $A$ that is tangent to segment $BC$. Let point $D\ne A$ be the second intersection of AB with $\omega$, and let point $E \ne A$ be the second intersection of $AC$ with $\omega$. Suppose $DE$ is parallel to $BC$. If $DE = \frac{a}{b}$ , where $a$, $b$ are relatively prime positive integers, find $a + b$.

Let there be an acute triangle $ABC$ with orthocenter $H$. Let $BH, CH$ hit the circumcircle of $\triangle ABC$ at $D, E$. Let $P$ be a point on $AB$, between $B$ and the foot of the perpendicular from $C$ to $AB$. Let $PH \cap AC = Q$. Now $\triangle AEP$'s circumcircle hits $CH$ at $S$, $\triangle ADQ$'s circumcircle hits $BH$ at $R$, and $\triangle AEP$'s circumcircle hits $\triangle ADQ$'s circumcircle at $J (\not=A)$. Prove that $RS$ is the perpendicular bisector of $HJ$.

Within the real numbers, solve the equation $$x^5 + \lfloor x \rfloor = 20$$ where $\lfloor x \rfloor$ denotes the largest whole number less than or equal to $x$.

Let $ABCDEFGHIJKL$ be a regular dodecagon. Find $\frac{AB}{AF} + \frac{AF}{AB}$.

For $0<k<2$, consider two curves $C_1: y=\sin 2x\ (0\leq x\leq \pi),\ C_2: y=k\cos x\ (0\leqq x\leqq \pi).$ Denote by $S(k)$ the sum of the areas of four parts enclosed by $C_1,\ C_2$ and two lines $x=0,\ x=\pi$. Find the minimum value of $S(k).$ [i]2010 Nagoya Institute of Technology entrance exam[/i]

Let $u,v,w$ be positive real numbers. Prove that there exists a cyclic permutation $(x,y,z)$ of $(u,v,w)$ such that for all positive real numbers $a,b,c$ the following holds: \[ \frac{a}{x\,a + y\,b + z\,c} \;+\; \frac{b}{x\,b + y\,c + z\,a} \;+\; \frac{c}{x\,c + y\,a + z\,b} \;\ge\; \frac{3}{x + y + z}. \]

Point $K$ is marked on the diagonal $AC$ in rectangle $ABCD$ so that $CK = BC$. On the side $BC$, point $M$ is marked so that $KM = CM$. Prove that $AK + BM = CM$.

Let $\{a_n\}_{n=0}^{\infty}$ be a sequence of integers numbers. Let $\Delta^1a_n=a_{n+1}-a_n$ for a non-negative integer $n$. Define $\Delta^Ma_n= \Delta^{M-1}a_{n+1}- \Delta^{M-1}a_n$. A sequence is [i]patriota[/i] if there are positive integers $k,l$ such that $a_{n+k}=\Delta^Ma_{n+l}$ for all non-negative integers $n$. Determine, with proof, whether exists a sequence that the last value of $M$ for which the sequence is [i]patriota[/i] is $2022$.

Prove that there exist infinitely many positive integers $n$ such that the number $\frac{1^2+2^2+\cdots+n^2}{n}$ is a perfect square. Obviously, $1$ is the least integer having this property. Find the next two least integers having this property.

Given an acute triangle $ABC$ with altitudes $AD$ and $BE$ intersecting at $H$, $M$ is the midpoint of $AB$. A nine-point circle of $ABC$ intersects with a circumcircle of $ABH$ on $P$ and $Q$ where $P$ lays on the same side of $A$ (with respect to $CH$). Prove that $ED, PH, MQ$ are concurrent on circumcircle $ABC$

Let $A$ be an acute angle such that $\tan A = 2\cos A$. Find the number of positive integers $n$ less than or equal to $1000$ such that $\sec^n A + \tan^n A$ is a positive integer whose units digit is $9$.

Consider an $m\times n$ board where $m, n \ge 3$ are positive integers, divided into unit squares. Initially all the squares are white. What is the minimum number of squares that need to be painted red such that each $3\times 3$ square contains at least two red squares? Andrei Eckstein and Alexandru Mihalcu

Let ABC with orthocenter $H$ and circumcenter $O$ be an acute scalene triangle satisfying $AB = AM$ where $M$ is the midpoint of $BC$. Suppose $Q$ and $K$ are points on $(ABC)$ distinct from A satisfying $\angle AQH = 90$ and $\angle BAK = \angle CAM$. Let $N$ be the midpoint of $AH$. • Let $I$ be the intersection of $B\text{-midline}$ and $A\text{-altitude}$ Prove that $IN = IO$. • Prove that there is point $P$ on the symmedian lying on circle with center $B$ and radius $BM$ such that $(APN)$ is tangent to $AB$. [i]Proposed by Krutarth Shah[/i]

Let $v$ be a vertex of a cube $C$ with edges of length $4$. Let $S$ be the largest sphere that can be inscribed in $C$. Let $R$ be the region consisting of all points $p$ between $S$ and $C$ such that $p$ is closer to $v$ than to any other vertex of the cube. Find the volume of $R$.

A line $d$ is called [i]faithful[/i] to triangle $ABC$ if $d$ be in plane of triangle $ABC$ and the reflections of $d$ over the sides of $ABC$ be concurrent. Prove that for any two triangles with acute angles lying in the same plane, either there exists exactly one [i]faithful[/i] line to both of them, or there exist infinitely [i]faithful[/i] lines to them.

Let $x_1,x_2,\ldots,x_n $ be real numbers, where $n\ge 2$ is a given integer, and let $\lfloor{x_1}\rfloor,\lfloor{x_2}\rfloor,\ldots,\lfloor{x_n}\rfloor $ be a permutation of $1,2,\ldots,n$. Find the maximum and minimum of $\sum\limits_{i=1}^{n-1}\lfloor{x_{i+1}-x_i}\rfloor$ (here $\lfloor x\rfloor $ is the largest integer not greater than $x$).

For positive real numbers $a_1, a_2, ..., a_n$ with product 1 prove: $$\left(\frac{a_1}{a_2}\right)^{n-1}+\left(\frac{a_2}{a_3}\right)^{n-1}+...+\left(\frac{a_{n-1}}{a_n}\right)^{n-1}+\left(\frac{a_n}{a_1}\right)^{n-1} \geq a_1^{2}+a_2^{2}+...+a_n^{2}$$ Proposed by Andrei Eckstein

In a dance party initially there are $20$ girls and $22$ boys in the pool and infinitely many more girls and boys waiting outside. In each round, a participant is picked uniformly at random; if a girl is picked, then she invites a boy from the pool to dance and then both of them elave the party after the dance; while if a boy is picked, then he invites a girl and a boy from the waiting line and dance together. The three of them all stay after the dance. The party is over when there are only (two) boys left in the pool. (a) What is the probability that the party never ends? (b) Now the organizer of this party decides to reverse the rule, namely that if a girl is picked, then she invites a boy and a girl from the waiting line to dance and the three stay after the dance; while if a boy is picked, he invites a girl from the pool to dance and both leave after the dance. Still the party is over when there are only (two) boys left in the pool. What is the expected number of rounds until the party ends?

Consider a triangle $ABC$ with $\angle ACB = 2 \angle CAB $ and $\angle ABC> 90 ^ \circ$. Consider the perpendicular on $AC$ that passes through $A$ and intersects $BC$ at $D$, prove that $$\frac {1} {BC} - \frac {2} {DC} = \frac {1} {CA} $$

[b]a)[/b] Show that two real numbers $ x,y>1 $ chosen so that $ x^y=y^x, $ are equal or there exists a positive real number $ m\neq 1 $ such that $ x=m^{\frac{1}{m-1}} $ and $ y=m^{\frac{m}{m-1}} . $ [b]b)[/b] Solve in $ \left( 1,\infty \right)^2 $ the equation: $ x^y+x^{x^{y-1}}=y^x+y^{y^{x-1}} . $

Two circles $ G_1$ and $ G_2$ intersect at two points $ M$ and $ N$. Let $ AB$ be the line tangent to these circles at $ A$ and $ B$, respectively, so that $ M$ lies closer to $ AB$ than $ N$. Let $ CD$ be the line parallel to $ AB$ and passing through the point $ M$, with $ C$ on $ G_1$ and $ D$ on $ G_2$. Lines $ AC$ and $ BD$ meet at $ E$; lines $ AN$ and $ CD$ meet at $ P$; lines $ BN$ and $ CD$ meet at $ Q$. Show that $ EP \equal{} EQ$.

The World Cup, featuring $17$ teams from Europe and South America, as well as $15$ other teams that honestly don’t have a chance, is a soccer tournament that is held once every four years. As we speak, Croatia andMorocco are locked in a battle that has no significance whatsoever on the winner, but if you would like live score updates nonetheless, feel free to ask your proctor, who has no obligation whatsoever to provide them. [b]p1.[/b] During the group stage of theWorld Cup, groups of $4$ teams are formed. Every pair of teams in a group play each other once. Each team earns $3$ points for each win and $1$ point for each tie. Find the greatest possible sum of the points of each team in a group. [b]p2.[/b] In the semi-finals of theWorld Cup, the ref is bad and lets $11^2 = 121$ players per team go on the field at once. For a given team, one player is a goalie, and every other player is either a defender, midfielder, or forward. There is at least one player in each position. The product of the number of defenders, midfielders, and forwards is a mulitple of $121$. Find the number of ordered triples (number of defenders, number of midfielders, number of forwards) that satisfy these conditions. [b]p3.[/b] Messi is playing in a game during the Round of $16$. On rectangular soccer field $ABCD$ with $AB = 11$, $BC = 8$, points $E$ and $F$ are on segment $BC$ such that $BE = 3$, $EF = 2$, and $FC = 3$. If the distance betweenMessi and segment $EF$ is less than $6$, he can score a goal. The area of the region on the field whereMessi can score a goal is $a\pi +\sqrt{b} +c$, where $a$, $b$, and $c$ are integers. Find $10000a +100b +c$. [b]p4.[/b] The workers are building theWorld Cup stadium for the $2022$ World Cup in Qatar. It would take 1 worker working alone $4212$ days to build the stadium. Before construction started, there were 256 workers. However, each day after construction, $7$ workers disappear. Find the number of days it will take to finish building the stadium. [b]p5.[/b] In the penalty kick shootout, $2$ teams each get $5$ attempts to score. The teams alternate shots and the team that scores a greater number of times wins. At any point, if it’s impossible for one team to win, even before both teams have taken all $5$ shots, the shootout ends and nomore shots are taken. If each team does take all $5$ shots and afterwards the score is tied, the shootout enters sudden death, where teams alternate taking shots until one team has a higher score while both teams have taken the same number of shots. If each shot has a $\frac12$ chance of scoring, the expected number of times that any team scores can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $0<a\leq 1$ be a real number and let $a\leq a_{i}\leq\frac{1}{a_{i}}\forall i=\overline{1,1996}$ are real numbers. Prove that for any nonnegative real numbers $k_{i}(i=1,2,...,1996)$ such that $\sum_{i=1}^{1996}k_{i}=1$ we have $(\sum_{i=1}^{1996}k_{i}a_{i})(\sum_{i=1}^{1996}\frac{k_{i}}{a_{i}})\leq (a+\frac{1}{a})^{2}$.

An ant crawls along the grid lines of an infinite quadrille notebook. One grid point is marked red, this is its starting point. Every time the ant reaches a grid point, it continues forward with probability $\frac13$ , left with probability $\frac13$ , and right with probability $\frac13$. What is the chance that it is after its third turn, but not after its fourth turn that it returns to the red point? If the answer is $\frac{p}{q}$ , where $p$ and $q$ are coprime positive integers, then your answer should be $p + q$. [i]The steps of the ant are independent.[/i]