In $ \triangle ABC $, $ AB = 3 $, $ BC = 4 $, and $ CA = 5 $. Circle $\omega$ intersects $\overline{AB}$ at $E$ and $B$, $\overline{BC}$ at $B$ and $D$, and $\overline{AC}$ at $F$ and $G$. Given that $EF=DF$ and $\tfrac{DG}{EG} = \tfrac{3}{4}$, length $DE=\tfrac{a\sqrt{b}}{c}$, where $a$ and $c$ are relatively prime positive integers, and $b$ is a positive integer not divisible by the square of any prime. Find $a+b+c$.

Let $z_1,z_2,z_3,\dots,z_{12}$ be the 12 zeroes of the polynomial $z^{12}-2^{36}$. For each $j$, let $w_j$ be one of $z_j$ or $i z_j$. Then the maximum possible value of the real part of $\displaystyle\sum_{j=1}^{12} w_j$ can be written as $m+\sqrt{n}$ where $m$ and $n$ are positive integers. Find $m+n$.

Prove that among arbitrary $13$ points in plane with coordinates as integers, such that no three are collinear, we can pick three points as vertices of triangle such that its centroid has coordinates as integers.

Consider triangle $ABC$ in $xy$-plane where $ A$ is at the origin, $ B$ lies on the positive $x$-axis, $C$ is on the upper right quadrant, and $\angle A = 30^o$, $\angle B = 60^o$ ,$\angle C = 90^o$. Let the length $BC = 1$. Draw the angle bisector of angle $\angle C$, and let this intersect the $y$-axis at $D$. What is the area of quadrilateral $ADBC$?

The equations of $L_1$ and $L_2$ are $y=mx$ and $y=nx$, respectively. Suppose $L_1$ makes twice as large of an angle with the horizontal (measured counterclockwise from the positive x-axis ) as does $L_2$, and that $L_1$ has 4 times the slope of $L_2$. If $L_1$ is not horizontal, then $mn$ is $\text{(A)} \ \frac{\sqrt{2}}{2} \qquad \text{(B)} \ -\frac{\sqrt{2}}{2} \qquad \text{(C)} \ 2 \qquad \text{(D)} \ -2 \qquad \text{(E)} \ \text{not uniquely determined}$

Observe the set $S =\{(x, y) \in Z^2 : |x| \le 5$ and $-10 \le y\le 0\}$. Find the number of points $P$ in $S$ such that there exists a tangent line from $P$ to the parabola $y = x^2 + 1$ that can be written in the form $y = mx + b$, where $m$ and $b$ are integers.

In $ \triangle ABC$ points $ D$ and $ E$ lie on $ \overline{BC}$ and $ \overline{AC}$, respectively. If $ \overline{AD}$ and $ \overline{BE}$ intersect at $ T$ so that $ AT/DT \equal{} 3$ and $ BT/ET \equal{} 4$, what is $ CD/BD$? [asy]unitsize(2cm); defaultpen(linewidth(.8pt)); pair A = (0,0); pair C = (2,0); pair B = dir(57.5)*2; pair E = waypoint(C--A,0.25); pair D = waypoint(C--B,0.25); pair T = intersectionpoint(D--A,E--B); label("$B$",B,NW);label("$A$",A,SW);label("$C$",C,SE);label("$D$",D,NE);label("$E$",E,S);label("$T$",T,2*W+N); draw(A--B--C--cycle); draw(A--D); draw(B--E);[/asy]$ \textbf{(A)}\ \frac {1}{8}\qquad \textbf{(B)}\ \frac {2}{9}\qquad \textbf{(C)}\ \frac {3}{10}\qquad \textbf{(D)}\ \frac {4}{11}\qquad \textbf{(E)}\ \frac {5}{12}$

A wishing well is located at the point $(11,11)$ in the $xy$-plane. Rachelle randomly selects an integer $y$ from the set $\left\{ 0, 1, \dots, 10 \right\}$. Then she randomly selects, with replacement, two integers $a,b$ from the set $\left\{ 1,2,\dots,10 \right\}$. The probability the line through $(0,y)$ and $(a,b)$ passes through the well can be expressed as $\frac mn$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$. [i]Proposed by Evan Chen[/i]

In the figure below, $\triangle ABC$ is an equilateral triangle. [asy] import graph; unitsize(60); axes("$x$", "$y$", (0, 0), (1.5, 1.5), EndArrow); real w = sqrt(3) - 1; pair A = (1, 1); pair B = (0, w); pair C = (w, 0); draw(A -- B -- C -- cycle); dot(Label("$A(1, 1)$", A, NE), A); dot(Label("$B$", B, W), B); dot(Label("$C$", C, S), C); [/asy] Point $A$ has coordinates $(1, 1)$, point $B$ is on the positive $y$-axis, and point $C$ is on the positive $x$-axis. What is the area of $\triangle ABC$?

For each positive integer $k$ greater than $1$, find the largest real number $t$ such that the following hold: Given $n$ distinct points $a^{(1)}=(a^{(1)}_1,\ldots, a^{(1)}_k)$, $\ldots$, $a^{(n)}=(a^{(n)}_1,\ldots, a^{(n)}_k)$ in $\mathbb{R}^k$, we define the score of the tuple $a^{(i)}$ as \[\prod_{j=1}^{k}\#\{1\leq i'\leq n\textup{ such that }\pi_j(a^{(i')})=\pi_j(a^{(i)})\}\] where $\#S$ is the number of elements in set $S$, and $\pi_j$ is the projection $\mathbb{R}^k\to \mathbb{R}^{k-1}$ omitting the $j$-th coordinate. Then the $t$-th power mean of the scores of all $a^{(i)}$'s is at most $n$. Note: The $t$-th power mean of positive real numbers $x_1,\ldots,x_n$ is defined as \[\left(\frac{x_1^t+\cdots+x_n^t}{n}\right)^{1/t}\] when $t\neq 0$, and it is $\sqrt[n]{x_1\cdots x_n}$ when $t=0$. [i]Proposed by Cheng-Ying Chang and usjl[/i]

Let $ a\geq 2$ be a real number; with the roots $ x_{1}$ and $ x_{2}$ of the equation $ x^2\minus{}ax\plus{}1\equal{}0$ we build the sequence with $ S_{n}\equal{}x_{1}^n \plus{} x_{2}^n$. [b]a)[/b]Prove that the sequence $ \frac{S_{n}}{S_{n\plus{}1}}$, where $ n$ takes value from $ 1$ up to infinity, is strictly non increasing. [b]b)[/b]Find all value of $ a$ for the which this inequality hold for all natural values of $ n$ $ \frac{S_{1}}{S_{2}}\plus{}\cdots \plus{}\frac{S_{n}}{S_{n\plus{}1}}>n\minus{}1$

$AB$ is a diameter of a circle with center $O$. Let $C$ and $D$ be two different points on the circle on the same side of $AB$, and the lines tangent to the circle at points $C$ and $D$ meet at $E$. Segments $AD$ and $BC$ meet at $F$. Lines $EF$ and $AB$ meet at $M$. Prove that $E,C,M$ and $D$ are concyclic.

We divide the plane in squares shaped of side 1, tracing straight lines parallel bars to the coordinate axles. Each square is painted of black white or. To each as, we recolor all simultaneously squares, in accordance with the following rule: each square $Q$ adopts the color that more appears in the configuration of five squares indicated in the figure. The recoloration process is repeated indefinitely. Determine if exists an initial coloration with black a finite amount of squares such that always has at least one black square, not mattering how many seconds if had passed since the beginning of the process.

If $ A$ and $ B$ are fixed points on a given circle and $ XY$ is a variable diameter of the same circle, determine the locus of the point of intersection of lines $ AX$ and $ BY$. You may assume that $ AB$ is not a diameter.

The graph relates the distance traveled [in miles] to the time elapsed [in hours] on a trip taken by an experimental airplane. During which hour was the average speed of this airplane the largest? [asy] unitsize(12); for(int a=1; a<13; ++a) { draw((2a,-1)--(2a,1)); } draw((-1,4)--(1,4)); draw((-1,8)--(1,8)); draw((-1,12)--(1,12)); draw((-1,16)--(1,16)); draw((0,0)--(0,17)); draw((-5,0)--(33,0)); label("$0$",(0,-1),S); label("$1$",(2,-1),S); label("$2$",(4,-1),S); label("$3$",(6,-1),S); label("$4$",(8,-1),S); label("$5$",(10,-1),S); label("$6$",(12,-1),S); label("$7$",(14,-1),S); label("$8$",(16,-1),S); label("$9$",(18,-1),S); label("$10$",(20,-1),S); label("$11$",(22,-1),S); label("$12$",(24,-1),S); label("Time in hours",(11,-2),S); label("$500$",(-1,4),W); label("$1000$",(-1,8),W); label("$1500$",(-1,12),W); label("$2000$",(-1,16),W); label(rotate(90)*"Distance traveled in miles",(-4,10),W); draw((0,0)--(2,3)--(4,7.2)--(6,8.5)); draw((6,8.5)--(16,12.5)--(18,14)--(24,15));[/asy] $ \text{(A)}\ \text{first (0-1)}\qquad\text{(B)}\ \text{second (1-2)}\qquad\text{(C)}\ \text{third (2-3)}\qquad\text{(D)}\ \text{ninth (8-9)}\qquad\text{(E)}\ \text{last (11-12)} $

$C_0:x^2+y^2=1,C_1:\frac{x^2}{a^2}+\frac{y^2}{b^2}(a>b>0)$. Find all $(a,b)$ such that for any point $P$ on $C_1$, we can find a parallelogram with an apex $P$, and it is externally tangent to $C_0$, inscribed to $C_1$.

In the coordinate plane a rectangle with vertices $ (0, 0),$ $ (m, 0),$ $ (0, n),$ $ (m, n)$ is given where both $ m$ and $ n$ are odd integers. The rectangle is partitioned into triangles in such a way that [i](i)[/i] each triangle in the partition has at least one side (to be called a “good” side) that lies on a line of the form $ x \equal{} j$ or $ y \equal{} k,$ where $ j$ and $ k$ are integers, and the altitude on this side has length 1; [i](ii)[/i] each “bad” side (i.e., a side of any triangle in the partition that is not a “good” one) is a common side of two triangles in the partition. Prove that there exist at least two triangles in the partition each of which has two good sides.

The four points $A(-1,2), B(3,-4), C(5,-6),$ and $D(-2,8)$ lie in the coordinate plane. Compute the minimum possible value of $PA + PB + PC + PD$ over all points P .

Starting at $(0,0),$ an object moves in the coordinate plane via a sequence of steps, each of length one. Each step is left, right, up, or down, all four equally likely. Let $p$ be the probability that the object reaches $(2,2)$ in six or fewer steps. Given that $p$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

A point $ P$ of integer coordinates in the Cartesian plane is said [i]visible[/i] if the segment $ OP$ does not contain any other points with integer coordinates (except its ends). Prove that for any $ n\in\mathbb{N}^*$ there exists a visible point $ P_{n}$, at distance larger than $ n$ from any other visible point. [b]Dan Schwarz[/b]

A penny is placed in the coordinate plane $\left(0,0\right)$. The penny can be moved $1$ unit to the right, $1$ unit up, or diagonally $1$ unit to the right and $1$ unit up. How many different ways are there for the penny to get to the point $\left(5,5\right)$? $\text{(A) }8\qquad\text{(B) }25\qquad\text{(C) }99\qquad\text{(D) }260\qquad\text{(E) }351$

The Ultimate Question is a 10-part problem in which each question after the first depends on the answer to the previous problem. As in the Short Answer section, the answer to each (of the 10) problems is a nonnegative integer. You should submit an answer for each of the 10 problems you solve (unlike in previous years). In order to receive credit for the correct answer to a problem, you must also correctly answer $\textit{every one}$ $\textit{of the previous parts}$ $\textit{of the Ultimate Question}$.

[asy] real t=pi/12;real u=8*t; real cu=cos(u);real su=sin(u); draw(unitcircle); draw((cos(-t),sin(-t))--(cos(13*t),sin(13*t))); draw((cu,su)--(cu,-su)); label("A",(cos(13*t),sin(13*t)),W); label("B",(cos(-t),sin(-t)),E); label("C",(cu,su),N); label("D",(cu,-su),S); label("E",(cu,sin(-t)),NE); label("2",((cu-1)/2,sin(-t)),N); label("6",((cu+1)/2,sin(-t)),N); label("3",(cu,(sin(-t)-su)/2),E); //Credit to Zimbalono for the diagram[/asy] Chords $AB$ and $CD$ in the circle above intersect at $E$ and are perpendicular to each other. If segments $AE$, $EB$, and $ED$ have measures $2$, $3$, and $6$ respectively, then the length of the diameter of the circle is $\textbf{(A) }4\sqrt{5}\qquad\textbf{(B) }\sqrt{65}\qquad\textbf{(C) }2\sqrt{17}\qquad\textbf{(D) }3\sqrt{7}\qquad \textbf{(E) }6\sqrt{2}$

The silicon-oxygen bonds in $\ce{SiO2}$ are best described as ${ \textbf{(A)}\ \text{coordinate covalent}\qquad\textbf{(B)}\ \text{ionic}\qquad\textbf{(C)}\ \text{nonpolar covalent}\qquad\textbf{(D)}}\ \text{polar covalent}\qquad $

For any two points $A (x_1 , y_1)$ and $B (x_2, y_2)$, the distance $r (A, B)$ between them is determined by the equality $r(A, B) = max\{| x_1- x_2 | , | y_1 - y_2 |\}$. Prove that the triangle inequality $r(A, C) + r(C, B) \ge r(A, B)$. holds for the distance introduced in this way . Let $A$ and $B$ be two points of the plane . Find the locus of points $C$ for which a) $r(A, C) + r(C, B) = r(A, B)$ b) $r(A, C) = r(C, B).$