Found problems: 1800
2010 Contests, 3
Determine all possible values of positive integer $n$, such that there are $n$ different 3-element subsets $A_1,A_2,...,A_n$ of the set $\{1,2,...,n\}$, with $|A_i \cap A_j| \not= 1$ for all $i \not= j$.
2022 Bolivia Cono Sur TST, P1
The numbers $1$ through $4^{n}$ are written on a board. In each step, Pedro erases two numbers $a$ and $b$ from the board, and writes instead the number $\frac{ab}{\sqrt{2a^2+2b^2}}$. Pedro repeats this procedure until only one number remains. Prove that this number is less than $\frac{1}{n}$, no matter what numbers Pedro chose in each step.
2006 Switzerland Team Selection Test, 3
Let $n$ be natural number. Each of the numbers $\in\{1,2,\ldots ,n\}$ is coloured in black or white. When we choose a number, we flip it's colour and the colour of all the numbers which have at least one common divider with the chosen number. At the beginning all the numbers were coloured white. For which $n$ are all the numbers black after a finite number of changes?
2009 Italy TST, 3
Two persons, A and B, set up an incantation contest in which they spell incantations (i.e. a finite sequence of letters) alternately. They must obey the following rules:
i) Any incantation can appear no more than once;
ii) Except for the first incantation, any incantation must be obtained by permuting the letters of the last one before it, or deleting one letter from the last incantation before it;
iii)The first person who cannot spell an incantation loses the contest. Answer the following questions:
a) If A says '$STAGEPREIMO$' first, then who will win?
b) Let $M$ be the set of all possible incantations whose lengths (i.e. the numbers of letters in them) are $2009$ and containing only four letters $A,B,C,D$, each of them appearing at least once. Find the first incantation (arranged in dictionary order) in $M$ such that A has a winning strategy by starting with it.
2009 Canadian Mathematical Olympiad Qualification Repechage, 4
Three fair six-sided dice are thrown. Determine the probability that the sum of the numbers on the three top faces is $6$.
2006 Peru IMO TST, 3
[color=blue][size=150]PERU TST IMO - 2006[/size]
Saturday, may 20.[/color]
[b]Question 03[/b]
In each square of a board drawn into squares of $2^n$ rows and
$n$ columns $(n\geq 1)$ are written a 1 or a -1, in such a way
that the rows of the board constitute all the possible sequences
of length $n$ that they are possible to be formed with numbers 1
and -1.
Next, some of the numbers are replaced by zeros.
Prove that it is possible to choose some of the rows of the board
(It could be a row only) so that in the chosen rows, is fulfilled that the
sum of the numbers in each column is zero.
----
[url=http://www.mathlinks.ro/Forum/viewtopic.php?t=88511]Spanish version[/url]
$\text{\LaTeX}{}$ed by carlosbr
2014 All-Russian Olympiad, 3
There are $n$ cells with indices from $1$ to $n$. Originally, in each cell, there is a card with the corresponding index on it. Vasya shifts the card such that in the $i$-th cell is now a card with the number $a_i$. Petya can swap any two cards with the numbers $x$ and $y$, but he must pay $2|x-y|$ coins. Show that Petya can return all the cards to their original position, not paying more than $|a_1-1|+|a_2-2|+\ldots +|a_n-n|$ coins.
2005 Morocco TST, 2
Consider the set $A=\{1,2,...,49\}$. We partitionate $A$ into three subsets. Prove that there exist a set from these subsets containing three distincts elements $a,b,c$ such that $a+b=c$
2013 Saint Petersburg Mathematical Olympiad, 2
At the faculty of mathematics study $40$ boys and $10$ girls. Every girl acquaintance with all boys, who older than her, or tall(higher) than her. Prove that there exist two boys such that the sets of acquainted-girls of the boys are same.
1980 IMO, 5
In the Euclidean three-dimensional space, we call [i]folding[/i] of a sphere $S$ every partition of $S \setminus \{x,y\}$ into disjoint circles, where $x$ and $y$ are two points of $S$. A folding of $S$ is called [b]linear[/b] if the circles of the [i]folding[/i] are obtained by the intersection of $S$ with a family of parallel planes or with a family of planes containing a straight line $D$ exterior to $S$. Is every [i]folding[/i] of a sphere $S$ [b]linear[/b]?
2005 International Zhautykov Olympiad, 1
The 40 unit squares of the 9 9-table (see below) are labeled. The horizontal or vertical row of 9 unit squares is good if it has more labeled unit squares than unlabeled ones. How many good (horizontal and vertical) rows totally could have the table?
2003 Romania Team Selection Test, 13
A parliament has $n$ senators. The senators form 10 parties and 10 committees, such that any senator belongs to exactly one party and one committee. Find the least possible $n$ for which it is possible to label the parties and the committees with numbers from 1 to 10, such that there are at least 11 senators for which the numbers of the corresponding party and committee are equal.
2008 Tournament Of Towns, 2
Twenty-fi ve of the numbers $1, 2, \cdots , 50$ are chosen. Twenty- five of the numbers$ 51, 52, \cdots, 100$ are also chosen. No two chosen numbers diff er by $0$ or $50$. Find the sum of all $50$ chosen numbers.
1994 Brazil National Olympiad, 1
The edges of a cube are labeled from 1 to 12 in an arbitrary manner. Show that it is not possible to get the sum of the edges at each vertex the same.
Show that we can get eight vertices with the same sum if one of the labels is changed to 13.
2022 Turkey Team Selection Test, 9
In every acyclic graph with 2022 vertices we can choose $k$ of the vertices such that every chosen vertex has at most 2 edges to chosen vertices. Find the maximum possible value of $k$.
2006 Iran Team Selection Test, 2
Suppose $n$ coins are available that their mass is unknown. We have a pair of balances and every time we can choose an even number of coins and put half of them on one side of the balance and put another half on the other side, therefore a [i]comparison[/i] will be done. Our aim is determining that the mass of all coins is equal or not. Show that at least $n-1$ [i]comparisons[/i] are required.
2014 China Team Selection Test, 5
Let $a_1<a_2<...<a_t$ be $t$ given positive integers where no three form an arithmetic progression. For $k=t,t+1,...$ define $a_{k+1}$ to be the smallest positive integer larger than $a_k$ satisfying the condition that no three of $a_1,a_2,...,a_{k+1}$ form an arithmetic progression. For any $x\in\mathbb{R}^+$ define $A(x)$ to be the number of terms in $\{a_i\}_{i\ge 1}$ that are at most $x$. Show that there exist $c>1$ and $K>0$ such that $A(x)\ge c\sqrt{x}$ for any $x>K$.
2011 Preliminary Round - Switzerland, 4
Given is a circular bus route with $n\geqslant2$ bus stops. The route can be frequented in both directions. The way between two stops is called [i]section[/i] and one of the bus stops is called [i]Zürich[/i]. A bus shall start at Zürich, pass through all the bus stops [b]at least once[/b] and drive along exactly $n+2$ sections before it returns to Zürich in the end. Assuming that the bus can chance directions at each bus stop, how many possible routes are there?
EDIT: Sorry, there was a mistake...corrected now, thanks mavropnevma! :oops:
2006 Switzerland Team Selection Test, 2
We place randomly the numbers $1,2, \dots ,2006$ around a circle. A move consists of changing two neighbouring numbers. After a limited numbers of moves all the numbers are diametrically opposite to their starting position. Show that we changed at least once two numbers which had the sum $2007$.
2007 Kyiv Mathematical Festival, 5
The vertices of 100-gon (i.e., polygon with 100 sides) are colored alternately white or black. One of the vertices contains a checker. Two players in turn do two things: move the checker into other vertice along the side of 100-gon and then erase some side. The game ends when it is impossible to move the checker. At the end of the game if the checker is in the white vertice then the first player wins. Otherwise the second player wins. Does any of the players have winning strategy? If yes, then who?
[i]Remark.[/i] The answer may depend on initial position of the checker.
2010 All-Russian Olympiad, 4
In each unit square of square $100*100$ write any natural number. Called rectangle with sides parallel sides of square $good$ if sum of number inside rectangle divided by $17$. We can painted all unit squares in $good$ rectangle. One unit square cannot painted twice or more.
Find maximum $d$ for which we can guaranteed paint at least $d$ points.
2015 Turkey MO (2nd round), 4
In an exhibition where $2015$ paintings are shown, every participant picks a pair of paintings and writes it on the board. Then, Fake Artist (F.A.) chooses some of the pairs on the board, and marks one of the paintings in all of these pairs as "better". And then, Artist's Assistant (A.A.) comes and in his every move, he can mark $A$ better then $C$ in the pair $(A,C)$ on the board if for a painting $B$, $A$ is marked as better than $B$ and $B$ is marked as better than $C$ on the board. Find the minimum possible value of $k$ such that, for any pairs of paintings on the board, F.A can compare $k$ pairs of paintings making it possible for A.A to compare all of the remaining pairs of paintings.
[b]P.S:[/b] A.A can decide $A_1>A_n$ if there is a sequence $ A_1 > A_2 > A_3 > \dots > A_{n-1} > A_n$ where $X>Y$ means painting $X$ is better than painting $Y$.
2004 CentroAmerican, 3
With pearls of different colours form necklaces, it is said that a necklace is [i]prime[/i] if it cannot be decomposed into strings of pearls of the same length, and equal to each other.
Let $n$ and $q$ be positive integers. Prove that the number of prime necklaces with $n$ beads, each of which has one of the $q^n$ possible colours, is equal to $n$ times the number of prime necklaces with $n^2$ pearls, each of which has one of $q$ possible colours.
Note: two necklaces are considered equal if they have the same number of pearls and you can get the same colour on both necklaces, rotating one of them to match it to the other.
2012 Tuymaada Olympiad, 4
$25$ little donkeys stand in a row; the rightmost of them is Eeyore. Winnie-the-Pooh wants to give a balloon of one of the seven colours of the rainbow to each donkey, so that successive donkeys receive balloons of different colours, and so that at least one balloon of each colour is given to some donkey. Eeyore wants to give to each of the $24$ remaining donkeys a pot of one of six colours of the rainbow (except red), so that at least one pot of each colour is given to some donkey (but successive donkeys can receive pots of the same colour). Which of the two friends has more ways to get his plan implemented, and how many times more?
[i]Eeyore is a character in the Winnie-the-Pooh books by A. A. Milne. He is generally depicted as a pessimistic, gloomy, depressed, old grey stuffed donkey, who is a friend of the title character, Winnie-the-Pooh. His name is an onomatopoeic representation of the braying sound made by a normal donkey. Of course, Winnie-the-Pooh is a fictional anthropomorphic bear.[/i]
[i]Proposed by F. Petrov[/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$.