Let $ABC$ be a triangle with $AB\ne AC$. Its incircle has center $I$ and touches the side $BC$ at point $D$. Line $AI$ intersects the circumcircle $\omega$ of triangle $ABC$ at $M$ and $DM$ intersects again $\omega$ at $P$. Prove that $\angle API= 90^o$.

Michael walks at the rate of $ 5$ feet per second on a long straight path. Trash pails are located every $ 200$ feet along the path. A garbage truck travels at $ 10$ feet per second in the same direction as Michael and stops for $ 30$ seconds at each pail. As Michael passes a pail, he notices the truck ahead of him just leaving the next pail. How many times will Michael and the truck meet? $ \textbf{(A)}\ 4\qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 8$

Consider the set $S = \{ q + \frac{1}{q}, \text{ where } q \text{ ranges over all positive rational numbers} \}$. (a) Let $N$ be a positive integer. Show that $N$ is the sum of two elements of $S$ if and only if $N$ is the product of two elements of $S$. (b) Show that there exist infinitely many positive integers $N$ that cannot be written as the sum of two elements of $S$. (c)Show that there exist infinitely many positive integers $N$ that can be written as the sum of two elements of $S$.

You have a large number of congruent equilateral triangular tiles on a table and you want to fit $n$ of them together to make a convex equiangular hexagon (i.e. one whose interior angles are $120^o$) . Obviously, $n$ cannot be any positive integer. The first three feasible $n$ are $6, 10$ and $13$. Show that $12$ is not feasible but $14$ is.

Solve the system equations \[\left\{\begin{array}{cc}x^{4}-y^{4}=240\\x^{3}-2y^{3}=3(x^{2}-4y^{2})-4(x-8y)\end{array}\right.\]

Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$, the remainder is $x + 2$, and when $P(x)$ is divided by the polynomial $x^2 + 1$, the remainder is $2x + 1$. There is a unique polynomial of least degree with these two properties. What is the sum of the squares of the coefficients of that polynomial? $\textbf{(A) } 10 \qquad \textbf{(B) } 13 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 23$

Prove that $f(2) \ge 3^n$ where the polynomial $f(x) = x_n + a_1x_{n-1} + ...+ a_{n-1}x + 1$ has non-negative coefficients and $n$ real roots.

Let $a, b$ and $c$ be positive real numbers such that $$a^2+ab+ac-bc = 0.$$ a) Show that if two of the numbers $a, b$ and $c$ are equal, then at least one of the numbers $a, b$ and $c$ is irrational. b) Show that there exist infinitely many triples $(m, n, p)$ of positive integers such that $$m^2 + mn + mp -np = 0.$$

Define an [i]almost-palindrome[/i] as a string of letters that is not a palindrome but can become a palindrome if one of its letters is changed. For example, $TRUST$ is an almost-palindrome because the $R$ can be changed to an $S$ to produce a palindrome, but $TRIVIAL$ is not an almost-palindrome because it cannot be changed into a palindrome by swapping out only one letter (both the $A$ and the $L$ are out of place). How many almost-palindromes contain fewer than $4$ letters.

Prove that for every positive integer $n \geq 3$ there exist two sets $A =\{ x_1, x_2,\ldots, x_n\}$ and $B =\{ y_1, y_2,\ldots, y_n\}$ for which [b]i)[/b] $A \cap B = \varnothing.$ [b]ii)[/b] $x_1+ x_2+\cdots+ x_n= y_1+ y_2+\cdots+ y_n.$ [b]ii)[/b] $x_1^2+ x_2^2+\cdots+ x_n^2= y_1^2+ y_2^2+\cdots+ y_n^2.$

The sequence $\{a_n\}$ satisfies $a_0=1, a_1=2011,$ and $a_n=2a_{n-1}+a_{n-2}$ for all $n \geq 2$. Let \[ S = \sum_{i=1}^{\infty} \frac{a_{i-1}}{a_i^2-a_{i-1}^2} \] What is $\frac{1}{S}$? [i]Author: Ray Li[/i]

The function $f$ is defined by $f\left(x\right)=x^2+3x$. Find the product of all solutions of the equation $f\left(2x-1\right)=6$.

Find maximal possible number of points lying on or inside a circle with radius $R$ in such a way that the distance between every two points is greater than $R\sqrt2$. [i]H. Lesov[/i]

Let $A$ be a subset of $\{1, 2, \dots , 1000000\}$ such that for any $x, y \in A$ with $x\neq y$, we have $xy\notin A$. Determine the maximum possible size of $A$.

Let $ABC$ be a triangle,$O$ its circumcenter and $R$ the radius of its circumcircle.Denote by $O_{1}$ the symmetric of $O$ with respect to $BC$,$O_{2}$ the symmetric of $O$ with respect to $AC$ and by $O_{3}$ the symmetric of $O$ with respect to $AB$. (a)Prove that the circles $C_{1}(O_{1},R)$, $C_{2}(O_{2},R)$, $C_{3}(O_{3},R)$ have a common point. (b)Denote by $T$ this point.Let $l$ be an arbitary line passing through $T$ which intersects $C_{1}$ at $L$, $C_{2}$ at $M$ and $C_{3}$ at $K$.From $K,L,M$ drop perpendiculars to $AB,BC,AC$ respectively.Prove that these perpendiculars pass through a point.

Let $ABC$ be an acute-angled triangle with $AC > AB$, let $O$ be its circumcentre, and let $D$ be a point on the segment $BC$. The line through $D$ perpendicular to $BC$ intersects the lines $AO, AC,$ and $AB$ at $W, X,$ and $Y,$ respectively. The circumcircles of triangles $AXY$ and $ABC$ intersect again at $Z \ne A$. Prove that if $W \ne D$ and $OW = OD,$ then $DZ$ is tangent to the circle $AXY.$

How many 6-digit numbers are there such that-: a)The digits of each number are all from the set $ \{1,2,3,4,5\}$ b)any digit that appears in the number appears at least twice ? (Example: $ 225252$ is valid while $ 222133$ is not) [b][weightage 17/100][/b]

Let $ABC$ be a triangle with $\angle{C} = 90^{\circ}$, and let $H$ be the foot of the altitude from $C$. A point $D$ is chosen inside the triangle $CBH$ so that $CH$ bisects $AD$. Let $P$ be the intersection point of the lines $BD$ and $CH$. Let $\omega$ be the semicircle with diameter $BD$ that meets the segment $CB$ at an interior point. A line through $P$ is tangent to $\omega$ at $Q$. Prove that the lines $CQ$ and $AD$ meet on $\omega$.

On a square board with $m$ rows and $n$ columns, where $m\le n$, some squares are colored black in such a way that no two rows are alike. Find tha biggest integer $k$ such that, for every possible coloring to start with, one can always color $k$ columns entirely red in such a way that still no two rows are alike.

Let $X, Y$ , and $Z$ be concentric circles with radii $1$, $13$, and $22$, respectively. Draw points $A, B$, and $C$ on $X$, $Y$ , and $Z$, respectively, such that the area of triangle $ABC$ is as large as possible. If the area of the triangle is $\Delta$, find $\Delta^2$.

Let $S$ be the set of all 3-tuples $(a,b,c)$ that satisfy $a+b+c=3000$ and $a,b,c>0$. If one of these 3-tuples is chosen at random, what's the probability that $a,b$ or $c$ is greater than or equal to 2,500?

Prove that for every positive integer $m$ there exists a positive integer $n_m$ such that for every positive integer $n \ge n_m$, there exist positive integers $a_1, a_2, \ldots, a_n$ such that $$\frac{1}{a_1^m}+\frac{1}{a_2^m}+\ldots+\frac{1}{a_n^m}=1.$$

[b]p1.[/b] One out of $12$ coins is counterfeited. It is known that its weight differs from the weight of a valid coin but it is unknown whether it is lighter or heavier. How to detect the counterfeited coin with the help of four trials using only a two-pan balance without weights? [b]p2.[/b] Below a $3$-digit number $c d e$ is multiplied by a $2$-digit number $a b$ . Find all solutions $a, b, c, d, e, f, g$ if it is known that they represent distinct digits. $\begin{tabular}{ccccc} & & c & d & e \\ x & & & a & b \\ \hline & & f & e & g \\ + & c & d & e & \\ \hline & b & b & c & g \\ \end{tabular}$ [b]p3.[/b] Find all integer $n$ such that $\frac{n + 1}{2n - 1}$is an integer. [b]p4[/b]. There are several straight lines on the plane which split the plane in several pieces. Is it possible to paint the plane in brown and green such that each piece is painted one color and no pieces having a common side are painted the same color? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $S$ be an infinite set of positive integers and define: $T=\{ x+y|x,y \in S , x \neq y \} $ Suppose that there are only finite primes $p$ so that: 1.$p \equiv 1 \pmod 4$ 2.There exists a positive integer $s$ so that $p|s,s \in T$. Prove that there are infinity many primes that divide at least one term of $S$.

The sequences $(x_n)$ and $(y_n)$ are defined as follows: $$ x_{n+1} = \frac{x_n+2}{x_n+1},\quad y_{n+1}=\frac{y_n^2+2}{2y_n} \quad \text{ for } n= 0,1,2,\ldots.$$ Prove that for every integer $ n\geq 0 $ the equality $ y_n = x_{2^n-1} $ holds.