Let $AD$ be the diameter of the circumcircle of an acute triangle $ABC$. The lines through $D$ parallel to $AB$ and $AC$ meet lines $AC$ and $AB$ in points $E$ and $F$, respectively. Lines $EF$ and $BC$ meet at $G$. Prove that $AD$ and $DG$ are perpendicular.

Compute the number of ways to pick two rectangles in a $5 \times 5$ grid of squares such that the edges of the rectangles lie on the lines of the grid and the rectangles do not overlap at their interiors, edges, or vertices. The order in which the rectangles are chosen does not matter.

Find all $a, b$ such that $\sin x + \sin a\ge b \cos x$ for all $x$.

Define a [i]beautiful number[/i] to be an integer of the form $a^n$, where $a\in\{3,4,5,6\}$ and $n$ is a positive integer. Prove that each integer greater than $2$ can be expressed as the sum of pairwise distinct beautiful numbers. [i]Proposed by Matthew Babbitt[/i]

Find all integers $n$, $n \ge 1$, such that $n \cdot 2^{n+1}+1$ is a perfect square.

Is it possible to partition the set of integers into three disjoint sets so that for every positive integer $n$ the numbers $n$, $n-50$ and $n+1987$ belong to different sets?

Prove that the intersection of a plane and a regular tetrahedron can be an obtuse-angled triangle and that the obtuse angle in any such triangle is always smaller than $ 120^{\circ}.$

Given any set $S$ of positive integers, show that at least one of the following two assertions holds: (1) There exist distinct finite subsets $F$ and $G$ of $S$ such that $\sum_{x\in F}1/x=\sum_{x\in G}1/x$; (2) There exists a positive rational number $r<1$ such that $\sum_{x\in F}1/x\neq r$ for all finite subsets $F$ of $S$.

Equilateral $ \triangle ABC$ has side length $ 2$, $ M$ is the midpoint of $ \overline{AC}$, and $ C$ is the midpoint of $ \overline{BD}$. What is the area of $ \triangle CDM$? [asy]size(200);defaultpen(linewidth(.8pt)+fontsize(8pt)); pair B = (0,0); pair A = 2*dir(60); pair C = (2,0); pair D = (4,0); pair M = midpoint(A--C); label("$A$",A,NW);label("$B$",B,SW);label("$C$",C, SE);label("$M$",M,NE);label("$D$",D,SE); draw(A--B--C--cycle); draw(C--D--M--cycle);[/asy]$ \textbf{(A)}\ \frac {\sqrt {2}}{2}\qquad \textbf{(B)}\ \frac {3}{4}\qquad \textbf{(C)}\ \frac {\sqrt {3}}{2}\qquad \textbf{(D)}\ 1\qquad \textbf{(E)}\ \sqrt {2}$

Big Chungus has been thinking of a new symbol for BMT, and the drawing below is what he came up with. If each of the $16$ small squares in the grid are unit squares, what is the area of the shaded region?

Find all continuous functions $f:\mathbb{R}^+\rightarrow \mathbb{R}^+$ such that $$f(xf(y))+f(yf(x))=1+f(x+y)$$ for all $x, y>0.$

Let $a,b,c$ be three positive real numbers with $ab+bc+ca=4$. Find the minimum value of the expression $$E(a,b,c)=\frac{a^2+b^2}{ab}+\frac{b^2+c^2}{bc}+\frac{c^2+a^2}{ca}-(a-b)^2.$$

There are $10001$ students at an university. Some students join together to form several clubs (a student may belong to different clubs). Some clubs join together to form several societies (a club may belong to different societies). There are a total of $k$ societies. Suppose that the following conditions hold: [i]i.)[/i] Each pair of students are in exactly one club. [i]ii.)[/i] For each student and each society, the student is in exactly one club of the society. [i]iii.)[/i] Each club has an odd number of students. In addition, a club with ${2m+1}$ students ($m$ is a positive integer) is in exactly $m$ societies. Find all possible values of $k$. [i]Proposed by Guihua Gong, Puerto Rico[/i]

The Fibonacci sequence is given by $a_1 = 1, a_2 = 2$ and $a_{n+1} = a_n +a_{n-1}$ for $n > 1$. Express $a_{2n}$ in terms of only $a_{n-1},a_n,a_{n+1}$.

Let $n,k$ be given natural numbers. Determine all ordered n-tuples of non-negative real numbers $(x_1,x_2,...,x_n)$ that satisfy the system of equations $$x_1^k+x_2^k+...+x_n^k=1$$ $$(1+x_1)(1+x_2)...(1+x_n)=2$$

One hundred friends, including Alice and Bob, live in several cities. Alice has determined the distance from her city to the city of each of the other 99 friends and totaled these 99 numbers. Alice’s total is 1000 km. Bob similarly totaled his distances to everyone else. What is the largest total that Bob could have obtained? (Consider the cities as points on the plane; if two people live in the same city, the distance between their cities is considered zero).

Assign to each side $b$ of a convex polygon $P$ the maximum area of a triangle that has $b$ as a side and is contained in $P$. Show that the sum of the areas assigned to the sides of $P$ is at least twice the area of $P$.

We say that $A$$=${$a_1,a_2,a_3\cdots a_n$} consisting $n>2$ distinct positive integers is $good$ if for every $i=1,2,3\cdots n$ the number ${a_i}^{2015}$ is divisible by the product of all numbers in $A$ except $a_i$. Find all integers $n>2$ such that exists a $good$ set consisting of $n$ positive integers.

Let $A$ be a set contains $2000$ distinct integers and $B$ be a set contains $2016$ distinct integers. $K$ is the numbers of pairs $(m,n)$ satisfying \[ \begin{cases} m\in A, n\in B\\ |m-n|\leq 1000 \end{cases} \] Find the maximum value of $K$

Find all integers $\,a,b,c\,$ with $\,1<a<b<c\,$ such that \[ (a-1)(b-1)(c-1) \] is a divisor of $abc-1.$

Let $ ABC$ be an isosceles triangle with $ AB\equal{}AC$, and $ D$ be midpoint of $ BC$, and $ E$ be foot of altitude from $ C$. Let $ H$ be orthocenter of $ ABC$ and $ N$ be midpoint of $ CE$. $ AN$ intersects with circumcircle of triangle $ ABC$ at $ K$. The tangent from $ C$ to circumcircle of $ ABC$ intersects with $ AD$ at $ F$. Suppose that radical axis of circumcircles of $ CHA$ and $ CKF$ is $ BC$. Find $ \angle BAC$.

John scores $93$ on this year's AHSME. Had the old scoring system still been in effect, he would score only $84$ for the same answers. How many questions does he leave unanswered? (In the new scoring system one receives 5 points for correct answers, 0 points for wrong answers, and 2 points for unanswered questions. In the old system, one started with 30 points, received 4 more for each correct answer, lost one point for each wrong answer, and neither gained nor lost points for unanswered questions. There are 30 questions in the 1986 AHSME.) $ \textbf{(A)}\ 6\qquad\textbf{(B)}\ 9\qquad\textbf{(C)}\ 11\qquad\textbf{(D)}\ 14\qquad\textbf{(E)}\ \text{Not uniquely determined} $

Jesse and Tjeerd are playing a game. Jesse has access to $n\ge 2$ stones. There are two boxes: in the black box there is room for half of the stones (rounded down) and in the white box there is room for half of the stones (rounded up). Jesse and Tjeerd take turns, with Jesse starting. Jesse grabs in his turn, always one new stone, writes a positive real number on the stone and places put him in one of the boxes that isn't full yet. Tjeerd sees all these numbers on the stones in the boxes and on his turn may move any stone from one box to the other box if it is not yet full, but he may also choose to do nothing. The game stops when both boxes are full. If then the total value of the stones in the black box is greater than the total value of the stones in the white box, Jesse wins; otherwise win Tjeerd. For every $n \ge 2$, determine who can definitely win (and give a corresponding winning strategy).

Suppose that $a$ is an even positive integer and $A=a^{n}+a^{n-1}+\ldots +a+1,n\in \mathbb{N^{*}}$ is a perfect square.Prove that $8\mid a$.

How many positive integers less than 2005 are relatively prime to 1001?