The road ministry has assigned $80$ informal companies to repair $2400$ roads. These roads connect $100$ cities to each other. Each road is between $2$ cities and there is at most $1$ road between every $2$ cities. We know that each company repairs $30$ roads that it has agencies in each $2$ ends of them. Prove that there exists a city in which $8$ companies have agencies.

Find the number of elements that a set $B$ can have, contained in $(1, 2, ... , n)$, according to the following property: For any elements $a$ and $b$ on $B$ ($a \ne b$), $(a-b) \not| (a+b)$.

Let $P_1$ be a regular $n$-gon, where $n\in\mathbb{N}$. We construct $P_2$ as the regular $n$-gon whose vertices are the midpoints of the edges of $P_1$. Continuing analogously, we obtain regular $n$-gons $P_3,P_4,\ldots ,P_m$. For $m\ge n^2-n+1$, find the maximum number $k$ such that for any colouring of vertices of $P_1,\ldots ,P_m$ in $k$ colours there exists an isosceles trapezium $ABCD$ whose vertices $A,B,C,D$ have the same colour. [i]Radu Ignat[/i]

There is a sequence with $a(2)=0$, $a(3)=1$ and $a(n)=a\left(\left\lfloor\dfrac n2\right\rfloor\right)+a\left(\left\lceil\dfrac n2\right\rceil\right)$ for $n\geq 4$. Find $a(2014)$. [Note that $\left\lfloor\dfrac n2\right\rfloor$ and $\left\lceil\dfrac n2\right\rceil$ denote the floor function (largest integer $\leq\tfrac n2$) and the ceiling function (smallest integer $\geq\tfrac n2$), respectively.]

Find $\lim_{n\to\infty} \int_0^1 |\sin nx|^3dx\ (n=1,\ 2,\ \cdots).$ [i]2010 Kyoto Institute of Technology entrance exam/Textile, 2nd exam[/i]

Let $n$ be an integer greater than 2, and $P_1, P_2, \cdots , P_n$ distinct points in the plane. Let $\mathcal S$ denote the union of all segments $P_1P_2, P_2P_3, \dots , P_{n-1}P_{n}$. Determine if it is always possible to find points $A$ and $B$ in $\mathcal S$ such that $P_1P_n \parallel AB$ (segment $AB$ can lie on line $P_1P_n$) and $P_1P_n = kAB$, where (1) $k = 2.5$; (2) $k = 3$.

Let $(a_{n})_{n \ge 1}$ be a sequence of integers satisfying the inequality \[ 0\le a_{n-1}+\frac{1-\sqrt{5}}{2}a_{n}+a_{n+1} <1 \] for all $n \ge 2$. Prove that the sequence $(a_{n})$ is periodic. Any Hints or Sols for this hard problem?? :help:

Let $n$ be a positive integer. For any positive integer $j$ and positive real number $r$, define $f_j(r)$ and $g_j(r)$ by \[f_j(r) = \min (jr, n) + \min\left(\frac{j}{r}, n\right), \text{ and } g_j(r) = \min (\lceil jr\rceil, n) + \min \left(\left\lceil\frac{j}{r}\right\rceil, n\right),\] where $\lceil x\rceil$ denotes the smallest integer greater than or equal to $x$. Prove that \[\sum_{j=1}^n f_j(r)\leq n^2+n\leq \sum_{j=1}^n g_j(r)\] for all positive real numbers $r$.

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]

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 $n\ge 2$ is a given integer , $x_1,x_2,\ldots,x_n $ be real numbers such that $(1) x_1+x_2+\ldots+x_n=0 $, $(2) |x_i|\le 1$ $(i=1,2,\cdots,n)$. Find the maximum of Min$\{|x_1-x_2|,|x_2-x_3|,\cdots,|x_{n-1}-x_n|\}$.

Let $A$ be the largest subset of $\{1,\dots,n\}$ such that for each $x\in A$, $x$ divides at most one other element in $A$. Prove that \[\frac{2n}3\leq |A|\leq \left\lceil \frac{3n}4\right\rceil. \]

Determine all positive real numbers $a$ such that there exists a positive integer $n$ and partition $A_1$, $A_2$, ..., $A_n$ of infinity sets of the set of the integers satisfying the following condition: for every set $A_i$, the positive difference of any pair of elements in $A_i$ is at least $a^i$.

$X$ has $n$ elements. $F$ is a family of subsets of $X$ each with three elements, such that any two of the subsets have at most one element in common. Show that there is a subset of $X$ with at least $\sqrt{2n}$ members which does not contain any members of $F$.

Let $k>1$ be an integer, set $n=2^{k+1}$. Prove that for any positive integers $a_1<a_2<\cdots<a_n$, the number $\prod_{1\leq i<j\leq n}(a_i+a_j)$ has at least $k+1$ different prime divisors.

Isabel wants to partition the set $\mathbb{N}$ of the positive integers into $n$ disjoint sets $A_{1}, A_{2}, \ldots, A_{n}$. Suppose that for each $i$ with $1\leq i\leq n$, given any positive integers $r, s\in A_{i}$ with $r\neq s$, we have $r+s\in A_{i}$. If $|A_{j}|=1$ for some $j$, find the greatest positive integer that may belong to $A_{j}$.

Let $ n \ge 2009$ be an integer and define the set: \[ S \equal{} \{2^x|7 \le x \le n, x \in \mathbb{N}\}. \] Let $ A$ be a subset of $ S$ and the sum of last three digits of each element of $ A$ is $ 8$. Let $ n(X)$ be the number of elements of $ X$. Prove that \[ \frac {28}{2009} < \frac {n(A)}{n(S)} < \frac {82}{2009}. \]

1 - Prove that $55 < (1+\sqrt{3})^4 < 56$ . 2 - Find the largest power of $2$ that divides $\lceil(1+\sqrt{3})^{2n}\rceil$ for the positive integer $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})$

Let $n$ be a positive integer and $A=\{ 1,2,\ldots ,n\}$. A subset of $A$ is said to be connected if it consists of one element or several consecutive elements. Determine the maximum $k$ for which there exist $k$ distinct subsets of $A$ such that the intersection of any two of them is connected.

A tournament on $2k$ vertices contains no $7$-cycles. Show that its vertices can be partitioned into two sets, each with size $k$, such that the edges between vertices of the same set do not determine any $3$-cycles. [i]Calvin Deng.[/i]

Given a positive integer $n\ge 3$, colour each cell of an $n\times n$ square array with one of $\lfloor (n+2)^2/3\rfloor$ colours, each colour being used at least once. Prove that there is some $1\times 3$ or $3\times 1$ rectangular subarray whose three cells are coloured with three different colours. [i](Russia) Ilya Bogdanov, Grigory Chelnokov, Dmitry Khramtsov[/i]

Let $X_1$, $X_2$, ..., $X_{2012}$ be chosen independently and uniformly at random from the interval $(0,1]$. In other words, for each $X_n$, the probability that it is in the interval $(a,b]$ is $b-a$. Compute the probability that $\lceil\log_2 X_1\rceil+\lceil\log_4 X_2\rceil+\cdots+\lceil\log_{1024} X_{2012}\rceil$ is even. (Note: For any real number $a$, $\lceil a \rceil$ is defined as the smallest integer not less than $a$.)

Find all real $x$ such that $$\lfloor x \lceil x \rceil \rfloor = 2022.$$ Express your answer in interval notation.

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]