In acute angled triangle $ABC$, $BC=a$,$CA=b$,$AB=c$, and $a>b>c$. $I,O,H$ are the incentre, circumcentre and orthocentre of $\triangle{ABC}$ respectively. Point $D \in BC$, $E \in CA$ and $AE=BD$, $CD+CE=AB$. Let the intersectionf of $BE$ and $AD$ be $K$. Prove that $KH \parallel IO$ and $KH = 2IO$.

On each cell of a $200 \times 200$ grid, we place a car, which faces in one of the four cardinal directions.In a move, one chooses a car that does not have a car immediately in front of it, and slides it one cellforward. If a move would cause a car to exit the grid, the car is removed instead. The cars are placedso that there exists a sequence of moves that eventually removes all the cars from the grid. Across all such starting configurations, determine the maximum possible number of moves to do so.

Given are positive integers $a, b$ for which $5a + 3b$ is divisible by $a + b$. Prove that $a = b$.

Find the largest $n$ such that the last nonzero digit of $n!$ is $1$.

In a contest, there are $11$ contestants to solve $9$ math problems. After the end of the contest, it was found that any two contestants solved no more than $ 1$ problem together. Find the largest positive integer $k$ such that each problem can be solved by at least $k$ candidates.

Denote $f_n(X) \in \Bbb Z [X]$ the polynomial $\Pi_{j=1}^n ( X + j -1)$. Show that if the numbers $\alpha$ and $\beta$ satisfy $f'_{1997} (\alpha) = f'_{1999} (\beta) = 0$ , then $f_{1997} (\alpha ) \neq f_{1999} (\beta)$ .

Do either (1) or (2): (1) Show that any solution $f(t)$ of the functional equation $$f(x+y)f(x-y)=f(x)^{2} +f(y)^{2} -1$$ for $x,y\in \mathbb{R}$ satisfies $$f''(t)= \pm c^{2} f(t)$$ for a constant $c$, assuming the existence and continuity of the second derivative. Deduce that $f(t)$ is one of the functions $$ \pm \cos ct, \;\;\; \pm \cosh ct.$$ (2) Let $(a_{i})_{i=1,...,n}$ and $(b_{i})_{i=1,...,n}$ be real numbers. Define an $(n+1)\times (n+1)$-matrix $A=(c_{ij})$ by $$ c_{i1}=1, \; \; c_{1j}= x^{j-1} \; \text{for} \; j\leq n,\; \; c_{1n+1}=p(x), \;\; c_{ij}=a_{i-1}^{j-1} \; \text{for}\; i>1, j\leq n,\;\; c_{in+1}=b_{i-1}\; \text{for}\; i>1.$$ The polynomial $p(x)$ is defined by the equation $\det A=0$. Let $f$ be a polynomial and replace $(b_{i})$ with $(f(b_{i}))$. Then $\det A=0$ defines another polynomial $q(x)$. Prove that $f(p(x))-q(x)$ is a multiple of $$\prod_{i=1}^{n} (x-a_{i}).$$

We define $N$ as the set of natural numbers $n<10^6$ with the following property: There exists an integer exponent $k$ with $1\le k \le 43$, such that $2012|n^k-1$. Find $|N|$.

Let $y=(x-a)^2+(x-b)^2, a, b$ constants. For what value of $x$ is $y$ a minimum? $ \textbf{(A)}\ \frac{a+b}{2} \qquad\textbf{(B)}\ a+b \qquad\textbf{(C)}\ \sqrt{ab} \qquad\textbf{(D)}\ \sqrt{\frac{a^2+b^2}{2}}\qquad\textbf{(E)}\ \frac{a+b}{2ab} $

Find all pairs $(m,p)$ of natural numbers , such that $p$ is a prime and \[2^mp^2+27\] is the third power of a natural numbers

Let $N$ be the set of positive integers. Find all functions $f : N \to N$ such that both $\bullet$ $f(f(m)f(n)) = mn$ $\bullet$ $f(2022a + 1) = 2022a + 1$ hold for all positive integers $m, n$ and $a$.

[b]p1.[/b] David runs at $3$ times the speed of Alice. If Alice runs $2$ miles in $30$ minutes, determine how many minutes it takes for David to run a mile. [b]p2.[/b] Al has $2019$ red jelly beans. Bob has $2018$ green jelly beans. Carl has $x$ blue jelly beans. The minimum number of jelly beans that must be drawn in order to guarantee $2$ jelly beans of each color is $4041$. Compute $x$. [b]p3.[/b] Find the $7$-digit palindrome which is divisible by $7$ and whose first three digits are all $2$. [b]p4.[/b] Determine the number of ways to put $5$ indistinguishable balls in $6$ distinguishable boxes. [b]p5.[/b] A certain reduced fraction $\frac{a}{b}$ (with $a,b > 1$) has the property that when $2$ is subtracted from the numerator and added to the denominator, the resulting fraction has $\frac16$ of its original value. Find this fraction. [b]p6.[/b] Find the smallest positive integer $n$ such that $|\tau(n +1)-\tau(n)| = 7$. Here, $\tau(n)$ denotes the number of divisors of $n$. [b]p7.[/b] Let $\vartriangle ABC$ be the triangle such that $AB = 3$, $AC = 6$ and $\angle BAC = 120^o$. Let $D$ be the point on $BC$ such that $AD$ bisect $\angle BAC$. Compute the length of $AD$. [b]p8.[/b] $26$ points are evenly spaced around a circle and are labeled $A$ through $Z$ in alphabetical order. Triangle $\vartriangle LMT$ is drawn. Three more points, each distinct from $L, M$, and $T$ , are chosen to form a second triangle. Compute the probability that the two triangles do not overlap. [b]p9.[/b] Given the three equations $a +b +c = 0$ $a^2 +b^2 +c^2 = 2$ $a^3 +b^3 +c^3 = 19$ find $abc$. [b]p10.[/b] Circle $\omega$ is inscribed in convex quadrilateral $ABCD$ and tangent to $AB$ and $CD$ at $P$ and $Q$, respectively. Given that $AP = 175$, $BP = 147$,$CQ = 75$, and $AB \parallel CD$, find the length of $DQ$. [b]p11. [/b]Let $p$ be a prime and m be a positive integer such that $157p = m^4 +2m^3 +m^2 +3$. Find the ordered pair $(p,m)$. [b]p12.[/b] Find the number of possible functions $f : \{-2,-1, 0, 1, 2\} \to \{-2,-1, 0, 1, 2\}$ that satisfy the following conditions. (1) $f (x) \ne f (y)$ when $x \ne y$ (2) There exists some $x$ such that $f (x)^2 = x^2$ [b]p13.[/b] Let $p$ be a prime number such that there exists positive integer $n$ such that $41pn -42p^2 = n^3$. Find the sum of all possible values of $p$. [b]p14.[/b] An equilateral triangle with side length $ 1$ is rotated $60$ degrees around its center. Compute the area of the region swept out by the interior of the triangle. [b]p15.[/b] Let $\sigma (n)$ denote the number of positive integer divisors of $n$. Find the sum of all $n$ that satisfy the equation $\sigma (n) =\frac{n}{3}$. [b]p16[/b]. Let $C$ be the set of points $\{a,b,c\} \in Z$ for $0 \le a,b,c \le 10$. Alice starts at $(0,0,0)$. Every second she randomly moves to one of the other points in $C$ that is on one of the lines parallel to the $x, y$, and $z$ axes through the point she is currently at, each point with equal probability. Determine the expected number of seconds it will take her to reach $(10,10,10)$. [b]p17.[/b] Find the maximum possible value of $$abc \left( \frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)^3$$ where $a,b,c$ are real such that $a +b +c = 0$. [b]p18.[/b] Circle $\omega$ with radius $6$ is inscribed within quadrilateral $ABCD$. $\omega$ is tangent to $AB$, $BC$, $CD$, and $DA$ at $E, F, G$, and $H$ respectively. If $AE = 3$, $BF = 4$ and $CG = 5$, find the length of $DH$. [b]p19.[/b] Find the maximum integer $p$ less than $1000$ for which there exists a positive integer $q$ such that the cubic equation $$x^3 - px^2 + q x -(p^2 -4q +4) = 0$$ has three roots which are all positive integers. [b]p20.[/b] Let $\vartriangle ABC$ be the triangle such that $\angle ABC = 60^o$,$\angle ACB = 20^o$. Let $P$ be the point such that $CP$ bisects $\angle ACB$ and $\angle PAC = 30^o$. Find $\angle PBC$. PS. You had better use hide for answers.

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

Determine all pairs $(p, q)$ of primes for which $p^{q+1}+q^{p+1}$ is a perfect square.

Find the greatest positive integer $n$ such that we can choose $2007$ different positive integers from $[2\cdot 10^{n-1},10^{n})$ such that for each two $1\leq i<j\leq n$ there exists a positive integer $\overline{a_{1}a_{2}\ldots a_{n}}$ from the chosen integers for which $a_{j}\geq a_{i}+2$. [i]A. Ivanov, E. Kolev[/i]

Let $n$ be a positive integer, and $a_1,...,a_n, b_1,..., b_n$ be $2n$ positive real numbers such that $a_1 + ... + a_n = b_1 + ... + b_n = 1$. Find the minimal value of $ \frac {a_1^2} {a_1 + b_1} + \frac {a_2^2} {a_2 + b_2} + ...+ \frac {a_n^2} {a_n + b_n}$.

Find integers $m,n$ such that the sum of their cubes is equal to the square of their sum.

Find all monotonic functions $u:\mathbb{R}\rightarrow\mathbb{R}$ which have the property that there exists a strictly monotonic function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[f(x+y)=f(x)u(x)+f(y) \] for all $x,y\in\mathbb{R}$. [i]Vasile Pop[/i]

Devah draws a row of 1000 equally spaced dots on a sheet of paper. She goes through the dots from left to right, one by one, checking if the midpoint between the current dot and some remaining dot to its left is also a remaining dot. If so, she erases the current dot. How many dots does Devah end up erasing?

In a sequence with the first term is positive integer, the next term is generated by adding the previous term and its largest digit. At most how many consequtive terms of this sequence are odd? $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6 $

find all positive integer pairs $(m,n)$,satisfies: (1)$gcd(m,n)=1$,and $m\le\ 2007$ (2)for any $k=1,2,...2007$,we have $[\frac{nk}{m}]=[\sqrt{2}k]$

Let $P$ be a set of nine points in the Cartesian coordinate plane, no three of which lie on the same line. Call an ordering $\{Q_1, Q_2, \ldots, Q_9\}$ of the points in $P$ [i]special[/i] if there exists a point $C$ in the same plane such that $CQ_1 < CQ_2 < \cdots < CQ_9$. Over all possible sets $P,$ what is the largest possible number of distinct special orderings of $P?$

Let $n$ be a positive integer. Consider a figure of a equilateral triangle of side $n$ and splitted in $n^2$ small equilateral triangles of side $1$. One will mark some of the $1+2+\dots+(n+1)$ vertices of the small triangles, such that for every integer $k\geq 1$, there is [b]not[/b] any trapezoid(trapezium), whose the sides are $(1,k,1,k+1)$, with all the vertices marked. Furthermore, there are [b]no[/b] small triangle(side $1$) have your three vertices marked. Determine the greatest quantity of marked vertices.

If $ \frac{a }{b}+ \frac{b}{c}+ \frac{c}{a}$ is integer. show that $ abc$ is perfect cube.

Prove that we can fill in the three dimensional space with regular tetrahedrons and regular octahedrons, all of which have the same edge-lengths. Also find the ratio of the number of the regular tetrahedrons used and the number of the regular octahedrons used.