Let $a>b>c>d$ be positive integers satisfying $a+b+c+d=502$ and $a^2-b^2+c^2-d^2=502$ . Calculate how many possible values of $ a$ are there.

Points with integer coordinates in cartesian space are called lattice points. We color $2000$ lattice points blue and $2000$ other lattice points red in such a way that no two blue-red segments have a common interior point (a segment is blue-red if its two endpoints are colored blue and red). Consider the smallest rectangular parallelepiped that covers all the colored points. (a) Prove that this rectangular parallelepiped covers at least $500,000$ lattice points. (b) Give an example of a coloring for which the considered rectangular paralellepiped covers at most $8,000,000$ lattice points.

Find all functions $f:[0, \infty) \to [0,\infty)$, such that for any positive integer $n$ and and for any non-negative real numbers $x_1,x_2,\dotsc,x_n$ \[f(x_1^2+\dotsc+x_n^2)=f(x_1)^2+\dots+f(x_n)^2.\]

Let $ABC$ be an acute triangle with $| AB | > | AC |$. Let $D$ be the foot of the altitude from $A$ to $BC$, let $K$ be the intersection of $AD$ with the internal bisector of angle $B$, Let $M$ be the foot of the perpendicular from $B$ to $CK$ (it could be in the extension of segment $CK$) and$ N$ the intersection of $BM$ and $AK$ (it could be in the extension of the segments). Let $T$ be the intersection of$ AC$ with the line that passes through $N$ and parallel to $DM$. Prove that $BM$ is the internal bisector of the angle $\angle TBC$

Do there exist prime numbers $p$ and $q$ such that $p^2(p^3-1)=q(q+1)$ ?

What is the smallest $6$-digit number that uses each of the digits $1$ through $6$ exactly once and has the property that every pair of adjacent digits has a sum that is prime?

For the positive integers $x , y$ and $z$ apply $\frac{1}{x}+\frac{1}{y}=\frac{1}{z}$ . Prove that if the three numbers $x , y,$ and $z$ have no common divisor greater than $1$, $x + y$ is the square of an integer.

A hollow box (with negligible thickness) shaped like a rectangular prism has a volume of $108$ cubic units. The top of the box is removed, exposing the faces on the inside of the box. What is the minimum possible value for the sum of the areas of the faces on the outside and inside of the box?

For a positive integer $n$, we say an $n$-[i]transposition[/i] is a bijection $\sigma: \{1,2, \dots , n\} \rightarrow \{1,2, \dots , n\}$ such that there exist exactly two elements $i$ of $\{1,2, \dots , n\}$ such that $\sigma(i) \neq i$. Fix some four pairwise distinct $n$-transpositions $\sigma_1,\sigma_2,\sigma_3,\sigma_4$. Let $q$ be any prime, and let $\mathbb{F}_q$ be the integers modulo $q$. Consider all functions $f:(\mathbb{F}_q^n)^n\to\mathbb{F}_q$ that satisfy, for all integers $i$ with $1 \leq i \leq n$ and all $x_1,\ldots x_{i-1},x_{i+1}, \dots ,x_n, y, z\in\mathbb{F}_q^n$, \[f(x_1, \ldots ,x_{i-1}, y, x_{i+1}, \ldots , x_n) +f(x_1, \ldots ,x_{i-1}, z, x_{i+1}, \ldots , x_n) = f(x_1, \ldots ,x_{i-1}, y+z, x_{i+1}, \ldots , x_n), \] and that satisfy, for all $x_1,\ldots,x_n\in\mathbb{F}_q^n$ and all $\sigma\in\{\sigma_1,\sigma_2,\sigma_3,\sigma_4\}$, \[f(x_1,\ldots,x_n)=-f(x_{\sigma(1)},\ldots,x_{\sigma(n)}).\] (Note that the equalities in the previous sentence are in $\mathbb F_q$. Note that, for any $a_1,\ldots ,a_n, b_1, \ldots , b_n \in \mathbb{F}_q$, we have $(a_1,\ldots , a_n)+(b_1, \ldots, b_n)=(a_1+b_1,\ldots, a_n+b_n)$, where $a_1+b_1,\ldots , a_n+b_n \in \mathbb{F}_q$.) For a given tuple $(x_1,\ldots,x_n)\in(\mathbb{F}_q^n)^n$, let $g(x_1,\ldots,x_n)$ be the number of different values of $f(x_1,\ldots,x_n)$ over all possible functions $f$ satisfying the above conditions. Pick $(x_1,\ldots,x_n)\in(\mathbb{F}_q^n)^n$ uniformly at random, and let $\varepsilon(q,\sigma_1,\sigma_2,\sigma_3,\sigma_4)$ be the expected value of $g(x_1,\ldots,x_n)$. Finally, let \[\kappa(\sigma_1,\sigma_2,\sigma_3,\sigma_4)=-\lim_{q \to \infty}\log_q\left(-\ln\left(\frac{\varepsilon(q,\sigma_1,\sigma_2,\sigma_3,\sigma_4)-1}{q-1}\right)\right).\] Pick four pairwise distinct $n$-transpositions $\sigma_1,\sigma_2,\sigma_3,\sigma_4$ uniformly at random from the set of all $n$-transpositions. Let $\pi(n)$ denote the expected value of $\kappa(\sigma_1,\ldots,\sigma_4)$. Suppose that $p(x)$ and $q(x)$ are polynomials with real coefficients such that $q(-3) \neq 0$ and such that $\pi(n)=\frac{p(n)}{q(n)}$ for infinitely many positive integers $n$. Compute $\frac{p\left(-3\right)}{q\left(-3\right)}$. [i]Proposed by Gopal Goel[/i]

Suppose for some positive integers $r$ and $s$, $2^r$ is obtained by permuting the digits of $2^s$ in decimal expansion. Prove that $r=s$.

Given a positive integer $n$, determine the maximal constant $C_n$ satisfying the following condition: for any partition of the set $\{1,2,\ldots,2n \}$ into two $n$-element subsets $A$ and $B$, there exist labellings $a_1,a_2,\ldots,a_n$ and $b_1,b_2,\ldots,b_n$ of $A$ and $B$, respectively, such that $$ (a_1-b_1)^2+(a_2-b_2)^2+\ldots+(a_n-b_n)^2\ge C_n. $$ [i](B. Serankou, M. Karpuk)[/i]

Let $x_1\leq x_2\leq \cdots\leq x_{100}$ be real numbers such that $|x_1| + |x_2| + \cdots + |x_{100}| = 1$ and $x_1 + x_2 + \cdots + x_{100} = 0$. Among all such $100$-tuples of numbers, the greatest value that $x_{76} - x_{16}$ can achieve is $\tfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let $E$ and $F$ be the respective midpoints of $BC,CD$ of a convex quadrilateral $ABCD$. Segments $AE,AF,EF$ cut the quadrilateral into four triangles whose areas are four consecutive integers. Find the maximum possible area of $\Delta BAD$.

Two six-sided dice are fair in the sense that each face is equally likely to turn up. However, one of the dice has the $ 4$ replaced by $ 3$ and the other die has the $ 3$ replaced by $ 4$. When these dice are rolled, what is the probability that the sum is an odd number? $ \textbf{(A)}\ \frac{1}{3}\qquad \textbf{(B)}\ \frac{4}{9}\qquad \textbf{(C)}\ \frac{1}{2}\qquad \textbf{(D)}\ \frac{5}{9}\qquad \textbf{(E)}\ \frac{11}{18}$

Let $ABC$ be any triangle and $D, E, F$ the midpoints of $BC, CA, AB$. The medians $AD, BE$ and $CF$ intersect at point $S$. At least two of the quadrilaterals $AF SE, BDSF, CESD$ are cyclic. Show that the triangle $ABC$ is equilateral.

Does there exist a regular triangular prism that can be covered (without overlapping) by different equilateral triangles? (One is allowed to bend the triangles around the edges of the prism.)

Let $ABCD$ be a quadrilateral with $\angle A = \angle B = 90^o$, $AB = AD$. Denote $E$ as the midpoint of $AD$, suppose that $CD = BC + AD$, $AD > BC$. Prove that $\angle ADC = 2\angle ABE$.

Let $n$ be an integer greater than $1$, and let $p$ be a prime divisor of $n$. A confederation consists of $p$ states, each of which has exactly $n$ airports. There are $p$ air companies operating interstate flights only such that every two airports in different states are joined by a direct (two-way) flight operated by one of these companies. Determine the maximal integer $N$ satisfying the following condition: In every such confederation it is possible to choose one of the $p$ air companies and $N$ of the $np$ airports such that one may travel (not necessarily directly) from any one of the $N$ chosen airports to any other such only by flights operated by the chosen air company.

Define a sequence $a_{m,n}$ where $a_{m,0}=1,$ and for all other $m,n$ (assuming $m \ge 1$): $$a_{m,n}=\begin{cases} 0 & n<0 \\ 1 & n \equiv 0 \mod{m} \\ a_{m,n-1}+a_{m, n-m} & \text{else} \end{cases}$$ If $\tfrac{a_{2025, (2025^2-1)}}{a_{2025, (2024^2-1)}} = \tfrac{a}{b}$ where $a$ and $b$ are relatively prime positive integers, then what is $a+b$?

Let $C_1, C_2$ be circles of radius $1/2$ tangent to each other and both tangent internally to a circle $C$ of radius $1$. The circles $C_1$ and $C_2$ are the first two terms of an infinite sequence of distinct circles $C_n$ defined as follows: $C_{n+2}$ is tangent externally to $C_n$ and $C_{n+1}$ and internally to $C$. Show that the radius of each $C_n$ is the reciprocal of an integer.

Let $P$ be a convex polygon in the plane. A real number is assigned to each point in the plane so that the sum of the numbers assigned to the vertices of any polygon similar to $P$ is equal to $0$. Prove that all the assigned numbers are equal to $0$.

The vertices of a regular $n + 1$-gon are denoted by $P_0,P_1,...,P_n$ in some order ($n \ge 2$). Each side of the polygon is assigned a natural number as follows: if the endpoints of the side are $P_i$ and $P_j$, then the assigned number equals $|i - j |$. Let S be the sum of all $n + 1$ assigned numbers. (a) Given $n$, what is the smallest possible value of $S$? (b) If $P_0$ is fixed, how many different assignments are there for which $S$ attains the smallest value?

Except for the first two terms, each term of the sequence $1000, x, 1000-x,\ldots$ is obtained by subtracting the preceding term from the one before that. The last term of the sequence is the first negative term encounted. What positive integer $x$ produces a sequence of maximum length?

$\Phi$ is the union of all triangles that are symmetric of the triangle $ABC$ wrt a point $O$, as point $O$ moves along the triangle's sides. If the area of the triangle is $E$, find the area of $\Phi$.

Given two integers, $k$ and $d$ such that $d$ divides $k^3 - 2$. Show that there exists integers $a$, $b$, $c$ satisfying $d = a^3 + 2b^3 + 4c^3 - 6abc$. [i]Proposed by Csongor Beke and László Bence Simon, Cambridge[/i]