The polynomial $P(x) = 3x^3 -2x^2 +ax+b$ has roots $\sin^2 \theta$, $\cos^2 \theta$, and $\sin \theta \cos\theta$ for some angle $\theta$. Compute $P(1)$.

For a set \(S\) of positive integers and a positive integer \(n\), consider the game of [i]\((n,S)\)-nim[/i], which is as follows. A pile starts with \(n\) watermelons. Two players, Deric and Erek, alternate turns eating watermelons from the pile, with Deric going first. On any turn, the number of watermelons eaten must be an element of \(S\). The last player to move wins. Let \(f(S)\) denote the set of positive integers \(n\) for which Deric has a winning strategy in \((n,S)\)-nim. Let \(T\) be a set of positive integers. Must the sequence \[T, \; f(T), \; f(f(T)), \;\ldots\] be eventually constant? [i]Proposed by Brandon Wang and Edward Wan[/i]

Let $M$ be the set of the vertices of a regular hexagon, our Olympiad symbol. How many chains $\emptyset \subset A \subset B \subset C \subset D \subset M$ of six different set, beginning with the empty set and ending with the $M$, are there?

Determine all functions $f : R \to R$ satisfying $f(f(x) + 2y)= 6x + f(f(y) -x)$ for all real numbers $x,y$

An infinite sequence is given by $x_1=2, x_2=7, x_{n+1} = 4x_n - x_{n-1}$ for all $n \geq 2$. Does there exist a perfect square in this sequence? [hide="Remark"]During the test the initial value of $x_1$ was given as $1$, thus the problem was not graded[/hide]

Find the largest and smallest value of the function $$y=\sqrt{7+5\cos x}-\cos x.$$

show that thee is no function f definedonthe positive real numbes such that : $f(y) > (y-x)f(x)^2$

Let $A$ be a fixed point of a circle $\omega$. Let $BC$ be an arbitrary chord of $\omega$ passing through a fixed point $P$. Prove that the nine-points circles of triangles $ABC$ touch some fixed circle not depending on $BC$.

The set $ G$ is defined by the points $ (x,y)$ with integer coordinates, $ 3\le|x|\le7$, $ 3\le|y|\le7$. How many squares of side at least $ 6$ have their four vertices in $ G$? [asy]defaultpen(black+0.75bp+fontsize(8pt)); size(5cm); path p = scale(.15)*unitcircle; draw((-8,0)--(8.5,0),Arrow(HookHead,1mm)); draw((0,-8)--(0,8.5),Arrow(HookHead,1mm)); int i,j; for (i=-7;i<8;++i) { for (j=-7;j<8;++j) { if (((-7 <= i) && (i <= -3)) || ((3 <= i) && (i<= 7))) { if (((-7 <= j) && (j <= -3)) || ((3 <= j) && (j<= 7))) { fill(shift(i,j)*p,black); }}}} draw((-7,-.2)--(-7,.2),black+0.5bp); draw((-3,-.2)--(-3,.2),black+0.5bp); draw((3,-.2)--(3,.2),black+0.5bp); draw((7,-.2)--(7,.2),black+0.5bp); draw((-.2,-7)--(.2,-7),black+0.5bp); draw((-.2,-3)--(.2,-3),black+0.5bp); draw((-.2,3)--(.2,3),black+0.5bp); draw((-.2,7)--(.2,7),black+0.5bp); label("$-7$",(-7,0),S); label("$-3$",(-3,0),S); label("$3$",(3,0),S); label("$7$",(7,0),S); label("$-7$",(0,-7),W); label("$-3$",(0,-3),W); label("$3$",(0,3),W); label("$7$",(0,7),W);[/asy]$ \textbf{(A)}\ 125\qquad \textbf{(B)}\ 150\qquad \textbf{(C)}\ 175\qquad \textbf{(D)}\ 200\qquad \textbf{(E)}\ 225$

Let $L$ be a figure made of $3$ squares, a right isosceles triangle and a quarter circle (all unit sized) as shown below: [img]https://wiki-images.artofproblemsolving.com//f/f9/Weirwiueripo.png[/img] Prove that any $18$ points in the plane can be covered with copies of $L$, which don't overlap (copies of $L$ may be rotated or flipped)

Positive real numbers $a_1, \dots, a_k, b_1, \dots, b_k$ are given. Let $A = \sum_{i = 1}^k a_i, B = \sum_{i = 1}^k b_i$. Prove the inequality \[ \left( \sum_{i = 1}^k \frac{a_i b_i}{a_i B + b_i A} - 1 \right)^2 \ge \sum_{i = 1}^k \frac{a_i^2}{a_i B + b_i A} \cdot \sum_{i = 1}^k \frac{b_i^2}{a_i B + b_i A}. \]

Consider the circle $\gamma$ with center at point $(0,3)$ and radius $3$, and a line $r$ parallel to the axis $Ox$ at a distance $3$ from the origin. A variable line through the origin meets $\gamma$ at point $M$ and $r$ at point $P$. Find the locus of the intersection point of the lines through $M$ and $P$ parallel to $Ox$ and $Oy$ respectively.

$a_1 + a_2 + ... + a_n = 0$, for some $k$ we have $a_j \le 0$ for $j \le k$ and $a_j \ge 0$ for $j > k$. If ai are not all $0$, show that $a_1 + 2a_2 + 3a_3 + ... + na_n > 0$.

Given $n \in N$, let $A$ be a family of subsets of $\{1,2,...,n\}$. If for every two sets $B,C \in A$ the set $(B \cup C) -(B \cap C)$ has an even number of elements, find the largest possible number of elements of $A$ .

Find all triples $(x,y, z)$ of real numbers such that $x^2 + y^2 + z^2 + 1 = xy + yz + zx + |x - 2y + z|$.

Let $O$ be the circumcenter of an acute-angled triangle $ABC$ with ${\angle B<\angle C}$. The line $AO$ meets the side $BC$ at $D$. The circumcenters of the triangles $ABD$ and $ACD$ are $E$ and $F$, respectively. Extend the sides $BA$ and $CA$ beyond $A$, and choose on the respective extensions points $G$ and $H$ such that ${AG=AC}$ and ${AH=AB}$. Prove that the quadrilateral $EFGH$ is a rectangle if and only if ${\angle ACB-\angle ABC=60^{\circ }}$. [i]Proposed by Hojoo Lee, Korea[/i]

You are at a point $(a,b)$ and you need to reach another point $(c,d)$. Both points are below the line $x = y$ and have integer coordinates. You can move in steps of length 1, either upwards of to the right, but you may not move to a point on the line $x = y$. How many different paths are there?

Determine the positive numbers $a{}$ for which the following statement true: for any function $f:[0,1]\to\mathbb{R}$ which is continuous at each point of this interval and for which $f(0)=f(1)=0$, the equation $f(x+a)-f(x)=0$ has at least one solution. [i]Proposed by I. Yaglom[/i]

A blackboard contains 68 pairs of nonzero integers. Suppose that for each positive integer $k$ at most one of the pairs $(k, k)$ and $(-k, -k)$ is written on the blackboard. A student erases some of the 136 integers, subject to the condition that no two erased integers may add to 0. The student then scores one point for each of the 68 pairs in which at least one integer is erased. Determine, with proof, the largest number $N$ of points that the student can guarantee to score regardless of which 68 pairs have been written on the board.

Let $A$ and $B$ be two sets such that $A \cup B$ is the set of the positive integers, and $A \cap B$ is the empty set. It is known that if two positive integers have a prime larger than $2013$ as their difference, then one of them is in $A$ and the other is in $B$. Find all the possibilities for the sets $A$ and $B$.

Find the number of positive integers $n$ between $1$ and $1000$, inclusive, satisfying \[ \lfloor \sqrt{n - 1} \rfloor + 1 = \left\lfloor \sqrt{n + \sqrt{n} + 1}\right\rfloor\] where $\lfloor n \rfloor$ denotes the greatest integer not exceeding $n$.

[b]7.[/b] Let $a_0$ and $a_1$ be arbitrary real numbers, and let $a_{n+1}=a_n + \frac{2}{n+1}a_{n-1}$ $(n= 1, 2, \dots)$ Show that the sequence $\left (\frac{a_n}{n^2} \right )_{n=1}^{\infty}$ is convergent and find its limit. [b](S. 10)[/b]

Let $n$ a positive integer. In a $2n\times 2n$ board, $1\times n$ and $n\times 1$ pieces are arranged without overlap. Call an arrangement [b]maximal[/b] if it is impossible to put a new piece in the board without overlapping the previous ones. Find the least $k$ such that there is a [b]maximal[/b] arrangement that uses $k$ pieces.

Some squares of a $n \times n$ tabel ($n>2$) are black, the rest are withe. In every white square we write the number of all the black squares having at least one common vertex with it. Find the maximum possible sum of all these numbers.

Consider an isosceles triangle $ABC$ ($AB = BC$). Let $D$ be on $BC$ such that $AD \perp BC$ and $O$ be a circle with diameter $BC$. Suppose that segment $AD$ intersects circle $O$ at $E$. If $CA = 2$ what is $CE$?