The $2001 \times 2001$ trees in a park form a square grid. What is the largest number of trees that can be cut so that no tree stump can be seen from any other? (Each tree has zero width.)

Is there an infinite set of points in the plane such that no three points are collinear, and the distance between any two points is rational?

For positive $a,b,c$, such that $abc=1$ prove the inequality: $4(\sqrt[3]{\frac{a}{b}}+\sqrt[3]{\frac{b}{c}}+\sqrt[3]{\frac{c}{a}}) \leq 3(2+a+b+c+\frac{1}{a}+\frac{1}{b}+ \frac{1}{c})^{\frac{2}{3}}$.

Prove that the elements of any natural power of a $ 2\times 2 $ special linear integer matrix are pairwise coprime, with the possible exception of the pairs that form the diagonals. [i]Vasile Pop[/i]

Let's call any natural number "very prime" if any number of consecutive digits (in particular, a digit or number itself) is a prime number. For example, $23$ and $37$ are "very prime" numbers, but $237$ and $357$ are not. Find the largest "prime" number (with justification!).

Let $n$ be a positive integer and $p$ be a prime number of the form $8k+5$. A polynomial $Q$ of degree at most $2023$ and nonnegative integer coefficients less than or equal to $n$ will be called "cool" if \[p\mid Q(2)\cdot Q(3) \cdot \ldots \cdot Q(p-2)-1.\] Prove that the number of cool polynomials is even.

Let $S$ be the set of all four digit palindromes (a palindrome is a number that reads the same forwards and backwards). The average value of $|m - n|$ over all ordered pairs $(m, n)$, where $m$ and $n$ are (not necessarily distinct) elements of $S$, is equal to $p/q$ , for relatively prime positive integers $p$ and $q$. Find $p + q$.

The [i]binary sudoku[/i] is a puzzle in which a table should be filled with digits $0$ and $1$ such that in each row and column, the number of 0s is equal to the number of $1$s. Furthermore, there cannot exist three adjacent cells in a row or in a column such that they have the same digit written in them. Solving the given binary sudoku, what is the sum of the numbers in the two diagonals? [img]https://cdn.artofproblemsolving.com/attachments/a/8/be7de94ce02a90b3cabf1b9795b94ec7ec677f.png[/img]

Initially, on the board, all integers from $1$ to $400$ are written. Two players play a game alternating their moves. In one move it is allowed to erase from the board any 3 integers, which form a triangle. The player, who can not perform a move loses. Who has a winning strategy?

In the convex quadrilateral $ABCD$ we have that $\angle BCD = \angle ADC \ge 90 ^o$. The bisectors of $\angle BAD$ and $\angle ABC$ intersect in $M$. Prove that if $M \in CD$, then $M$ is the middle of $CD$.

For which integers $N\ge 3$ can we find $N$ points on the plane such that no three are collinear, and for any triangle formed by three vertices of the points’ convex hull, there is exactly one point within that triangle?

Let $ABC$ be a triangle with incenter $I$. Let $K$ be the midpoint of $AI$ and $BI\cap \odot(\triangle ABC)=M,CI\cap \odot(\triangle ABC)=N$. points $P,Q$ lie on $AM,AN$ respectively such that $\angle ABK=\angle PBC,\angle ACK=\angle QCB$. Prove that $P,Q,I$ are collinear.

A nickel is placed on a table. The number of nickels which can be placed around it, each tangent to it and to two others is: $ \textbf{(A)}\ 4 \qquad\textbf{(B)}\ 5 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ 8 \qquad\textbf{(E)}\ 12$

Consider the equation $x^5+x=10$. Show that (a) the equation has only one real root; (b) this root lies between $1$ and $2$; (c) this root must be irrational.

Let $ABC$ be an acute triangle with $AB<AC$. Let $M$ be the midpoint of $BC$ and $E$ be the foot of altitude from $B$ to $AC$. The point $C'$ is the reflection of $C$ across $AM$. The point $D$ not equal to $C$ is placed on line $BC$ such that $AD=AC$. Prove that $B$ is the incenter of triangle $DEC'$.

Initially, the numbers $1,3,4$ are written on a board. We do the following process repeatedly. Consider all of the numbers that can be obtained as the sum of $3$ distinct numbers written on the board and that aren't already written, and we write those numbers on the board. We repeat this process, until at a certain step, all of the numbers in that step are greater than $2024$. Determine all of the integers $1\leq k\leq 2024$ that were not written on the board.

A cyclic quadrilateral $ABCD$ has circumcircle $\Gamma$, and $AB+BC=AD+DC$. Let $E$ be the midpoint of arc $BCD$, and $F (\neq C)$ be the antipode of $A$ [i]wrt[/i] $\Gamma$. Let $I,J,K$ be the incenter of $\triangle ABC$, the $A$-excenter of $\triangle ABC$, the incenter of $\triangle BCD$, respectively. Suppose that a point $P$ satisfies $\triangle BIC \stackrel{+}{\sim} \triangle KPJ$. Prove that $EK$ and $PF$ intersect on $\Gamma.$

Let $\triangle ABC$ be a triangle with side length $BC= 4\sqrt{6}$. Denote $\omega$ as the circumcircle of $\triangle{ABC}$. Point $D$ lies on $\omega$ such that $AD$ is the diameter of $\omega$. Let $N$ be the midpoint of arc $BC$ that contains $A$. $H$ is the intersection of the altitudes in $\triangle{ABC}$ and it is given that $HN = HD= 6$. If the area of $\triangle{ABC}$ can be expressed as $\frac{a\sqrt{b}}{c}$, where $a,b,c$ are positive integers with $a$ and $c$ relatively prime and $b$ not divisible by the square of any prime, compute $a+b+c$. [i]Proposed by Andy Xu[/i]

In an acute triangle $ABC$ , the bisector of angle $\angle A$ intersects the circumscribed circle of the triangle $ABC$ at the point $W$. From point $W$ , a parallel is drawn to the side $AB$, which intersects this circle at the point $F \ne W$. Describe the construction of the triangle $ABC$, if given are the segments $FA$ , $FW$ and $\angle FAC$. (Andrey Mostovy)

The Alpine Club organizes four mountain trips for its $n$ members. Let $E_1, E_2, E_3, E_4$ be the teams participating in these trips. In how many ways can these teams be formed so as to satisfy $E_1 \cap E_2 \ne\varnothing$, $E_2 \cap E_3 \ne\varnothing$ , $E_3 \cap E_4 \ne\varnothing$ ?

For a positive integer $n$, define $d(n)$ to be the sum of the digits of $n$ when written in binary (for example, $d(13)=1+1+0+1=3$). Let \[ S=\sum_{k=1}^{2020}(-1)^{d(k)}k^3. \] Determine $S$ modulo $2020$.

Let $m$ and $n$ be positive integers. For a connected simple graph $G$ on $n$ vertices and $m$ edges, we consider the number $N(G)$ of orientations of (all of) its edges so that, in the resulting directed graph, every vertex has even outdegree. Show that $N(G)$ only depends on $m$ and $n$, and determine its value.

Let $A$, $B$, $C$, $D$, $E$ be points such that $ABCD$ is a cyclic quadrilateral and $ABDE$ is a parallelogram. The diagonals $AC$ and $BD$ intersect at $S$ and the rays $AB$ and $DC$ intersect at $F$. Prove that $\sphericalangle{AFS}=\sphericalangle{ECD}$. [i](4th Middle European Mathematical Olympiad, Team Competition, Problem 6)[/i]

There are $10001$ students at an university. Some students join together to form several clubs (a student may belong to different clubs). Some clubs join together to form several societies (a club may belong to different societies). There are a total of $k$ societies. Suppose that the following conditions hold: [i]i.)[/i] Each pair of students are in exactly one club. [i]ii.)[/i] For each student and each society, the student is in exactly one club of the society. [i]iii.)[/i] Each club has an odd number of students. In addition, a club with ${2m+1}$ students ($m$ is a positive integer) is in exactly $m$ societies. Find all possible values of $k$. [i]Proposed by Guihua Gong, Puerto Rico[/i]

Find all triples $(a, b, c)$ of positive integers such that $a^3 + b^3 + c^3 = (abc)^2$.