Let $a$, $b$ and $n$ be positive integers, satisfying that $bn$ divides $an-a+1$. Let $\alpha=a/b$. Prove that, when the numbers $\lfloor\alpha\rfloor,\lfloor2\alpha\rfloor,\dots,\lfloor(n-1)\alpha\rfloor$ are divided by $n$, the residues are $1,2,\dots,n-1$, in some order.

There exists infinitely many positive integers such that $a^3 + 1990b^3 = c^4$.

Let $F_1$ be an arbitrary convex quadrilateral. For $k\ge2$, $F_k$ is obtained by cutting $F_{k-1}$ into two pieces along one of its diagonals, flipping one piece over, and the glueing them back together along the same diagonal. What is the maximum number of non-congruent quadrilaterals in the sequence $\{F_k\}$?

Let $A,B,C,...,Z$ be $26$ nonzero real numbers. Suppose that $T=TNYWR$. Compute the smallest possible value of \[ \left\lceil A^2+B^2+\cdots+Z^2\right\rceil . \] (The notation $\left\lceil x\right\rceil$ denotes the least integer $n$ such that $n\geq x$.) [i]Proposed by Luke Robitaille[/i]

[u]Round 1[/u] [b]p1.[/b] Six pirates – Captain Jack and his five crewmen – sit in a circle to split a treasure of $99$ gold coins. Jack must decide how many coins to take for himself and how many to give each crewman (not necessarily the same number to each). The five crewmen will then vote on Jack's decision. Each is greedy and will vote “aye” only if he gets more coins than each of his two neighbors. If a majority vote “aye”, Jack's decision is accepted. Otherwise Jack is thrown overboard and gets nothing. What is the most coins Captain Jack can take for himself and survive? [b]p2[/b]. Rose and Bella take turns painting cells red and blue on an infinite piece of graph paper. On Rose's turn, she picks any blank cell and paints it red. Bella, on her turn, picks any blank cell and paints it blue. Bella wins if the paper has four blue cells arranged as corners of a square of any size with sides parallel to the grid lines. Rose goes first. Show that she cannot prevent Bella from winning. [img]https://cdn.artofproblemsolving.com/attachments/d/6/722eaebed21a01fe43bdd0dedd56ab3faef1b5.png[/img] [b]p3.[/b] A $25\times 25$ checkerboard is cut along the gridlines into some number of smaller square boards. Show that the total length of the cuts is divisible by $4$. For example, the cuts shown on the picture have total length $16$, which is divisible by $4$. [img]https://cdn.artofproblemsolving.com/attachments/c/1/e152130e48b804fe9db807ef4f5cd2cbad4947.png[/img] [b]p4.[/b] Each robot in the Martian Army is equipped with a battery that lasts some number of hours. For any two robots, one's battery lasts at least three times as long as the other's. A robot works until its battery is depleted, then recharges its battery until it is full, then goes back to work, and so on. A battery that lasts $N$ hours takes exactly $N$ hours to recharge. Prove that there will be a moment in time when all the robots are recharging (so you can invade the planet). [b]p5.[/b] A casino machine accepts tokens of $32$ different colors, one at a time. For each color, the player can choose between two fixed rewards. Each reward is up to $\$10$ cash, plus maybe another token. For example, a blue token always gives the player a choice of getting either $\$5$ plus a red token or $\$3$ plus a yellow token; a black token can always be exchanged either for $\$10$ (but no token) or for a brown token (but no cash). A player may keep playing as long as he has a token. Rob and Bob each have one white token. Rob watches Bob play and win $\$500$. Prove that Rob can win at least $\$1000$. [img]https://cdn.artofproblemsolving.com/attachments/6/6/e55614bae92233c9b2e7d66f5f425a18e6475a.png [/img] [u]Round 2[/u] [b]p6.[/b] The sum of $2015$ rational numbers is an integer. The product of every pair of them is also an integer. Prove that they are all integers. (A rational number is one that can be written as $m/n$, where $m$ and $n$ are integers and $n\ne 0$.) [b]p7.[/b] An $N \times N$ table is filled with integers such that numbers in cells that share a side differ by at most $1$. Prove that there is some number that appears in the table at least $N$ times. For example, in the $5 \times 5$ table below the numbers $1$ and $2$ appear at least $5$ times. [img]https://cdn.artofproblemsolving.com/attachments/3/8/fda513bcfbe6834d88fb8ca0bfcdb504d8b859.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A positive integer is called extra-even if all of its digits are even. Compute the number of positive integers $n$ less than or equal to $2022$ such that both $n$ and $2n$ are both extra-even.

Petya gave Vasya a number puzzle. Petya chose a digit $X$ and said, "I am thinking of a three digit number that is divisible by 11. The hundreds digit is $X$ and the tens digit is 3. Find the units digit." Vasya was excited because he knew how to solve this problem, but then realized that the problem Petya gave did not have an answer. What digit $X$ did Petya chose? [i]Ray Li.[/i]

Determine the smallest real number $C$ such that the inequality \[ C(x_1^{2005} +x_2^{2005} + \cdots + x_5^{2005}) \geq x_1x_2x_3x_4x_5(x_1^{125} + x_2^{125}+ \cdots + x_5^{125})^{16} \] holds for all positive real numbers $x_1,x_2,x_3,x_4,x_5$.

Determine the real numbers $x$, $y$, $z > 0$ for which $xyz \leq \min\left\{4(x - \frac{1}{y}), 4(y - \frac{1}{z}), 4(z - \frac{1}{x})\right\}$

Let $ABC$ be a triangle, $T$ its centroid and $S$ its incenter. Prove that the following conditions are equivalent: (1) line $TS$ is parallel to one side of triangle $ABC$, (2) one of the sides of triangle $ABC$ is equal to the half-sum of the other two sides.

Let $n\ge2$ be a positive integer. The numbers $1,2,..., n^2$ are consecutively placed into squares of an $n\times n$, so the first row contains $1,2,...,n$ from left to right, the second row contains $n+1,n+2,...,2n$ from left to right, and so on. The [i]magic square value[/i] of a grid is defined to be the number of rows, columns, and main diagonals whose elements have an average value of $\frac{n^2 + 1}{2}$. Show that the magic-square value of the grid stays constant under the following two operations: (1) a permutation of the rows; and (2) a permutation of the columns. (The operations can be used multiple times, and in any order.) [i]Proposed by Ray Li[/i]

Suppose $x$ and $y$ are nonzero real numbers simultaneously satisfying the equations $x + \frac{2018}{y}= 1000$ and $ \frac{9}{x}+ y = 1$. Find the maximum possible value of $x + 1000y$.

$a,b,c$ are positive numbers such that $ a^2 + b^2 + c^2 = 2abc + 1 $. Find the maximum value of \[ (a-2bc)(b-2ca)(c-2ab) \]

Find all positive integers $n$ such that \[3^n+4^n+\cdots+(n+2)^n=(n+3)^n.\]

Sunay is in the bottom-left square of a checkerboard which is $5$ squares wide (the left-right direction) and $3$ squares tall (the up-down direction). From any square, he may move one square up, one square down, or one square to the right, provided that he does not fall off the checkerboard and provided that he does not revisit a square. How many paths are there for Sunay from the bottom-left square to the top-right square?

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ that are coprime to $n$. Find the sum of all $1<n<100$ such that $\phi(n)\mid n$.

The quadrilateral $ABCD$ is circumscribed around a circle $k$ with center $I$ and $DA\cap CB=E$, $AB\cap DC=F$. In $\Delta EAF$ and $\Delta ECF$ are inscribed circles $k_1 (I_1,r_1)$ and $k_2 (I_2,r_2)$ respectively. Prove that the middle point $M$ of $AC$ lies on the radical axis of $k_1$ and $k_2$.

Let $u$ and $v$ be positive rational numbers with $u \ne v$. Assume that there are infinitely many positive integers $n$ with the property that $u^n - v^n$ are integers. Prove that $u$ and $v$ are integers.

Prove that the number $1$ can be written as a sum of $2023$ fractions of the form $\frac{1}{k_i}$, where all nonnegative integers $k_i (1\leq i\leq 2023)$ are distinct.

Prove that the sum of the numbers $1,2,\ldots,n$ divides their product if and only if $n+1$ is a composite number.

For positive numbers is true that $$ab+ac+bc=a+b+c$$ Prove $$a+b+c+1 \geq 4abc$$

A spherical planet has the equator of length $1$. On this planet, $N$ circular roads of length $1$ each are to be built and used for several trains each. The trains must have the same constant positive speed and never stop or collide. What is the greatest possible sum of lengths of all the trains? The trains are arcs of zero width with endpoints removed (so that if only endpoints of two arcs have coincided then it is not a collision). Solve the problem for : (a) $N=3$ ([i]4 points)[/i] (b) $N=4$ ([i]6 points)[/i] [i]Alexandr Berdnikov [/i]

Let $A=a_{ij}$ is simetrical real matrix. Prove that : $\sum_i e^{a_{ii}} \leq tr (e^A)$

Let $(x_{n}) \ n\geq 1$ be a sequence of real numbers with $x_{1}=1$ satisfying $2x_{n+1}=3x_{n}+\sqrt{5x_{n}^{2}-4}$ a) Prove that the sequence consists only of natural numbers. b) Check if there are terms of the sequence divisible by $2011$.

Let $a, b, c$ be positive real numbers such that $a + b + c = 1$. If $n$ is a positive integer then prove that \[ \frac{(3a)^n}{(b + 1)(c + 1)} + \frac{(3b)^n}{(c + 1)(a + 1)} + \frac{(3c)^n}{(a + 1)(b + 1)} \ge \frac{27}{16} \,. \]