Do there exist real numbers $a$ and $b$ such that [list=a][*] $a+b$ is rational and $a^n +b^n $ is irrational for all $n \in \mathbb{N}$ with $n \ge 2$? [*] $a+b$ is irrational and $a^n +b^n $ is rational for all $n \in \mathbb{N}$ with $n \ge 2$?[/list]

Let $S$ be a finite set of positive integers which has the following property:if $x$ is a member of $S$,then so are all positive divisors of $x$. A non-empty subset $T$ of $S$ is [i]good[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is a power of a prime number. A non-empty subset $T$ of $S$ is [i]bad[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is not a power of a prime number. A set of an element is considered both [i]good[/i] and [i]bad[/i]. Let $k$ be the largest possible size of a [i]good[/i] subset of $S$. Prove that $k$ is also the smallest number of pairwise-disjoint [i]bad[/i] subsets whose union is $S$.

Fix an integer $k>2$. Two players, called Ana and Banana, play the following game of numbers. Initially, some integer $n \ge k$ gets written on the blackboard. Then they take moves in turn, with Ana beginning. A player making a move erases the number $m$ just written on the blackboard and replaces it by some number $m'$ with $k \le m' < m$ that is coprime to $m$. The first player who cannot move anymore loses. An integer $n \ge k $ is called good if Banana has a winning strategy when the initial number is $n$, and bad otherwise. Consider two integers $n,n' \ge k$ with the property that each prime number $p \le k$ divides $n$ if and only if it divides $n'$. Prove that either both $n$ and $n'$ are good or both are bad.

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?

A $ 4\times 4$ table is divided into $ 16$ white unit square cells. Two cells are called neighbors if they share a common side. A [i]move[/i] consists in choosing a cell and the colors of neighbors from white to black or from black to white. After exactly $ n$ moves all the $ 16$ cells were black. Find all possible values of $ n$.

Let $C$ be a right circular cone with apex $A$. Let $P_1, P_2, P_3, P_4$ and $P_5$ be points placed evenly along the circular base in that order, so that $P_1P_2P_3P_4P_5$ is a regular pentagon. Suppose that the shortest path from $P_1$ to $P_3$ along the curved surface of the cone passes through the midpoint of $AP_2$. Let $h$ be the height of $C$, and $r$ be the radius of the circular base of $C$. If $\left(\frac{h}{r}\right)^2$ can be written in simplest form as $\frac{a}{b}$ , find $a + b$.

Let $A_n$ be the set of all sequences with length $n$ and members of the set $\{1,2…q\}$. We denote with $B_n$ a subset of $A_n$ with a minimal number of elements with the following property: For each sequence $a_1,a_2,...,a_n$ from $A_n$ there exist a sequence $b_1,b_2,...,b_n$ from $B_n$ such that $a_i\neq b_i$ for each $i=1,2,....,n$. Prove that, if $q>n$, then $|B_n |=n+1$.

A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$. (a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced. (b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$. [i]Proposed by Jorge Tipe, Peru[/i]

Let $x, y, z$ be positive real numbers. Prove that $$4(x^2+y^2+z^2)\geq3(xy+yz+zx).$$

Let $S_{1},$ $S_{2},$ $...,$ $S_{n}$ be finitely many subsets of $\mathbb{N}$ such that $S_{1}\cup S_{2}\cup...\cup S_{n}=\mathbb{N}.$ Prove that there exists some $k\in\left\{ 1,2,...,n\right\} $ such that for each positive integer $m,$ the set $S_{k}$ contains infinitely many multiples of $m.$

Suppose that $m$ and $n$ are positive integers with $m < n$ such that the interval $[m, n)$ contains more multiples of $2021$ than multiples of $2000$. Compute the maximum possible value of $n - m$.

Let $a, b, c$ be real numbers so that all roots of the equation $2x^5 + 5x^4 + 5x^3 + ax^2 + bx + c = 0$ are real. Find the smallest real root of the equation above.

Let $\triangle ABC$ be an acute triangle, and let $I_B, I_C,$ and $O$ denote its $B$-excenter, $C$-excenter, and circumcenter, respectively. Points $E$ and $Y$ are selected on $\overline{AC}$ such that $\angle ABY=\angle CBY$ and $\overline{BE}\perp\overline{AC}$. Similarly, points $F$ and $Z$ are selected on $\overline{AB}$ such that $\angle ACZ=\angle BCZ$ and $\overline{CF}\perp\overline{AB}$. Lines $\overleftrightarrow{I_BF}$ and $\overleftrightarrow{I_CE}$ meet at $P$. Prove that $\overline{PO}$ and $\overline{YZ}$ are perpendicular. [i]Proposed by Evan Chen and Telv Cohl[/i]

If $x$, $y$, $z$ are nonnegative integers satisfying the equation below, then compute $x+y+z$. \[\left(\frac{16}{3}\right)^x\times \left(\frac{27}{25}\right)^y\times \left(\frac{5}{4}\right)^z=256.\] [i]Proposed by Jeffrey Shi[/i]

(i) Consider two positive integers $a$ and $b$ which are such that $a^a b^b$ is divisible by $2000$. What is the least possible value of $ab$? (ii) Consider two positive integers $a$ and $b$ which are such that $a^b b^a$ is divisible by $2000$. What is the least possible value of $ab$?