You are given $25$ pieces of cheese of different weights. Is it always possible to cut one of the pieces into two parts and put the $26$ pieces in two packets so that $\bullet$ each packet contains $13$ pieces; $\bullet$ the total weights of the two packets are equal; $\bullet$ the two parts of the piece which has been cut are in different packets? (VL Dolnikov)

Prove that there are infinitely many positive $n$ that for all prime divisors $p$ of $n^2 + 3, \exists 0 \leq k \leq \sqrt{n}$ and $p \mid k^2+3$

Let $x$ and $y$ are real numbers such that $$\begin{cases} x + y = 2 \\ x^3 + y^3 = 3\end{cases} $$ What is $x^2+y^2$?

In a half-plane, bounded by a line \(r\), equilateral triangles \(S_1, S_2, \ldots, S_n\) are placed, each with one side parallel to \(r\), and their opposite vertex is the point of the triangle farthest from \(r\). For each triangle \(S_i\), let \(T_i\) be its medial triangle. Let \(S\) be the region covered by triangles \(S_1, S_2, \ldots, S_n\), and let \(T\) be the region covered by triangles \(T_1, T_2, \ldots, T_n\). Prove that \[\text{area}(S) \leq 4 \cdot \text{area}(T).\]

Show that for any natural number $n$, the number $A = [\frac{n + 3}{4}] + [ \frac{n + 5}{4} ] + [\frac{n}{2} ] +n^2 + 3n + 3$ is a perfect square. ($[x]$ denotes the integer part of the real number x.)

$n$ people (with names $1,2,\dots,n$) are around a table. Some of them are friends. At each step 2 friend can change their place. Find a necessary and sufficient condition for friendship relation between them that with these steps we can always reach to all of posiible permutations.

Let $ABCD$ be a parallelogram with $\angle BAD < 90^{\circ}$. A circle tangent to sides $\overline{DA}$, $\overline{AB}$, and $\overline{BC}$ intersects diagonal $\overline{AC}$ at points $P$ and $Q$ with $AP < AQ$, as shown. Suppose that $AP = 3$, $PQ = 9$, and $QC = 16$. Then the area of $ABCD$ can be expressed in the form $m\sqrt n$, where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$. [asy] defaultpen(linewidth(0.6)+fontsize(11)); size(8cm); pair A,B,C,D,P,Q; A=(0,0); label("$A$", A, SW); B=(6,15); label("$B$", B, NW); C=(30,15); label("$C$", C, NE); D=(24,0); label("$D$", D, SE); P=(5.2,2.6); label("$P$", (5.8,2.6), N); Q=(18.3,9.1); label("$Q$", (18.1,9.7), W); draw(A--B--C--D--cycle); draw(C--A); draw(Circle((10.95,7.45), 7.45)); dot(A^^B^^C^^D^^P^^Q); [/asy]

Prove that for any integer $a \ge 2$ and positive integer $n,$ there exist positive integer $k$ such that $a^k+1,a^k+2,\ldots,a^k+n$ are all composite numbers.

A [i]cross-pentomino[/i] is a shape that consists of a unit square and four other unit squares each sharing a different edge with the first square. If a cross-pentomino is inscribed in a circle of radius $R,$ what is $100R^2$? [i]Author: Ray Li[/i]

Can there be drawn on a circle of radius $1$ a number of $1975$ distinct points, so that the distance (measured on the chord) between any two points (from the considered points) is a rational number?