An isosceles trapezoid $ABCD$ with bases $AB$ and $CD$ has $AB=13$, $CD=17$, and height $3$. Let $E$ be the intersection of $AC$ and $BD$. Circles $\Omega$ and $\omega$ are circumscribed about triangles $ABE$ and $CDE$. Compute the sum of the radii of $\Omega$ and $\omega$.

Let $p(x)=x^n+a_{n-1}x^{n-1}+\cdots+a_1x+a_0$ be a monic polynomial of degree $n>2$, with real coefficients and all its roots real and different from zero. Prove that for all $k=0,1,2,\cdots,n-2$, at least one of the coefficients $a_k,a_{k+1}$ is different from zero.

Let $ x$ be an integer and $ y,z,w$ be odd positive integers. Prove that $ 17$ divides $ x^{y^{z^w}}\minus{}x^{y^z}$.

The side $AB$ of $\Delta ABC$ touches the corresponding excircle at point $T$. Let $J$ be the center of the excircle inscribed into $\angle A$, and $M$ be the midpoint of $AJ$. Prove that $MT = MC$.

Let $ABCD$ be a rectangle whose vertices are labeled in counterclockwise order with $AB=32$ and $AD=60.$ Rectangle $A'B'C'D'$ is constructed by rotating $ABCD$ counterclockwise about $A$ by $60^\circ.$ Given that lines $BB'$ and $DD'$ intersect at point $X,$ compute $CX.$

A $3 \times 3$ square is filled with numbers: $a, b, c, d, e, f, g, h, i$ in the following way: [img]https://cdn.artofproblemsolving.com/attachments/8/9/737c41e9d0dbfdc81be1b986b8e680290db55e.png[/img] Given that the square is magic (sums of the numbers in each row, column and each of two diagonals are the same), show that a) $2(a + c + g + i) = b + d + f + h + 4e$. (3) b) $2(a^3 + c^3 + g^3 + i^3) = b^3 + d^3 + f^3 + h^3 + 4e^3$. (3)

Let $f(x)$ be a continuous function, where $f(0)\neq0$. Find $\lim_{x \to 0} \frac{2\int_{0}^{x}(x-t)f(t)dt}{x\int_{0}^{x}f(x-t)dt}$.

1. The transformation $ n \to 2n \minus{} 1$ or $ n \to 3n \minus{} 1$, where $ n$ is a positive integer, is called the 'change' of $ n$. Numbers $ a$ and $ b$ are called 'similar', if there exists such positive integer, that can be got by finite number of 'changes' from both $ a$ and $ b$. Find all positive integers 'similar' to $ 2005$ and less than $ 2005$.

Let $\Gamma$ be a circle with center $O$. Consider the points $A$, $B$, $C$, $D$, $E$ and $F$ in $\Gamma$, with $D$ and $E$ in the (minor) arc $BC$ and $C$ in the (minor) arc $EF$, such that $DEFO$ is a rhombus and $\vartriangle ABC$ It is equilateral. Show that $\overleftrightarrow{BD}$ and $\overleftrightarrow{CE}$ are perpendicular.

Given triangle $ ABC$ with sidelengths $ a,b,c$. Tangents to incircle of $ ABC$ that parallel with triangle's sides form three small triangle (each small triangle has 1 vertex of $ ABC$). Prove that the sum of area of incircles of these three small triangles and the area of incircle of triangle $ ABC$ is equal to $ \frac{\pi (a^{2}\plus{}b^{2}\plus{}c^{2})(b\plus{}c\minus{}a)(c\plus{}a\minus{}b)(a\plus{}b\minus{}c)}{(a\plus{}b\plus{}c)^{3}}$ (hmm,, looks familiar, isn't it? :wink: )

Determine the natural numbers $m,n$ such as $85^m-n^4=4$

If you increase a number $X$ by $20\%,$ you get $Y.$ By what percent must you decrease $Y$ to get $X?$

Let $ a,b,c,d $ be four non-negative reals such that $ a+b+c+d = 4 $. Prove that $$ a\sqrt{3a+b+c}+b\sqrt{3b+c+d}+c\sqrt{3c+d+a}+d\sqrt{3d+a+b} \ge 4\sqrt{5} $$

For odd integers $n,$ two people play the game on $2\times n$ grid. Each people color one cell that is not colored before with white and black. When coloring is done, they count the number of ordered pairs of neighboring cells that have the same color and different color, respectively. If same color neighboring ordered pair of cells are more than different color neighboring ordered pair of cells, the person who first starts win and lose otherwise. (If the number is same, they are tied.) If both of them use the best strategy, find the result of the game.

Given an isosceles triangle $ABC$ with base $AB$, cirumcenter $O$, incenter $S$ and $\angle C<60^\circ$. The circumcircle of $AOS$ intersects $AC$ at $D$. Prove that $SD\parallel BC$ and $AS\perp OD$.

Equilateral triangle $\triangle ABC$ is inscribed in circle $\omega$ with radius $18.$ Circle $\omega_A$ is tangent to sides $\overline{AB}$ and $\overline{AC}$ and is internally tangent to $\omega$. Circles $\omega_B$ and $\omega_C$ are defined analogously. Circles $\omega_A$, $\omega_B$, and $\omega_C$ meet in six points$-$two points for each pair of circles. The three intersection points closest to the vertices of $\triangle ABC$ are the vertices of a large equilateral triangle in the interior of $\triangle ABC$, and the other three intersection points are the vertices of a smaller equilateral triangle in the interior of $\triangle ABC$. The side length of the smaller equilateral triangle can be written as $\sqrt{a}-\sqrt{b}$, where $a$ and $b$ are positive integers. Find $a+b$.

Prove that for all positive integers $n$, there exists a positive integer $m$ which is a multiple of $n$ and the sum of the digits of $m$ is equal to $n$.

Find the minimum value of the expression $f(a, b, c) = (a + b)^4 + (b + c)^4 + (c + a)^4 - \frac47 (a^4 + b^4 + c^4)$, as $a, b, c$ varies over the set of all real numbers

Suppose $x$ and $y$ are real numbers which satisfy the system of equations \[x^2-3y^2=\frac{17}x\qquad\text{and}\qquad 3x^2-y^2=\frac{23}y.\] Then $x^2+y^2$ can be written in the form $\sqrt[m]{n}$, where $m$ and $n$ are positive integers and $m$ is as small as possible. Find $m+n$.

Consider a chessboard $6 \times 6$, made up of $36$ single squares. We want to place $6$ chess rooks on this board, one rook on each square, so that there are no two rooks on the same row, nor two rooks on the same column. Note that, once the rooks have been placed in this way, we have that, for every square where a rook has not been placed, there is a rook in the same row as it and a rook in the same column as it. We will say that such rooks are in line with this square. For each of those $30$ houses without rooks, color it green if the two rooks aligned with that same house are the same distance from it, and color it yellow otherwise. For example, when we place the $6$ rooks ($T$) as below, we have: (a) Is it possible to place the rooks so that there are $30$ green squares? (b) Is it possible to place the rooks so that there are $30$ yellow squares? (c) Is it possible to place the rooks so that there are $15$ green and $15$ yellow squares?

Given the functions $f(x)=xe^{x}+2x\int_0^2 |g(t)|dt-1,\ g(x)=x^2-x\int_0^1 f(t)dt$, evaluate $\int_0^2 |g(t)|dt.$

A circle of radius 2 is centered at $ O$. Square $ OABC$ has side length 1. Sides $ \overline{AB}$ and $ \overline{CB}$ are extended past $ b$ to meet the circle at $ D$ and $ E$, respectively. What is the area of the shaded region in the figure, which is bounded by $ \overline{BD}$, $ \overline{BE}$, and the minor arc connecting $ D$ and $ E$? [asy] defaultpen(linewidth(0.8)); pair O=origin, A=(1,0), C=(0,1), B=(1,1), D=(1, sqrt(3)), E=(sqrt(3), 1), point=B; fill(Arc(O, 2, 0, 90)--O--cycle, mediumgray); clip(B--Arc(O, 2, 30, 60)--cycle); draw(Circle(origin, 2)); draw((-2,0)--(2,0)^^(0,-2)--(0,2)); draw(A--D^^C--E); label("$A$", A, dir(point--A)); label("$C$", C, dir(point--C)); label("$O$", O, dir(point--O)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$B$", B, SW);[/asy] $ \textbf{(A) } \frac {\pi}3 \plus{} 1 \minus{} \sqrt {3} \qquad \textbf{(B) } \frac {\pi}2\left( 2 \minus{} \sqrt {3}\right) \qquad \textbf{(C) } \pi\left(2 \minus{} \sqrt {3}\right) \qquad \textbf{(D) } \frac {\pi}{6} \plus{} \frac {\sqrt {3} \minus{} 1}{2} \\ \qquad \indent \textbf{(E) } \frac {\pi}{3} \minus{} 1 \plus{} \sqrt {3}$

Elbert and Yaiza each draw $10$ cards from a $20$-card deck with cards numbered $1,2,3,\dots,20$. Then, starting with the player with the card numbered $1$, the players take turns placing down the lowest-numbered card from their hand that is greater than every card previously placed. When a player cannot place a card, they lose and the game ends. Given that Yaiza lost and $5$ cards were placed in total, compute the number of ways the cards could have been initially distributed. (The order of cards in a player’s hand does not matter.)

Given $x \ge 0$, prove that $$\frac{(x^2 + 1)^6}{2^7}+\frac12 \ge x^5 - x^3 + x$$

Daredevil Darren challenges Forgetful Fred to spell "Johns Hopkins." Forgetful Fred will spell it correctly except for the 's's; there is a $\frac{1}{3}$ and $\frac{1}{4}$ chance that he will omit the 's' in the first and last names, respectively, with his mistakes being independent of each other. If Forgetful Fred spells the name correctly, then he is happy; otherwise, Daredevil Darren will present him with a dare, and there is a $\frac{9}{10}$ chance that Forgetful Fred will not be happy. Find the probability that Forgetful Fred will be happy.