Found problems: 14842
2011 China Team Selection Test, 2
Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.
2012 Iran MO (3rd Round), 3
Prove that if $n$ is large enough, then for each coloring of the subsets of the set $\{1,2,...,n\}$ with $1391$ colors, two non-empty disjoint subsets $A$ and $B$ exist such that $A$, $B$ and $A\cup B$ are of the same color.
2011 USA TSTST, 5
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).
2006 Macedonia National Olympiad, 1
A natural number is written on the blackboard. In each step, we erase the units digit and add four times the erased digit to the remaining number, and write the result on the blackboard instead of the initial number. Starting with the number $13^{2006}$, is it possible to obtain the number $2006^{13}$ by repeating this step finitely many times?
2009 Cono Sur Olympiad, 4
Andrea and Bruno play a game on a table with $11$ rows and $9$ columns. First Andrea divides the table in $33$ zones. Each zone is formed by $3$ contiguous cells aligned vertically or horizontally, as shown in the figure.
[code]
._
|_|
|_| _ _ _
|_| |_|_|_|
[/code]
Then, Bruno writes one of the numbers $0, 1, 2, 3, 4, 5$ in each cell in such a way that the sum of the numbers in each zone is equal to $5$. Bruno wins if the sum of the numbers written in each of the $9$ columns of the table is a prime number. Otherwise, Andrea wins. Show that Bruno always has a winning strategy.
2012 Dutch Mathematical Olympiad, 5
The numbers $1$ to $12$ are arranged in a sequence. The number of ways this can be done equals $12 \times11 \times 10\times ...\times 1$. We impose the condition that in the sequence there should be exactly one number that is smaller than the number directly preceding it.
How many of the $12 \times11 \times 10\times ...\times 1$ sequences satisfy this condition?
2014 JBMO TST - Turkey, 4
Alice and Bob play a game on a complete graph $G$ with $2014$ vertices. They take moves in turn with Alice beginning. At each move Alice directs one undirected edge of $G$. At each move Bob chooses a positive integer number $m,$ $1 \le m \le 1000$ and after that directs $m$ undirected edges of $G$. The game ends when all edges are directed. If there is some directed cycle in $G$ Alice wins. Determine whether Alice has a winning strategy.
2023 Romania Team Selection Test, P4
Fix a positive integer $n.{}$ Consider an $n{}$-point set $S{}$ in the plane. An [i]eligible[/i] set is a non-empty set of the form $S\cap D,{}$ where $D$ is a closed disk in the plane. In terms of $n,$ determine the smallest possible number of eligible subsets $S{}$ may contain.
[i]Proposed by Cristi Săvescu[/i]
2015 China Team Selection Test, 1
For a positive integer $n$, and a non empty subset $A$ of $\{1,2,...,2n\}$, call $A$ good if the set $\{u\pm v|u,v\in A\}$ does not contain the set $\{1,2,...,n\}$. Find the smallest real number $c$, such that for any positive integer $n$, and any good subset $A$ of $\{1,2,...,2n\}$, $|A|\leq cn$.
2023 Turkey MO (2nd round), 3
Let a $9$-digit number be balanced if it has all numerals $1$ to $9$. Let $S$ be the sequence of the numerals which is constructed by writing all balanced numbers in increasing order consecutively. Find the least possible value of $k$ such that any two subsequences of $S$ which has consecutive $k$ numerals are different from each other.
2017 Korea Winter Program Practice Test, 3
For a number consists of $0$ and $1$, one can perform the following operation: change all $1$ into $100$, all $0$ into $1$. For all nonnegative integer $n$, let $A_n$ be the number obtained by performing the operation $n$ times on $1$(starts with $100,10011,10011100100,\dots$), and $a_n$ be the $n$-th digit(from the left side) of $A_n$. Prove or disprove that there exists a positive integer $m$ satisfies the following:
For every positive integer $l$, there exists a positive integer $k\le m$ satisfying$$a_{l+k+1}=a_1,\ a_{l+k+2}=a_2,\ \dots,\ a_{l+k+2017}=a_{2017}$$
2004 Hong kong National Olympiad, 2
In a school there $b$ teachers and $c$ students. Suppose that
a) each teacher teaches exactly $k$ students, and
b)for any two (distinct) students , exactly $h$ teachers teach both of them.
Prove that $\frac{b}{h}=\frac{c(c-1)}{k(k-1)}$.
2018 Cono Sur Olympiad, 3
Define the product $P_n=1! \cdot 2!\cdot 3!\cdots (n-1)!\cdot n!$
a) Find all positive integers $m$, such that $\frac {P_{2020}}{m!}$ is a perfect square.
b) Prove that there are infinite many value(s) of $n$, such that $\frac {P_{n}}{m!}$ is a perfect square, for at least two positive integers $m$.
2017 HMNT, 10
Five equally skilled tennis players named Allen, Bob, Catheryn, David, and Evan play in a round robin tournament, such that each pair of people play exactly once, and there are no ties. In each of the ten games, the two players both have a 50% chance of winning, and the results of the games are independent. Compute the probability that there exist four distinct players $P_1$, $P_2$, $P_3$, $P_4$ such that $P_i$ beats $P_{i+1}$ for $i=1, 2, 3, 4$. (We denote $P_5=P_1$).
2024 Euler Olympiad, Round 2, 4
Three numbers are initially written on the board: 2023, 2024, and 2025. In each move, you can increase any two of these numbers by 1 and decrease the third one by 2.
a) Determine whether it is possible to perform a sequence of operations such that the board eventually contains two numbers that are equal.
b) Calculate the number of all possible ordered triples of positive integers that can be obtained by performing such operations some number of times.
[i]Proposed by Giorgi Arabidze, Georgia [/i]
Kvant 2020, M2612
Peter and Basil play the following game on a horizontal table $1\times{2019}$. Initially Peter chooses $n$ positive integers and writes them on a board. After that Basil puts a coin in one of the cells. Then at each move, Peter announces a number s among the numbers written on the board, and Basil needs to shift the coin by $s$ cells, if it is possible: either to the left, or to the right, by his decision. In case it is not possible to shift the coin by $s$ cells neither to the left, nor to the right, the coin stays in the current cell. Find the least $n$ such that Peter can play so that the coin will visit all the cells, regardless of the way Basil plays.
2008 All-Russian Olympiad, 5
The distance between two cells of an infinite chessboard is defined as the minimum nuber to moves needed for a king for move from one to the other.One the board are chosen three cells on a pairwise distances equal to $ 100$. How many cells are there that are on the distance $ 50$ from each of the three cells?
2011 ELMO Shortlist, 1
Let $S$ be a finite set, and let $F$ be a family of subsets of $S$ such that
a) If $A\subseteq S$, then $A\in F$ if and only if $S\setminus A\notin F$;
b) If $A\subseteq B\subseteq S$ and $B\in F$, then $A\in F$.
Determine if there must exist a function $f:S\to\mathbb{R}$ such that for every $A\subseteq S$, $A\in F$ if and only if
\[\sum_{s\in A}f(s)<\sum_{s\in S\setminus A}f(s).\]
[i]Evan O'Dorney.[/i]
2016 South African National Olympiad, 4
For which integers $n \geq 2$ is it possible to draw $n$ straight lines in the plane in such a way that there are at least $n - 2$ points where exactly three of the lines meet?
2011 Brazil Team Selection Test, 2
Five points $A_1,A_2,A_3,A_4,A_5$ lie on a plane in such a way that no three among them lie on a same straight line. Determine the maximum possible value that the minimum value for the angles $\angle A_iA_jA_k$ can take where $i, j, k$ are distinct integers between $1$ and $5$.
MathLinks Contest 6th, 4.1
Let $F$ be a family of n subsets of a set $K$ with $5$ elements, such that any two subsets in $F$ have a common element. Find the minimal value of $n$ such that no matter how we choose $F$ with the properties above, there exists exactly one element of $K$ which belongs to all the sets in $F$.
2019 Durer Math Competition Finals, 6
(Game) At the beginning of the game, the organisers place paper disks on the table, grouped into piles which may contain various numbers of disks. The two players take turns. On a player’s turn, their opponent selects two piles (one if there is only one pile left), and the player must remove some number of disks from one of the piles selected. This means that at least one disk has to be removed, and removing all disks in the pile is also permitted. The player removing the last disk from the table wins.
[i]Defeat the organisers in this game twice in a row! A starting position will be given and then you can decide whether you want to go first or second.[/i]
2021 SYMO, Q5
Simon draws some line segments on the face of a regular polygon, dissecting it into exactly $2021$ triangles, such that no two drawn line segments are collinear, and no two triangles share a pair of vertices. Simon then assigns each drawn line segment and each side of the polygon with one of three colours. Prove that there is some triangle in the dissection with a pair of identically-coloured sides.
2008 Korean National Olympiad, 1
Let $V=[(x,y,z)|0\le x,y,z\le 2008]$ be a set of points in a 3-D space.
If the distance between two points is either $1, \sqrt{2}, 2$, we color the two points differently.
How many colors are needed to color all points in $V$?
2023 Czech-Polish-Slovak Match, 1
Given an integer $n\geq 3$, determine the smallest positive number $k$ such that any two points in any $n$-gon (or at its boundary) in the plane can be connected by a polygonal path consisting of $k$ line segments contained in the $n$-gon (including its boundary).