Let $P$ be a point in the interior of a triangle $ABC$ and let $d_a,d_b,d_c$ be its distances to $BC,CA,AB$ respectively. Prove that max $(AP, BP, CP) \ge \sqrt{d_a^2+d_b^2+d_c^2}$

Suppose that $a, b,$ and $c$ are positive real numbers such that $$a + b + c \ge \frac{1}{a} + \frac{1}{b} + \frac{1}{c}.$$ Find the largest possible value of the expression $$\frac{a + b - c}{a^3 + b^3 + abc} + \frac{b + c - a}{b^3 + c^3 + abc} + \frac{c + a - b}{c^3 + a^3 + abc}.$$

In triangle $ABC$, bisectors are drawn $AA_1$ and $CC_1$. Prove that if the length of the perpendiculars drawn from the vertex $B$ on lines $AA1$ and $CC_1$ are equal, then $\vartriangle ABC$ is isosceles.

Find the least positive integer that has exactly $20$ positive integer divisors.

A set $X$ consisting of $n$ positive integers is called $\textit{good}$ if the following condition holds: For any two different subsets of $X$, say $A$ and $B$, the number $s(A) - s(B)$ is not divisible by $2^n$. (Here, for a set $A$, $s(A)$ denotes the sum of the elements of $A$) Given $n$, find the number of good sets of size $n$, all of whose elements is strictly less than $2^n$.

Prove that each finite set of integers can be arranged without intersection.

If \[f(x) = (x + 2x^2 +\cdots+ nx^n)^2 = a_2x^2 + a_3x^3 + \cdots+ a_{2n}x^{2n},\] prove that \[a_{n+1} + a_{n+2} + \cdots + a_{2n} =\dbinom{n + 1}{2}\frac{5n^2 + 5n + 2}{12}\]

If $a$ and $b$ are positive real numbers such that $a \cdot 2^b=8$ and $a^b=2,$ compute $a^{\log_2 a} 2^{b^2}.$

A $10$-digit number is called a $\textit{cute}$ number if its digits belong to the set $\{1,2,3\}$ and the difference of every pair of consecutive digits is $1$. a) Find the total number of cute numbers. b) Prove that the sum of all cute numbers is divisibel by $1408$.

Let $u,f$ and $g$ be functions, defined for all real numbers $x$, such that $$\frac{u(x+1)+u(x-1)}{2}=f(x) \text{ and } \frac{u(x+4)+u(x-4)}{2}=g(x).$$ Determine $u(x)$ in terms of $f$ and $g$.

Parabolas $P_1, P_2$ share a focus at $(20,22)$ and their directrices are the $x$ and $y$ axes respectively. They intersect at two points $X,Y.$ Find $XY^2.$ [i]Proposed by Evan Chang[/i]

Let $a$ and $b$ be integers. Show that $a$ and $b$ have the same parity if and only if there exist integers $c$ and $d$ such that $a^2 +b^2 +c^2 +1 = d^2$.

A square is cut into three rectangles along two lines parallel to a side, as shown. If the perimeter of each of the three rectangles is 24, then the area of the original square is [asy] draw((0,0)--(9,0)--(9,9)--(0,9)--cycle); draw((3,0)--(3,9), dashed); draw((6,0)--(6,9), dashed);[/asy] $\text{(A)} \ 24 \qquad \text{(B)} \ 36 \qquad \text{(C)} \ 64 \qquad \text{(D)} \ 81 \qquad \text{(E)} \ 96$

Let $n \ge 3$ cells be arranged into a circle. Each cell can be occupied by $0$ or $1$. The following operation is admissible: Choose any cell $C$ occupied by a $1$, change it into a $0$ and simultaneously reverse the entries in the two cells adjacent to $C$ (so that $x,y$ become $1 - x$, $1 - y$). Initially, there is a $1$ in one cell and zeros elsewhere. For which values of $n$ is it possible to obtain zeros in all cells in a finite number of admissible steps?

Does there exist two infinite positive integer sets $S,T$, such that any positive integer $n$ can be uniquely expressed in the form $$n=s_1t_1+s_2t_2+\ldots+s_kt_k$$ ,where $k$ is a positive integer dependent on $n$, $s_1<\ldots<s_k$ are elements of $S$, $t_1,\ldots, t_k$ are elements of $T$?

The circle with the centre $O$ is inscribed in the triangle $ABC$ . The circumference touches its sides $[BC], [CA], [AB]$ in $A_1, B_1, C_1$ points respectively. The $[AO], [BO], [CO]$ segments cross the circumference in $A_2, B_2, C_2$ points respectively. Prove that lines $(A_1A_2),(B_1B_2)$ and $(C_1C_2)$ intersect in one point.

Charlyn walks completely around the boundary of a square whose sides are each $5$ km long. From any point on her path she can see exactly $1$ km horizontally in all directions. What is the area of the region consisting of all points Charlyn can see during her walk, expressed in square kilometers and rounded to the nearest whole number? $\text{(A)}\ 24 \qquad\text{(B)}\ 27\qquad\text{(C)}\ 39\qquad\text{(D)}\ 40 \qquad\text{(E)}\ 42$

Let $f$ be a real function on the real line with continuous third derivative. Prove that there exists a point $a$ such that \[f(a)\cdot f^\prime(a)\cdot f^{\prime\prime}(a)\cdot f^{\prime\prime\prime}(a)\geq 0.\]

Find all functions $f : \mathbb{R} \to\mathbb{R}$ such that $f(0)\neq 0$ and \[f(f(x)) + f(f(y)) = f(x + y)f(xy),\] for all $x, y \in\mathbb{R}$.

Solve the following system of equations for real $x,y$ and $z$: \begin{eqnarray*} x &=& \sqrt{2y+3}\\ y &=& \sqrt{2z+3}\\ z &=& \sqrt{2x+3}. \end{eqnarray*}

A finite number of stones are [i]good[/i] when the weight of each of these stones is less than the total weight of the rest. It is known that arbitrary $n-1$ of the given $n$ stones is [i]good[/i]. Prove that it is possible to choose a [i]good[/i] triple from these stones.

Alice and Bob play a game where on each turn, Alice rolls a die and Bob flips a coin. Bob wins the game if he flips $3$ heads before Alice rolls a $6$. What is the probability that Bob wins? Note that Bob does not in if he flips his third head the same turn Alice rolls her first $6$.

[b]p1.[/b] Find all positive integers $n$ such that $n^3 - 14n^2 + 64n - 93$ is prime. [b]p2.[/b] Let $a, b, c$ be real numbers such that $0 \le a, b, c \le 1$. Find the maximum value of $$\frac{a}{1 + bc}+\frac{b}{1 + ac}+\frac{c}{1 + ab}$$ [b]p3.[/b] Find the maximum value of the function $f(x, y, z) = 4x + 3y + 2z$ on the ellipsoid $16x^2 + 9y^2 + 4z^2 = 1$ [b]p4.[/b] Let $x_1,..., x_n$ be numbers such that $x_1+...+x_n = 2009$. Find the minimum value of $x^2_1+...+x^2_n$ (in term of $n$). [b]p5.[/b] Find the number of odd integers between $1000$ and $9999$ that have at least 3 distinct digits. [b]p6.[/b] Let $A_1,A_2,...,A_{2^n-1}$ be all the possible nonempty subsets of $\{1, 2, 3,..., n\}$. Find the maximum value of $a_1 + a_2 + ... + a_{2^n-1}$ where $a_i \in A_i$ for each $i = 1, 2,..., 2^n - 1$. [b]p7.[/b] Find the rightmost digit when $41^{2009}$ is written in base $7$. [b]p8.[/b] How many integral ordered triples $(x, y, z)$ satisfy the equation $x+y+z = 2009$, where $10 \le x < 31$, $100 < z < 310$ and $y \ge 0$. [b]p9.[/b] Scooby has a fair six-sided die, labeled $1$ to $6$, and Shaggy has a fair twenty-sided die, labeled $1$ to $20$. During each turn, they both roll their own dice at the same time. They keep rolling the die until one of them rolls a 5. Find the probability that Scooby rolls a $5$ before Shaggy does. [b]p10.[/b] Let $N = 1A323492110877$ where $A$ is a digit in the decimal expansion of $N$. Suppose $N$ is divisible by $7$. Find $A$. [b]p11.[/b] Find all solutions $(x, y)$ of the equation $\tan^4(x+y)+\cot^4(x+y) = 1-2x-x^2$, where $-\frac{\pi}{2} \le x; y \le \frac{\pi}{2}$ [b]p12.[/b] Find the remainder when $\sum^{50}_{k=1}k!(k^2 + k - 1)$ is divided by $1008$. [b]p13.[/b] The devil set of a positive integer $n$, denoted $D(n)$, is defined as follows: (1) For every positive integer $n$, $n \in D(n)$. (2) If $n$ is divisible by $m$ and $m < n$, then for every element $a \in D(m)$, $a^3$ must be in $D(n)$. Furthermore, call a set $S$ scary if for any $a, b \in S$, $a < b$ implies that $b$ is divisible by $a$. What is the least positive integer $n$ such that $D(n)$ is scary and has at least $2009$ elements? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $I$ be the incenter, $A_1$ and $B_1$ midpoints of sides $BC$ and $AC$ of a triangle $\Delta ABC$. Denote by $M$ and $N$ the midpoints of the arcs $AC$ and $BC$ of circumcircle of $\Delta ABC$ which do contain the other vertex of the triangle. If points $M$, $I$ and $N$ are collinear prove that: \begin{align*} \angle AIB_1=\angle BIA_1=90^{\circ} \end{align*}

Let $p > 2$ be a prime and let $a,b,c,d$ be integers not divisible by $p$, such that \[ \left\{ \dfrac{ra}{p} \right\} + \left\{ \dfrac{rb}{p} \right\} + \left\{ \dfrac{rc}{p} \right\} + \left\{ \dfrac{rd}{p} \right\} = 2 \] for any integer $r$ not divisible by $p$. Prove that at least two of the numbers $a+b$, $a+c$, $a+d$, $b+c$, $b+d$, $c+d$ are divisible by $p$. (Note: $\{x\} = x - \lfloor x \rfloor$ denotes the fractional part of $x$.)