Let $S$ be a subset of $\{1, 2, . . . , 500\}$ such that no two distinct elements of S have a product that is a perfect square. Find, with proof, the maximum possible number of elements in $S$.

There is a pack of 27 distinct cards, and each card has three values on it. The first value is a shape from $\{\Delta,\square,\odot\}$; the second value is a letter from $\{A,B,C\}$; and the third value is a number from $\{1,2,3\}$. In how many ways can we choose an unordered set of 3 cards from the pack, so that no two of the chosen cards have two matching values. For example we can chose $\{\Delta A1,\Delta B2,\odot C3\}$ But we cannot choose $\{\Delta A1,\square B2,\Delta C1\}$

On a board there are written the integers from $1$ to $119$. Two players, $A$ and $B$, make a move by turn. A $move$ consists in erasing $9$ numbers from the board. The player after whose move two numbers remain on the board wins and his score is equal with the positive difference of the two remaining numbers. The player $A$ makes the first move. Find the highest integer $k$, such that the player $A$ can be sure that his score is not smaller than $k$.

One of the following numbers is not divisible by any prime number less than 10. Which is it? (A) $2^{606} - 1 \ \ $ (B) $2^{606} + 1 \ \ $ (C) $2^{607} - 1 \ \ $ (D) $2^{607} + 1 \ \ $ (E) $2^{607} + 3^{607} \ \ $

Let $ABC$ be an acute triangle, and $H$ its orthocenter. The distance from $H$ to rays $BC$, $CA$, and $AB$ is denoted by $d_a$, $d_b$, and $d_c$, respectively. Let $R$ be the radius of circumcenter of $\triangle ABC$ and $r$ be the radius of incenter of $\triangle ABC$. Prove the following inequality: $$d_a+d_b+d_c \le \frac{3R^2}{4r}$$.

Do there exist two polynomials $P(x)$ and $Q(x)$ with integer coefficients such that $$(P-Q)(x), \,\,\,\, P(x) \,\,\,\, and \,\,\,\,(P+Q)(x)$$ are squares of polynomials (and $Q$ is not equal to $cP$, where $c$ is a real number)? (V Prasolov)

Let $a, b, c, d$ be four positive reals such that $abc+abd+acd+bcd = 1$. Determine all possible values for $$(ab + cd)(ac + bd)(ad + bc).$$ [i]Proposed by usjl and YaWNeeT[/i]

Let $ABCD$ be a quadrilateral with $AB\parallel CD$ and $AC \perp BD$. Let $O$ be the intersection of $AC$ and $BD$. On the rays $(OA$ and $(OB$ we consider the points $M$ and $N$ respectively such that $\angle ANC = \angle BMD = 90^\circ$. We denote with $E$ the midpoint of the segment $MN$. Prove that a) $\triangle OMN \sim \triangle OBA$; b) $OE \perp AB$. [i]Claudiu-Stefan Popa[/i]

Let $n$ and $q$ be integers with $n \ge 5$, $2 \le q \le n$. Prove that $q-1$ divides $\left\lfloor \frac{(n-1)!}{q}\right\rfloor $.

Given a convex quadrilateral $ABCD$ such that $m(\widehat{ABC})=m(\widehat{BCD})$. The lines $AD$ and $BC$ intersect at a point $P$ and the line passing through $P$ which is parallel to $AB$, intersects $BD$ at $T$. Prove that $$m(\widehat{ACB})=m(\widehat{PCT})$$

Euclid has a tool called [i]cyclos[/i] which allows him to do the following: [list] [*] Given three non-collinear marked points, draw the circle passing through them. [*] Given two marked points, draw the circle with them as endpoints of a diameter. [*] Mark any intersection points of two drawn circles or mark a new point on a drawn circle. [/list] Show that given two marked points, Euclid can draw a circle centered at one of them and passing through the other, using only the cyclos. [i]Proposed by Rohan Goyal, Anant Mudgal, and Daniel Hu[/i]

If $f(x)=e^xg(x)$, where $g(2)=1$ and $g'(2)=2$, find $f'(2)$.

Four distinct points are marked in a line. For each point, the sum of the distances from said point to the other three is calculated; getting in total 4 numbers. Decide whether these 4 numbers can be, in some order: a) $29,29,35,37$ b) $28,29,35,37$ c) $28,34,34,37$

Given is a board $n \times n$ and in every square there is a checker. In one move, every checker simultaneously goes to an adjacent square (two squares are adjacent if they share a common side). In one square there can be multiple checkers. Find the minimum and the maximum number of covered cells for $n=5, 6, 7$.

Find the best approximation of $\sqrt{3}$ by a rational number with denominator less than or equal to $15$

Let $f : \mathbb{R} \to \mathbb{R}$ be a function whose second derivative is continuous. Suppose that $f$ and $f''$ are bounded. Show that $f'$ is also bounded.

Let $ABC$ be a triangle with $ \angle ACB = 90^o + \frac12 \angle ABC$ . The point $M$ is the midpoint of the side $BC$ . A circle with center at vertex $A$ intersects the line $BC$ at points $M$ and $D$. Prove that $MD = AB$.

An ordinary clock in a factory is running slow so that the minute hand passes the hour hand at the usual dial position($12$ o'clock, etc.) but only every $69$ minutes. At time and one-half for overtime, the extra pay to which a $\textdollar 4.00$ per hour worker should be entitled after working a normal $8$ hour day by that slow running clock, is $\textbf{(A) }\textdollar 2.30\qquad\textbf{(B) }\textdollar 2.60\qquad\textbf{(C) }\textdollar 2.80\qquad\textbf{(D) }\textdollar 3.00\qquad \textbf{(E) }\textdollar 3.30$

Find all functions $R-->R$ such that: $f(x^2) - f(y^2) + 2x + 1 = f(x + y)f(x - y)$

Two teams, $ A$ and $ B$, fight for a territory limited by a circumference. $ A$ has $ n$ blue flags and $ B$ has $ n$ white flags ($ n\geq 2$, fixed). They play alternatively and $ A$ begins the game. Each team, in its turn, places one of his flags in a point of the circumference that has not been used in a previous play. Each flag, once placed, cannot be moved. Once all $ 2n$ flags have been placed, territory is divided between the two teams. A point of the territory belongs to $ A$ if the closest flag to it is blue, and it belongs to $ B$ if the closest flag to it is white. If the closest blue flag to a point is at the same distance than the closest white flag to that point, the point is neutral (not from $ A$ nor from $ B$). A team wins the game is their points cover a greater area that that covered by the points of the other team. There is a draw if both cover equal areas. Prove that, for every $ n$, team $ B$ has a winning strategy.

Let $ABC$ be an acute triangle inscribed in a circle of center $O$. If the altitudes $BD,CE$ intersect at $H$ and the circumcenter of $\triangle BHC$ is $O_1$, prove that $AHO_1O$ is a parallelogram.

Let $n\geqslant 2$ be a positive integer and $a_1,a_2, \ldots ,a_n$ be real numbers such that \[a_1+a_2+\dots+a_n=0.\] Define the set $A$ by \[A=\left\{(i, j)\,|\,1 \leqslant i<j \leqslant n,\left|a_{i}-a_{j}\right| \geqslant 1\right\}\] Prove that, if $A$ is not empty, then \[\sum_{(i, j) \in A} a_{i} a_{j}<0.\]

Find the maximum number of cells that can be coloured from a $4\times 3000$ board such that no tetromino is formed. [i]Proposed by Arian Zamani, Matin Yousefi[/i] [b]Rated 5[/b]

Let $a_1, a_2, \ldots , a_n, \ldots $ be a sequence of real numbers such that $0 \leq a_n \leq 1$ and $a_n - 2a_{n+1} + a_{n+2} \geq 0$ for $n = 1, 2, 3, \ldots$. Prove that \[0 \leq (n + 1)(a_n - a_{n+1}) \leq 2 \qquad \text{ for } n = 1, 2, 3, \ldots\]

Find the smallest positive real constant $a$, such that for any three points $A,B,C$ on the unit circle, there exists an equilateral triangle $PQR$ with side length $a$ such that all of $A,B,C$ lie on the interior or boundary of $\triangle PQR$.