$x,y,z,a,b,c$ are positive integers that satisfy $xy \equiv a \pmod z$, $yz \equiv b \pmod x$, $zx \equiv c \pmod y$. Prove that $\min{\{x,y,z\}} \le ab+bc+ca$.

How many pairs $(a, b)$ for integers $1 \le a, b \le 2015$ which satisfy that $a$ is divisible by $b + 1$ and $2016 - a$ is divisible by $b$.

Let $ p \geq 2$ be a prime number. Eduardo and Fernando play the following game making moves alternately: in each move, the current player chooses an index $i$ in the set $\{0,1,2,\ldots, p-1 \}$ that was not chosen before by either of the two players and then chooses an element $a_i$ from the set $\{0,1,2,3,4,5,6,7,8,9\}$. Eduardo has the first move. The game ends after all the indices have been chosen .Then the following number is computed: $$M=a_0+a_110+a_210^2+\cdots+a_{p-1}10^{p-1}= \sum_{i=0}^{p-1}a_i.10^i$$. The goal of Eduardo is to make $M$ divisible by $p$, and the goal of Fernando is to prevent this. Prove that Eduardo has a winning strategy. [i]Proposed by Amine Natik, Morocco[/i]

Let $a^b$ denote the number $ab$. The order of operations in the expression 7^7^7^7^7^7^7 must be determined by parentheses ($5$ pairs of parentheses are needed). Is it possible to put parentheses in two distinct ways so that the value of the expression be the same?

In decimal representation, we call an integer [i]$k$-carboxylic[/i] if and only if it can be represented as a sum of $k$ distinct integers, all of them greater than $9$, whose digits are the same. For instance, $2008$ is [i]$5$-carboxylic[/i] because $2008=1111+666+99+88+44$. Find, with an example, the smallest integer $k$ such that $8002$ is [i]$k$-carboxylic[/i].

Let $\mathbb N = {1, 2, 3, . . .}$. For real $x, y$, set $S(x, y) = \{s | s = [nx+y], n \in \mathbb N\}$. Prove that if $r > 1$ is a rational number, there exist real numbers $u$ and $v$ such that \[S(r, 0) \cap S(u, v) = \emptyset, S(r, 0) \cup S(u, v) = \mathbb N.\]

Square $S_{1}$ is $1\times 1.$ For $i\ge 1,$ the lengths of the sides of square $S_{i+1}$ are half the lengths of the sides of square $S_{i},$ two adjacent sides of square $S_{i}$ are perpendicular bisectors of two adjacent sides of square $S_{i+1},$ and the other two sides of square $S_{i+1},$ are the perpendicular bisectors of two adjacent sides of square $S_{i+2}.$ The total area enclosed by at least one of $S_{1}, S_{2}, S_{3}, S_{4}, S_{5}$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m-n.$ [asy] size(250); path p=rotate(45)*polygon(4); int i; for(i=0; i<5; i=i+1) { draw(shift(2-(1/2)^(i-1),0)*scale((1/2)^i)*p); } label("$S_1$", (0,-0.75)); label("$S_2$", (1,-0.75)); label("$S_3$", (3/2,-0.75)); label("$\cdots$", (7/4, -3/4)); label("$\cdots$", (2.25, 0));[/asy]

An ordered pair \((k,n)\) of positive integers is [i]good[/i] if there exists an ordered quadruple \((a,b,c,d)\) of positive integers such that \(a^3+b^k=c^3+d^k\) and \(abcd=n\). Prove that there exist infinitely many positive integers \(n\) such that \((2022,n)\) is not good but \((2023,n)\) is good. [i]Proposed by Luke Robitaille[/i]

Find all positive integers $n$ such that the number $\frac{(2n)!+1}{n!+1}$ is positive integer.

Determine which of the prime numbers $2,3,5,7,11,13,109,151,491$ divide $z =1963^{1965} -1963$.

Compute the sum of all positive integers $n$ for which the expression \[\frac{n+7}{\sqrt{n-1}}\] is an integer.

Let $k$ be a fixed odd integer, $k>3$. Prove: There exist infinitely many positive integers $n$, such that there are two positive integers $d_1, d_2$ satisfying $d_1,d_2$ each dividing $\frac{n^2+1}{2}$, and $d_1+d_2=n+k$.

Let $a_1, a_2, ...$ a sequence of integers such that for every $n \in N$ we have: $$\sum_{d | n} a_d = 2^n.$$ Show for every $n \in N$ that $n$ divides $a_n$. Remark: For $n = 6$ the equation is $a_1 + a_2 + a_3 + a_6 = 2^6.$

Call a rational number $r$ [i]powerful[/i] if $r$ can be expressed in the form $\dfrac{p^k}{q}$ for some relatively prime positive integers $p, q$ and some integer $k >1$. Let $a, b, c$ be positive rational numbers such that $abc = 1$. Suppose there exist positive integers $x, y, z$ such that $a^x + b^y + c^z$ is an integer. Prove that $a, b, c$ are all [i]powerful[/i]. [i]Jeck Lim, Singapore[/i]

Determine all finite nonempty sets $S$ of positive integers satisfying \[ {i+j\over (i,j)}\qquad\mbox{is an element of S for all i,j in S}, \] where $(i,j)$ is the greatest common divisor of $i$ and $j$.

[b]p1.[/b] In the correct identity $(x^2 - 1)(x + ...) = (x + 3)(x- 1)(x +...)$ two numbers were replaced with dots. What were these numbers? [b]p2.[/b] A merchant is carrying money from point A to point B. There are robbers on the roads who rob travelers: on one road the robbers take $10\%$ of the amount currently available, on the other - $20\%$, etc. . How should the merchant travel to bring as much of the money as possible to B? What part of the original amount will he bring to B? [img]https://cdn.artofproblemsolving.com/attachments/f/5/ab62ce8fce3d482bc52b89463c953f4271b45e.png[/img] [b]p3.[/b] Find the angle between the hour and minute hands at $7$ hours $38$ minutes. [b]p4.[/b] The lottery game is played as follows. A random number from $1$ to $1000$ is selected. If it is divisible by $2$, they pay a ruble, if it is divisible by $10$ - two rubles, by $12$ - four rubles, by $20$ - eight, if it is divisible by several of these numbers, then they pay the sum. How much can you win (at one time) in such a game? List all options. [b]p5.[/b]The sum of the digits of a positive integer $x$ is equal to $n$. Prove that between $x$ and $10x$ you can find an integer whose sum of digits is $ n + 5$. [b]p6.[/b] $9$ people took part in the campaign, which lasted $12$ days. There were $3$ people on duty every day. At the same time, the duty officers quarreled with each other and no two of them wanted to be on duty together ever again. Nevertheless, the participants of the campaign claim that for all $12$ days they were able to appoint three people on duty, taking into account this requirement. Could this be so? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

[b]p1.[/b] Consider a $4 \times 4$ lattice on the coordinate plane. At $(0,0)$ is Mori’s house, and at $(4,4)$ is Mori’s workplace. Every morning, Mori goes to work by choosing a path going up and right along the roads on the lattice. Recently, the intersection at $(2, 2)$ was closed. How many ways are there now for Mori to go to work? [b]p2.[/b] Given two integers, define an operation $*$ such that if a and b are integers, then a $*$ b is an integer. The operation $*$ has the following properties: 1. $a * a$ = 0 for all integers $a$. 2. $(ka + b) * a = b * a$ for integers $a, b, k$. 3. $0 \le b * a < a$. 4. If $0 \le b < a$, then $b * a = b$. Find $2017 * 16$. [b]p3.[/b] Let $ABC$ be a triangle with side lengths $AB = 13$, $BC = 14$, $CA = 15$. Let $A'$, $B'$, $C'$, be the midpoints of $BC$, $CA$, and $AB$, respectively. What is the ratio of the area of triangle $ABC$ to the area of triangle $A'B'C'$? [b]p4.[/b] In a strange world, each orange has a label, a number from $0$ to $10$ inclusive, and there are an infinite number of oranges of each label. Oranges with the same label are considered indistinguishable. Sally has 3 boxes, and randomly puts oranges in her boxes such that (a) If she puts an orange labelled a in a box (where a is any number from 0 to 10), she cannot put any other oranges labelled a in that box. (b) If any two boxes contain an orange that have the same labelling, the third box must also contain an orange with that labelling. (c) The three boxes collectively contain all types of oranges (oranges of any label). The number of possible ways Sally can put oranges in her $3$ boxes is $N$, which can be written as the product of primes: $$p_1^{e_1} p_2^{e_2}... p_k^{e_k}$$ where $p_1 \ne p_2 \ne p_3 ... \ne p_k$ and $p_i$ are all primes and $e_i$ are all positive integers. What is the sum $e_1 + e_2 + e_3 +...+ e_k$? [b]p5.[/b] Suppose I want to stack $2017$ identical boxes. After placing the first box, every subsequent box must either be placed on top of another one or begin a new stack to the right of the rightmost pile. How many different ways can I stack the boxes, if the order I stack them doesn’t matter? Express your answer as $$p_1^{e_1} p_2^{e_2}... p_n^{e_n}$$ where $p_1, p_2, p_3, ... , p_n$ are distinct primes and $e_i$ are all positive integers. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the minimum possible value of |m -n|, where $m$ and $n$ are integers satisfying $m + n = mn - 2021$.

Let $X \neq \varnothing$ be a finite set and let $f: X \to X$ be a function such that for every $x \in X$ and a fixed prime $p$ we have $f^p(x)=x.$ Let $Y=\{x \in X | f(x) \neq x\}.$ Prove that the number of the members of the set $Y$ is divisible by $p.$ [i]Note.[/i] ${f^p(x)=x = \underbrace{f(f(f(\cdots ((f}_{ p \text{ times}}(x) ) \cdots )))} .$

Consider the positive integers written in the decimal system with $n$ digits, the start of which is not zero and where there are no two sevens next to each other. The number of these numbers is called $u_n$. Derive a relation that expresses $u_{n+2}$ in terms of $u_{n+1}$ and $u_n$.

Find all functions $f:\mathbb{Z}_{\ge 1}\to \mathbb{R}_{>0}$ such that for all positive integers $n$ the following relation holds: $$\sum_{d|n} f(d)^3=\left (\sum_{d|n} f(d) \right )^2,$$ where both sums are taken over the positive divisors of $n$. [i] (Vlad Robu) [/i]

Let $n>1$ be any integer. Define $f,g$ as functions from $\{0,1,2,\cdots,n-1 \}$ to $\{0,1,2,\cdots,n-1\}$ defined as \begin{align*} &f(i)=2i \pmod{n} \\ &g(i)=2i+1 \pmod{n} \end{align*} Show that for any integers $\ell,m \in \{0,1,2,\cdots,n-1 \}$ , there are infinitely many compositions of $f,g$ that map $\ell$ to $m$

[b]p1.[/b] The length of the first side of a triangle is $1$, the length of the second side is $11$, and the length of the third side is an integer. Find that integer. [b]p2.[/b] Suppose $a, b$, and $c$ are positive numbers such that $a + b + c = 1$. Prove that $ab + ac + bc \le \frac13$. [b]p3.[/b] Prove that $1 +\frac12+\frac13+\frac14+ ... +\frac{1}{100}$ is not an integer. [b]p4.[/b] Find all of the four-digit numbers n such that the last four digits of $n^2$ coincide with the digits of $n$. [b]p5.[/b] (Bonus) Several ants are crawling along a circle with equal constant velocities (not necessarily in the same direction). If two ants collide, both immediately reverse direction and crawl with the same velocity. Prove that, no matter how many ants and what their initial positions are, they will, at some time, all simultaneously return to the initial positions. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1[/u] [b]p1.[/b] Five children, Aisha, Baesha, Cosha, Dasha, and Erisha, competed in running, jumping, and throwing. In each event, first place was won by someone from Renton, second place by someone from Seattle, and third place by someone from Tacoma. Aisha was last in running, Cosha was last in jumping, and Erisha was last in throwing. Could Baesha and Dasha be from the same city? [b]p2.[/b] Fifty-five Brits and Italians met in a coffee shop, and each of them ordered either coffee or tea. Brits tell the truth when they drink tea and lie when they drink coffee; Italians do it the other way around. A reporter ran a quick survey: Forty-four people answered “yes” to the question, “Are you drinking coffee?” Thirty-three people answered “yes” to the question, “Are you Italian?” Twenty-two people agreed with the statement, “It is raining outside.” How many Brits in the coffee shop are drinking tea? [b]p3.[/b] Doctor Strange is lost in a strange house with a large number of identical rooms, connected to each other in a loop. Each room has a light and a switch that could be turned on and off. The lights might initially be on in some rooms and off in others. How can Dr. Strange determine the number of rooms in the house if he is only allowed to switch lights on and off? [b]p4.[/b] Fifty street artists are scheduled to give solo shows with three consecutive acts: juggling, drumming, and gymnastics, in that order. Each artist will spend equal time on each of the three activities, but the lengths may be different for different artists. At least one artist will be drumming at every moment from dawn to dusk. A new law was just passed that says two artists may not drum at the same time. Show that it is possible to cancel some of the artists' complete shows, without rescheduling the rest, so that at least one show is going on at every moment from dawn to dusk, and the schedule complies with the new law. [b]p5.[/b] Alice and Bob split the numbers from $1$ to $12$ into two piles with six numbers in each pile. Alice lists the numbers in the first pile in increasing order as $a_1 < a_2 < a_3 < a_4 < a_5 < a_6$ and Bob lists the numbers in the second pile in decreasing order $b_1 > b_1 > b_3 > b_4 > b_5 > b_6$. Show that no matter how they split the numbers, $$|a_1 -b_1| + |a_2 -b_2| + |a_3 -b_3| + |a_4 -b_4| + |a_5 -b_5| + |a_6 -b_6| = 36.$$ [u]Round 2[/u] [b]p6.[/b] The Martian alphabet has ? letters. Marvin writes down a word and notices that within every sub-word (a contiguous stretch of letters) at least one letter occurs an odd number of times. What is the length of the longest possible word he could have written? [b]p7.[/b] For a long space journey, two astronauts with compatible personalities are to be selected from $24$ candidates. To find a good fit, each candidate was asked $24$ questions that required a simple yes or no answer. Two astronauts are compatible if exactly $12$ of their answers matched (that is, both answered yes or both answered no). Miraculously, every pair of these $24$ astronauts was compatible! Show that there were exactly $12$ astronauts whose answer to the question “Can you repair a flux capacitor?” was exactly the same as their answer to the question “Are you afraid of heights?” (that is, yes to both or no to both). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p_n$ denote the $n^{\text{th}}$ prime number and define $a_n=\lfloor p_n\nu\rfloor$ for all positive integers $n$ where $\nu$ is a positive irrational number. Is it possible that there exist only finitely many $k$ such that $\binom{2a_k}{a_k}$ is divisible by $p_i^{10}$ for all $i=1,2,\ldots,2020?$ [i]Proposed by Superguy and ayan.nmath[/i]