Found problems: 800
The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection.
Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$.
[i]Proposed by Warut Suksompong, Thailand[/i]
Let $ABC$ be a triangle with $\angle A = 90^{\circ}$. Points $D$ and $E$ lie on sides $AC$ and $AB$, respectively, such that $\angle ABD = \angle DBC$ and $\angle ACE = \angle ECB$. Segments $BD$ and $CE$ meet at $I$. Determine whether or not it is possible for segments $AB$, $AC$, $BI$, $ID$, $CI$, $IE$ to all have integer lengths.
$110$ teams participate in a volleyball tournament. Every team has played every other team exactly once (there are no ties in volleyball). Turns out that in any set of $55$ teams, there is one which has lost to no more than $4$ of the remaining $54$ teams. Prove that in the entire tournament, there is a team that has lost to no more than $4$ of the remaining $109$ teams.
Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$, the remainder is $x + 2$, and when $P(x)$ is divided by the polynomial $x^2 + 1$, the remainder is $2x + 1$. There is a unique polynomial of least degree with these two properties. What is the sum of the squares of the coefficients of that polynomial?
$\textbf{(A) } 10 \qquad \textbf{(B) } 13 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 23$
Let $C$ be the set of non-negative integers which can be expressed as $1999s+2000t$, where $s$ and $t$ are also non-negative integers.
(a) Show that $3,994,001$ is not in $C$.
(b) Show that if $0\leq n \leq 3,994,001$ and $n$ is an integer not in $C$, then $3,994,001-n$ is in $C$.
A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation
$$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$
Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.
For any positive integers $n$ and $k$, let $L(n,k)$ be the least common multiple of the $k$ consecutive integers $n,n+1,\ldots ,n+k-1$. Show that for any integer $b$, there exist integers $n$ and $k$ such that $L(n,k)>bL(n+1,k)$.
In a badminton tournament, each of $n$ players play all the other $n-1$ players. Each game results in either a win, or a loss. The players then write down the names of those whom they defeated, and also of those who they defeated. For example, if $A$ beats $B$ and $B$ beats $C,$ then $A$ writes the names of both $B$ and $C$. Show that there will be one person, who has written down the names of all the other $n-1$ players.
[hide="Clarification"]
Consider a game between $A,B,C,D,E,F,G$ where $A$ defeats $B$ and $C$ and $B$ defeats $E,F$, $C$ defeats $E.$ Then $A$'s list will have $(B,C,E,F)$, and will not include $G.$
[/hide]
Find all $C\in \mathbb{R}$ such that every sequence of integers $\{a_n\}_{n=1}^{\infty}$ which is bounded from below and for all $n\geq 2$ satisfy $$0\leq a_{n-1}+Ca_n+a_{n+1}<1$$ is periodic.
Proposed by Navid Safaei
Define a $ k$-[i]clique[/i] to be a set of $ k$ people such that every pair of them are acquainted with each other. At a certain party, every pair of 3-cliques has at least one person in common, and there are no 5-cliques. Prove that there are two or fewer people at the party whose departure leaves no 3-clique remaining.
For any integer $k\ge1$, let $p(k)$ be the smallest prime which does not divide $k$. Define the integer function $X(k)$ to be the product of all primes less than $p(k)$ if $p(k)>2$, and $X(k)=1$ if $p(k)=2$. Let $\{x_n\}$ be the sequence defined by $x_0=1$, and $x_{n+1}X(x_n)=x_np(x_n)$ for $n\ge0$. Find the smallest positive integer, $t$ such that $x_t=2090$.
For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.
Ten gangsters are standing on a flat surface, and the distances between them are all distinct. At twelve o’clock, when the church bells start chiming, each of them fatally shoots the one among the other nine gangsters who is the nearest. At least how many gangsters will be killed?
All letters in the word $VUQAR$ are different and chosen from the set $\{1,2,3,4,5\}$. Find all solutions to the equation \[\frac{(V+U+Q+A+R)^2}{V-U-Q+A+R}=V^{{{U^Q}^A}^R}.\]
A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation
$$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$
Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.
A rectangular array has $ n$ rows and $ 6$ columns, where $ n \geq 2$. In each cell there is written either $ 0$ or $ 1$. All rows in the array are different from each other. For each two rows $ (x_{1},x_{2},x_{3},x_{4},x_{5},x_{6})$ and $ (y_{1},y_{2},y_{3},y_{4},y_{5},y_{6})$, the row $ (x_{1}y_{1},x_{2}y_{2},x_{3}y_{3},x_{4}y_{4},x_{5}y_{5},x_{6}y_{6})$ can be found in the array as well. Prove that there is a column in which at least half of the entries are zeros.
Let $P(x)$ be a polynomial with integer coefficients such that $P(0)=1$, and let $c > 1$ be an integer. Define $x_0=0$ and $x_{i+1} = P(x_i)$ for all integers $i \ge 0$. Show that there are infinitely many positive integers $n$ such that $\gcd (x_n, n+c)=1$.
[i]Proposed by Milan Haiman and Carl Schildkraut[/i]
The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection.
Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$.
[i]Proposed by Warut Suksompong, Thailand[/i]
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
For any finite sets $X$ and $Y$ of positive integers, denote by $f_X(k)$ the $k^{\text{th}}$ smallest positive integer not in $X$, and let $$X*Y=X\cup \{ f_X(y):y\in Y\}.$$Let $A$ be a set of $a>0$ positive integers and let $B$ be a set of $b>0$ positive integers. Prove that if $A*B=B*A$, then $$\underbrace{A*(A*\cdots (A*(A*A))\cdots )}_{\text{ A appears $b$ times}}=\underbrace{B*(B*\cdots (B*(B*B))\cdots )}_{\text{ B appears $a$ times}}.$$
[i]Proposed by Alex Zhai, United States[/i]
Let $(a_n)_{n\geq 1}$ be a sequence of positive real numbers with the property that
$$(a_{n+1})^2 + a_na_{n+2} \leq a_n + a_{n+2}$$
for all positive integers $n$. Show that $a_{2022}\leq 1$.
Are there any triples $(a,b,c)$ of positive integers such that $(a-2)(b-2)(c-2)+12$ is a prime number that properly divides the positive number $a^2+b^2+c^2+abc-2017$?
Let $M$ be a point in the triangle $ABC$ such that
\[\text{area}(ABM)=2 \cdot \text{area}(ACM)\]
Show that the locus of all such points is a straight line.
For a finite set $A$ of positive integers, a partition of $A$ into two disjoint nonempty subsets $A_1$ and $A_2$ is $\textit{good}$ if the least common multiple of the elements in $A_1$ is equal to the greatest common divisor of the elements in $A_2$. Determine the minimum value of $n$ such that there exists a set of $n$ positive integers with exactly $2015$ good partitions.
On some planet, there are $2^N$ countries $(N \geq 4).$ Each country has a flag $N$ units wide and one unit high composed of $N$ fields of size $1 \times 1,$ each field being either yellow or blue. No two countries have the same flag. We say that a set of $N$ flags is diverse if these flags can be arranged into an $N \times N$ square so that all $N$ fields on its main diagonal will have the same color. Determine the smallest positive integer $M$ such that among any $M$ distinct flags, there exist $N$ flags forming a diverse set.
[i]Proposed by Tonći Kokan, Croatia[/i]