This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1800

2011 ELMO Shortlist, 2
Tags: induction , combinatorics proposed , combinatorics , Directed graphs , graph theory , Coloring
A directed graph has each vertex with outdegree 2. Prove that it is possible to split the vertices into 3 sets so that for each vertex $v$, $v$ is not simultaneously in the same set with both of the vertices that it points to. [i]David Yang.[/i] [hide="Stronger Version"]See [url=http://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=492100]here[/url].[/hide]

2002 France Team Selection Test, 3
Tags: absolute value , combinatorics proposed , combinatorics
Let $n$ be a positive integer and let $(a_1,a_2,\ldots ,a_{2n})$ be a permutation of $1,2,\ldots ,2n$ such that the numbers $|a_{i+1}-a_i|$ are pairwise distinct for $i=1,\ldots ,2n-1$. Prove that $\{a_2,a_4,\ldots ,a_{2n}\}=\{1,2,\ldots ,n\}$ if and only if $a_1-a_{2n}=n$.

1998 Iran MO (3rd Round), 1
Tags: combinatorics proposed , combinatorics
A one-player game is played on a $m \times n$ table with $m \times n$ nuts. One of the nuts' sides is black, and the other side of them is white. In the beginning of the game, there is one nut in each cell of the table and all nuts have their white side upwards except one cell in one corner of the table which has the black side upwards. In each move, we should remove a nut which has its black side upwards from the table and reverse all nuts in adjacent cells (i.e. the cells which share a common side with the removed nut's cell). Find all pairs $(m,n)$ for which we can remove all nuts from the table.

2002 China National Olympiad, 2
Tags: combinatorics proposed , combinatorics
Suppose that a point in the plane is called [i]good[/i] if it has rational coordinates. Prove that all good points can be divided into three sets satisfying: 1) If the centre of the circle is good, then there are three points in the circle from each of the three sets. 2) There are no three collinear points that are from each of the three sets.

2001 Hungary-Israel Binational, 6
Tags: combinatorics proposed , combinatorics
Let be given $32$ positive integers with the sum $120$, none of which is greater than $60.$ Prove that these integers can be divided into two disjoint subsets with the same sum of elements.

2014 Contests, 2
Tags: geometry , rectangle , combinatorics proposed , combinatorics
Every cell of a $m \times n$ chess board, $m\ge 2,n\ge 2$, is colored with one of four possible colors, e.g white, green, red, blue. We call such coloring good if the four cells of any $2\times 2$ square of the chessboard are colored with pairwise different colors. Determine the number of all good colorings of the chess board. [i]Proposed by N. Beluhov[/i]

2007 All-Russian Olympiad, 5
Tags: induction , algebra , polynomial , function , combinatorics proposed , combinatorics
Two numbers are written on each vertex of a convex $100$-gon. Prove that it is possible to remove a number from each vertex so that the remaining numbers on any two adjacent vertices are different. [i]F. Petrov [/i]

2006 Turkey Team Selection Test, 2
Tags: geometry , rectangle , calculus , integration , function , combinatorics proposed , combinatorics
How many ways are there to divide a $2\times n$ rectangle into rectangles having integral sides, where $n$ is a positive integer?

2024 All-Russian Olympiad, 3
Tags: combinatorics , combinatorics proposed , game , ilostthegame
Yuri is looking at the great Mayan table. The table has $200$ columns and $2^{200}$ rows. Yuri knows that each cell of the table depicts the sun or the moon, and any two rows are different (i.e. differ in at least one column). Each cell of the table is covered with a sheet. The wind has blown aways exactly two sheets from each row. Could it happen that now Yuri can find out for at least $10000$ rows what is depicted in each of them (in each of the columns)? [i]Proposed by I. Bogdanov, K. Knop[/i]

2010 ELMO Shortlist, 7
Tags: symmetry , induction , strong induction , combinatorics proposed , combinatorics , graph theory
The game of circulate is played with a deck of $kn$ cards each with a number in $1,2,\ldots,n$ such that there are $k$ cards with each number. First, $n$ piles numbered $1,2,\ldots,n$ of $k$ cards each are dealt out face down. The player then flips over a card from pile $1$, places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the $k$ cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game? [i]Brian Hamrick.[/i]

2005 Danube Mathematical Olympiad, 4
Tags: geometry , rectangle , modular arithmetic , combinatorics proposed , combinatorics
Let $k$ and $n$ be positive integers. Consider an array of $2\left(2^n-1\right)$ rows by $k$ columns. A $2$-coloring of the elements of the array is said to be [i]acceptable[/i] if any two columns agree on less than $2^n-1$ entries on the same row. Given $n$, determine the maximum value of $k$ for an acceptable $2$-coloring to exist.

2017 Bulgaria JBMO TST, 3
Tags: combinatorics proposed , combinatorics
Given are sheets and the numbers $00, 01, \ldots, 99$ are written on them. We must put them in boxes $000, 001, \ldots, 999$ so that the number on the sheet is the number on the box with one digit erased. What is the minimum number of boxes we need in order to put all the sheets?

1995 Balkan MO, 4
Tags: analytic geometry , induction , combinatorics proposed , combinatorics
Let $n$ be a positive integer and $\mathcal S$ be the set of points $(x, y)$ with $x, y \in \{1, 2, \ldots , n\}$. Let $\mathcal T$ be the set of all squares with vertices in the set $\mathcal S$. We denote by $a_k$ ($k \geq 0$) the number of (unordered) pairs of points for which there are exactly $k$ squares in $\mathcal T$ having these two points as vertices. Prove that $a_0 = a_2 + 2a_3$. [i]Yugoslavia[/i]

2007 Iran MO (2nd Round), 3
Tags: induction , combinatorics proposed , combinatorics
Farhad has made a machine. When the machine starts, it prints some special numbers. The property of this machine is that for every positive integer $n$, it prints exactly one of the numbers $n,2n,3n$. We know that the machine prints $2$. Prove that it doesn't print $13824$.

2013 Turkey Team Selection Test, 2
Tags: geometry , rectangle , induction , combinatorics proposed , combinatorics
We put pebbles on some unit squares of a $2013 \times 2013$ chessboard such that every unit square contains at most one pebble. Determine the minimum number of pebbles on the chessboard, if each $19\times 19$ square formed by unit squares contains at least $21$ pebbles.

2002 Tournament Of Towns, 4
Tags: counting , derangement , combinatorics proposed , combinatorics
The spectators are seated in a row with no empty places. Each is in a seat which does not match the spectator's ticket. An usher can order two spectators in adjacent seats to trade places unless one of them is already seated correctly. Is it true that from any initial arrangement, the spectators can be brought to their correct seats?

2011 ELMO Shortlist, 1
Tags: function , modular arithmetic , combinatorics proposed , combinatorics
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]

2003 Iran MO (3rd Round), 11
Tags: combinatorics proposed , combinatorics
assume that X is a set of n number.and $0\leq k\leq n$.the maximum number of permutation which acting on $X$ st every two of them have at least k component in common,is $a_{n,k}$.and the maximum nuber of permutation st every two of them have at most k component in common,is $b_{n,k}$. a)proeve that :$a_{n,k}\cdot b_{n,k-1}\leq n!$ b)assume that p is prime number,determine the exact value of $a_{p,2}$.

2002 Tournament Of Towns, 5
Tags: combinatorics proposed , combinatorics
[list] [*] There are $128$ coins of two different weights, $64$ each. How can one always find two coins of different weights by performing no more than $7$ weightings on a regular balance? [*] There are $8$ coins of two different weights, $4$ each. How can one always find two coins of different weights by performing two weightings on a regular balance?[/list]

2015 German National Olympiad, 3
Tags: combinatorics , graph theory , Germany , combinatorics proposed
To prepare a stay abroad, students meet at a workshop including an excursion. To promote interaction between the students, they are to be distributed to two busses such that not too many of the students in the same bus know each other. Every student knows all those who know her. The number of such pairwise acquaintances is $k$. Prove that it is possible to distribute the students such that the number of pairwise acquaintances in each bus is at most $\frac{k}{3}$.

2006 All-Russian Olympiad, 8
Tags: ceiling function , function , combinatorics proposed , combinatorics , Probabilistic Method
At a tourist camp, each person has at least $50$ and at most $100$ friends among the other persons at the camp. Show that one can hand out a t-shirt to every person such that the t-shirts have (at most) $1331$ different colors, and any person has $20$ friends whose t-shirts all have pairwisely different colors.

2012 Romanian Masters In Mathematics, 3
Tags: function , algebra proposed , algebra , combinatorics , combinatorics proposed , Additive combinatorics
Each positive integer is coloured red or blue. A function $f$ from the set of positive integers to itself has the following two properties: (a) if $x\le y$, then $f(x)\le f(y)$; and (b) if $x,y$ and $z$ are (not necessarily distinct) positive integers of the same colour and $x+y=z$, then $f(x)+f(y)=f(z)$. Prove that there exists a positive number $a$ such that $f(x)\le ax$ for all positive integers $x$. [i](United Kingdom) Ben Elliott[/i]

1986 IMO Longlists, 37
Tags: combinatorics proposed , combinatorics
Prove that the set $\{1, 2, . . . , 1986\}$ can be partitioned into $27$ disjoint sets so that no one of these sets contains an arithmetic triple (i.e., three distinct numbers in an arithmetic progression).

2007 Vietnam Team Selection Test, 6
Tags: combinatorics proposed , combinatorics
Let $A_{1}A_{2}\ldots A_{9}$ be a regular $9-$gon. Let $\{A_{1},A_{2},\ldots,A_{9}\}=S_{1}\cup S_{2}\cup S_{3}$ such that $|S_{1}|=|S_{2}|=|S_{3}|=3$. Prove that there exists $A,B\in S_{1}$, $C,D\in S_{2}$, $E,F\in S_{3}$ such that $AB=CD=EF$ and $A \neq B$, $C\neq D$, $E\neq F$.

2011 Kosovo National Mathematical Olympiad, 5
Tags: combinatorics proposed , combinatorics
Let $n>1$ be an integer and $S_n$ the set of all permutations $\pi : \{1,2,\cdots,n \} \to \{1,2,\cdots,n \}$ where $\pi$ is bijective function. For every permutation $\pi \in S_n$ we define: \[ F(\pi)= \sum_{k=1}^n |k-\pi(k)| \ \ \text{and} \ \ M_{n}=\frac{1}{n!}\sum_{\pi \in S_n} F(\pi) \] where $M_n$ is taken with all permutations $\pi \in S_n$. Calculate the sum $M_n$.