Scientists perform an experiment on a colony of bacteria with an initial population of $32$. The scientists expose the bacteria to alternating rounds of light and darkness. They first put the bacteria in a bright environment for one hour before placing it in a dark room for the second hour, and then repeating this process. Because they are vulnerable to light, the population of the bacteria will be halved in one hour of exposure to sunlight. However, in one hour of darkness, the population triples. How many hours will it take for the bacteria’s population to exceed $150$? $\textbf{(A) }\text{between }4\text{ and }5\qquad\textbf{(B) }\text{between }5\text{ and }6\qquad\textbf{(C) }\text{between }6\text{ and }7\qquad\textbf{(D) }\text{between }7\text{ and }8\qquad\textbf{(E) }\text{between }8\text{ and }9$

For a multiple of $ kb$ of $ b$ let $ a \% kb$ be the greatest number such that $ a \% kb \equal{} a \bmod b$ which is smaller than $ kb$ and not greater than $ a$ itself. Let $ n \in \mathbb{Z}^ \plus{} .$ Determine all integer pairs $ (a,b)$ with: \[ a\%b \plus{} a\%2b \plus{} a\%3b \plus{} \ldots \plus{} a\%nb \equal{} a \plus{} b \]

A [i]triangulation[/i] $ \mathcal{T}$ of a polygon $ P$ is a finite collection of triangles whose union is $ P,$ and such that the intersection of any two triangles is either empty, or a shared vertex, or a shared side. Moreover, each side of $ P$ is a side of exactly one triangle in $ \mathcal{T}.$ Say that $ \mathcal{T}$ is [i]admissible[/i] if every internal vertex is shared by $ 6$ or more triangles. For example [asy] size(100); dot(dir(-100)^^dir(230)^^dir(160)^^dir(100)^^dir(50)^^dir(5)^^dir(-55)); draw(dir(-100)--dir(230)--dir(160)--dir(100)--dir(50)--dir(5)--dir(-55)--cycle); pair A = (0,-0.25); dot(A); draw(A--dir(-100)^^A--dir(230)^^A--dir(160)^^A--dir(100)^^A--dir(5)^^A--dir(-55)^^dir(5)--dir(100)); [/asy] Prove that there is an integer $ M_n,$ depending only on $ n,$ such that any admissible triangulation of a polygon $ P$ with $ n$ sides has at most $ M_n$ triangles.

Given $a_1, a_2, ... , a_n$. Define $$b_k = \frac{a_1 + a_2 + ... + a_k}{k}$$ for $1 \le k\le n.$ Let $$C = (a_1 - b_1)^2 + (a_2 - b_2)^2 + ... + (a_n - b_n)^2, D = (a_1 - b_n)^2 + (a_2 - b_n)^2 + ... + (a_n - b_n)^2$$ Prove that $C \le D \le 2C$.

Three friends are to divide five different jobs between each other so that nobody is left without a job. In how many different ways can this be done? A. 6 B. 25 C. 40 D. 90 E. 150

A red ball and a green ball are randomly and independently tossed into bins numbered with positive integers so that for each ball, the probability that it is tossed into bin $k$ is $2^{-k}$ for $k=1,2,3,\ldots.$ What is the probability that the red ball is tossed into a higher-numbered bin than the green ball? $\textbf{(A) } \frac{1}{4} \qquad\textbf{(B) } \frac{2}{7} \qquad\textbf{(C) } \frac{1}{3} \qquad\textbf{(D) } \frac{3}{8} \qquad\textbf{(E) } \frac{3}{7}$

Find all integers $x,y$ which satisfy the equation $xy=20-3x+y$.

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ that satisfy the conditions \[f(1+xy)-f(x+y)=f(x)f(y) \quad \text{for all } x,y \in \mathbb{R},\] and $f(-1) \neq 0$.

Find all functions $f: \mathbb{R}\to{R}$ such that for any $a<b$, $f([a,b])$ is an interval of length $b-a$

Let $ p$ be an odd prime number. How many $ p$-element subsets $ A$ of $ \{1,2,\dots,2p\}$ are there, the sum of whose elements is divisible by $ p$?

If $a,b,c>0$, what is the smallest possible value of $ \left\lfloor \dfrac {a+b}{c} \right\rfloor + \left\lfloor \dfrac {b+c}{a} \right\rfloor + \left\lfloor \dfrac {c+a}{b} \right\rfloor $? (Note that $ \lfloor x \rfloor $ denotes the greatest integer less than or equal to $x$.)

A triangle $ ABC$ is given. Let $ B_1$ be the reflection of $ B$ across the line $ AC$, $ C_1$ the reflection of $ C$ across the line $ AB$, and $ O_1$ the reflection of the circumcentre of $ ABC$ across the line $ BC$. Prove that the circumcentre of $ AB_1C_1$ lies on the line $ AO_1$. [i]Proposed by A. Akopyan[/i]

What fraction of the Earth's volume lies above the $45$ degrees north parallel? You may assume the Earth is a perfect sphere. The volume in question is the smaller piece that we would get if the sphere were sliced into two pieces by a plane.

With $150$ white cubes of $1 \times 1 \times 1$ a prism of $6 \times 5 \times 5$ is assembled, its six faces are painted blue and then the prism is disassembled. Lucrecia must build a new prism, without holes, exclusively using cubes that have at least one blue face and so that the faces of Lucrecia's prism are all completely blue. Give the dimensions of the prism with the largest volume that Lucrecia can assemble.

For a natural number $ n\ge 2, $ prove that the $ \text{n-ary} $ direct product of the group of order $ 2 $ is abelian and isomorphic with the group of the power set of a set under symmetric difference.

Let $x, y$ be real numbers such that $1\le x^2-xy+y^2\le2$. Show that: a) $\dfrac{2}{9}\le x^4+y^4\le 8$; b) $x^{2n}+y^{2n}\ge\dfrac{2}{3^n}$, for all $n\ge3$. [i]Laurențiu Panaitopol[/i] and [i]Ioan Tomescu[/i]

Given an acute-angled $\vartriangle AB$C with altitude $AH$ ( $\angle BAC > 45^o > \angle AB$C). The perpendicular bisector of $AB$ intersects $BC$ at point $D$. Let $K$ be the midpoint of $BF$, where $F$ is the foot of the perpendicular from $C$ on $AD$. Point $H'$ is the symmetric to $H$ wrt $K$. Point $P$ lies on the line $AD$, such that $H'P \perp AB$. Prove that $AK = KP$.

Let $ABC$ be a triangle with circumcircle $\Omega$. $X$ and $Y$ are points on $\Omega$ such that $XY$ meets $AB$ and $AC$ at $D$ and $E$, respectively. Show that the midpoints of $XY$, $BE$, $CD$, and $DE$ are concyclic. [i]Carl Lian.[/i]

Show that for all reals $x,y,z$, we have $$\left(x^2+3\right)\left(y^2+3\right)\left(z^2+3\right)\ge(xyz+x+y+z+4)^2.$$

Let $\{x_n\}$ be a sequence of real numbers in the interval $[0,1)$. Prove that there exists a sequence $1 < n_1 < n_2 < n_3 < \cdots$ of positive integers such that the following limit exists $$\lim_{i,j \to \infty} x_{n_i+n_j}. $$ That is, there exists a real number $L$ such that for every $\epsilon > 0,$ there exists a positive integer $N$ such that if $i,j > N$, then $|x_{n_i+n_j}-L| < \epsilon.$

Let $h(x,y)$ be a real-valued function that is twice continuously differentiable throughout $\mathbb{R}^2$, and define \[ \rho (x,y)=yh_x -xh_y . \] Prove or disprove: For any positive constants $d$ and $r$ with $d>r$, there is a circle $S$ of radius $r$ whose center is a distance $d$ away from the origin such that the integral of $\rho$ over the interior of $S$ is zero.

Determine all functions $f : \mathbb{R} \to \mathbb{R}$ such that $$ f(2f(x) + y) = f(f(x) - f(y)) + 2y + x, $$ for all $x,y \in \mathbb{R}.$

Let a sequence be defined as follows: $a_0=1$, and for $n>0$, $a_n$ is $\tfrac{1}{3}a_{n-1}$ and is $\tfrac{1}{9}a_{n-1}$ with probability $\tfrac{1}{2}$. If the expected value of $\textstyle\sum_{n=0}^{\infty}a_n$ can be expressed in simplest form as $\tfrac{p}{q}$, what is $p+q$?

Q. An automatic cleaner of the disc shape has passed along a plain floor. For each point of its circular boundary there exists a straight line that has contained this point all the time. Is it necessarily true that the center of the disc stayed on some straight line all the time? ($9$ marks)

Let $a>0$ and $x_1,x_2,x_3$ be real numbers with $x_1+x_2+x_3=0$. Prove that $$\log_2\left(1+a^{x_1}\right)+\log_2\left(1+a^{x_2}\right)+\log_2\left(1+a^{x_3}\right)\ge3.$$