A network is a simple directed graph such that each edge $ e$ has two intger lower and upper capacities $ 0\leq c_l(e)\leq c_u(e)$. A circular flow on this graph is a function such that: 1) For each edge $ e$, $ c_l(e)\leq f(e)\leq c_u(e)$. 2) For each vertex $ v$: \[ \sum_{e\in v^\plus{}}f(e)\equal{}\sum_{e\in v^\minus{}}f(e)\] a) Prove that this graph has a circular flow, if and only if for each partition $ X,Y$ of vertices of the network we have: \[ \sum_{\begin{array}{c}{e\equal{}xy}\\{x\in X,y\in Y}\end{array}} c_l(e)\leq \sum_{\begin{array}{c}{e\equal{}yx}\\{y\in Y,x\in X}\end{array}} c_l(e)\] b) Suppose that $ f$ is a circular flow in this network. Prove that there exists a circular flow $ g$ in this network such that $ g(e)\equal{}\lfloor f(e)\rfloor$ or $ g(e)\equal{}\lceil f(e)\rceil$ for each edge $ e$.

Let $ a$, $ b$, $ c$ be positive reals such that $ a^4 \plus{} b^4 \plus{} c^4 \equal{} 3$. Prove that $ \sum\frac1{4 \minus{} ab}\leq1$, where the $ \sum$ sign stands for cyclic summation. [i]Alternative formulation:[/i] For any positive reals $ a$, $ b$, $ c$ satisfying $ a^4 \plus{} b^4 \plus{} c^4 \equal{} 3$, prove the inequality $ \frac{1}{4\minus{}bc}\plus{}\frac{1}{4\minus{}ca}\plus{}\frac{1}{4\minus{}ab}\leq 1$.

For each positive integer $n$ let $a_n$ be the largest positive integer satisfying \[(a_n)!\left| \prod_{k=1}^n \left\lfloor \frac{n}{k}\right\rfloor\right.\] Show that there are infinitely many positive integers $m$ for which $a_{m+1}<a_m$.

Consider functions $\, f: [0,1] \rightarrow \mathbb{R} \,$ which satisfy (i) $f(x) \geq 0 \,$ for all $\, x \,$ in $\, [0,1],$ (ii) $f(1) = 1,$ (iii) $f(x) + f(y) \leq f(x+y)\,$ whenever $\, x, \, y, \,$ and $\, x + y \,$ are all in $\, [0,1]$. Find, with proof, the smallest constant $\, c \,$ such that \[ f(x) \leq cx \] for every function $\, f \,$ satisfying (i)-(iii) and every $\, x \,$ in $\, [0,1]$.

Suppose that \[x_1+1=x_2+2=x_3+3=\cdots=x_{2008}+2008=x_1+x_2+x_3+\cdots+x_{2008}+2009.\] Find the value of $\left\lfloor|S|\right\rfloor$, where $S=\displaystyle\sum_{n=1}^{2008}x_n$.

The semicircle with centre $O$ and the diameter $AC$ is divided in two arcs $AB$ and $BC$ with ratio $1: 3$. $M$ is the midpoint of the radium $OC$. Let $T$ be the point of arc $BC$ such that the area of the cuadrylateral $OBTM$ is maximum. Find such area in fuction of the radium.

Let $\mathbb{N}_{\ge 1}$ be the set of positive integers. Find all functions $f \colon \mathbb{N}_{\ge 1} \to \mathbb{N}_{\ge 1}$ such that, for all positive integers $m$ and $n$: (a) $n = \left(f(2n)-f(n)\right)\left(2 f(n) - f(2n)\right)$, (b)$f(m)f(n) - f(mn) = \left(f(2m)-f(m)\right)\left(2 f(n) - f(2n)\right) + \left(f(2n)-f(n)\right)\left(2 f(m) - f(2m)\right)$, (c) $m-n$ divides $f(2m)-f(2n)$ if $m$ and $n$ are distinct odd prime numbers.

How many integers between $100$ and $999$, inclusive, have the property that some permutation of its digits is a multiple of $11$ between $100$ and $999$? For example, both $121$ and $211$ have this property. $ \textbf{(A) }226\qquad \textbf{(B) } 243 \qquad \textbf{(C) } 270 \qquad \textbf{(D) }469\qquad \textbf{(E) } 486$

Find the number of subsets of ${1,2,3,...,10}$ that contain exactly one pair of consecutive integers. Examples of such subsets are ${1,2,5}$ and ${1,3,6,7,10}$.

Let $a, b, c$ be positive reals such that $abc=1$. Show that \[\frac{1}{a^5(b+2c)^2} + \frac{1}{b^5(c+2a)^2} + \frac{1}{c^5(a+2b)^2} \ge \frac{1}{3}.\]

Parallelogram $ABCD$ is such that angle $B < 90$ and $AB<BC$. Points E and F are on the circumference of $\omega$ inscribing triangle ABC, such that tangents to $\omega$ in those points pass through D. If $\angle EDA= \angle{FDC}$, find $\angle{ABC}$.

$100$ deputies formed $450$ commissions. Each two commissions has no more than three common deputies, and every $5$ - no more than one. Prove that, that there are $4$ commissions that has exactly one common deputy each.

What is the smallest number ? (A) $3$ (B) $2^{\sqrt2}$ (C) $2^{1+\frac{1}{\sqrt2}}$ (D) $2^{\frac12} + 2^{\frac23}$ (E) $2^{\frac53}$

Circles $A, B$, and $C$ each have radius $r$, and their centers are the vertices of an equilateral triangle of side length $6r$. Two lines are drawn, one tangent to $A$ and $C$ and one tangent to $B$ and $C$, such that $A$ is on the opposite side of each line from $B$ and $C$. Find the sine of the angle between the two lines. [img]http://4.bp.blogspot.com/-IZv8q-3NYZg/XXmrroy2PnI/AAAAAAAAKxg/jSOcOOQ8Kyw0EwHUifXJ1jOd2ENAo1FfACK4BGAYYCw/s200/2008%2Bpumac%2Bb6.png[/img]

A minus sign is placed on one square of a $5 \times 5$ board and plus signs are placed on the remaining squares. A move is to select a $2 \times 2, 3 \times 3, 4 \times 4$ or $5 \times 5$ square and change all the signs in it. Which initial positions allow a series of moves to change all the signs to plus?

Suppose that $a_1,...,a_{15}$ are prime numbers forming an arithmetic progression with common difference $d > 0$ if $a_1 > 15$ show that $d > 30000$

Real numbers $a, b, c, x, y, z$ satisfy $$\begin{aligned} \begin{cases} a^2+2bc=x^2+2yz,\\ b^2+2ca=y^2+2zx,\\ c^2+2ab=z^2+2xy.\\ \end{cases} \end{aligned}$$ Prove that $a^2+b^2+c^2=x^2+y^2+z^2$.

Determine all real numbers $\alpha$ with the property that all numbers in the sequence $\cos\alpha,\cos2\alpha,\cos2^2\alpha,\ldots,\cos2^n\alpha,\ldots$ are negative.

What maximal area can have a triangle if its sides $a,b,c$ satisfy inequality $0\le a\le 1\le b\le 2\le c\le 3$ ?

Determine all $k$ for which there exists a natural number n such that $1^n + 2^n + 3^n + 4^n$ with exactly $k$ zeros at the end.

A pair of positive integers $(m,n)$ is called [i]compatible[/i] if $m \ge \tfrac{1}{2} n + 7$ and $n \ge \tfrac{1}{2} m + 7$. A positive integer $k \ge 1$ is called [i]lonely[/i] if $(k,\ell)$ is not compatible for any integer $\ell \ge 1$. Find the sum of all lonely integers. [i]Proposed by Evan Chen[/i]

$a_1,a_2,...,a_{2014}$ is a permutation of $1,2,3,...,2014$. What is the greatest number of perfect squares can have a set ${ a_1^2+a_2,a_2^2+a_3,a_3^2+a_4,...,a_{2013}^2+a_{2014},a_{2014}^2+a_1 }?$

Let $r, s \geq 1$ be integers and $a_{0}, a_{1}, . . . , a_{r-1}, b_{0}, b_{1}, . . . , b_{s-1} $ be real non-negative numbers such that $(a_0+a_1x+a_2x^2+. . .+a_{r-1}x^{r-1}+x^r)(b_0+b_1x+b_2x^2+. . .+b_{s-1}x^{s-1}+x^s) =1 +x+x^2+. . .+x^{r+s-1}+x^{r+s}$. Prove that each $a_i$ and each $b_j$ equals either $0$ or $1$.

Determine all values $\alpha\in\mathbb R$ with the following property: if positive numbers $(x,y,z)$ satisfy the inequality \[x^2+y^2+z^2\le\alpha(xy+yz+zx),\] then $x,y,z$ are sides of a triangle.

An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A [i]beam[/i] is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions: [list=] [*]The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot {2020}^2$ possible positions for a beam.) [*]No two beams have intersecting interiors. [*]The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam. [/list] What is the smallest positive number of beams that can be placed to satisfy these conditions? [i]Proposed by Alex Zhai[/i]