A cylindrical hole of radius $r$ is bored through a cylinder of radiues $R$ ($r\leq R$) so that the axes intersect at right angles. i) Show that the area of the larger cylinder which is inside the smaller one can be expressed in the form $$S=8r^2\int_{0}^{1} \frac{1-v^{2}}{\sqrt{(1-v^2)(1-m^2 v^2)}}\;dv,\;\; \text{where} \;\; m=\frac{r}{R}.$$ ii) If $K=\int_{0}^{1} \frac{1}{\sqrt{(1-v^2)(1-m^2 v^2)}}\;dv$ and $E=\int_{0}^{1} \sqrt{\frac{1-m^2 v^2}{1-v^2 }}dv$. show that $$S=8[R^2 E - (R^2 - r^2 )K].$$

For each positive integer $n$, let $S(n)$ be the sum of the digits of $n$. Determines the smallest positive integer $a$ such that there are infinite positive integers $n$ for which you have $S (n) -S (n + a) = 2018$.

For any positive integer $n$, define $$c_n=\min_{(z_1,z_2,...,z_n)\in\{-1,1\}^n} |z_1\cdot 1^{2018} + z_2\cdot 2^{2018} + ... + z_n\cdot n^{2018}|.$$ Is the sequence $(c_n)_{n\in\mathbb{Z}^+}$ bounded?

Regular hexagon $ABCDEF$ has side length $1$. Given that $P$ is a point inside $ABCDEF$, compute the minimum of $AP \sqrt3 + CP + DP + EP\sqrt3$.

A cube is constructed from $4$ white unit cubes and $4$ black unit cubes. How many different ways are there to construct the $2 \times 2 \times 2$ cube using these smaller cubes? (Two constructions are considered the same if one can be rotated to match the other.) $\textbf{(A)}\ 7 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 9 \qquad\textbf{(D)}\ 10 \qquad\textbf{(E)}\ 11$

Let $n$ be a positive integer such that $24\mid n+1$. Prove that the sum of the positive divisors of $n$ is divisble by 24.

Let $n $ be a positive integer. Let $f $ be a function from nonnegative integers to themselves. Let $f (0,i)=f (i,0)=0$, $f (1, 1)=n $, and $ f(i, j)= [\frac {f(i-1,j)}{2}]+ [\frac {f(i, j-1)}{2}] $ for positive integers $i, j$ such that $i*j>1$. Find the number of pairs $(i,j) $ such that $f (i, j) $ is an odd number.( $[x]$ is the floor function).

City of Mar del Plata is a square shaped $WSEN$ land with $2(n + 1)$ streets that divides it into $n \times n$ blocks, where $n$ is an even number (the leading streets form the perimeter of the square). Each block has a dimension of $100 \times 100$ meters. All streets in Mar del Plata are one-way. The streets which are parallel and adjacent to each other are directed in opposite direction. Street $WS$ is driven in the direction from $W$ to $S$ and the street $WN$ travels from $W$ to $N$. A street cleaning car starts from point $W$. The driver wants to go to the point $E$ and in doing so, he must cross as much as possible roads. What is the length of the longest route he can go, if any $100$-meter stretch cannot be crossed more than once? (The figure shows a plan of the city for $n=6$ and one of the possible - but not the longest - routes of the street cleaning car. See http://goo.gl/maps/JAzD too.) [img]http://s14.postimg.org/avfg7ygb5/CPS_2012_P5.jpg[/img]

For positive integer $n$, prove that at least one of the numbers $$A=2n-1 , B=5n-1, C=13n-1$$ is not perfect square

Let $n$ be a positive integer. Let $a_1$, $a_2$, $\ldots\,$, $a_n$ be real numbers such that $-1 \le a_i \le 1$ (for all $1 \le i \le n$). Let $b_1$, $b_2$, $\ldots$, $b_n$ be real numbers such that $-1 \le b_i \le 1$ (for all $1 \le i \le n$). Prove that \[ \left| \prod_{i=1}^n a_i - \prod_{i=1}^n b_i \right| \le \sum_{i = 1}^n \left| a_i - b_i \right| \, . \]

A circular track with diameter $500$ is externally tangent at a point A to a second circular track with diameter $1700.$ Two runners start at point A at the same time and run at the same speed. The first runner runs clockwise along the smaller track while the second runner runs clockwise along the larger track. There is a first time after they begin running when their two positions are collinear with the point A. At that time each runner will have run a distance of $\frac{m\pi}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n. $

line $l$ through the point $A$ from triangle $ABC$ . Point $X$ is on line $l$.${\omega}_b$ and ${\omega}_c$ are circles that through points $X,A$ and respectively tanget to $AB$ adn $AC$. tangets from $B,C$ respectively to ${\omega}_b$ and ${\omega}_c$ meet them in $Y,Z$. Prove that by changing $X$, the circumcircle of the circle $XYZ$ passes through two fixed points. [i]Proposed by Ali Zamani [/i]

A tetrahedron $ABCD$ satisfies $AB=6$, $CD=8$, and $BC=DA=5$. Let $V$ be the maximum value of $ABCD$ possible. If we can write $V^4=2^n3^m$ for some integers $m$ and $n$, find $mn$.

Various points $x_1,..., x_n$ ($n \ge 3$) are randomly located on the $Ox$ axis. Construct all parabolas defined by the monic square trinomials and intersecting the Ox axis at these points (and not intersecting axis at other points). Let$ y = f_1$, $...$ , $y = f_m$ are functions that define these parabolas. Prove that the parabola $y = f_1 +...+ f_m$ intersects the $Ox$ axis at two points.

15 of the cells of a chessboard 8x8 are chosen. We draw the segments which unite the centers of every two of the chosen squares. Prove that among these segments there are four segments which have the same length.

Let $n$ be a natural number. Prove that, \[ \left\lfloor \frac{n}{1} \right\rfloor+ \left\lfloor \frac{n}{2} \right\rfloor + \cdots + \left\lfloor \frac{n}{n} \right\rfloor + \left\lfloor \sqrt{n} \right\rfloor \] is even.

The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was 61 points. How many free throws did they make? $ \textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17 $

Four identical squares and one rectangle are placed together to form one large square as shown. The length of the rectangle is how many times as large as its width? [asy]unitsize(8mm); defaultpen(linewidth(.8pt)); draw(scale(4)*unitsquare); draw((0,3)--(4,3)); draw((1,3)--(1,4)); draw((2,3)--(2,4)); draw((3,3)--(3,4));[/asy]$ \textbf{(A)}\ \frac {5}{4} \qquad \textbf{(B)}\ \frac {4}{3} \qquad \textbf{(C)}\ \frac {3}{2} \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ 3$

Find all ordered triplets $(p,q,r)$ of positive integers such that $p$ and $q$ are two (not necessarily distinct) primes, $r$ is even, and \[p^3+q^2=4r^2+45r+103.\]

Given a simple, connected graph with $n$ vertices and $m$ edges. Prove that one can find at least $m$ ways separating the set of vertices into two parts, such that the induced subgraphs on both parts are connected.

Given that the base-$17$ integer $\overline{8323a02421_{17}}$ (where a is a base-$17$ digit) is divisible by $\overline{16_{10}}$, find $a$. Express your answer in base $10$. [i]Proposed by Jonathan Liu[/i]

Given a table $4\times 4$. a) Find, how $7$ stars can be put in its fields in such a way, that erasing of two arbitrary lines and two columns will always leave at list one of the stars. b) Prove that if there are less than $7$ stars, You can always find two columns and two rows, such, that if you erase them, no star will remain in the table.

A spring has an equilibrium length of $2.0$ meters and a spring constant of $10$ newtons/meter. Alice is pulling on one end of the spring with a force of $3.0$ newtons. Bob is pulling on the opposite end of the spring with a force of $3.0$ newtons, in the opposite direction. What is the resulting length of the spring? (A) $\text{1.7 m}$ (B) $\text{2.0 m}$ (C) $\text{2.3 m}$ (D) $\text{2.6 m}$ (E) $\text{8.0 m}$

We are given a bag of sugar, a two-pan balance, and a weight of $1$ gram. How do we obtain $1$ kilogram of sugar in the smallest possible number of weighings?

For a positive integer $n$ write down all its positive divisors in increasing order: $1=d_1<d_2<\ldots<d_k=n$. Find all positive integers $n$ divisible by $2019$ such that $n=d_{19}\cdot d_{20}$. [i](I. Gorodnin)[/i]