Determine the maximum value attained by \[\dfrac{x^4-x^2}{x^6+2x^3-1}\] over real numbers $x>1.$

Points $X$ and $Y$ inside the rhombus $ABCD$ are such that $Y$ is inside the convex quadrilateral $BXDC$ and $2\angle XBY = 2\angle XDY = \angle ABC$. Prove that the lines $AX$ and $CY$ are parallel. [i]S. Berlov[/i]

Let $ABC$ be a triangle. The incircle of triangle $ABC$ touches the side $BC$ at $A^{\prime}$, and the line $AA^{\prime}$ meets the incircle again at a point $P$. Let the lines $CP$ and $BP$ meet the incircle of triangle $ABC$ again at $N$ and $M$, respectively. Prove that the lines $AA^{\prime}$, $BN$ and $CM$ are concurrent.

Find all real numbers $k$ such that $r^4+kr^3+r^2+4kr+16=0$ is true for exactly one real number $r$.

Let $ A_1A_2$ be the external tangent line to the nonintersecting cirlces $ \omega_1(O_1)$ and $ \omega_2(O_2)$,$ A_1\in\omega_1$,$ A_2\in\omega_2$.Points $ K$ is the midpoint of $ A_1A_2$.And $ KB_1$ and $ KB_2$ are tangent lines to $ \omega_1$ and $ \omega_2$,respectvely($ B_1\neq A_1$,$ B_2\neq A_2$).Lines $ A_1B_1$ and $ A_2B_2$ meet in point $ L$,and lines $ KL$ and $ O_1O_2$ meet in point $ P$. Prove that points $ B_1,B_2,P$ and $ L$ are concyclic.

Compute the minimum possible value of $(x-1)^2+(x-2)^2+(x-3)^2+(x-4)^2+(x-5)^2$ For real values $x$

In a chess tournament $ 2n\plus{}3$ players take part. Every two play exactly one match. The schedule is such that no two matches are played at the same time, and each player, after taking part in a match, is free in at least $ n$ next (consecutive) matches. Prove that one of the players who play in the opening match will also play in the closing match.

Let $\omega_P$ and $\omega_Q$ be two circles of radius $1$, intersecting in points $A$ and $B$. Let $P$ and $Q$ be two regular $n$-gons (for some positive integer $n\ge4$) inscribed in $\omega_P$ and $\omega_Q$, respectively, such that $A$ and $B$ are vertices of both $P$ and $Q$. Suppose a third circle $\omega$ of radius $1$ intersects $P$ at two of its vertices $C$, $D$ and intersects $Q$ at two of its vertices $E$, $F$. Further assume that $A$, $B$, $C$, $D$, $E$, $F$ are all distinct points, that $A$ lies outside of $\omega$, and that $B$ lies inside $\omega$. Show that there exists a regular $2n$-gon that contains $C$, $D$, $E$, $F$ as four of its vertices.

Suppose that each of the diagonals $AD,BE,CF$ divides the hexagon $ABCDEF$ into two parts of the same area and perimeter. Does the hexagon necessarily have a center of symmetry?

Players Aino and Eino take turns choosing numbers from the set $\{0,..., n\}$ with $n\in \Bbb{N}$ being fixed in advance. The game ends when the numbers picked by one of the players include an arithmetic progression of length $4.$ The one who obtains the progression wins. Prove that for some $n,$ the starter of the game wins. Find the smallest such $n.$

Let $ABC$ be an equilateral triangle. $D$ and $E$ are midpoints of $[AB]$ and $[AC]$. The ray $[DE$ cuts the circumcircle of $\triangle ABC$ at $F$. What is $\frac {|DE|}{|DF|}$? $ \textbf{(A)}\ \frac 12 \qquad\textbf{(B)}\ \frac {\sqrt 3}3 \qquad\textbf{(C)}\ \frac 23(\sqrt 3 - 1) \qquad\textbf{(D)}\ \frac 23 \qquad\textbf{(E)}\ \frac {\sqrt 5 - 1}2 $

Let be given a triangle $ ABC$ and its internal angle bisector $ BD$ $ (D\in BC)$. The line $ BD$ intersects the circumcircle $ \Omega$ of triangle $ ABC$ at $ B$ and $ E$. Circle $ \omega$ with diameter $ DE$ cuts $ \Omega$ again at $ F$. Prove that $ BF$ is the symmedian line of triangle $ ABC$.

Let $x_1, x_2 \ldots , x_5$ be real numbers. Find the least positive integer $n$ with the following property: if some $n$ distinct sums of the form $x_p+x_q+x_r$ (with $1\le p<q<r\le 5$) are equal to $0$, then $x_1=x_2=\cdots=x_5=0$.

Given a right triangle $ABC$ with the hypotenuse $AB$. Let $K$ be any interior point of triangle $ABC$ and points $L, M$ are symmetric of point $K$ wrt lines $BC, AC$ respectively. Specify all possible values for $S_{ABLM} / S_{ABC}$, where $S_{XY ... Z}$ indicates the area of the polygon $XY...Z$ .

Diagonals of a cyclic quadrilateral $ABCD$ intersect at point $K.$ The midpoints of diagonals $AC$ and $BD$ are $M$ and $N,$ respectively. The circumscribed circles $ADM$ and $BCM$ intersect at points $M$ and $L.$ Prove that the points $K ,L ,M,$ and $ N$ lie on a circle. (all points are supposed to be different.)

The sphere $ \omega $ passes through the vertex $S$ of the pyramid $SABC$ and intersects with the edges $SA,SB,SC$ at $A_1,B_1,C_1$ other than $S$. The sphere $ \Omega $ is the circumsphere of the pyramid $SABC$ and intersects with $ \omega $ circumferential, lies on a plane which parallel to the plane $(ABC)$. Points $A_2,B_2,C_2$ are symmetry points of the points $A_1,B_1,C_1$ respect to midpoints of the edges $SA,SB,SC$ respectively. Prove that the points $A$, $B$, $C$, $A_2$, $B_2$, and $C_2$ lie on a sphere.

A circle $\omega$ through the incentre$ I$ of a triangle $ABC$ and tangent to $AB$ at $A$, intersects the segment $BC$ at $D$ and the extension of$ BC$ at $E$. Prove that the line $IC$ intersects $\omega$ at a point $M$ such that $MD=ME$.

Bob has invented the Very Normal Coin (VNC). When the VNC is flipped, it shows heads $\textstyle\frac{1}{2}$ of the time and tails $\textstyle\frac{1}{2}$ of the time - unless it has yielded the same result five times in a row, in which case it is guaranteed to yield the opposite result. For example, if Bob flips five heads in a row, then the next flip is guaranteed to be tails. Bob flips the VNC an infinite number of times. On the $n$th flip, Bob bets $2^{-n}$ dollars that the VNC will show heads (so if the second flip shows heads, Bob wins $\$0.25$, and if the third flip shows tails, Bob loses $\$0.125$). Assume that dollars are infinitely divisible. Given that the first flip is heads, the expected number of dollars Bob is expected to win can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a, b$. Compute $100a + b$. [i]Proposed by Lewis Chen[/i]

There are exactly $N$ distinct rational numbers $k$ such that $|k|<200$ and \[5x^2+kx+12=0\] has at least one integer solution for $x$. What is $N$? $\textbf{(A) }6\qquad \textbf{(B) }12\qquad \textbf{(C) }24\qquad \textbf{(D) }48\qquad \textbf{(E) }78\qquad$

I have $8$ unit cubes of different colors, which I want to glue together into a $2\times 2\times 2$ cube. How many distinct $2\times 2\times 2$ cubes can I make? Rotations of the same cube are not considered distinct, but reflections are.

Let $\Gamma$ be a circle and $P$ be a point outside, $PA$ and $PB$ be tangents to $\Gamma$ , $A, B \in \Gamma$ . Point $K$ is an arbitrary point on the segment $AB$. The circumscirbed circle of $\vartriangle PKB$ intersects $\Gamma$ for the second time at point $T$, point $P'$ is symmetric to point $P$ wrt point $A$. Prove that $\angle PBT = \angle P'KA$.

In Determinant Tic-Tac-Toe, Player $1$ enters a $1$ in an empty $3 \times 3$ matrix. Player $0$ counters with a $0$ in a vacant position and play continues in turn intil the $ 3 \times 3 $ matrix is completed with five $1$’s and four $0$’s. Player $0$ wins if the determinant is $0$ and player $1$ wins otherwise. Assuming both players pursue optimal strategies, who will win and how?

A fudgeflake is a planar fractal figure with a $120^{\circ}$ rotational symmetry such that three identical fudgeflakes in the same orientation fit together without gaps to form a larger fudgeflake with its orientation $30^{\circ}$ clockwise of the smaller fudgeflakes' orientation, as shown below. If the distance between the centers of the original three fudgeflakes is $1$, what is the area of one of those three fudgeflakes? Justify your answer. [asy] defaultpen(linewidth(.7)); string s = "00d08c8520612022202288272220065886,00e0708768822888788866683,01006c8765,01206b88227606,01208c858768588616678868160027,017068870228728868822872272220600278886,0190988886872272882228166060,02209486868506,02304b282022852282022828888828228166060066002000668666,02304d8882858688886166702,023050,0230637222282272220786,0240918681,02505f,0260908527222027285886852728522820766,02905b81,03904422888888766686882288888607,03908c58588685876668688228882078688228822220258587685886166702,049053852282000027888666,0490fa852061112222282282000702202220065868,04a0ae868822888888866602768688228888860728228822820228586888766702,04a0de2821666868822888500602,04b0ac5812022882227200070,04c04a8220228822272012882876882288227606,04c0da288282220228886882288227600660020060668,04c0f2,04e0fa88868588616668688228882078688228822220786,05e0ba878605,05e0d287688872006,05e102786720,05f0b88220228822816606066860,06002786882288886888666868886166600668666868887,0600748207,0600ce88616,0600ff86816,0610258222282220228887882288228202285868886668688228858688228822827066,062023223,0620cd88227600,0620fe8527222027686,064074555555555555555555555555555555555552882288888876668688866606060276866686882288878886668668522888868527282822816660222228588688861668678886166600668666868886660602782228,0650c985877,0680b0865282888882822202288878886668678282858768522882822200602788860660606,06a0fa88886070220,06c0b48830,0700fe8527222206702,0790fb867888666868822888788228722722720128288768886668688866600668666027686882288886888606786882288888607,0870b9822202288222022888886058,0880428582288868886668688228828768822882282166606060602,088070816,08903e7870,08a06c877,08b02a82858868886067222006,08b03b867202285272220786,08c06b8528220676,09003572,0900745555555555555555555555555555555555555555555555555555555555555555555555555558207,0920668858888285272220786,09606c,09812e88228166,09a128868827,09b12682202288222766060061,09c0648867,09c094868672020228160,09d04b86787228828868886668688866616006686605820228,09d0e38207,09e0908282822202288888828282220228886888681666868522888888285228202282886685886066886888606606666678868160027,09f0478765,0a10468822220276866606,0a411e828886882288227606060602,0a90428888681288227600,0aa046,0aa091,0b111f8282886788766866852288586882288228216660606,0b2122,0b30438861,0b5042858868886668688228882078688228822760600660,0b805f28868686868686850633,0be09d,0c3127868681020222022882276066660,0c40de86788228728868886668688866606066860678688228886888681666868527285886872272882228166602,0c504b88688810600220222027686,0c60da86816,0c70a8,0c80d98527222027686,0c90b08886888666868822888886058228822820228287688868166768886816606006786667021,0cb046827222025888685272850,0cc11f8702288888605822882281660602,0d00d588886070220,0d60d98527222070070,0d811a86868850607,0d90b8786783,0da0268768822882876888666868886661600668666868886816611,0da107272858868886166786888616660066870202,0db0b586816,0dc02527201288227600,0dd0b48527222027686,0e301e8861,0e501d88888605822882222027686,0e50b0888860702,0eb0b48527222206702,0f401d88868886166702,0f40b1867888666868822888788228822202786,0f50298822882888860652288227600,0fc02d,1010b98765,10206f82222282220228888882828222006588606600660020066660660066868,10207288228888685866686888681636160706768166686882288878886706786882288868822885228166,10303e28216668688228887685886166702,1030b8220258527227,10502b87,10503a288282220065886066006,10602958882078688866683,10904e8527285886882288227600,10a0b127282887685272858122816,1160ad86885,11706327683,1170ab8216,11904f877,11905f87022872812220605886,119097882886888666868886661600658,11b04e858868886166783"; string[] k = split(s,","); for(string str:k) { string a = substr(str,0,3),b=substr(str,3,3),c=substr(str,6); real x=hex(a),y=hex(b); for (int i=0;i<length(c);++i) { int next = hex(substr(c,i,1)); real yI=(int)((next-next%3)/3),xI=next%3; --xI; --yI; draw((x,-y)--(x+xI,-(y+yI))); x+=xI; y+=yI; } }[/asy]

In how many ways a cube can be painted using seven different colors in such a way that no two faces are in same color? $ \textbf{(A)}\ 154 \qquad\textbf{(B)}\ 203 \qquad\textbf{(C)}\ 210 \qquad\textbf{(D)}\ 240 \qquad\textbf{(E)}\ \text{None of the above} $

A regular hexagon with sides of length $6$ has an isosceles triangle attached to each side. Each of these triangles has two sides of length $8$. The isosceles triangles are folded to make a pyramid with the hexagon as the base of the pyramid. What is the volume of the pyramid? $\textbf{(A) }18\qquad\textbf{(B) }162\qquad\textbf{(C) }36\sqrt{21}\qquad\textbf{(D) }18\sqrt{138}\qquad\textbf{(E) }54\sqrt{21}$