Given $S$ be the finite lattice (with integer coordinate) set in the $xy$-plane. $A$ is the subset of $S$ with most elements such that the line connecting any two points in $A$ is not parallel to $x$-axis or $y$-axis. $B$ is the subset of integer with least elements such that for any $(x,y)\in S$, $x \in B$ or $y \in B$ holds. Prove that $|A| \geq |B|$.

For each positive integer $ n$, let $ c(n)$ be the largest real number such that \[ c(n) \le \left| \frac {f(a) \minus{} f(b)}{a \minus{} b}\right|\] for all triples $ (f, a, b)$ such that --$ f$ is a polynomial of degree $ n$ taking integers to integers, and --$ a, b$ are integers with $ f(a) \neq f(b)$. Find $ c(n)$. [i]Shaunak Kishore.[/i]

A circle is called a [b]separator[/b] for a set of five points in a plane if it passes through three of these points, it contains a fourth point inside and the fifth point is outside the circle. Prove that every set of five points such that no three are collinear and no four are concyclic has exactly four separators.

Let $n \geqslant 2$ be an integer and let $1<a_1 \le a_2 \le \dots \le a_n$ be $n$ real numbers such that $a_1+a_2+\dots+a_n=2n$. Prove that$$a_1a_2\dots a_{n-1}+a_1a_2\dots a_{n-2}+\dots+a_1a_2+a_1+2 \leqslant a_1a_2\dots a_n.$$ [i]Proposed by Kapil Pause[/i]

Among a group of programmers, every two either know each other or do not know each other. Eleven of them are geniuses. Two companies hire them one at a time, alternately, and may not hire someone already hired by the other company. There are no conditions on which programmer a company may hire in the first round. Thereafter, a company may only hire a programmer who knows another programmer already hired by that company. Is it possible for the company which hires second to hire ten of the geniuses, no matter what the hiring strategy of the other company may be?

Let S be the set of line segments between any two vertices of a regular $21$-gon. If we select two distinct line segments from $S$ at random, what is the probability they intersect? Note that line segments are considered to intersect if they share a common vertex.

The vertex $A$, center $O$ and Euler line $\ell$ of a triangle $ABC$ is given. It is known that $\ell$ intersects $AB,AC$ at two points equidistant from $A$. Restore the triangle.

What is the value of $2-(-2)^{-2}$? $ \textbf{(A) } -2 \qquad\textbf{(B) } \dfrac{1}{16} \qquad\textbf{(C) } \dfrac{7}{4} \qquad\textbf{(D) } \dfrac{9}{4} \qquad\textbf{(E) } 6 $

Let $I$ be the incenter of triangle $ABC$, and $K$ be the common point of $BC$ with the external bisector of angle $A$. The line $KI$ meets the external bisectors of angles $B$ and $C$ at points $X$ and $Y$ . Prove that $\angle BAX = \angle CAY$

Point $M$ is the midpoint of the side $AB$ of an acute triangle $ABC$. Point $P$ lies on the segment $AB$, and points $S_1$ and $S_2$ are the centers of the circumcircles of $APC$ and $BPC$, respectively. Show that the midpoint of segment $S_1S_2$ lies on the perpendicular bisector of segment $CM$.

On a cyclic quadrilateral $ABCD$, $M$ is the midpoint of $AB$ and $N$ is the midpoint of $CD$. Let $E$ be the projection of $C$ onto $AB$ and $F$ the reflection of $N$ about the midpoint of $DE$. If $F$ is inside quadrilateral $ABCD$, show that $\angle BMF = \angle CBD$.

Four distinct circles are drawn in a plane. What is the maximum number of points where at least two of the circles intersect? $ \textbf{(A)}\ 8 \qquad \textbf{(B)}\ 9 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 16$

Is it true that any two rectangles of equal area can be placed in the plane such that any horizontal line intersecting at least one of them will also intersect the other, and the segments of intersection will be equal?

Let $ABCD$ be a tangential quadrilateral with inscribed circle $k(O,r)$ which is tangent to the sides $BC$ and $AD$ at $K$ and $L$, respectively. Show that the circle with diameter $OC$ passes through the intersection point of $KL$ and $OD$. [i]Proposed by Ilija Jovchevski[/i]

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Let $n \geq 2, n \in \mathbb{N},$ find the least positive real number $\lambda$ such that for arbitrary $a_i \in \mathbb{R}$ with $i = 1, 2, \ldots, n$ and $b_i \in \left[0, \frac{1}{2}\right]$ with $i = 1, 2, \ldots, n$, the following holds: \[\sum^n_{i=1} a_i = \sum^n_{i=1} b_i = 1 \Rightarrow \prod^n_{i=1} a_i \leq \lambda \sum^n_{i=1} a_i b_i.\]

On Mars a basketball team consists of 6 players. The coach of the team Mars can select any line-up of 6 players among 100 candidates. The coach considers some line-ups as [i]appropriate[/i] while the other line-ups are not (there exists at least one appropriate line-up). A set of 5 candidates is called [i]perspective[/i] if one more candidate could be added to it to obtain an appropriate line-up. A candidate is called [i]universal[/i] if he completes each perspective set of 5 candidates (not containing him) upto an appropriate line-up. The coach has selected a line-up of 6 universal candidates. Determine if it follows that this line-up is appropriate.

The arithmetic mean (average) of a set of $50$ numbers is $38$. If two numbers, namely, $45$ and $55$, are discarded, the mean of the remaining set of numbers is: $ \textbf{(A)}\ 36.5 \qquad\textbf{(B)}\ 37\qquad\textbf{(C)}\ 37.2\qquad\textbf{(D)}\ 37.5\qquad\textbf{(E)}\ 37.52 $

Given a triangle $ABC$. The points $A$, $B$, $C$ divide the circumcircle $\Omega$ of the triangle $ABC$ into three arcs $BC$, $CA$, $AB$. Let $X$ be a variable point on the arc $AB$, and let $O_{1}$ and $O_{2}$ be the incenters of the triangles $CAX$ and $CBX$. Prove that the circumcircle of the triangle $XO_{1}O_{2}$ intersects the circle $\Omega$ in a fixed point.

A best-of-9 series is to be played between two teams; that is, the first team to win 5 games is the winner. The Mathletes have a chance of $\tfrac{2}{3}$ of winning any given game. What is the probability that exactly 7 games will need to be played to determine a winner?

Find all functions $f:\mathbb Z\rightarrow \mathbb Z$ such that, for all integers $a,b,c$ that satisfy $a+b+c=0$, the following equality holds: \[f(a)^2+f(b)^2+f(c)^2=2f(a)f(b)+2f(b)f(c)+2f(c)f(a).\] (Here $\mathbb{Z}$ denotes the set of integers.) [i]Proposed by Liam Baker, South Africa[/i]

Submit a positive integer $N$ between 1 and 20, inclusive. If $C$ is the total number of teams that submit $N$ for this question, your score will be $\lfloor\frac{N}{C}\rfloor$ [i]Lightning 5.4[/i]

Let O be the circumcenter of a triangle ABC. Points M and N are choosen on the sides AB and BC respectively so that the angle AOC is two times greater than angle MON. Prove that the perimeter of triangle MBN is not less than the lenght of side AC

Points $ A$ and $ B$ lie on a circle centered at $ O$, and $ \angle AOB\equal{}60^\circ$. A second circle is internally tangent to the first and tangent to both $ \overline{OA}$ and $ \overline{OB}$. What is the ratio of the area of the smaller circle to that of the larger circle? $ \textbf{(A)}\ \frac{1}{16} \qquad \textbf{(B)}\ \frac{1}{9} \qquad \textbf{(C)}\ \frac{1}{8} \qquad \textbf{(D)}\ \frac{1}{6} \qquad \textbf{(E)}\ \frac{1}{4}$

Find all polynomials $P(x)$ of degree $1$ such that $\underset {a\le x\le b}{max} P(x) - \underset {a\le x\le b}{min} P(x) =b-a$ , $\forall a,b\in R$ where $a < b$