Found problems: 429
For each prime $p$, construct a graph $G_p$ on $\{1,2,\ldots p\}$, where $m\neq n$ are adjacent if and only if $p$ divides $(m^{2} + 1-n)(n^{2} + 1-m)$. Prove that $G_p$ is disconnected for infinitely many $p$
Twenty-five points are given on the plane. Among any three of them, one can choose two less than one inch apart. Prove that there are 13 points among them which lie in a circle of radius 1.
At a certain orphanage, every pair of orphans are either friends or enemies. For every three of an orphan's friends, an even number of pairs of them are enemies. Prove that it's possible to assign each orphan two parents such that every pair of friends shares exactly one parent, but no pair of enemies does, and no three parents are in a love triangle (where each pair of them has a child).
Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.
Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$.
[i]Proposed by Warut Suksompong, Thailand[/i]
Find the maximal value of
\[S = \sqrt[3]{\frac{a}{b+7}} + \sqrt[3]{\frac{b}{c+7}} + \sqrt[3]{\frac{c}{d+7}} + \sqrt[3]{\frac{d}{a+7}},\]
where $a$, $b$, $c$, $d$ are nonnegative real numbers which satisfy $a+b+c+d = 100$.
[i]Proposed by Evan Chen, Taiwan[/i]
Let $T$ be a finite set of positive integers greater than 1. A subset $S$ of $T$ is called [i]good[/i] if for every $t \in T$ there exists some $s \in S$ with $\gcd(s, t) > 1$. Prove that the number of good subsets of $T$ is odd.
Fix integers $n\geq 2$ and $1\leq m\leq n-1$. Let $a_0, a_1, \dots, a_n$ be non-negative real numbers satisfying $a_0+a_1+\dots +a_n=1$. Prove that, if $\sum_{k=0}^n a_kx^k < x^m$ for some $0<x<1$, then $$\sum_{k=0}^{m-1}(m-k)a_k < \sum_{k=m+1}^n (k-m)a_k.$$
Elmo is drawing with colored chalk on a sidewalk outside. He first marks a set $S$ of $n>1$ collinear points. Then, for every unordered pair of points $\{X,Y\}$ in $S$, Elmo draws the circle with diameter $XY$ so that each pair of circles which intersect at two distinct points are drawn in different colors. Count von Count then wishes to count the number of colors Elmo used. In terms of $n$, what is the minimum number of colors Elmo could have used?
[i]Michael Ren[/i]
There are $n > 2022$ cities in the country. Some pairs of cities are connected with straight two-ways airlines. Call the set of the cities {\it unlucky}, if it is impossible to color the airlines between them in two colors without monochromatic triangle (i.e. three cities $A$, $B$, $C$ with the airlines $AB$, $AC$ and $BC$ of the same color).
The set containing all the cities is unlucky. Is there always an unlucky set containing exactly 2022 cities?
Prove that, for all sufficiently large integers $n$, there exists $n$ numbers $a_1, a_2, \dots, a_n$ satisfying the following three conditions:
[list]
[*] Each number $a_i$ is equal to either $-1, 0$ or $1$.
[*] At least $\frac{2n}{5}$ of the numbers $a_1, a_2, \dots, a_n$ are non-zero.
[*] The sum $\frac{a_1}{1} + \frac{a_2}{2} + \dots + \frac{a_n}{n}$ is $0$.
[/list]
$\textit{Note: Results with 2/5 replaced by a constant } c \textit{ will be awarded points depending on the value of } c$
[i]Proposed by Navneel Singhal, India; Kyle Hess, USA; and Vincent Jugé, France[/i]
Given is an integer $k\geq 2$. Determine the smallest positive integer $n$, such that, among any $n$ points in the plane, there exist $k$ points among them, such that all distances between them are less than or equal to $2$, or all distances are strictly greater than $1$.
If we write the sequence $\text{AAABABBB}$ along the perimeter of a circle, then every word of the length $3$ consisting of letters $A$ and $B$ (i.e. $\text{AAA}$, $\text{AAB}$, $\text{ABA}$, $\text{BAB}$, $\text{ABB}$, $\text{BBB}$, $\text{BBA}$, $\text{BAA}$) occurs exactly once on the perimeter. Decide whether it is possible to write a sequence of letters from a $k$-element alphabet along the perimeter of a circle in such a way that every word of the length $l$ (i.e. an ordered $l$-tuple of letters) occurs exactly once on the perimeter.
Given $10$ points in the space such that each $4$ points are not lie on a plane. Connect some points with some segments such that there are no triangles or quadrangles. Find the maximum number of the segments.
Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards.
Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells.
[*]Prove that every minimal blocking set containing at most $3m^2$ cells.
The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$.
[i]Proposed by Croatia[/i]
Nancy shuffles a deck of $52$ cards and spreads the cards out in a circle face up, leaving one spot empty. Andy, who is in another room and does not see the cards, names a card. If this card is adjacent to the empty spot, Nancy moves the card to the empty spot, without telling Andy; otherwise nothing happens. Then Andy names another card and so on, as many times as he likes, until he says "stop."
[list][b](a)[/b] Can Andy guarantee that after he says "stop," no card is in its initial spot?
[b](b)[/b] Can Andy guarantee that after he says "stop," the Queen of Spades is not adjacent to
the empty spot?[/list]
Unit cubes are made into beads by drilling a hole through them along a diagonal. The beads are put on a string in such a way that they can move freely in space under the restriction that the vertices of two neighboring cubes are touching. Let $ A$ be the beginning vertex and $ B$ be the end vertex. Let there be $ p \times q \times r$ cubes on the string $ (p, q, r \geq 1).$
[i](a)[/i] Determine for which values of $ p, q,$ and $ r$ it is possible to build a block with dimensions $ p, q,$ and $ r.$ Give reasons for your answers.
[i](b)[/i] The same question as (a) with the extra condition that $ A \equal{} B.$
There are $4n$ pebbles of weights $1, 2, 3, \dots, 4n.$ Each pebble is coloured in one of $n$ colours and there are four pebbles of each colour. Show that we can arrange the pebbles into two piles so that the following two conditions are both satisfied:
[list]
[*]The total weights of both piles are the same.
[*] Each pile contains two pebbles of each colour.
[/list]
[i]Proposed by Milan Haiman, Hungary and Carl Schildkraut, USA[/i]
Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$.
[i]Proposed by Warut Suksompong, Thailand[/i]
Let $n$ be a positive integer. There are $2018n+1$ cities in the Kingdom of Sellke Arabia. King Mark wants to build two-way roads that connect certain pairs of cities such that for each city $C$ and integer $1\le i\le 2018,$ there are exactly $n$ cities that are a distance $i$ away from $C.$ (The [i]distance[/i] between two cities is the least number of roads on any path between the two cities.)
For which $n$ is it possible for Mark to achieve this?
[i]Proposed by Michael Ren[/i]
Edges of a complete graph with $2m$ vertices are properly colored with $2m-1$ colors. It turned out that for any two colors all the edges colored in one of these two colors can be described as union of several $4$-cycles. Prove that $m$ is a power of $2$.
Let $S$ be an infinite set of positive integers, such that there exist four pairwise distinct $a,b,c,d \in S$ with $\gcd(a,b) \neq \gcd(c,d)$. Prove that there exist three pairwise distinct $x,y,z \in S$ such that $\gcd(x,y)=\gcd(y,z) \neq \gcd(z,x)$.
Let $n{}$ be a positive integer, and let $\mathcal{C}$ be a collection of subsets of $\{1,2,\ldots,2^n\}$ satisfying both of the following conditions:[list=1]
[*]Every $(2^n-1)$-element subset of $\{1,2,\ldots,2^n\}$ is a member of $\mathcal{C}$, and
[*]Every non-empty member $C$ of $\mathcal{C}$ contains an element $c$ such that $C\setminus\{c\}$ is again a member of $\mathcal{C}$.
[/list]Determine the smallest size $\mathcal{C}$ may have.
[i]Serbia, Pavle Martinovic ́[/i]
There are $n$ cities in a country, where $n \geq 100$ is an integer. Some pairs of cities are connected by direct (two-way) flights. For two cities $A$ and $B$ we define:
$(i)$ A $\emph{path}$ between $A$ and $B$ as a sequence of distinct cities $A = C_0, C_1, \dots, C_k, C_{k+1} = B$, $k \geq 0$, such that there are direct flights between $C_i$ and $C_{i+1}$ for every $0 \leq i \leq k$;
$(ii)$ A $\emph{long path}$ between $A$ and $B$ as a path between $A$ and $B$ such that no other path between $A$ and $B$ has more cities;
$(iii)$ A $\emph{short path}$ between $A$ and $B$ as a path between $A$ and $B$ such that no other path between $A$ and $B$ has fewer cities.
Assume that for any pair of cities $A$ and $B$ in the country, there exist a long path and a short path between them that have no cities in common (except $A$ and $B$). Let $F$ be the total number of pairs of cities in the country that are connected by direct flights. In terms of $n$, find all possible values $F$
Proposed by David-Andrei Anghel, Romania.