A monic quadratic polynomial $f$ with integer coefficients attains prime values at three consecutive integer points.show that it attains a prime value at some other integer point as well.

Let $(a_n)^{\infty}_{n =1}$ be a sequence of positive integers with $a_1 < a_2 < a_3 < ...$ , and for n = 1, 2, 3,..., $$a_{2n} = a_n + n.$$ Furthermore, whenever $n$ is prime, so is $a_n$. Prove that $a_n = n$.

$\frac{\sin 10^\circ + \sin 20^\circ}{\cos 10^\circ + \cos 20^\circ}$ equals A. $\tan 10^\circ + \tan 20^\circ$ B. $\tan 30^\circ$ C. $\frac{1}{2} (\tan 10^\circ + \tan 20^\circ)$ D. $\tan 15^\circ$ E. $\frac{1}{4} \tan 60^\circ$

For any $n,T \geq 2, n, T \in \mathbb{N}$, find all $a \in \mathbb{N}$ such that $\forall a_i > 0, i = 1, 2, \ldots, n$, we have \[\sum^n_{k=1} \frac{a \cdot k + \frac{a^2}{4}}{S_k} < T^2 \cdot \sum^n_{k=1} \frac{1}{a_k},\] where $S_k = \sum^k_{i=1} a_i.$

Let $q$ be an odd positive integer, and let $N_q$ denote the number of integers $a$ such that $0<a<q/4$ and $\gcd(a,q)=1.$ Show that $N_q$ is odd if and only if $q$ is of the form $p^k$ with $k$ a positive integer and $p$ a prime congruent to $5$ or $7$ modulo $8.$

Points $A$ and $B$ are fixed on a circle $c_1$. Circle $c_2$, whose centre lies on $c_1$, touches line $AB$ at $B$. Another line through $A$ intersects $c_2$ at points $D$ and $E$, where $D$ lies between $A$ and $E$. Line $BD$ intersects $c_1$ again at $F$. Prove that line $EB$ is tangent to $c_1$ if and only if $D$ is the midpoint of the segment $BF$.

Let $f(x)$ be a polynomial of degree $n$ with real coefficients, having $n$ (not necessarily distinct) real roots. Prove that for all real $x$, $$f(x)f''(x)\le f'(x)^2.$$

On $\triangle ABC$ if there existed a point $D$ in $AC$ such that $\angle CBD=\angle ABD+60$ and $\angle BDC=30$ and $AB \cdot BC=BD^2$, then find the angles inside the triangle $\triangle ABC$

Initially we have a $2 \times 2$ table with at least one grain of wheat on each cell. In each step we may perform one of the following two kinds of moves: $i.$ If there is at least one grain on every cell of a row, we can take away one grain from each cell in that row. $ii.$ We can double the number of grains on each cell of an arbitrary column. a) Show that it is possible to reach the empty table using the above moves, starting from the position down below. b) Show that it is possible to reach the empty table from any starting position. c) Prove that the same is true for the $8 \times 8$ tables as well.

$(FRA 5)$ Let $\alpha(n)$ be the number of pairs $(x, y)$ of integers such that $x+y = n, 0 \le y \le x$, and let $\beta(n)$ be the number of triples $(x, y, z)$ such that$ x + y + z = n$ and $0 \le z \le y \le x.$ Find a simple relation between $\alpha(n)$ and the integer part of the number $\frac{n+2}{2}$ and the relation among $\beta(n), \beta(n -3)$ and $\alpha(n).$ Then evaluate $\beta(n)$ as a function of the residue of $n$ modulo $6$. What can be said about $\beta(n)$ and $1+\frac{n(n+6)}{12}$? And what about $\frac{(n+3)^2}{6}$? Find the number of triples $(x, y, z)$ with the property $x+ y+ z \le n, 0 \le z \le y \le x$ as a function of the residue of $n$ modulo $6.$What can be said about the relation between this number and the number $\frac{(n+6)(2n^2+9n+12)}{72}$?

Let $A$ and $B$ be sets with $2011^2$ and $2010$ elements, respectively. Show that there is a function $f:A \times A \to B$ satisfying the condition $f(x,y)=f(y,x)$ for all $(x,y) \in A \times A$ such that for every function $g:A \to B$ there exists $(a_1,a_2) \in A \times A$ with $g(a_1)=f(a_1,a_2)=g(a_2)$ and $a_1 \neq a_2.$

(a) Some vertices of a dodecahedron are to be marked so that each face contains a marked vertex. What is the smallest number of marked vertices for which this is possible? (b) Answer the same question, but for an icosahedron. (G. Galperin, Moscow) (Recall that a dodecahedron has $12$ pentagonal faces which meet in threes at each vertex, while an icosahedron has $20$ triangular faces which meet in fives at each vertex.)

4. A square can be divided into four congruent figures as shown: [asy] size(2cm); draw((0,0)--(2,0)--(2,2)--(0,2)--cycle); draw((1,0)--(1,2)); draw((0,1)--(2,1)); [/asy] For how many $n$ with $1 \le n \le 100$ can a unit square be divided into $n$ congruent figures? 5. If $x + 2y - 3z = 7$ and $2x - y + 2z = 6$, determine $8x + y$. 6. Let $ABCD$ be a rectangle, and let $E$ and $F$ be points on segment $AB$ such that $AE = EF = FB$. If $CE$ intersects the line $AD$ at $P$, and $PF$ intersects $BC$ at $Q$, determine the ratio of $BQ$ to $CQ$.

There are some markets in a city. Some of them are joined by one-way streets, such that for any market there are exactly two streets to leave it. Prove that the city may be partitioned into $1014$ districts such that streets join only markets from different districts, and by the same one-way for any two districts (either only from first to second, or vice-versa).

$ABCD$ is a trapezium such that $AB\parallel DC$ and $\frac{AB}{DC}=\alpha >1$. Suppose $P$ and $Q$ are points on $AC$ and $BD$ respectively, such that \[\frac{AP}{AC}=\frac{BQ}{BD}=\frac{\alpha -1}{\alpha+1}\] Prove that $PQCD$ is a parallelogram.

Let $a,b,c,d$ be positive real numbers such that $ 2(a+b+c+d)\ge abcd $. Prove that \[ a^2+b^2+c^2+d^2 \ge abcd .\]

There are $n$ $(n \ge 3)$ players in a table tennis tournament, in which any two players have a match. Player $A$ is called not out-performed by player $B$, if at least one of player $A$'s losers is not a $B$'s loser. Determine, with proof, all possible values of $n$, such that the following case could happen: after finishing all the matches, every player is not out-performed by any other player.

All cells of $2015 \times 2015$ table colored in one of $4$ colors. We count number of ways to place one tetris T-block in table. Prove that T-block has cell of all $4$ colors in less than $51\%$ of total number of ways.

Does there exist a set $ M$ with the following properties? [i](i)[/i] The set $ M$ consists of 1992 natural numbers. [i](ii)[/i] Every element in $ M$ and the sum of any number of elements have the form $ m^k$ $ (m, k \in \mathbb{N}, k \geq 2).$

Let $f:\mathbb{N}\mapsto\mathbb{R}$ be the function \[f(n)=\sum_{k=1}^\infty\dfrac{1}{\operatorname{lcm}(k,n)^2}.\] It is well-known that $f(1)=\tfrac{\pi^2}6$. What is the smallest positive integer $m$ such that $m\cdot f(10)$ is the square of a rational multiple of $\pi$?

Let $\triangle ABC$ have $AB = 1$ cm, $BC = 2$ cm and $AC = \sqrt{3}$ cm. Points $D$, $E$ and $F$ lie on segments $AB$, $AC$ and $BC$ respectively are such that $AE = BD$ and $BF = AD$. The angle bisector of $\angle BAC$ intersects the circumcircle of $\triangle ADE$ for the second time at $M$ and the angle bisector of $\angle ABC$ intersects the circumcircle of $\triangle BDF$ at $N$. Determine the length of $MN$.

What is the sum of all positive integers less than $30$ divisible by $2, 3$, or $5$?

In a circle, parallel chords of lengths 2, 3, and 4 determine central angles of $\alpha$, $\beta$, and $\alpha + \beta$ radians, respectively, where $\alpha + \beta < \pi$. If $\cos \alpha$, which is a positive rational number, is expressed as a fraction in lowest terms, what is the sum of its numerator and denominator?

Point $P$ lies inside of parallelogram $ABCD$. Perpendicular lines to $PA,PB,PC$ and $PD$ through $A,B,C$ and $D$ construct convex quadrilateral $XYZT$. Prove that $S_{XYZT}\geq 2S_{ABCD}$. [i]Proposed by Siamak Ahmadpour[/i]

Prove that if a natural number $n$ is greater than $4$ and is not a prime number, then the produxt of the consecutive natural numbers from $1$ to $n-1$ is divisible by $ n$.