Suppose there are several juice boxes, one of which is poisoned. You have $n$ guinea pigs to test the boxes. The testing happens in the following way: [list] [*] At each round, you can have the guinea pigs taste any number of juice boxes. [*] Conversely, a juice box can be tasted by any number of guinea pigs. [*] After the round ends, any guinea pigs who tasted the poisoned juice die. [/list] Suppose you have to find the poisoned juice box in at most $k$ rounds. What is the maximum number of juice boxes such that it is possible?

Points $A$, $B$, and $O$ lie in the plane such that $\measuredangle AOB = 120^\circ$. Circle $\omega_0$ with radius $6$ is constructed tangent to both $\overrightarrow{OA}$ and $\overrightarrow{OB}$. For all $i \ge 1$, circle $\omega_i$ with radius $r_i$ is constructed such that $r_i < r_{i - 1}$ and $\omega_i$ is tangent to $\overrightarrow{OA}$, $\overrightarrow{OB}$, and $\omega_{i - 1}$. If \[ S = \sum_{i = 1}^\infty r_i, \] then $S$ can be expressed as $a\sqrt{b} + c$, where $a, b, c$ are integers and $b$ is not divisible by the square of any prime. Compute $100a + 10b + c$. [i]Proposed by Aaron Lin[/i]

The figure below shows a semicircle inscribed in a right triangle. [asy] draw((0, 0) -- (15, 0) -- (0, 8) -- cycle); real r = 120 / 23; real theta = -aTan(8/15); draw(arc((r, r), r, theta + 180, theta + 360)); [/asy] The triangle has legs of length 8 and 15. The semicircle is tangent to the two legs, and its diameter is on the hypotenuse. What is the radius of the semicircle?

Let $N$ be the positive integer $7777\ldots777$, a $313$-digit number where each digit is a $7$. Let $f(r)$ be the leading digit of the $r{ }$th root of $N$. What is$$f(2) + f(3) + f(4) + f(5)+ f(6)?$$ $(\textbf{A})\: 8\qquad(\textbf{B}) \: 9\qquad(\textbf{C}) \: 11\qquad(\textbf{D}) \: 22\qquad(\textbf{E}) \: 29$

The "Sea battle" game. a) You are trying to find the $4$-field ship -- a rectangle $1x4$, situated on the $7x7$ playing board. You are allowed to ask a question, whether it occupies the particular field or not. How many questions is it necessary to ask to find that ship surely? b) The same question, but the ship is a connected (i.e. its fields have common sides) set of $4$ fields.

Two circles with radius $2$, $\omega_1$ and $\omega_2$, are centered at $O_1$ and $O_2$ respectively. The circles $\omega_1$ and $\omega_2$ are externally tangent to each other and internally tangent to a larger circle $\omega$ centered at $O$ at points $A$ and $B$, respectively. Let $M$ be the midpoint of minor arc $AB$. Let $P$ be the intersection of $\omega_1$ and $O_1M$, and let $Q$ be the intersection of $\omega_2$ and $O_2M$. Given that there is a point $R$ on $\omega$ such that $\triangle PQR$ is equilateral, the radius of $\omega$ can be written as $\frac{a+\sqrt{b}}{c}$ where $a$, $b$, and $c$ are positive integers and $a$ and $c$ are relatively prime. Find $a+b+c$.

Let $R$ be a ring where $\forall a\in R: a^2=0$. Prove that $abc+abc=0$ for all $a,b,c\in R$.

Let $n>1$ be an integer. Hippo chooses a list of $n$ points in the plane $P_1, \dots, P_n$; some of these points may coincide, but not all of them can be identical. After this, Wombat picks a point from the list $X$ and measures the distances from it to the other $n-1$ points in the list. The average of the resulting $n-1$ numbers will be denoted $m(X)$. Find all values of $n$ for which Hippo can prepare the list in such a way, that for any point $X$ Wombat may pick, he can point to a point $Y$ from the list such that $XY=m(X)$.

Determine all functions $f: \mathbb R \to \mathbb R$, such that $$ f (f (x + y) - f (x - y)) = xy$$ for all real $x$ and $y$.

For any positive integer $n$, let $D_n$ denote the greatest common divisor of all numbers of the form $a^n + (a + 1)^n + (a + 2)^n$ where $a$ varies among all positive integers. (a) Prove that for each $n$, $D_n$ is of the form $3^k$ for some integer $k \ge 0$. (b) Prove that, for all $k\ge 0$, there exists an integer $n$ such that $D_n = 3^k$.

For prime number $q$ the polynomial $P(x)$ with integer coefficients is said to be factorable if there exist non-constant polynomials $f_q,g_q$ with integer coefficients such that all of the coefficients of the polynomial $Q(x)=P(x)-f_q(x)g_q(x)$ are dividable by $q$ ; and we write: $$P(x)\equiv f_q(x)g_q(x)\pmod{q}$$ For example the polynomials $2x^3+2,x^2+1,x^3+1$ can be factored modulo $2,3,p$ in the following way: $$\left\{\begin{array}{lll} X^2+1\equiv (x+1)(-x+1)\pmod{2}\\ 2x^3+2\equiv (2x-1)^3\pmod{3}\\ X^3+1\equiv (x+1)(x^2-x+1) \end{array}\right.$$ Also the polynomial $x^2-2$ is not factorable modulo $p=8k\pm 3$. a) Find all prime numbers $p$ such that the polynomial $P(x)$ is factorable modulo $p$: $$P(x)=x^4-2x^3+3x^2-2x-5$$ b) Does there exist irreducible polynomial $P(x)$ in $\mathbb{Z}[x]$ with integer coefficients such that for each prime number $p$ , it is factorable modulo $p$?

[b]E[/b]milia wishes to create a basic solution with 7% hydroxide (OH) ions. She has three solutions of different bases available: 10% rubidium hydroxide (Rb(OH)), 8% cesium hydroxide (Cs(OH)), and 5% francium hydroxide (Fr(OH)). (The Rb(OH) solution has both 10% Rb ions and 10% OH ions, and similar for the other solutions.) Since francium is highly radioactive, its concentration in the final solution should not exceed 2%. What is the highest possible concentration of rubidium in her solution?

Suppose $P(x)$ is a degree $n$ monic polynomial with integer coefficients such that $2013$ divides $P(r)$ for exactly $1000$ values of $r$ between $1$ and $2013$ inclusive. Find the minimum value of $n$.

A square of size $2\times2$ with one of its cells occupied by a tower is called a castle. What maximal number of castles one can place on a board of size $7\times7$ so that the castles have no common cells and all the towers stand on the diagonals of the board?

Let be the sequence $ \left( J_n \right)_{n\ge 1} , $ where $ J_n=\int_{(1+n)^2}^{1+(1+n)^2} \sqrt{\frac{x-1-n-n^2}{x-1}} dx. $ [b]a)[/b] Study its monotony. [b]b)[/b] Calculate $ \lim_{n\to\infty } J_n\sqrt{n} . $ [i]Ion Bursuc[/i]

Let $I$ be the incenter of an acute triangle $ABC$. Assume that $K_1$ is the point such that $AK_1 \perp BC$ and the circle with center $K_1$ of radius $K_1A$ is internally tangent to the incircle of triangle $ABC$ at $A_1$. The points $B_1, C_1$ are defined similarly. a) Prove that $AA_1, BB_1, CC_1$ are concurrent at a point $P$. b) Let $\omega_1,\omega_2,\omega_3$ be the excircles of triangle $ABC$ with respect to $A, B, C$, respectively. The circles $\gamma_1,\gamma_2\gamma_3$ are the reflections of $\omega_1,\omega_2,\omega_3$ with respect to the midpoints of $BC, CA, AB$, respectively. Prove that P is the radical center of $\gamma_1,\gamma_2,\gamma_3$.

The edges of a regular tetrahedron with vertices $A ,~ B,~ C$, and $D$ each have length one. Find the least possible distance between a pair of points $P$ and $Q$, where $P$ is on edge $AB$ and $Q$ is on edge $CD$. $\textbf{(A) }\frac{1}{2}\qquad\textbf{(B) }\frac{3}{4}\qquad\textbf{(C) }\frac{\sqrt{2}}{2}\qquad\textbf{(D) }\frac{\sqrt{3}}{2}\qquad\textbf{(E) }\frac{\sqrt{3}}{3}$ [asy] size(150); import patterns; pair D=(0,0),C=(1,-1),B=(2.5,-0.2),A=(1,2),AA,BB,CC,DD,P,Q,aux; add("hatch",hatch()); //AA=new A and etc. draw(rotate(100,D)*(A--B--C--D--cycle)); AA=rotate(100,D)*A; BB=rotate(100,D)*D; CC=rotate(100,D)*C; DD=rotate(100,D)*B; aux=midpoint(AA--BB); draw(BB--DD); P=midpoint(AA--aux); aux=midpoint(CC--DD); Q=midpoint(CC--aux); draw(AA--CC,dashed); dot(P); dot(Q); fill(DD--BB--CC--cycle,pattern("hatch")); label("$A$",AA,W); label("$B$",BB,S); label("$C$",CC,E); label("$D$",DD,N); label("$P$",P,S); label("$Q$",Q,E); //Credit to TheMaskedMagician for the diagram [/asy]

Given that $\tbinom{n}{k}=\tfrac{n!}{k!(n-k)!}$, the value of $$\sum_{n=3}^{10}\frac{\binom{n}{2}}{\binom{n}{3}\binom{n+1}{3}}$$ can be written in the form $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$.

What is the enclosed area between the graph of $y=\lfloor 10x \rfloor + \sqrt{1-x^2}$ in the interval $[0,1]$ and the $x$ axis?

[u]Set 2[/u] [b]2.1[/b] A school has $50$ students and four teachers. Each student has exactly one teacher, such that two teachers have $10$ students each and the other two teachers have $15$ students each. You survey each student in the school, asking the number of classmates they have (not including themself or the teacher). What is the average of all $50$ responses? [b]2.2[/b] Let $T$ be the answer from the previous problem. A ball is thrown straight up from the ground, reaching (maximum) height $T+1$. Then the ball bounces on the ground and rebounds to height $T-1$. The ball continues bouncing indefinitely, and the height of each bounce is $r$ times the height of the previous bounce for some constant $r$. What is the total vertical distance that the ball travels? [b]2.3[/b] Let $T$ be the answer from the previous problem. The polynomial equation $$x^3 + x^2 - (T + 1)x + (T- 1) = 0$$ has one (integer) solution for x which does not depend on $T$ and two solutions for $x$ which do depend on $T$. Find the greatest solution for $x$ in this equation. (Hint: Find the independent solution for $x$ while you wait for $T$.) PS. You should use hide for answers.

Two convex polygons have a total of 33 sides and 243 diagonals. Find the number of diagonals in the polygon with the greater number of sides.

The graph shows the distribution of the number of children in the families of the students in Ms. Jordan's English class. The median number of children in the family for this distribution is [asy] unitsize(12); for(int i = 1; i <= 7; ++i) { draw((0,i)--(19,i),dotted); draw((-0.5,i)--(0.5,i)); } for(int i = 0; i <= 5; ++i) { draw((3*i+2,0)--(3*i+2,-0.5)); } fill((1,0)--(1,2)--(3,2)--(3,0)--cycle,white); fill((4,0)--(4,1)--(6,1)--(6,0)--cycle,white); fill((7,0)--(7,2)--(9,2)--(9,0)--cycle,white); fill((10,0)--(10,2)--(12,2)--(12,0)--cycle,white); fill((13,0)--(13,6)--(15,6)--(15,0)--cycle,white); draw((0,9)--(0,0)--(19,0)); draw((1,0)--(1,2)--(3,2)--(3,0)); draw((4,0)--(4,1)--(6,1)--(6,0)); draw((7,0)--(7,2)--(9,2)--(9,0)); draw((10,0)--(10,2)--(12,2)--(12,0)); draw((13,0)--(13,6)--(15,6)--(15,0)); label("$1$",(2,-0.5),S); label("$2$",(5,-0.5),S); label("$3$",(8,-0.5),S); label("$4$",(11,-0.5),S); label("$5$",(14,-0.5),S); label("$6$",(17,-0.5),S); label("$2$",(-0.5,2),W); label("$4$",(-0.5,4),W); label("$6$",(-0.5,6),W); label("$\textbf{Number of Children}$",(9,-1.5),S); label("$\textbf{in the Family}$",(9,-2.5),S); label("$\textbf{Number}$",(-1.5,6),W); label("$\textbf{of}$",(-3,5),W); label("$\textbf{Families}$",(-1.5,4),W); [/asy] $\text{(A)}\ 1 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 3 \qquad \text{(D)}\ 4 \qquad \text{(E)}\ 5$

Find all polynomials $ P $ with integer coefficients that have the property that for any natural number $ n $ the polynomial $ P-n $ has at least a root whose square is integer.

Determine the number of positive integers $n$ satisfying: [list] [*] $n<10^6$ [*] $n$ is divisible by 7 [*] $n$ does not contain any of the digits 2,3,4,5,6,7,8. [/list]

Consider a polyhedron having $100$ edges. (a) Find the maximal possible number of its edges which can be intersected by a plane (not containing any vertices of the polyhedron) if the polyhedron is convex. (b) Prove that for a non-convex polyhedron this number i. can be as great as $96$, ii. cannot be as great as $100$. (A Andjans, Riga