Among $33$ balls, there are $2$ radioactive ones. You can put several balls in the detector and it will show if the both radioactive balls are among the balls. What is the smallest number that we have to use the detector so that one can certainly find at least one of the radioactive balls?

Let $ABCDEFG$ be a regular heptagon. If $AC = m$ and $AD = n$, prove that $AB =\frac{mn}{m+n}$.

Let $\triangle ABC$ be scalene, with $BC$ as the largest side. Let $D$ be the foot of the perpendicular from $A$ on side $BC$. Let points $K,L$ be chosen on the lines $AB$ and $AC$ respectively, such that $D$ is the midpoint of segment $KL$. Prove that the points $B,K,C,L$ are concyclic if and only if $\angle BAC=90^{\circ}$.

Diagonals of an isosceles trapezoid $ABCD$ with bases $BC$ and $AD$ are perpendicular. Let $DE$ be the perpendicular from $D$ to $AB$, and let $CF$ be the perpendicular from $C$ to $DE$. Prove that angle $DBF$ is equal to half of angle $FCD$.

A positive integer $k$ is $2014$-ambiguous if the quadratics $x^2+kx+2014$ and $x^2+kx-2014$ both have two integer roots. Compute the number of integers which are $2014$-ambiguous.

Suppose $P (x)$ is a polynomial with real coefficients such that $P (t) = P (1)t^2 + P (P (1))t + P (P (P (1)))$ for all real numbers $t$. Compute the largest possible value of $P(P(P(P(1))))$.

The equation $z(z+i)(z+3i)=2002i$ has a zero of the form $a+bi$, where $a$ and $b$ are positive real numbers. Find $a$. $\textbf{(A) }\sqrt{118}\qquad\textbf{(B) }\sqrt{210}\qquad\textbf{(C) }2\sqrt{210}\qquad\textbf{(D) }\sqrt{2002}\qquad\textbf{(E) }100\sqrt2$

For positive integers $n,$ let $\nu_3 (n)$ denote the largest integer $k$ such that $3^k$ divides $n.$ Find the number of subsets $S$ (possibly containing 0 or 1 elements) of $\{1, 2, \ldots, 81\}$ such that for any distinct $a,b \in S$, $\nu_3 (a-b)$ is even. [i]Author: Alex Zhu[/i] [hide="Clarification"]We only need $\nu_3(a-b)$ to be even for $a>b$. [/hide]

Let $\triangle ABC$ be an acute triangle with circumcenter $O$, and let $Q\neq A$ denote the point on $\odot (ABC)$ for which $AQ\perp BC$. The circumcircle of $\triangle BOC$ intersects lines $AC$ and $AB$ for the second time at $D$ and $E$ respectively. Suppose that $AQ$, $BC$, and $DE$ are concurrent. If $OD=3$ and $OE=7$, compute $AQ$.

Let be the polynomial $ f=X^4+X^2\in\mathbb{Z}_2[X] $ Find: a) its degree.. b) the splitting field of $ f $ c) the Galois group of $ f $ (Galois group of its splitting field)

Given is a board $n \times n$ and in every square there is a checker. In one move, every checker simultaneously goes to an adjacent square (two squares are adjacent if they share a common side). In one square there can be multiple checkers. Find the minimum and the maximum number of covered cells for $n=5, 6, 7$.

Solve the following system of equations in real numbers: \[ \begin{cases} \sqrt{x^2-2x+6}\cdot \log_{3}(6-y) =x \\ \sqrt{y^2-2y+6}\cdot \log_{3}(6-z)=y \\ \sqrt{z^2-2z+6}\cdot\log_{3}(6-x)=z \end{cases}. \]

For positive numbers $a, b, c$ holds $(a + c) (b^2 + a c) = 4a$. Determine the maximum value of $b + c$ and find all triplets of numbers $(a, b, c)$ for which expression takes this value

Consider a set of $16$ points arranged in $4 \times 4$ square grid formation. Prove that if any $7$ of these points are coloured blue, then there exists an isosceles right-angled triangle whose vertices are all blue.

Determine all polynomials $P$ such that for every real number $x$, $P(x)^2 +P(-x) = P(x^2)+P(x)$

Bobo the clown was juggling his spherical cows again when he realized that when he drops a cow is related to how many cows he started off juggling. If he juggles $1$, he drops it after $64$ seconds. When juggling $2$, he drops one after $55$ seconds, and the other $55$ seconds later. In fact, he was able to create the following table: [img]https://cdn.artofproblemsolving.com/attachments/1/0/554a9bace83b4b3595c6012dfdb42409465829.png[/img] He can only juggle up to $22$ cows. To juggle the cows the longest, what number of cows should he start off juggling? How long (in minutes) can he juggle for?

How many multiples of $2005$ are factors of $(2005)^2$?

Let $ S$ be the set of all positive integers whose all digits are $ 1$ or $ 2$. Denote $ T_{n}$ as the set of all integers which is divisible by $ n$, then find all positive integers $ n$ such that $ S\cap T_{n}$ is an infinite set.

$\boxed{\text{A5}}$ Let $x,y,z$ be positive reals. Prove that $(x^2+y+1)(x^2+z+1)(y^2+x+1)(y^2+z+1)(z^2+x+1)(z^2+y+1)\geq (x+y+z)^6$

The sides $x$ and $y$ of a scalene triangle satisfy $x + \frac{2\Delta }{x}=y+ \frac{2\Delta }{y}$ , where $\Delta$ is the area of the triangle. If $x = 60, y = 63$, what is the length of the largest side of the triangle?

[asy]defaultpen(linewidth(.8pt)); pair A = (0,11); pair B = (2,0); pair D = (4,0); pair E = (7,0); pair C = (13,0); label("$A$",A,N); label("$B$",B,SW); label("$C$",C,SE); label("$D$",D,S); label("$E$",E,S); label("$2$",midpoint(B--D),N); label("$3$",midpoint(D--E),NW); label("$6$",midpoint(E--C),NW); draw(A--B--C--cycle); draw(A--D); draw(A--E);[/asy] In triangle $ ABC$ in the adjoining figure, $ AD$ and $ AE$ trisect $ \angle BAC$. The lengths of $ BD$, $ DE$ and $ EC$ are $ 2$, $ 3$, and $ 6$, respectively. The length of the shortest side of $ \triangle ABC$ is $ \textbf{(A)}\ 2\sqrt{10}\qquad \textbf{(B)}\ 11\qquad \textbf{(C)}\ 6\sqrt{6}\qquad \textbf{(D)}\ 6\qquad \textbf{(E)}\ \text{not uniquely determined by the given information}$

Suppose $\{x_n\}$ is a decreasing sequence that $\displaystyle\lim_{n \rightarrow\infty}x_n=0$. Prove that $\sum(-1)^nx_n$ is convergent

Let $n \geq 2023$ be an integer. For each real $x$, we say that $\lfloor x \rceil$ is the closest integer to $x$, and if there are two closest integers then it is the greater of the two. Suppose there is a positive real $a$ such that $$\lfloor an \rceil = n + \bigg\lfloor\frac{n}{a} \bigg\rceil.$$ Show that $|a^2 - a - 1| < \frac{n\varphi+1}{n^2}$.

For a positive integer $ n>2$, let $ \left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a sequence of $ n$ positive reals which is either non-decreasing (this means, we have $ a_{1}\leq a_{2}\leq \ldots \leq a_{n}$) or non-increasing (this means, we have $ a_{1}\geq a_{2}\geq \ldots \geq a_{n}$), and which satisfies $ a_{1}\neq a_{n}$. Let $ x$ and $ y$ be positive reals satisfying $ \frac{x}{y}\geq \frac{a_{1}-a_{2}}{a_{1}-a_{n}}$. Show that: \[ \frac{a_{1}}{a_{2}\cdot x+a_{3}\cdot y}+\frac{a_{2}}{a_{3}\cdot x+a_{4}\cdot y}+\ldots+\frac{a_{n-1}}{a_{n}\cdot x+a_{1}\cdot y}+\frac{a_{n}}{a_{1}\cdot x+a_{2}\cdot y}\geq \frac{n}{x+y}. \]

Eight children, all of different heights, must form an orderly line from smallest to largest. We will say that the row has exactly one error if there is a child that is immediately behind another taller than it, and everyone else (except the first in line) is immediately behind a shorter one. of how many ways the eight children can line up with exactly one mistake?