Found problems: 175
1986 IMO Shortlist, 8
From a collection of $n$ persons $q$ distinct two-member teams are selected and ranked $1, \cdots, q$ (no ties). Let $m$ be the least integer larger than or equal to $2q/n$. Show that there are $m$ distinct teams that may be listed so that :
[b](i)[/b] each pair of consecutive teams on the list have one member in common and
[b](ii)[/b] the chain of teams on the list are in rank order.
[i]Alternative formulation.[/i]
Given a graph with $n$ vertices and $q$ edges numbered $1, \cdots , q$, show that there exists a chain of $m$ edges, $m \geq \frac{2q}{n}$ , each two consecutive edges having a common vertex, arranged monotonically with respect to the numbering.
2002 Iran MO (2nd round), 1
Let $n \in \mathbb N$ and $A_n$ set of all permutations $(a_1, \ldots, a_n)$ of the set $\{1, 2, \ldots , n\}$ for which
\[k|2(a_1 + \cdots+ a_k), \text{ for all } 1 \leq k \leq n.\]
Find the number of elements of the set $A_n$.
[i]Proposed by Vidan Govedarica, Serbia[/i]
1959 Kurschak Competition, 3
What is the largest possible value of $|a_1 - 1| + |a_2-2|+...+ |a_n- n|$ where $a_1, a_2,..., a_n$ is a permutation of $1,2,..., n$?
2015 Romania Team Selection Tests, 3
Let $n$ be a positive integer . If $\sigma$ is a permutation of the first $n$ positive integers , let $S(\sigma)$ be the set of all distinct sums of the form $\sum_{i=k}^{l} \sigma(i)$ where $1 \leq k \leq l \leq n$ .
[b](a)[/b] Exhibit a permutation $\sigma$ of the first $n$ positive integers such that $|S(\sigma)|\geq \left \lfloor{\frac{(n+1)^2}{4}}\right \rfloor $.
[b](b)[/b] Show that $|S(\sigma)|>\frac{n\sqrt{n}}{4\sqrt{2}}$ for all permutations $\sigma$ of the first $n$ positive integers .
2014 IMC, 5
For every positive integer $n$, denote by $D_n$ the number of permutations $(x_1, \dots, x_n)$ of $(1,2,\dots, n)$ such that $x_j\neq j$ for every $1\le j\le n$. For $1\le k\le \frac{n}{2}$, denote by $\Delta (n,k)$ the number of permutations $(x_1,\dots, x_n)$ of $(1,2,\dots, n)$ such that $x_i=k+i$ for every $1\le i\le k$ and $x_j\neq j$ for every $1\le j\le n$. Prove that
$$\Delta (n,k)=\sum_{i=0}^{k=1} \binom{k-1}{i} \frac{D_{(n+1)-(k+i)}}{n-(k+i)}$$
(Proposed by Combinatorics; Ferdowsi University of Mashhad, Iran; Mirzavaziri)
1986 IMO Longlists, 74
From a collection of $n$ persons $q$ distinct two-member teams are selected and ranked $1, \cdots, q$ (no ties). Let $m$ be the least integer larger than or equal to $2q/n$. Show that there are $m$ distinct teams that may be listed so that :
[b](i)[/b] each pair of consecutive teams on the list have one member in common and
[b](ii)[/b] the chain of teams on the list are in rank order.
[i]Alternative formulation.[/i]
Given a graph with $n$ vertices and $q$ edges numbered $1, \cdots , q$, show that there exists a chain of $m$ edges, $m \geq \frac{2q}{n}$ , each two consecutive edges having a common vertex, arranged monotonically with respect to the numbering.
1992 Czech And Slovak Olympiad IIIA, 1
For a permutation $p(a_1,a_2,...,a_{17})$ of $1,2,...,17$, let $k_p$ denote the largest $k$ for which $a_1 +...+a_k < a_{k+1} +...+a_{17}$. Find the maximum and minimum values of $k_p$ and find the sum $\sum_{p} k_p$ over all permutations$ p$.
2025 Taiwan TST Round 1, N
Find all positive integers $n$ such that there exist two permutations $a_0,a_1,\ldots,a_{n-1}$ and $b_0,b_1,\ldots,b_{n-1}$ of the set $\lbrace0,1,\ldots,n-1\rbrace$, satisfying the condition
$$ia_i\equiv b_i\pmod{n}$$
for all $0\le i\le n-1$.
[i]Proposed by Fysty[/i]
2018 Saudi Arabia IMO TST, 3
Find all positive integers $k$ such that there exists some permutation of $(1, 2,...,1000)$ namely $(a_1, a_2,..., a_{1000}) $ and satisfy $|a_i - i| = k$ for all $i = 1,1000$.
1991 Swedish Mathematical Competition, 4
$x_1, x_2, ... , x_8$ is a permutation of $1, 2, ..., 8$. A move is to take $x_3$ or $x_8$ and place it at the start to from a new sequence. Show that by a sequence of moves we can always arrive at $1, 2, ..., 8$.
2013 India IMO Training Camp, 1
Let $n \ge 2$ be an integer. There are $n$ beads numbered $1, 2, \ldots, n$. Two necklaces made out of some of these beads are considered the same if we can get one by rotating the other (with no flipping allowed). For example, with $n \ge 5$, the necklace with four beads $1, 5, 3, 2$ in the clockwise order is same as the one with $5, 3, 2, 1$ in the clockwise order, but is different from the one with $1, 2, 3, 5$ in the clockwise order.
We denote by $D_0(n)$ (respectively $D_1(n)$) the number of ways in which we can use all the beads to make an even number (resp. an odd number) of necklaces each of length at least $3$. Prove that $n - 1$ divides $D_1(n) - D_0(n)$.
2021 Kyiv City MO Round 1, 8.3
The $1 \times 1$ cells located around the perimeter of a $3 \times 3$ square are filled with the numbers $1,
2, \ldots, 8$ so that the sums along each of the four sides are equal. In the upper left corner cell is the number $8$, and in the upper left is the number $6$ (see the figure below).
[img]https://i.ibb.co/bRmd12j/Kyiv-MO-2021-Round-1-8-2.png[/img]
How many different ways to fill the remaining cells are there under these conditions?
[i]Proposed by Mariia Rozhkova[/i]
2012 IMAC Arhimede, 1
Let $a_1,a_2,..., a_n$ be different integers and let $(b_1,b_2,..., b_n),(c_1,c_2,..., c_n)$ be two of their permutations, different from the identity. Prove that
$$(|a_1-b_1|+|a_2-b_2|+...+|a_n-b_n| , |a_1-c_1|+|a_2-c_2|+...+|a_n-c_n| ) \ge 2$$
where $(x,y)$ denotes the greatest common divisor of the numbers $x,y$
2019 Durer Math Competition Finals, 5
How many permutations $s$ does the set $\{1,2,..., 15\}$ have with the following properties:
for every $1 \le k \le 13$ we have $s(k) < s(k+2)$ and for every $1 \le k \le 12$ we have $s(k) < s(k+3)$?
2024 SG Originals, Q1
Find all permutations $(a_1, a_2, \cdots, a_{2024})$ of $(1, 2, \cdots, 2024)$ such that there exists a polynomial $P$ with integer coefficients satisfying $P(i) = a_i$ for each $i = 1, 2, \cdots, 2024$.
2018 Puerto Rico Team Selection Test, 2
Let $A = \{a_1, a_2, a_3, a_4, a_5\}$ be a set of $5$ positive integers.
Show that for any rearrangement of $A$, $a_{i1}$, $a_{i2}$, $a_{i3}$, $a_{i4}$, $a_{i5}$, the product $$(a_{i1} -a_1) (a_{i2} -a_2) (a_{i3} -a_3) (a_{i4} -a_4) (a_{i5} -a_5)$$
is always even.
2024 Mexican University Math Olympiad, 5
Consider two finite sequences of real numbers \( a_1, a_2, \dots, a_n \) and \( b_1, b_2, \dots, b_n \). Let \( \alpha(x) = \#\{i | a_i = x \} \) and \( \beta(x) = \#\{i | b_i = -x \} \). Prove that there exists a permutation \( \sigma \in S_n \) (the symmetric group of \( n \) elements) such that \( a_{\sigma(i)} + b_i \neq 0 \) for all \( i = 1, \dots, n \) if and only if \( \alpha(x) + \beta(x) \leq n \) for all \( x \in \mathbb{R} \).
2006 Germany Team Selection Test, 3
Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$.
Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have
\[ n\mid a_i \minus{} b_i \minus{} c_i
\]
[i]Proposed by Ricky Liu & Zuming Feng, USA[/i]
2009 Junior Balkan Team Selection Tests - Romania, 4
Show that there exist (at least) a rearrangement $a_0, a_1, a_2,..., a_{63}$ of the numbers $0,1, 2,..., 63$, such that $a_i - a_j \ne a_j - a_k$, for any $i < j < k \in \{0,1, 2,..., 63\}$.
1989 Poland - Second Round, 2
For a randomly selected permutation $ \mathbf{f} = (f_1,..., f_n) $ of the set $ \{1,\ldots, n\} $ let us denote by $ X(\mathbf{f}) $ the largest number $ k \leq n $ such that $ f_i < f_{ i+1} $ for all numbers $ i < k $. Prove that the expected value of the random variable $ X $ is $ \sum_{k=1}^n \frac{1}{k!} $.
2018 Pan-African Shortlist, C4
Seven cyclists follow one another, in a line, on a narrow way. By the end of the training, each cyclist complains about the style of driving of the one in front of him. They agree to rearrange themselves the next day, so that no cyclist would follow the same cyclist he follows the first day. How many such rearrangements are possible?
2022 Tuymaada Olympiad, 5
Each row of a $24 \times 8$ table contains some permutation of the numbers $1, 2, \cdots , 8.$ In each column the numbers are multiplied. What is the minimum possible sum of all the products?
[i](C. Wu)[/i]
2024 Junior Balkan Team Selection Tests - Romania, P1
Let $n\geqslant 3$ be an integer and $a_1,a_2,\ldots,a_n$ be pairwise distinct positive real numbers with the property that there exists a permutation $b_1,b_2,\ldots,b_n$ of these numbers such that\[\frac{a_1}{b_1}=\frac{a_2}{b_2}=\cdots=\frac{a_{n-1}}{b_{n-1}}\neq 1.\]Prove that there exist $a,b>0$ such that $\{a_1,a_2,\ldots,a_n\}=\{ab,ab^2,\ldots,ab^n\}.$
[i]Cristi Săvescu[/i]
2010 Contests, 1
A [i]permutation[/i] of the set of positive integers $[n] = \{1, 2, . . . , n\}$ is a sequence $(a_1 , a_2 , \ldots, a_n ) $ such that each element of $[n]$ appears precisely one time as a term of the sequence. For example, $(3, 5, 1, 2, 4)$ is a permutation of $[5]$. Let $P (n)$ be the number of permutations of $[n]$ for which $ka_k$ is a perfect square for all $1 \leq k \leq n$. Find with proof the smallest $n$ such that $P (n)$ is a multiple of $2010$.
2015 Middle European Mathematical Olympiad, 3
There are $n$ students standing in line positions $1$ to $n$. While the teacher looks away, some students change their positions. When the teacher looks back, they are standing in line again. If a student who was initially in position $i$ is now in position $j$, we say the student moved for $|i-j|$ steps. Determine the maximal sum of steps of all students that they can achieve.