Let $\alpha_1,\alpha_2,\alpha_3$ be three congruent circles that are tangent to each other. A third circle $\beta$ is tangent to them at points $A_1,A_2,A_3$ respectively. Let $P$ be a point on $\beta$ which is different from $A_1,A_2,A_3$. For $i=1,2,3$, let $B_i$ be the second intersection point of the line $PA_i$ with circle $\alpha_i$. Prove that $\Delta B_1B_2B_3$ is equilateral.

In a summer camp that is going to last $n$ weeks, you want to divide the time into $3$ periods so that each period starts on a Monday and ends on a Sunday. The first period will be dedicated to artistic work, the second will be for sports and in the third there will be a technological workshop. During each term, a Monday will be chosen for an expert on the topic of the term to give a talk. Let $C(n)$ be the number of ways in which the activity calendar can be made. (For example, if $n=10$ one way the calendar could be done is by putting the first four weeks for art and the artist talk on the first Monday; the next $5$ weeks could be for sports, with the athlete visit on the fourth Monday of that period; the remaining week would be for the technology workshop and the talk would be on Monday of that week.) Calculate $C(8)$.

Let $S$ be the set of all pairs $(m,n)$ of relatively prime positive integers $m,n$ with $n$ even and $m < n.$ For $s = (m,n) \in S$ write $n = 2^k \cdot n_o$ where $k, n_0$ are positive integers with $n_0$ odd and define \[ f(s) = (n_0, m + n - n_0). \] Prove that $f$ is a function from $S$ to $S$ and that for each $s = (m,n) \in S,$ there exists a positive integer $t \leq \frac{m+n+1}{4}$ such that \[ f^t(s) = s, \] where \[ f^t(s) = \underbrace{ (f \circ f \circ \cdots \circ f) }_{t \text{ times}}(s). \] If $m+n$ is a prime number which does not divide $2^k - 1$ for $k = 1,2, \ldots, m+n-2,$ prove that the smallest value $t$ which satisfies the above conditions is $\left [\frac{m+n+1}{4} \right ]$ where $\left[ x \right]$ denotes the greatest integer $\leq x.$

In MTRP district there are $10$ cities. Bob the builder wants to make roads between cities in such a way so that one can go from one city to the other through exactly one unique path. The government has allotted him a budget of Rs. $20$ and each road requires a positive integer amount (in Rs.) to build. In how many ways he can build such a network of roads? It is known that in the MTRP district, any positive integer amount of rupees can be used to construct a road, and that the full budget is used by Bob in the construction. Write the last two digits of your answer.

Let $a$ be any integer. Prove that there are infinitely many primes $p$ such that \[ p\,|\,n^2+3\qquad\text{and}\qquad p\,|\,m^3-a \] for some integers $n$ and $m$.

Determine the radius of the largest circle which can lie on the ellipsoid $$\frac{x^2 }{a^2 } +\frac{ y^2 }{b^2 } +\frac{z^2 }{c^2 }=1 \;\;\;\; (a>b>c).$$

For $n \geq 3$, let $(b_0, b_1,..., b_{n-1}) = (1, 1, 1, 0, ..., 0).$ Let $C_n = (c_{i, j})$ the $n \times n$ matrix defined by $c_{i, j} = b _{(j -i) \mod n}$. Show that $\det (C_n) = 3$ if $n$ is not a multiple of 3 and $\det (C_n) = 0$ if $n$ is a multiple of 3.

For $a,b \in [1;\infty)$ show that \[ab\leq e^{a-1}+b\ln b\]

$(HUN 5)$ Let $r$ and $m (r \le m)$ be natural numbers and $Ak =\frac{2k-1}{2m}\pi$. Evaluate $\frac{1}{m^2}\displaystyle\sum_{k=1}^{m}\displaystyle\sum_{l=1}^{m}\sin(rA_k)\sin(rA_l)\cos(rA_k-rA_l)$

Let $\gamma$ be the incircle of $\triangle ABC$ (i.e. the circle inscribed in $\triangle ABC$) for which $AB+AC=3BC$. Let the point where $AC$ is tangent to $\gamma$ be $D$. Let the incenter of $I$. Let the intersection of the circumcircle of $\triangle BCI$ with $\gamma$ that is closer to $B$ be $P$. Show that $PID$ is collinear.

Let $a, b,$ and $c$ be positive real numbers such that $ab + bc + ca = 3$. Show that \[ \dfrac{bc}{1 + a^4} + \dfrac{ca}{1 + b^4} + \dfrac{ab}{1 + c^4} \geq \dfrac{3}{2}. \]

Jenny places 100 pennies on a table, 30 showing heads and 70 showing tails. She chooses 40 of the pennies at random (all different) and turns them over. That is, if a chosen penny was showing heads, she turns it to show tails; if a chosen penny was showing tails, she turns it to show heads. At the end, what is the expected number of pennies showing heads?

We define a beehive of order $n$ as follows: a beehive of order 1 is one hexagon To construct a beehive of order $n$, take a beehive of order $n-1$ and draw a layer of hexagons in the exterior of these hexagons. See diagram for examples of $n=2,3$ Initially some hexagons are infected by a virus. If a hexagon has been infected, it will always be infected. Otherwise, it will be infected if at least 5 out of the 6 neighbours are infected. Let $f(n)$ be the minimum number of infected hexagons in the beginning so that after a finite time, all hexagons become infected. Find $f(n)$.

Let $a,b,c,$ and $d$ be real numbers and $k\geq l\geq m$ and $p\geq q\geq r$. Prove that $f(x)=a(x+1)^k (x+2)^p+b(x+1)^l (x+2)^q+c(x+1)^m (x+2)^r-d=0$ has no more than 14 positive roots.

Given a plane $P$ and two fixed points $A$ and $B$ that do not lie in this plane. Denote two points $A'$ and $B'$ on plane $P$ and $M ,N$ the midpoints of the segments $AA'$, $BB'$. a) Determine the locus of the midpoint of the segment MN if the points are $A'$ and $B'$ move arbitrarily in plane $P$. b) A circle $O$ is considered in the plane $P$. Determine the locus $L$ of the midpoint of the segment $MN$ if the points $A'$ and $B'$ lie on the circle $O$ or inside it . c) $A'$ is assumed to be fixed on the circle $O$ or inside it and $B'$ is assumed to be movable inside it , except for $O$. Determine the locus of the point $B'$ such the above certain locus $L$ remains the same . Note: For b) and c) the following cases should be considered: 1. $A'$ and $B'$ are different, 2. $A'$ and $B'$ coincide.

Find all functions $f:\mathbb{R}\to \mathbb{R}$ such that for all real numbers $a,b,$ and $c$: (i) If $a+b+c\ge 0$ then $f(a^3)+f(b^3)+f(c^3)\ge 3f(abc).$ (ii) If $a+b+c\le 0$ then $f(a^3)+f(b^3)+f(c^3)\le 3f(abc).$ [i]Proposed by Ashwin Sah[/i]