Treasure was buried in a single cell of an $M\times N$ ($2\le M$, $N$) grid. Detectors were brought to find the cell with the treasure. For each detector, you can set it up to scan a specific subgrid $[a,b]\times[c,d]$ with $1\le a\le b\le M$ and $1\le c\le d\le N$. Running the detector will tell you whether the treasure is in the region or not, though it cannot say where in the region the treasure was detected. You plan on setting up $Q$ detectors, which may only be run simultaneously after all $Q$ detectors are ready. In terms of $M$ and $N$, what is the minimum $Q$ required to gaurantee to determine the location of the treasure?

On the table there are $k \ge 3$ heaps of $1, 2, \dots , k$ stones. In the first step, we choose any three of the heaps, merge them into a single new heap, and remove $1$ stone from this new heap. Thereafter, in the $i$-th step ($i \ge 2$) we merge some three heaps containing more than $i$ stones in total and remove $i$ stones from the new heap. Assume that after a number of steps a single heap of $p$ stones remains on the table. Show that the number $p$ is a perfect square if and only if so are both $2k + 2$ and $3k + 1$. Find the least $k$ with this property.

Marie does three equally time-consuming tasks in a row without taking breaks. She begins the first task at 1:00 PM and finishes the second task at 2:40 PM. When does she finish the third task? $ \textbf{(A) }\text{3:10 PM}\qquad\textbf{(B) }\text{3:30 PM}\qquad\textbf{(C) }\text{4:00 PM}\qquad\textbf{(D) }\text{4:10 PM}\qquad\textbf{(E) }\text{4:30 PM} $

$n$ is a natural number that $\frac{x^{n}+1}{x+1}$ is irreducible over $\mathbb Z_{2}[x]$. Consider a vector in $\mathbb Z_{2}^{n}$ that it has odd number of $1$'s (as entries) and at least one of its entries are $0$. Prove that these vector and its translations are a basis for $\mathbb Z_{2}^{n}$

Show that \[ abc \geq (a+b-c)(b+c-a)(c+a-b) \] for positive reals $a$, $b$, $c$.

Let $n$ be the smallest positive integer such that the number obtained by taking $n$’s rightmost digit (decimal expansion) and moving it to be the leftmost digit is $7$ times $n$. Determine the number of digits in $n$.

Two players $A$ and $B$ play alternatively in a convex polygon with $n \geq 5$ sides. In each turn, the corresponding player has to draw a diagonal that does not cut inside the polygon previously drawn diagonals. A player loses if after his turn, one quadrilateral is formed such that its two diagonals are not drawn. $A$ starts the game. For each positive integer $n$, find a winning strategy for one of the players.

For any non-empty numerical numbers $A$ and $B$, denote $$A + B = \{a + b | a \in A, b \in B\} $$ a) Determine the largest natural number not $p$ with the property: [i] there exists[/i] $A,B \subset N$ [i]such that[/i] $card \, A = card\, B = p$ [i]and [/i] $A+B = \{0, 1, 2,..., 2012\}$ b) Determine the smallest natural number $n$ with the property: [i] there exists[/i] $A,B \subset N$ [i]such that[/i] $card \, A = card\, B $ [i]and [/i] $A+B =\{0, 1, 2,..., 2012\}$

For positive integers $n, m$ define $f(n,m)$ as follows. Write a list of $ 2001$ numbers $a_i$, where $a_1 = m$, and $a_{k+1}$ is the residue of $a_k^2$ $mod \, n$ (for $k = 1, 2,..., 2000$). Then put $f(n,m) = a_1-a_2 + a_3 -a_4 + a_5- ... + a_{2001}$. For which $n \ge 5$ can we find m such that $2 \le m \le n/2$ and $f(m,n) > 0$?

On complex plane, what figure does the set $\{ \overline{Z}^2|\arg Z=\alpha,\alpha\in[0,2\pi)\}$ stands for? $\text{(A)}$ half-line $\arg Z=2\alpha$ $\text{(B)}$ half-line $\arg Z=-2\alpha$ $\text{(C)}$ half-line $\arg Z=\alpha$ $\text{(D)}$ None above

Let $ABC$ be a triangle with $AB < AC$ and let $D{}$ be the other intersection point of the angle bisector of $\angle A$ with the circumcircle of the triangle $ABC$. Let $E{}$ and $F{}$ be points on the sides $AB$ and $AC$ respectively, such that $AE = AF$ and let $P{}$ be the point of intersection of $AD$ and $EF$. Let $M{}$ be the midpoint of $BC{}$. Prove that $AM$ and the circumcircles of the triangles $AEF$ and $PMD$ pass through a common point.

Given an integer $a>1$. Prove that there exists a sequence of positive integers \[ n_1, n_2, n_3, \ldots \] Such that \[ \gcd(a^{n_i+1} + a^{n_i} - 1, \ a^{n_j + 1} + a^{n_j} - 1) =1 \] For every $i \neq j$.

Let $X$ be an arbitrary point inside the circumcircle of a triangle $ABC$. The lines $BX$ and $CX$ meet the circumcircle in points $K$ and $L$ respectively. The line $LK$ intersects $BA$ and $AC$ at points $E$ and $F$ respectively. Find the locus of points $X$ such that the circumcircles of triangles $AFK$ and $AEL$ touch.

A positive integer $N$ has $20$ digits when written in base $9$ and $13$ digits when written in base $27$. How many digits does $N$ have when written in base $3$? [i]Proposed by Aaron Lin[/i]

Determine all sequences of real numbers $a_1$, $a_2$, $\ldots$, $a_{1995}$ which satisfy: \[ 2\sqrt{a_n - (n - 1)} \geq a_{n+1} - (n - 1), \ \mbox{for} \ n = 1, 2, \ldots 1994, \] and \[ 2\sqrt{a_{1995} - 1994} \geq a_1 + 1. \]

Prove that the number $512^{3} +675^{3}+ 720^{3}$ is composite.

Find all values of the parameter $a$ for which there exist exactly two integer values of $x$ that satisfy the inequality $$x^2+5\sqrt2 x+a<0.$$

Let $ABCD$ be a parallelogram ($AB < BC$). The bisector of the angle $BAD$ intersects the side $BC$ at the point K; and the bisector of the angle $ADC$ intersects the diagonal $AC$ at the point $F$. Suppose that $KD \perp BC$. Prove that $KF \perp BD$.

Let $S=\{x_0, x_1, \cdots, x_n\} \subset [0,1]$ be a finite set of real numbers with $x_{0}=0$ and $x_{1}=1$, such that every distance between pairs of elements occurs at least twice, except for the distance $1$. Prove that all of the $x_i$ are rational.

Let $a$, $b$, $c$ be positive integers and $p$ be a prime number. Assume that \[ a^n(b+c)+b^n(a+c)+c^n(a+b)\equiv 8\pmod{p} \] for each nonnegative integer $n$. Let $m$ be the remainder when $a^p+b^p+c^p$ is divided by $p$, and $k$ the remainder when $m^p$ is divided by $p^4$. Find the maximum possible value of $k$. [i]Proposed by Justin Stevens and Evan Chen[/i]

In convex quadrilateral $ABCD$, let $M$ and $N$ denote the midpoints of sides $AD$ and $BC$, respectively. On sides $AB$ and $CD$ are points $K$ and $L$, respectively, such that $\angle MKA=\angle NLC$. Prove that if lines $BD$, $KM$, and $LN$ are concurrent, then \[ \angle KMN = \angle BDC\qquad\text{and}\qquad\angle LNM=\angle ABD.\]

Find all integers $m$ and $n$ such that $\frac{m^2+n}{n^2-m}$ and $\frac{n^2+m}{m^2-n}$ are both integers.

Through the point $F(0,\frac{1}{4})$ of the coordinate plane two perpendicular lines pass, that intersect parabola $y=x^2$ at points $A,B,C,D$ ($A_x<B_x<C_x<D_x$) The difference of projections of segments $AD$ and $BC$ onto the $Ox$ line is $m$ Find the area of $ABCD$

A cube with the edge of length $n$ is divided onto $n^3$ unit ones. Let us choose some of them and draw three lines parallel to the edges through their centres. What is the least possible number of the chosen small cubes necessary to make those lines cross all the smaller cubes? a) Find the answer for the small $n$ ($n = 2,3,4$). b) Try to find the answer for $n = 10$. c) If You can not solve the general problem, try to estimate that value from the upper and lower side. d) Note, that You can reformulate the problem in such a way: Consider all the triples $(x_1,x_2,x_3)$, where $x_i$ can be one of the integers $1,2,...,n$. What is the minimal number of the triples necessary to provide the property: [i]for each of the triples there exist the chosen one, that differs only in one coordinate. [/i] Try to find the answer for the situation with more than three coordinates, for example, with four.

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]