Show that the following equation has finitely many solutions $(t,A,x,y,z)$ in positive integers $$\sqrt{t(1-A^{-2})(1-x^{-2})(1-y^{-2})(1-z^{-2})}=(1+x^{-1})(1+y^{-1})(1+z^{-1})$$

We have a blue triangle. In every move, we divide the blue triangle by angle bisector to $2$ triangles and color one triangle in red. Prove, that after some moves we color more than half of the original triangle in red.

Given a positive integer $n \geq 2$, whose canonical prime factorization is $n = p_1^{\alpha_1}p_2^{\alpha_2} \ldots p_k^{\alpha_k}$, we define the following functions: $$\varphi(n) = n\bigg(1 -\frac{1}{p_1}\bigg) \bigg(1 -\frac{1}{p_2}\bigg) \ldots \bigg(1 -\frac {1}{p_k}\bigg) ; \overline{\varphi}(n) = n\bigg(1 +\frac{1}{p_1}\bigg) \bigg(1 +\frac{1}{p_2}\bigg) \ldots \bigg(1 + \frac{1}{p_k}\bigg)$$ Consider all positive integers $n$ such that $\overline{\varphi}(n)$ is a multiple of $n + \varphi(n) $. (a) Prove that $n$ is even. (b) Determine all positive integers $n$ that satisfy this property.

Steve is piling $m\geq 1$ indistinguishable stones on the squares of an $n\times n$ grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform [i]stone moves[/i], defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions $(i, k), (i, l), (j, k), (j, l)$ for some $1\leq i, j, k, l\leq n$, such that $i<j$ and $k<l$. A stone move consists of either removing one stone from each of $(i, k)$ and $(j, l)$ and moving them to $(i, l)$ and $(j, k)$ respectively, or removing one stone from each of $(i, l)$ and $(j, k)$ and moving them to $(i, k)$ and $(j, l)$ respectively. Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves. How many different non-equivalent ways can Steve pile the stones on the grid?

Prove that if \( a \), \( b \), and \( c \) are positive real numbers, then the following inequality holds: \[ \frac{a + 3c}{a + b} + \frac{c + 3a}{b + c} + \frac{4b}{c + a} \geq 6. \]

Suppose that points $A$ and $B$ lie on circle $\Omega$, and suppose that points $C$ and $D$ are the trisection points of major arc $AB$, with $C$ closer to $B$ than $A$. Let $E$ be the intersection of line $AB$ with the line tangent to $\Omega$ at $C$. Suppose that $DC = 8$ and $DB = 11$. If $DE = a\sqrt{b}$ for integers $a$ and $b$ with $b$ squarefree, find $a + b$.

In the plane, consider a point $ X$ and a polygon $ \mathcal{F}$ (which is not necessarily convex). Let $ p$ denote the perimeter of $ \mathcal{F}$, let $ d$ be the sum of the distances from the point $ X$ to the vertices of $ \mathcal{F}$, and let $ h$ be the sum of the distances from the point $ X$ to the sidelines of $ \mathcal{F}$. Prove that $ d^2 \minus{} h^2\geq\frac {p^2}{4}.$

Let $y(x)$ be a continuously differentiable real-valued function of a real variable $x$. Show that if $y'(x)^2 +y(x)^3 \to 0$ as $x\to \infty,$ then $y(x)$ and $y'(x) \to 0$ as $x \to \infty.$

Let $ M \equal{} \lbrace 2, 3, 4, \ldots\, 1000 \rbrace$. Find the smallest $ n \in \mathbb{N}$ such that any $ n$-element subset of $ M$ contains 3 pairwise disjoint 4-element subsets $ S, T, U$ such that [b]I.[/b] For any 2 elements in $ S$, the larger number is a multiple of the smaller number. The same applies for $ T$ and $ U$. [b]II.[/b] For any $ s \in S$ and $ t \in T$, $ (s,t) \equal{} 1$. [b]III.[/b] For any $ s \in S$ and $ u \in U$, $ (s,u) > 1$.

The numbers $1$ to $12$ are arranged in a sequence. The number of ways this can be done equals $12 \times11 \times 10\times ...\times 1$. We impose the condition that in the sequence there should be exactly one number that is smaller than the number directly preceding it. How many of the $12 \times11 \times 10\times ...\times 1$ sequences satisfy this condition?

Let $f$ be a polynomial such that, for all real number $x$, $f(-x^2-x-1) = x^4 + 2x^3 + 2022x^2 + 2021x + 2019$. Compute $f(2018)$.

We are given a polyhedron with at least $5$ vertices, such that exactly $3$ edges meet in each of the vertices. Prove that we can assign a rational number to every vertex of the given polyhedron such that the following conditions are met: $(i)$ At least one of the numbers assigned to the vertices is equal to $2020$. $(ii)$ For every polygonal face, the product of the numbers assigned to the vertices of that face is equal to $1$.

Let $x, y$ be positive integers such that $\frac{x^2}{y}+\frac{y^2}{x}$ is an integer. Prove that $y|x^2$.

Every point of the plane is painted with one of three colors. Can we always find two points a distance $1$ cm apart which are of the same color?

A space station consists of two living modules attached to a central hub on opposite sides of the hub by long corridors of equal length. Each living module contains $N$ astronauts of equal mass. The mass of the space station is negligible compared to the mass of the astronauts, and the size of the central hub and living modules is negligible compared to the length of the corridors. At the beginning of the day, the space station is rotating so that the astronauts feel as if they are in a gravitational field of strength $g$. Two astronauts, one from each module, climb into the central hub, and the remaining astronauts now feel a gravitational field of strength $g'$ . What is the ratio $g'/g$ in terms of $N$?[asy] import roundedpath; size(300); path a = roundedpath((0,-0.3)--(4,-0.3)--(4,-1)--(5,-1)--(5,0),0.1); draw(scale(+1,-1)*a); draw(scale(+1,+1)*a); draw(scale(-1,-1)*a); draw(scale(-1,+1)*a); filldraw(circle((0,0),1),white,black); filldraw(box((-2,-0.27),(2,0.27)),white,white); draw(arc((0,0),1.5,+35,+150),dashed,Arrow); draw(arc((0,0),1.5,-150,-35),dashed,Arrow);[/asy] $ \textbf{(A)}\ 2N/(N-1) $ $ \textbf{(B)}\ N/(N-1) $ $ \textbf{(C)}\ \sqrt{(N-1)/N} $ $ \textbf{(D)}\ \sqrt{N/(N-1)} $ $ \textbf{(E)}\ \text{none of the above} $

Find the sum of the positive integer solutions to the equation $\left\lfloor\sqrt[3]{x}\right\rfloor+\left\lfloor\sqrt[4]{x}\right\rfloor=4.$

In trapezoid $ABCD$, $AD \parallel BC$ and $\angle ABC + \angle CDA = 270^{\circ}$. Compute $AB^2$ given that $AB \cdot \tan(\angle BCD) = 20$ and $CD = 13$. [i]Proposed by Lewis Chen[/i]

In an infinite sequence of positive integers every element (starting with the second) is the harmonic mean of its neighbors. Show that all the numbers must be equal.

Show that $$\sqrt{n + \left[ \sqrt{n} +\frac12\right]}$$ is an irrational number, for every positive integer $n$.

Let $A_{1}A_{2} \cdots A_{14}$ be a regular $14-$gon. Prove that $A_{1}A_{3}\cap A_{5}A_{11}\cap A_{6}A_{9}\ne \emptyset$.

Consider the additive group $\mathbb{Z}^{2}$. Let $H$ be the smallest subgroup containing $(3,8), (4,-1)$ and $(5,4)$. Let $H_{xy}$ be the smallest subgroup containing $(0,x)$ and $(1,y)$. Find some pair $(x,y)$ with $x>0$ such that $H=H_{xy}$.

In a triangle \( ABC \), \( D \) is the foot of the altitude from \( C \). Let \( P \in \overline{CD} \). \( Q \) is the intersection of \( \overline{AP} \) and \( \overline{CB} \), and \( R \) is the intersection of \( \overline{BP} \) and \( \overline{CA} \). Prove that \( \angle RDC = \angle QDC \).

Determine all pairs $(a, b)$ of integers having the following property: there is an integer $d \ge 2$ such that $a^n + b^n + 1$ is divisible by $d$ for all positive integers $n$.

Let $a_1,a_2,...$ and $b_1,b_2,..$. be two arbitrary infinite sequences of natural numbers. Prove that there exist different indices $r$ and $s$ such that $a_r \ge a_s$ and $b_r \ge b_s$.

Let $f:\mathbb{N}\to\mathbb{N}_0$ be a function that satisfies \[ f(mn) = mf(n) + nf(m)\] for all positive integers $m,n$ and $f(2024)=10120$. Prove that there are two integers $m,n$ with $m\ne n$ such that $f(m)=f(n)$.