A finite collection of digits $0$ and $1$ is written around a circle. An [i]arc[/i] of length $L\ge 0$ consists of $L$ consecutive digits around the circle. For each arc $w,$ let $Z(w)$ and $N(w)$ denote the number of $0$'s in $w$ and the number of $1$'s in $w,$ respectively. Assume that $|Z(w)-Z(w')|\le 1$ for any two arcs $w,w'$ of the same length. Suppose that some arcs $w_1,\dots,w_k$ have the property that \[Z=\frac1k\sum_{j=1}^kZ(w_j)\text{ and }N=\frac1k\sum_{j=1}^k N(w_j)\] are both integers. Prove that there exists an arc $w$ with $Z(w)=Z$ and $N(w)=N.$

The $n$-element set of real numbers is given, where $n \geq 6$. Prove that there exist at least $n-1$ two-element subsets of this set, in which the arithmetic mean of elements is not less than the arithmetic mean of elements in the whole set.

The 2010 positive numbers $a_1, a_2, \ldots , a_{2010}$ satisfy the inequality $a_ia_j \le i+j$ for all distinct indices $i, j$. Determine, with proof, the largest possible value of the product $a_1a_2\ldots a_{2010}$.

For any $a>0$,set $\mathcal{S}(a)=\{\lfloor{na}\rfloor|n\in \mathbb{N}\}$. Show that there are no three positive reals $a,b,c$ such that \[ \mathcal{S}(a)\cap \mathcal{S}(b)=\mathcal{S}(b)\cap \mathcal{S}(c)=\mathcal{S}(c)\cap \mathcal{S}(a)=\emptyset \] \[ \mathcal{S}(a)\cup \mathcal{S}(b)\cup \mathcal{S}(c)=\mathbb{N} \]

Let $G$ be a directed graph with infinitely many vertices. It is known that for each vertex the outdegree is greater than the indegree. Let $O$ be a fixed vertex of $G$. For an arbitrary positive number $n$, let $V_{n}$ be the number of vertices which can be reached from $O$ passing through at most $n$ edges ( $O$ counts). Find the smallest possible value of $V_{n}$.

Let $n\geq 1$ be an integer and let $X$ be a set of $n^2+1$ positive integers such that in any subset of $X$ with $n+1$ elements there exist two elements $x\neq y$ such that $x\mid y$. Prove that there exists a subset $\{x_1,x_2,\ldots, x_{n+1} \} \in X$ such that $x_i \mid x_{i+1}$ for all $i=1,2,\ldots, n$.

Let $a_1,a_2,a_3,...$ be a sequence of positive real numbers such that: (i) For all positive integers $m,n$, we have $a_{mn}=a_ma_n$ (ii) There exists a positive real number $B$ such that for all positive integers $m,n$ with $m<n$, we have $a_m < Ba_n$ Find all possible values of $\log_{2015}(a_{2015}) - \log_{2014}(a_{2014})$

Given a positive integer $n,$ what is the largest $k$ such that the numbers $1,2,\dots,n$ can be put into $k$ boxes so that the sum of the numbers in each box is the same? [When $n=8,$ the example $\{1,2,3,6\},\{4,8\},\{5,7\}$ shows that the largest $k$ is [i]at least[/i] 3.]

The integers from $1$ to $999999$ are partitioned into two groups: the first group consists of those integers for which the closest perfect square is odd, whereas the second group consists of those for which the closest perfect square is even. In which group is the sum of the elements greater?

Let $x_1,x_2,\dots,x_{31}$ be real numbers. Then find the maximum value can $$\sum_{i,j=1,2,\dots,31, \; i\neq j}{\lceil x_ix_j \rceil }-30\left(\sum_{i=1,2,\dots,31}{\lfloor x_i^2 \rfloor } \right)$$ achieve. P.S.: For a real number $x$ we denote the smallest integer that does not subseed $x$ by $\lceil x \rceil$ and the biggest integer that does not exceed $x$ by $\lfloor x \rfloor$. For example $\lceil 2.7 \rceil=3$, $\lfloor 2.7 \rfloor=2$ and $\lfloor 4 \rfloor=\lceil 4 \rceil=4$

Let $f(x, y) = \left\lfloor \frac{5x}{2y} \right\rfloor + \left\lceil \frac{5y}{2x} \right\rceil$. Suppose $x, y$ are chosen independently uniformly at random from the interval $(0, 1]$. Let $p$ be the probability that $f(x, y) < 6$. If $p$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$, compute $m + n$. (Note: $\lfloor x\rfloor $ is defined as the greatest integer less than or equal to $x$ and $\lceil x \rceil$ is defined as the least integer greater than or equal to$ x$.)

Given a positive integer $n,$ what is the largest $k$ such that the numbers $1,2,\dots,n$ can be put into $k$ boxes so that the sum of the numbers in each box is the same? [When $n=8,$ the example $\{1,2,3,6\},\{4,8\},\{5,7\}$ shows that the largest $k$ is [i]at least[/i] 3.]

Compute the sum of all positive real numbers $x \le 5$ satisfying $$x =\frac{ \lceil x^2 \rceil + \lceil x \rceil \cdot \lfloor x \rfloor}{ \lceil x\rceil + \lfloor x \rfloor}$$

Let $n$ be a positive integer. Let $\mathcal{F}$ be a family of sets that contains more than half of all subsets of an $n$-element set $X$. Prove that from $\mathcal{F}$ we can select $\lceil \log_2 n \rceil + 1$ sets that form a separating family on $X$, i.e., for any two distinct elements of $X$ there is a selected set containing exactly one of the two elements. Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?f=41&t=614827&hilit=Schweitzer+2014+separating

Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\] is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.) [i]Russia[/i]

Each one of 2009 distinct points in the plane is coloured in blue or red, so that on every blue-centered unit circle there are exactly two red points. Find the gratest possible number of blue points.

It is known that a certain mechanical balance can measure any object of integer mass anywhere between 1 and 2009 (both included). This balance has $k$ weights of integral values. What is the minimum $k$ for which there exist weights that satisfy this condition?

Show that $\lceil (\sqrt{3}+1)^{2n})\rceil$ is divisible by $2^{n+1}.$

A convex pentagon $ABCDE$ satisfies that the sidelengths and $AC,AD\leq \sqrt 3.$ Let us choose $2011$ distinct points inside this pentagon. Prove that there exists an unit circle with centre on one edge of the pentagon, and which contains at least $403$ points out of the $2011$ given points. {Edited} {I posted it correctly before but because of a little confusion deleted the sidelength part, sorry.}

Let $n$ be a positive integer. Daniel and Merlijn are playing a game. Daniel has $k$ sheets of paper lying next to each other on a table, where $k$ is a positive integer. On each of the sheets, he writes some of the numbers from $1$ up to $n$ (he is allowed to write no number at all, or all numbers). On the back of each of the sheets, he writes down the remaining numbers. Once Daniel is finished, Merlijn can flip some of the sheets of paper (he is allowed to flip no sheet at all, or all sheets). If Merlijn succeeds in making all of the numbers from $1$ up to n visible at least once, then he wins. Determine the smallest $k$ for which Merlijn can always win, regardless of Daniel’s actions.

Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\] is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.) [i]Russia[/i]

[b]Problem 3.[/b] Let $n\geq 3$ is given natural number, and $M$ is the set of the first $n$ primes. For any nonempty subset $X$ of $M$ with $P(X)$ denote the product of its elements. Let $N$ be a set of the kind $\ds\frac{P(A)}{P(B)}$, $A\subset M, B\subset M, A\cap B=\emptyset$ such that the product of any 7 elements of $N$ is integer. What is the maximal number of elements of $N$? [i]Alexandar Ivanov[/i]

Find all real numbers $x$ such that $x\lfloor x\lfloor x\lfloor x\rfloor\rfloor\rfloor=88$. The notation $\lfloor x\rfloor$ means the greatest integer less than or equal to $x$.

Thirty people sit at a round table. Each of them is either smart or dumb. Each of them is asked: "Is your neighbor to the right smart or dumb?" A smart person always answers correctly, while a dumb person can answer both correctly and incorrectly. It is known that the number of dumb people does not exceed $F$. What is the largest possible value of $F$ such that knowing what the answers of the people are, you can point at at least one person, knowing he is smart?

Suppose $x$ is a random real number between $1$ and $4$, and $y$ is a random real number between $1$ and $9$. If the expected value of \[ \left\lceil \log_2 x \right\rceil - \left\lfloor \log_3 y \right\rfloor \] can be expressed as $\frac mn$ where $m$ and $n$ are relatively prime positive integers, compute $100m + n$. [i]Proposed by Lewis Chen[/i]