Found problems: 1488
1963 Vietnam National Olympiad, 1
A conference has $ 47$ people attending. One woman knows $ 16$ of the men who are attending, another knows $ 17$, and so on up to the $ m$-th woman who knows all $ n$ of the men who are attending. Find $ m$ and $ n$.
2023 Philippine MO, 4
In chess, a knight placed on a chess board can move by jumping to an adjacent square in one direction (up, down, left, or right) then jumping to the next two squares in a perpendicular direction. We then say that a square in a chess board [i]can be attacked[/i] by a knight if the knight can end up on that square after a move. Thus, depending on where a knight is placed, it can attack as many as eight squares, or maybe even less.
In a $10 \times 10$ chess board, what is the maximum number of knights that can be placed such that each square on the board can be attacked by at most one knight?
2006 Brazil National Olympiad, 2
Let $n$ be an integer, $n \geq 3$. Let $f(n)$ be the largest number of isosceles triangles whose vertices belong to some set of $n$ points in the plane without three colinear points. Prove that there exists positive real constants $a$ and $b$ such that $an^{2}< f(n) < bn^{2}$ for every integer $n$, $n \geq 3$.
2012 Nordic, 4
The number $1$ is written on the blackboard. After that a sequence of numbers is created as follows: at each step each number $a$ on the blackboard is replaced by the numbers $a - 1$ and $a + 1$; if the number $0$ occurs, it is erased immediately; if a number occurs more than once, all its occurrences are left on the blackboard. Thus the blackboard will show $1$ after $0$ steps; $2$ after $1$ step; $1, 3$ after $2$ steps; $2, 2, 4$ after $3$ steps, and so on. How many numbers will there be on the blackboard after $n$ steps?
1993 All-Russian Olympiad, 4
Prove that there exists a positive integer $n$, such that if an equilateral triangle with side lengths $n$ is split into $n^2$ triangles with side lengths 1 with lines parallel to its sides, then among the vertices of the small triangles it is possible to choose $1993n$ points so that no three of them are vertices of an equilateral triangle.
2005 France Team Selection Test, 3
In an international meeting of $n \geq 3$ participants, 14 languages are spoken. We know that:
- Any 3 participants speak a common language.
- No language is spoken more that by the half of the participants.
What is the least value of $n$?
2008 Germany Team Selection Test, 2
[b](i)[/b] Determine the smallest number of edges which a graph of $ n$ nodes may have given that adding an arbitrary new edge would give rise to a 3-clique (3 nodes joined pairwise by edges).
[b](ii)[/b] Determine the smallest number of edges which a graph of $ n$ nodes may have given that adding an arbitrary new edge would give rise to a 4-clique (4 nodes joined pairwise by edges).
2003 China Western Mathematical Olympiad, 1
Place the numbers $ 1, 2, 3, 4, 5, 6, 7, 8$ at the vertices of a cuboid such that the sum of any $ 3$ numbers on a side is not less than $ 10$. Find the smallest possible sum of the 4 numbers on a side.
1995 Moldova Team Selection Test, 5
Given a finite sequence of real numbers $a_1,a_2,\dots ,a_n$ ($\ast$), we call a segment $a_k,\dots ,a_{k+l-1}$ of the sequence ($\ast$) a “[i]long[/i]”(Chinese dragon) and $a_k$ “[i]head[/i]” of the “[i]long[/i]” if the arithmetic mean of $a_k,\dots ,a_{k+l-1}$ is greater than $1988$. (especially if a single item $a_m>1988$, we still regard $a_m$ as a “[i]long[/i]”). Suppose that there is at least one “[i]long[/i]” among the sequence ($\ast$), show that the arithmetic mean of all those items of sequence ($\ast$) that could be “[i]head[/i]” of a certain “[i]long[/i]” individually is greater than $1988$.
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?
2017 Bosnia Herzegovina Team Selection Test, 4
There are $ 6n \plus{} 4$ mathematicians participating in a conference which includes $ 2n \plus{} 1$ meetings. Each meeting has one round table that suits for $ 4$ people and $ n$ round tables that each table suits for $ 6$ people. We have known that two arbitrary people sit next to or have opposite places doesn't exceed one time.
1. Determine whether or not there is the case $ n \equal{} 1$.
2. Determine whether or not there is the case $ n > 1$.
2013 India Regional Mathematical Olympiad, 4
Find the number of $10$-tuples $(a_1,a_2,\dots,a_9,a_{10})$ of integers such that $|a_1|\leq 1$ and
\[a_1^2+a_2^2+a_3^2+\cdots+a_{10}^2-a_1a_2-a_2a_3-a_3a_4-\cdots-a_9a_{10}-a_{10}a_1=2.\]
2008 Tournament Of Towns, 1
Alex distributes some cookies into several boxes and records the number of cookies in each box. If the same number appears more than once, it is recorded only once. Serge takes one cookie from each box and puts them on the first plate. Then he takes one cookie from each box that is still non-empty and puts the cookies on the second plate. He continues until all the boxes are empty. Then Serge records the number of cookies on each plate. Again, if the same number appears more than once, it is recorded only once. Prove that Alex's record contains the same number of numbers as Serge's record.
2008 South East Mathematical Olympiad, 3
Captain Jack and his pirate men plundered six chests of treasure $(A_1,A_2,A_3,A_4,A_5,A_6)$. Every chest $A_i$ contains $a_i$ coins of gold, and all $a_i$s are pairwise different $(i=1,2,\cdots ,6)$. They place all chests according to a layout (see the attachment) and start to alternately take out one chest a time between the captain and a pirate who serves as the delegate of the captain’s men. A rule must be complied with during the game: only those chests that are not adjacent to other two or more chests are allowed to be taken out. The captain will win the game if the coins of gold he obtains are not less than those of his men in the end. Let the captain be granted to take chest firstly, is there a certain strategy for him to secure his victory?
2005 Swedish Mathematical Competition, 5
Every cell of a $2005 \times 2005$ square board is colored white or black so that every $2 \times 2$ subsquare contains an odd number of black cells.
Show that among the corner cells there is an even number of black ones. How many ways are there to color the board in this manner?
2013 ELMO Shortlist, 10
Let $N\ge2$ be a fixed positive integer. There are $2N$ people, numbered $1,2,...,2N$, participating in a tennis tournament. For any two positive integers $i,j$ with $1\le i<j\le 2N$, player $i$ has a higher skill level than player $j$. Prior to the first round, the players are paired arbitrarily and each pair is assigned a unique court among $N$ courts, numbered $1,2,...,N$.
During a round, each player plays against the other person assigned to his court (so that exactly one match takes place per court), and the player with higher skill wins the match (in other words, there are no upsets). Afterwards, for $i=2,3,...,N$, the winner of court $i$ moves to court $i-1$ and the loser of court $i$ stays on court $i$; however, the winner of court 1 stays on court 1 and the loser of court 1 moves to court $N$.
Find all positive integers $M$ such that, regardless of the initial pairing, the players $2, 3, \ldots, N+1$ all change courts immediately after the $M$th round.
[i]Proposed by Ray Li[/i]
1999 All-Russian Olympiad, 4
Initially numbers from 1 to 1000000 are all colored black. A move consists of picking one number, then change the color (black to white or white to black) of itself and all other numbers NOT coprime with the chosen number. Can all numbers become white after finite numbers of moves?
Edited by pbornsztein
2009 Korea - Final Round, 5
There is a $m \times (m-1)$ board. (i.e. there are $m+1$ horizontal lines and $m$ vertical lines) A stone is put on an intersection of the lowest horizontal line. Now two players move this stone with the following rules.
(i) Each players move the stone to a neighboring intersection along a segment, by turns.
(ii) A segment, which is already passed by the stone, cannot be used more.
(iii) One who cannot move the stone anymore loses.
Prove that there is a winning strategy for the former player.
2012 Kazakhstan National Olympiad, 3
The cell of a $(2m +1) \times (2n +1)$ board are painted in two colors - white and black. The unit cell of a row (column) is called [i]dominant[/i] on the row (the column) if more than half of the cells that row (column) have the same color as this cell. Prove that at least $m + n-1$ cells on the board are dominant in both their row and column.
2010 Indonesia MO, 3
A mathematical competition was attended by 120 participants from several contingents. At the closing ceremony, each participant gave 1 souvenir each to every other participants from the same contingent, and 1 souvenir to any person from every other contingents. It is known that there are 3840 souvenirs whom were exchanged.
Find the maximum possible contingents such that the above condition still holds?
[i]Raymond Christopher Sitorus, Singapore[/i]
1999 Hungary-Israel Binational, 2
$ 2n\plus{}1$ lines are drawn in the plane, in such a way that every 3 lines define a triangle with no right angles. What is the maximal possible number of acute triangles that can be made in this way?
1979 IMO Longlists, 57
Let $M$ be a set and $A,B,C$ given subsets of $M$. Find a necessary and sufficient condition for the existence of a set $X\subset M$ for which $(X\cup A)\backslash(X\cap B)=C$. Describe all such sets.
2014 Iran MO (2nd Round), 2
A subset $S$ of positive real numbers is called [i]powerful[/i] if for any two distinct elements $a, b$ of $S$, at least one of $a^{b}$ or $b^{a}$ is also an element of $S$.
[b]a)[/b] Give an example of a four elements powerful set.
[b]b)[/b] Prove that every finite powerful set has at most four elements.
1993 All-Russian Olympiad Regional Round, 10.4
Each citizen in a town knows at least $ 30$% of the remaining citizens. A citizen votes in elections if he/she knows at least one candidate. Prove that it is possible to schedule elections with two candidates for the mayor of the city so that at least $ 50$% of the citizen can vote.
2003 All-Russian Olympiad, 1
There are $N$ cities in a country. Any two of them are connected either by a road or by an airway. A tourist wants to visit every city exactly once and return to the city at which he started the trip. Prove that he can choose a starting city and make a path, changing means of transportation at most once.