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: 1488

1994 China National Olympiad, 6
Tags: analytic geometry , geometry , incenter , combinatorics unsolved , combinatorics
Let $M$ be a point which has coordinates $(p\times 1994,7p\times 1994)$ in the Cartesian plane ($p$ is a prime). Find the number of right-triangles satisfying the following conditions: (1) all vertexes of the triangle are lattice points, moreover $M$ is on the right-angled corner of the triangle; (2) the origin ($0,0$) is the incenter of the triangle.

2005 China Girls Math Olympiad, 6
Tags: analytic geometry , combinatorics unsolved , combinatorics
An integer $ n$ is called good if there are $ n \geq 3$ lattice points $ P_1, P_2, \ldots, P_n$ in the coordinate plane satisfying the following conditions: If line segment $ P_iP_j$ has a rational length, then there is $ P_k$ such that both line segments $ P_iP_k$ and $ P_jP_k$ have irrational lengths; and if line segment $ P_iP_j$ has an irrational length, then there is $ P_k$ such that both line segments $ P_iP_k$ and $ P_jP_k$ have rational lengths. (1) Determine the minimum good number. (2) Determine if 2005 is a good number. (A point in the coordinate plane is a lattice point if both of its coordinate are integers.)

1989 IMO Longlists, 27
Tags: calculus , integration , modular arithmetic , number theory , relatively prime , combinatorics unsolved , combinatorics
Let $ L$ denote the set of all lattice points of the plane (points with integral coordinates). Show that for any three points $ A,B,C$ of $ L$ there is a fourth point $ D,$ different from $ A,B,C,$ such that the interiors of the segments $ AD,BD,CD$ contain no points of $ L.$ Is the statement true if one considers four points of $ L$ instead of three?

1976 IMO Longlists, 33
Tags: search , combinatorics unsolved , combinatorics
A finite set of points $P$ in the plane has the following property: Every line through two points in $P$ contains at least one more point belonging to $P$. Prove that all points in $P$ lie on a straight line. [hide="Remark."]This may be a well known theorem called "Sylvester Gallai", but I didn't find this problem (I mean, exactly this one) using search function. So please discuss about the problem here, in this topic. Thanks :) [/hide]

2010 Albania National Olympiad, 3
Tags: calculus , integration , analytic geometry , geometry , pigeonhole principle , combinatorics unsolved , combinatorics
[b](a)[/b]Prove that every pentagon with integral coordinates has at least two vertices , whose respective coordinates have the same parity. [b](b)[/b]What is the smallest area possible of pentagons with integral coordinates. Albanian National Mathematical Olympiad 2010---12 GRADE Question 3.

2004 India IMO Training Camp, 3
Tags: function , geometry , combinatorics unsolved , combinatorics
The game of $pebbles$ is played on an infinite board of lattice points $(i,j)$. Initially there is a $pebble$ at $(0,0)$. A move consists of removing a $pebble$ from point $(i,j)$and placing a $pebble$ at each of the points $(i+1,j)$ and $(i,j+1)$ provided both are vacant. Show taht at any stage of the game there is a $pebble$ at some lattice point $(a,b)$ with $0 \leq a+b \leq 3$

2007 Germany Team Selection Test, 1
Tags: combinatorics unsolved , combinatorics
Let $ n > 1, n \in \mathbb{Z}$ and $ B \equal{}\{1,2,\ldots, 2^n\}.$ A subset $ A$ of $ B$ is called weird if it contains exactly one of the distinct elements $ x,y \in B$ such that the sum of $ x$ and $ y$ is a power of two. How many weird subsets does $ B$ have?

1983 IMO Longlists, 21
Tags: combinatorics unsolved , combinatorics
Prove that there are infinitely many positive integers $n$ for which it is possible for a knight, starting at one of the squares of an $n \times n$ chessboard, to go through each of the squares exactly once.

2007 Brazil National Olympiad, 4
Tags: combinatorics unsolved , combinatorics
$ 2007^2$ unit squares are arranged forming a $ 2007\times 2007$ table. Arnold and Bernold play the following game: each move by Arnold consists of taking four unit squares that forms a $ 2\times 2$ square; each move by Bernold consists of taking a single unit square. They play anternatively, Arnold being the first. When Arnold is not able to perform his move, Bernold takes all the remaining unit squares. The person with more unit squares in the end is the winner. Is it possible to Bernold to win the game, no matter how Arnold play?

1998 All-Russian Olympiad, 7
Tags: combinatorics unsolved , combinatorics
A jeweller makes a chain consisting of $N>3$ numbered links. A querulous customer then asks him to change the order of the links, in such a way that the number of links the jeweller must open is maximized. What is the maximum number?

2001 Italy TST, 4
Tags: induction , calculus , integration , combinatorics unsolved , combinatorics
We are given $2001$ balloons and a positive integer $k$. Each balloon has been blown up to a certain size (not necessarily the same for each balloon). In each step it is allowed to choose at most $k$ balloons and equalize their sizes to their arithmetic mean. Determine the smallest value of $k$ such that, whatever the initial sizes are, it is possible to make all the balloons have equal size after a finite number of steps.

2002 Bulgaria National Olympiad, 3
Tags: combinatorics unsolved , combinatorics
Given are $n^2$ points in the plane, such that no three of them are collinear, where $n \geq 4$ is the positive integer of the form $3k+1$. What is the minimal number of connecting segments among the points, such that for each $n$-plet of points we can find four points, which are all connected to each other? [i]Proposed by Alexander Ivanov and Emil Kolev[/i]

2007 Bundeswettbewerb Mathematik, 2
Tags: search , combinatorics unsolved , combinatorics
Each positive integer shall be coloured red or green such that it satisfies the following properties: - The sum of three not necessarily distinct red numbers is a red number. - The sum of three not necessarily distinct green numbers is a green number. - There are red and green numbers. Find all such colorations!

2011 Korea - Final Round, 3
Tags: combinatorics unsolved , combinatorics
There are $n$ boys $a_1, a_2, \ldots, a_n$ and $n$ girls $b_1, b_2, \ldots, b_n $. Some pairs of them are connected. Any two boys or two girls are not connected, and $a_i$ and $b_i$ are not connected for all $i \in \{ 1,2,\ldots,n\}$. Now all boys and girls are divided into several groups satisfying two conditions: (i) Every groups contains an equal number of boys and girls. (ii) There is no connected pair in the same group. Assume that the number of connected pairs is $m$. Show that we can make the number of groups not larger than $\max\left \{2, \dfrac{2m}{n} +1\right \}$.

1994 IMO Shortlist, 6
Tags: combinatorics unsolved , combinatorics , IMO Shortlist , Combinatorial games , game strategy , game
Two players play alternatively on an infinite square grid. The first player puts an $X$ in an empty cell and the second player puts an $O$ in an empty cell. The first player wins if he gets $11$ adjacent $X$'s in a line - horizontally, vertically or diagonally. Show that the second player can always prevent the first player from winning.

1992 Cono Sur Olympiad, 3
Tags: combinatorics unsolved , combinatorics
Consider a $m*n$ board. On each box there's a non-negative integrer number assigned. An operation consists on choosing any two boxes with $1$ side in common, and add to this $2$ numbers the same integrer number (it can be negative), so that both results are non-negatives. What conditions must be satisfied initially on the assignment of the boxes, in order to have, after some operations, the number $0$ on every box?.

1993 Cono Sur Olympiad, 3
Tags: combinatorics unsolved , combinatorics
Prove that, given a positive integrer $n$, there exists a positive integrer $k_n$ with the following property: Given any $k_n$ points in the space, $4$ by $4$ non-coplanar, and associated integrer numbers between $1$ and $n$ to each sharp edge that meets $2$ of this points, there's necessairly a triangle determined by $3$ of them, whose sharp edges have associated the same number.

2009 Argentina Team Selection Test, 6
Tags: combinatorics unsolved , combinatorics
Let $ n \geq 3$ be an odd integer. We denote by $ [\minus{}n,n]$ the set of all integers greater or equal than $ \minus{}n$ and less or equal than $ n$. Player $ A$ chooses an arbitrary positive integer $ k$, then player $ B$ picks a subset of $ k$ (distinct) elements from $ [\minus{}n,n]$. Let this subset be $ S$. If all numbers in $ [\minus{}n,n]$ can be written as the sum of exactly $ n$ distinct elements of $ S$, then player $ A$ wins the game. If not, $ B$ wins. Find the least value of $ k$ such that player $ A$ can always win the game.

2014 Romania Team Selection Test, 5
Tags: combinatorics unsolved , combinatorics
Let $n$ be an integer greater than $1$ and let $S$ be a finite set containing more than $n+1$ elements.Consider the collection of all sets $A$ of subsets of $S$ satisfying the following two conditions : [b](a)[/b] Each member of $A$ contains at least $n$ elements of $S$. [b](b)[/b] Each element of $S$ is contained in at least $n$ members of $A$. Determine $\max_A \min_B |B|$ , as $B$ runs through all subsets of $A$ whose members cover $S$ , and $A$ runs through the above collection.

2003 All-Russian Olympiad, 1
Tags: graph theory , combinatorics unsolved , combinatorics
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.

2005 Irish Math Olympiad, 2
Tags: combinatorics unsolved , combinatorics
Using the digits: $ 1,2,3,4,5,$ players $ A$ and $ B$ compose a $ 2005$-digit number $ N$ by selecting one digit at a time: $ A$ selects the first digit, $ B$ the second, $ A$ the third and so on. Player $ A$ wins if and only if $ N$ is divisible by $ 9$. Who will win if both players play as well as possible?

2006 China Girls Math Olympiad, 4
Tags: combinatorics unsolved , combinatorics
$8$ people participate in a party. (1) Among any $5$ people there are $3$ who pairwise know each other. Prove that there are $4$ people who paiwise know each other. (2) If Among any $6$ people there are $3$ who pairwise know each other, then can we find $4$ people who pairwise know each other?

1996 APMO, 4
Tags: combinatorics unsolved , combinatorics
The National Marriage Council wishes to invite $n$ couples to form 17 discussion groups under the following conditions: (1) All members of a group must be of the same sex; i.e. they are either all male or all female. (2) The difference in the size of any two groups is 0 or 1. (3) All groups have at least 1 member. (4) Each person must belong to one and only one group. Find all values of $n$, $n \leq 1996$, for which this is possible. Justify your answer.

2005 India IMO Training Camp, 3
Tags: analytic geometry , combinatorics unsolved , combinatorics
A merida path of order $2n$ is a lattice path in the first quadrant of $xy$- plane joining $(0,0)$ to $(2n,0)$ using three kinds of steps $U=(1,1)$, $D= (1,-1)$ and $L= (2,0)$, i.e. $U$ joins $x,y)$ to $(x+1,y+1)$ etc... An ascent in a merida path is a maximal string of consecutive steps of the form $U$. If $S(n,k)$ denotes the number of merdia paths of order $2n$ with exactly $k$ ascents, compute $S(n,1)$ and $S(n,n-1)$.

2000 Baltic Way, 10
Tags: function , combinatorics unsolved , combinatorics
Two positive integers are written on the blackboard. Initially, one of them is $2000$ and the other is smaller than $2000$. If the arithmetic mean $ m$ of the two numbers on the blackboard is an integer, the following operation is allowed: one of the two numbers is erased and replaced by $ m$. Prove that this operation cannot be performed more than ten times. Give an example where the operation is performed ten times.