Suppose that $a,b,c,d\in\mathbb{R}$ and $f(x)=ax^3+bx^2+cx+d$ such that $f(2)+f(5)<7<f(3)+f(4)$. Prove that there exists $u,v\in\mathbb{R}$ such that $u+v=7 , f(u)+f(v)=7$

Two ants are moving along the edges of a convex polyhedron. The route of every ant ends in its starting point, so that one ant does not pass through the same point twice along its way. On every face $F$ of the polyhedron are written the number of edges of $F$ belonging to the route of the first ant and the number of edges of $F$ belonging to the route of the second ant. Is there a polyhedron and a pair of routes described as above, such that only one face contains a pair of distinct numbers? [i]Proposed by Nikolai Beluhov[/i]

Along a circle are $100$ white points. An integer $k$ is given, where $2 \le k \le 50$. In each move, we choose a block of $k$ adjacent points such that the first and the last are white, and we paint both of them black. For which values of $k$ is it possible for us to paint all $100$ points black after $50$ moves?

Let $ I_n\equal{}\int_0^{\sqrt{3}} \frac{1}{1\plus{}x^{n}}\ dx\ (n\equal{}1,\ 2,\ \cdots)$. (1) Find $ I_1,\ I_2$. (2) Find $ \lim_{n\to\infty} I_n$.

Positive integer $k(\ge 8)$ is given. Prove that if there exists a pair of positive integers $(x,y)$ that satisfies the conditions below, then there exists infinitely many pairs $(x,y)$. (1) $ $ $x\mid y^2-3, y\mid x^2-2$ (2) $ $ $gcd\left(3x+\frac{2(y^2-3)}{x},2y+\frac{3(x^2-2)}{y}\right)=k$ $ $

Let $n\geq 2$ be an integer. Let $a_{ij}, \ i,j=1,2,\ldots,n$ be $n^2$ positive real numbers satisfying the following conditions: [list=1] [*]For all $i=1,\ldots,n$ we have $a_{ii}=1$ and, [*]For all $j=2,\ldots,n$ the numbers $a_{ij}, \ i=1,\ldots, j-1$ form a permutation of $1/a_{ji}, \ i=1,\ldots, j-1.$ [/list] Given that $S_i=a_{i1}+\cdots+a_{in}$, determine the maximum value of the sum $1/S_1+\cdots+1/S_n.$

In the spherical shaped planet $X$ there are $2n$ gas stations. Every station is paired with one other station , and every two paired stations are diametrically opposite points on the planet. Each station has a given amount of gas. It is known that : if a car with empty (large enough) tank starting from any station it is always to reach the paired station with the initial station (it can get extra gas during the journey). Find all naturals $n$ such that for any placement of $2n$ stations for wich holds the above condotions, holds: there always a gas station wich the car can start with empty tank and go to all other stations on the planet.(Consider that the car consumes a constant amount of gas per unit length.)

A regular $n$-gon has $135$ diagonals. What is the measure of its exterior angle, in degrees? (An exterior angle is the supplement of an interior angle.)

For a positive integer $n$ define $S_n=1!+2!+\ldots +n!$. Prove that there exists an integer $n$ such that $S_n$ has a prime divisor greater than $10^{2012}$.

Let $\Gamma_B$ and $\Gamma_C$ be excircles of an acute-angled triangle $ABC$ opposite to its vertices $B$ and $C$, respectively. Let $C_1$ and $L$ be the tangent points of $\Gamma_C$ and the side $AB$ and the line $BC$ respectively. Let $B_1$ and $M$ be the tangent points of $\Gamma_B$ and the side $AC$ and the line $BC$, respectively. Let $X$ be the point of intersection of the lines $LC_1$ and $MB_1$. Prove that $AX$ is equal to the inradius of the triangle $ABC$. (A. Voidelevich)

Consider a $3k \times 3k$ square grid (where $k$ is a positive integer), the cells in the grid are coordinated in terms of columns and rows: Cell $(i, j)$ is at the $i^{\text{th}}$ column from left to right and the $j^{\text{th}}$ row from bottom up. We want to place $4k$ marbles in the cells of the grid, with each cell containing at most one marble, such that - Each row and each column has at least one marble - For each marble, there is another marble placed on the same row or column with that marble. a) Assume $k=1$. Determine the number of ways to place the marbles to satisfy the above conditions (Two ways to place marbles are different if there is a cell $(i, j)$ having a marble placed in one way but not in the other way). b) Assume $k \geq 1$. Find the largest positive integer $N$ such that if we mark any $N$ cells on the board, there is always a way to place $4k$ marbles satisfying the above conditions such that none of the marbles are placed on any of the marked cells.

Let $\omega$ be the circumcircle of the acute nonisosceles triangle $\Delta ABC$. Point $P$ lies on the altitude from $A$. Let $E$ and $F$ be the feet of the altitudes from P to $CA$, $BA$ respectively. Circumcircle of triangle $\Delta AEF$ intersects the circle $\omega$ in $G$, different from $A$. Prove that the lines $GP$, $BE$ and $CF$ are concurrent.

Consider $n \geq 2 $ positive numbers $0<x_1 \leq x_2 \leq ... \leq x_n$, such that $x_1 + x_2 + ... + x_n = 1$. Prove that if $x_n \leq \dfrac{2}{3}$, then there exists a positive integer $1 \leq k \leq n$ such that $\dfrac{1}{3} \leq x_1+x_2+...+x_k < \dfrac{2}{3}$.

The coefficients $a,b,c$ of a polynomial $f:\mathbb{R}\to\mathbb{R}, f(x)=x^3+ax^2+bx+c$ are mutually distinct integers and different from zero. Furthermore, $f(a)=a^3$ and $f(b)=b^3.$ Determine $a,b$ and $c$.

Given that \[ \frac 1{2!17!}+\frac 1{3!16!}+\frac 1{4!15!}+\frac 1{5!14!}+\frac 1{6!13!}+\frac 1{7!12!}+\frac 1{8!11!}+\frac 1{9!10!}=\frac N{1!18!} \] find the greatest integer that is less than $\frac N{100}.$

Let $a$,$b$,$c$ be real numbers. Let $z_{1}$,$z_{2}$,$z_{3}$ be complex numbers such that $|z_{k}|=1$ $(k=1,2,3)$ $~$ and $~$ $\frac{z_{1}}{z_{2}}+\frac{z_{2}}{z_{3}}+\frac{z_{3}}{z_{1}}=1$ Find $|az_{1}+bz_{2}+cz_{3}|$.