Combinatorics Problems
Amir Hossein Parvardi
∗
June 16, 2011
This is a little bit different from the other problem sets I’ve made before. I’ve
written the source of the problems beside their numbers. If you need solutions,
visit AoPS Resources Page, select the competition, select the year and go to
the link of the problem. All of these problems have been posted by Orlando
Doehring (orl).
Contents
1 Problems
1.1 IMO Problems . . . . . . . . . . . . . . . . . . . . .
1.2 ISL and ILL Problems . . . . . . . . . . . . . . . . .
1.3 Ohter Competitions . . . . . . . . . . . . . . . . . .
1.3.1 China IMO Team Selection Test Problems . .
1.3.2 Vietnam IMO Team Selection Test Problems
1.3.3 Other Problems . . . . . . . . . . . . . . . . .
1
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1
1
3
8
8
11
13
Problems
1.1
IMO Problems
1. (IMO 1970, Day 2, Problem 4) Find all positive integers n such that
the set {n, n + 1, n + 2, n + 3, n + 4, n + 5} can be partitioned into two subsets
so that the product of the numbers in each subset is equal.
2. (IMO 1970, Day 2, Problem 6) Given 100 coplanar points, no three
collinear, prove that at most 70% of the triangles formed by the points have all
angles acute.
3. (IMO 1971, Day 2, Problem 5) Prove that for every positive integer m
we can find a finite set S of points in the plane, such that given any point A of
S, there are exactly m points in S at unit distance from A.
∗ email:
ahpwsog@gmail.com, blog: http://math-olympiad.blogsky.com.
1
4. (IMO 1972, Day 1, Problem 1) Prove that from a set of ten distinct twodigit numbers, it is always possible to find two disjoint subsets whose members
have the same sum.
5. (IMO 1975, Day 2, Problem 5) Can there be drawn on a circle of radius
1 a number of 1975 distinct points, so that the distance (measured on the chord)
between any two points (from the considered points) is a rational number?
6. (IMO 1976, Day 1, Problem 3) A box whose shape is a parallelepiped can
be completely filled with cubes of side 1. If we put in it the maximum possible
number of cubes, each ofvolume, 2, with the sides parallel to those of the box,
then exactly 40 percent from the volume of the box is occupied. Determine the
possible dimensions of the box.
7. (IMO 1978, Day 2, Problem 6) An international society has its members
from six different countries. The list of members contain 1978 names, numbered
1, 2, . . . , 1978. Prove that there is at least one member whose number is the sum
of the numbers of two members from his own country, or twice as large as the
number of one member from his own country.
8. (IMO 1981, Day 1, Problem 2) Take r such that 1 ≤ r ≤ n, and consider
all subsets of r elements of the set {1, 2, . . . , n}. Each subset has a smallest
element. Let F (n, r) be the arithmetic mean of these smallest elements. Prove
that:
n+1
.
F (n, r) =
r+1
9. (IMO 1985, Day 2, Problem 4) Given a set M of 1985 distinct positive
integers, none of which has a prime divisor greater than 23, prove that M
contains a subset of 4 elements whose product is the 4th power of an integer.
10. (IMO 1986, Day 1, Problem 3) To each vertex of a regular pentagon
an integer is assigned, so that the sum of all five numbers is positive. If three
consecutive vertices are assigned the numbers x, y, z respectively, and y < 0,
then the following operation is allowed: x, y, z are replaced by x + y, −y, z + y
respectively. Such an operation is performed repeatedly as long as at least one
of the five numbers is negative. Determine whether this procedure necessarily
comes to an end after a finite number of steps.
11. (1986, Day 2, Problem 6) Given a finite set of points in the plane, each
with integer coordinates, is it always possible to color the points red or white so
that for any straight line L parallel to one of the coordinate axes the difference
(in absolute value) between the numbers of white and red points on L is not
greater than 1?
12. (IMO 1987, Day 1, Problem 1) Let pn (k) be the number of permutations
Pn of the set {1, 2, 3, . . . , n} which have exactly k fixed points. Prove that
k=0 kpn (k) = n!.
2
13. (IMO 1989, Day 1, Problem 3) Let n and k be positive integers and
let S be a set of n points in the plane such that
• no three points of S are collinear, and
• for every point P of S there are at least k points of S equidistant from P.
Prove that:
k<
1 √
+ 2·n
2
14. (IMO 1989, Day 2, Problem 6) A permutation {x1 , . . . , x2n } of the
set {1, 2, . . . , 2n} where n is a positive integer, is said to have property T if
|xi − xi+1 | = n for at least one i in {1, 2, . . . , 2n − 1}. Show that, for each n,
there are more permutations with property T than without.
15. (IMO 1990, Day 1, Problem 2) Let n ≥ 3 and consider a set E of
2n − 1 distinct points on a circle. Suppose that exactly k of these points are to
be colored black. Such a coloring is good if there is at least one pair of black
points such that the interior of one of the arcs between them contains exactly
n points from E. Find the smallest value of k so that every such coloring of k
points of E is good.
16. (IMO 1991, Day 1, Problem 3) Let S = {1, 2, 3, · · · , 280}. Find the
smallest integer n such that each n-element subset of S contains five numbers
which are pairwise relatively prime.
17. (IMO 1992, Day 1, Problem 3) Consider 9 points in space, no four of
which are coplanar. Each pair of points is joined by an edge (that is, a line
segment) and each edge is either colored blue or red or left uncolored. Find the
smallest value of n such that whenever exactly n edges are colored, the set of
colored edges necessarily contains a triangle all of whose edges have the same
color.
18. (IMO 1993, Day 1, Problem 3) On an infinite chessboard, a solitaire
game is played as follows: at the start, we have n2 pieces occupying a square
of side n. The only allowed move is to jump over an occupied square to an
unoccupied one, and the piece which has been jumped over is removed. For
which n can the game end with only one piece remaining on the board?
19. (IMO 1993, Day 2, Problem 6) Let n > 1 be an integer. In a circular
arrangement of n lamps L0 , . . . , Ln−1 , each of of which can either ON or OFF, we
start with the situation where all lamps are ON, and then carry out a sequence
of steps, Step0 , Step1 , . . . . If Lj−1 (j is taken mod n) is ON then Stepj changes
the state of Lj (it goes from ON to OFF or from OFF to ON) but does not
change the state of any of the other lamps. If Lj−1 is OFF then Stepj does not
change anything at all. Show that:
• There is a positive integer M (n) such that after M (n) steps all lamps are
ON again,
3
• If n has the form 2k then all the lamps are ON after n2 − 1 steps,
• If n has the form 2k + 1 then all lamps are ON after n2 − n + 1 steps.
1.2
ISL and ILL Problems
20. (IMO LongList 1959-1966 Problem 14) What is the maximal number
of regions a circle can be divided in by segments joining n points on the boundary
of the circle ?
21. (IMO LongList 1959-1966 Problem 45) An alphabet consists of n letters. What is the maximal length of a word if we know that any two consecutive
letters a, b of the word are different and that the word cannot be reduced to a
word of the kind abab with a 6= b by removing letters.
k 22. (IMO ShortList 1973, Romania 1) Show that there exists exactly [ k2 ]
sequences a1 , a2 , . . . , ak+1 of integer numbers ≥ 0, for which a1 = 0 and |ai −
ai+1 | = 1 for all i = 0, . . . , k.
23. (IMO ShortList 1974, USA 1) Three players A, B and C play a game
with three cards and on each of these 3 cards it is written a positive integer,
all 3 numbers are different. A game consists of shuffling the cards, giving each
player a card and each player is attributed a number of points equal to the
number written on the card and then they give the cards back. After a number
(≥ 2) of games we find out that A has 20 points, B has 10 points and C has
9 points. We also know that in the last game B had the card with the biggest
number. Who had in the first game the card with the second value (this means
the middle card concerning its value).
24. (IMO ShortList 1988, Problem 11) The lock of a safe consists of 3
wheels, each of which may be set in 8 different ways positions. Due to a defect
in the safe mechanism the door will open if any two of the three wheels are in
the correct position. What is the smallest number of combinations which must
be tried if one is to guarantee being able to open the safe (assuming the ”right
combination” is not known)?
25. (IMO ShortList 1988, Problem 20) Find the least natural number n
such that, if the set {1, 2, . . . , n} is arbitrarily divided into two non-intersecting
subsets, then one of the subsets contains 3 distinct numbers such that the product of two of them equals the third.
26. (IMO ShortList 1988, Problem 31) Around a circular table an even
number of persons have a discussion. After a break they sit again around the
circular table in a different order. Prove that there are at least two people such
that the number of participants sitting between them before and after a break
is the same.
27. (IMO Longlist 1989, Problem 27) Let L denote the set of all lattice
points of the plane (points with integral coordinates). Show that for any three
4
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?
28. (IMO Longlist 1989, Problem 80) A balance has a left pan, a right
pan, and a pointer that moves along a graduated ruler. Like many other grocer
balances, this one works as follows: An object of weight L is placed in the left
pan and another of weight R in the right pan, the pointer stops at the number
R−L on the graduated ruler. There are n, (n ≥ 2) bags of coins, each containing
n(n−1)
+ 1 coins. All coins look the same (shape, color, and so on). n − 1 bags
2
contain real coins, all with the same weight. The other bag (we dont know which
one it is) contains false coins. All false coins have the same weight, and this
weight is different from the weight of the real coins. A legal weighing consists of
placing a certain number of coins in one of the pans, putting a certain number
of coins in the other pan, and reading the number given by the pointer in the
graduated ruler. With just two legal weighings it is possible to identify the bag
containing false coins. Find a way to do this and explain it.
29. (IMO ShortList 1988, Problem 4) An n × n, n ≥ 2 chessboard is numbered by the numbers 1, 2, . . . , n2 (and every number occurs). Prove that there
exist two neighbouring (with common edge) squares such that their numbers
differ by at least n.
30. (IMO ShortList 1990, Problem 15) Determine for which positive integers k the set
X = {1990, 1990 + 1, 1990 + 2, . . . , 1990 + k}
can be partitioned into two disjoint subsets A and B such that the sum of the
elements of A is equal to the sum of the elements of B.
31. (IMO Shortlist 1993, Ireland 2) Let n, k ∈ Z+ with k ≤ n and let S
be a set containing n distinct real numbers. Let T be a set of all real numbers
of the form x1 + x2 + . . . + xk where x1 , x2 , . . . , xk are distinct elements of S.
Prove that T contains at least k(n − k) + 1 distinct elements.
32. (IMO Shortlist 1994, Combinatorics Problem 2) In a certain city,
age is reckoned in terms of real numbers rather than integers. Every two citizens
x and x′ either know each other or do not know each other. Moreover, if they
do not, then there exists a chain of citizens x = x0 , x1 , . . . , xn = x′ for some
integer n ≥ 2 such that xi−1 and xi know each other. In a census, all male
citizens declare their ages, and there is at least one male citizen. Each female
citizen provides only the information that her age is the average of the ages of
all the citizens she knows. Prove that this is enough to determine uniquely the
ages of all the female citizens.
33. (IMO Shortlist 1995, Combinatorics Problem 5) At a meeting of
12k people, each person exchanges greetings with exactly 3k + 6 others. For any
two people, the number who exchange greetings with both is the same. How
many people are at the meeting?
5
34. (IMO Shortlist 1996, Combinatorics Problem 1) We are given a positive integer r and a rectangular board ABCD with dimensions AB = 20, BC =
12. The rectangle is divided into a grid of 20 × 12 unit squares. The following
moves are permitted on the board: one can move from one square
to another
√
only if the distance between the centers of the two squares is r. The task is
to find a sequence of moves leading from the square with A as a vertex to the
square with B as a vertex.
• Show that the task cannot be done if r is divisible by 2 or 3.
• Prove that the task is possible when r = 73.
• Can the task be done when r = 97?
35. (IMO Shortlist 1996, Combinatorics Problem 4) Determine whether
or nor there exist two disjoint infinite sets A and B of points in the plane
satisfying the following conditions:
• a) No three points in A ∪ B are collinear, and the distance between any
two points in A ∪ B is at least 1.
• b) There is a point of A in any triangle whose vertices are in B, and there
is a point of B in any triangle whose vertices are in A.
36. (IMO Shortlist 1996, Combinatorics Problem 6) A finite number of
coins are placed on an infinite row of squares. A sequence of moves is performed
as follows: at each stage a square containing more than one coin is chosen.
Two coins are taken from this square; one of them is placed on the square
immediately to the left while the other is placed on the square immediately to
the right of the chosen square. The sequence terminates if at some point there
is at most one coin on each square. Given some initial configuration, show that
any legal sequence of moves will terminate after the same number of steps and
with the same final configuration.
37. (IMO ShortList 1998, Combinatorics Problem 1) A rectangular array of numbers is given. In each row and each column, the sum of all numbers is
an integer. Prove that each nonintegral number x in the array can be changed
into either ⌈x⌉ or ⌊x⌋ so that the row-sums and column-sums remain unchanged.
(Note that ⌈x⌉ is the least integer greater than or equal to x, while ⌊x⌋ is the
greatest integer less than or equal to x.)
38. (IMO ShortList 1998, Combinatorics Problem 5) In a contest, there
are m candidates and n judges, where n ≥ 3 is an odd integer. Each candidate is
evaluated by each judge as either pass or fail. Suppose that each pair of judges
agrees on at most k candidates. Prove that
k
n−1
≥
.
m
2n
6
39. (IMO ShortList 1999, Combinatorics Problem 4) Let A be a set
of N residues (mod N 2 ). Prove that there exists a set B of of N residues
(mod N 2 ) such that A + B = {a + b|a ∈ A, b ∈ B} contains at least half of all
the residues (mod N 2 ).
40. (IMO ShortList 1999, Combinatorics Problem 6) Suppose that every
integer has been given one of the colours red, blue, green or yellow. Let x and y
be odd integers so that |x| =
6 |y|. Show that there are two integers of the same
colour whose difference has one of the following values: x, y, x + y or x − y.
41. (IMO Shortlist 2000, Combinatorics Problem 3) Let n ≥ 4 be a fixed
positive integer. Given a set S = {P1 , P2 , . . . , Pn } of n points in the plane such
that no three are collinear and no four concyclic, let at , 1 ≤ t ≤ n, be theP
number
n
of circles Pi Pj Pk that contain Pt in their interior, and let m(S) =
i=1 ai .
Prove that there exists a positive integer f (n), depending only on n, such that
the points of S are the vertices of a convex polygon if and only if m(S) = f (n).
42. (IMO Shortlist 2000, Combinatorics Problem 4) Let n and k be
positive integers such that 21 n < k ≤ 23 n. Find the least number m for which it
is possible to place m pawns on m squares of an n × n chessboard so that no
column or row contains a block of k adjacent unoccupied squares.
43. (IMO ShortList 2001, Combinatorics Problem 1) Let A = (a1 , a2 , . . . ,
a2001 ) be a sequence of positive integers. Let m be the number of 3-element subsequences (ai , aj , ak ) with 1 ≤ i < j < k ≤ 2001, such that aj = ai + 1 and
ak = aj + 1. Considering all such sequences A, find the greatest value of m.
44. (IMO ShortList 2001, Combinatorics Problem 2) Let n be an odd
integer greater than 1 and let c1 , c2 , . . . , cn be integers.
For each permutation
P
a = (a1 , a2 , . . . , an ) of {1, 2, . . . , n}, define S(a) = ni=1 ci ai . Prove that there
exist permutations a 6= b of {1, 2, . . . , n} such that n! is a divisor of S(a) − S(b).
45. (IMO ShortList 2001, Combinatorics Problem 3) Define a k-clique
to be a set of k people such that every pair of them are acquainted with each
other. At a certain party, every pair of 3-cliques has at least one person in
common, and there are no 5-cliques. Prove that there are two or fewer people
at the party whose departure leaves no 3-clique remaining.
46. (IMO ShortList 2002, Combinatorics Problem 1) Let n be a positive
integer. Each point (x, y) in the plane, where x and y are non-negative integers
with x + y < n, is coloured red or blue, subject to the following condition: if a
point (x, y) is red, then so are all points (x′ , y ′ ) with x′ ≤ x and y ′ ≤ y. Let A
be the number of ways to choose n blue points with distinct x-coordinates, and
let B be the number of ways to choose n blue points with distinct y-coordinates.
Prove that A = B.
47. (IMO ShortList 2002, Combinatorics Problem 2) For n an odd positive integer, the unit squares of an n × n chessboard are coloured alternately
black and white, with the four corners coloured black. A it tromino is an L-shape
7
formed by three connected unit squares. For which values of n is it possible to
cover all the black squares with non-overlapping trominos? When it is possible,
what is the minimum number of trominos needed?
48. (IMO ShortList 2002, Combinatorics Problem 3) Let n be a positive
integer. A sequence of n positive integers (not necessarily distinct) is called full
if it satisfies the following condition: for each positive integer k ≥ 2, if the
number k appears in the sequence then so does the number k − 1, and moreover
the first occurrence of k − 1 comes before the last occurrence of k. For each n,
how many full sequences are there ?
49. (IMO ShortList 2004, Combinatorics Problem 8) For a finite graph
G, let f (G) be the number of triangles and g(G) the number of tetrahedra
formed by edges of G. Find the least constant c such that
g(G)3 ≤ c · f (G)4
for every graph G.
50. (IMO Shortlist 2007, Combinatorics Problem 1) Let n > 1 be an
integer. Find all sequences a1 , a2 , . . . an2 +n satisfying the following conditions:
• a) ai ∈ {0, 1} for all 1 ≤ i ≤ n2 + n
• b) ai+1 + ai+2 + . . . + ai+n < ai+n+1 + ai+n+2 + . . . + ai+2n for all 0 ≤
i ≤ n2 − n.
51. (IMO Shortlist 2007, Combinatorics Problem 3) Find all positive
integers n for which the numbers in the set S = {1, 2, . . . , n} can be colored
red and blue, with the following condition being satisfied: The set S × S × S
contains exactly 2007 ordered triples (x, y, z) such that:
• (i) the numbers x, y, z are of the same color, and
• (ii) the number x + y + z is divisible by n.
1.3
1.3.1
Ohter Competitions
China IMO Team Selection Test Problems
52. (China TST 1987, Problem 6) Let G be a simple graph with 2 · n
vertices and n2 + 1 edges. Show that this graph G contains a K4 − one edge,
that is, two triangles with a common edge.
53. (China TST 1988, Problem 4) Let k ∈ N, Sk = {(a, b)|a, b = 1, 2, . . . , k}.
Any two elements (a, b), (c, d) ∈ Sk are called ”undistinguishing” in Sk if
a − c ≡ 0 or ±1 (mod k) and b − d ≡ 0 or ±1 (mod k); otherwise, we call
them ”distinguishing”. For example, (1, 1) and (2, 5) are undistinguishing in
S5 . Considering the subset A of Sk such that the elements of A are pairwise
distinguishing. Let rk be the maximum possible number of elements of A.
8
• Find r5 .
• Find r7 .
• Find rk for k ∈ N.
Q
54. (China TST 1988, Problem 7) A polygon is given in the OXY plane
and its area exceeds n. Prove
Q that there exist n + 1 points P1 (x1 , y1 ), P2 (x2 , y2 ),
. . . , Pn+1 (xn+1 , yn+1 ) in
such that ∀i, j ∈ {1, 2, . . . , n + 1}, xj − xi and yj − yi
are all integers.
55. (China TST 1989, Problem 7) 1989 equal circles are arbitrarily placed
on the table without overlap. What is the least number of colors are needed
such that all the circles can be painted with any two tangential circles colored
differently.
56. (China TST 1990, Problem 1) In a wagon, every m ≥ 3 people have
exactly one common friend. (When A is B’s friend, B is also A’s friend. No
one was considered as his own friend.) Find the number of friends of the person
who has the most friends.
57. (China TST 1990, Problem 8) There are arbitrary 7 points in the plane.
Circles are drawn through every 4 possible concyclic points. Find the maximum
number of circles that can be drawn.
58. (China TST 1991, Problem 3) 5 points are given in the plane. Any three
of them are non-collinear. Any four are non-cyclic. If three points determine a
circle that has one of the remaining points inside it and the other one outside
it, then the circle is said to be good. Let the number of good circles be n, find
all possible values of n.
59. (China TST 1991, Problem 6) All edges of a polyhedron are painted
with red or yellow. For an angle determined by consecutive edges on the surface,
if the edges are of distinct colors, then the angle is called excentric. The excentricity of a vertex A, namely SA , is defined as the number of excentrix angles it
has. Prove that there exist two vertices B and C such that SB + SC ≤ 4.
60. (China TST 1992, Problem 1) 16 students took part in a competition.
All problems were multiple choice style. Each problem had four choices. It
was said that any two students had at most one answer in common, find the
maximum number of problems.
61. (China TST 1992, Problem 5) A (3n + 1) × (3n + 1) table (n ∈ N) is
given. Prove that deleting any one of its squares yields a shape cuttable into
pieces of the following form and its rotations: ”L” shape formed by cutting one
square from a 4 × 4 squares.
62. (China TST 1993, Problem 3) A graph G = (V, E) is given. If at least
n colors are required to paints its vertices so that between any two same colored
vertices no edge is connected, then call this graph ”n−colored”. Prove that for
any n ∈ N, there is a n−colored graph without triangles.
9
63. (China TST 1994, Problem 2) An n by n grid, where every square
contains a number, is called an n-code if the numbers in every row and column
form an arithmetic progression. If it is sufficient to know the numbers in certain
squares of an n-code to obtain the numbers in the entire grid, call these squares
a key.
• a.) Find the smallest s ∈ N such that any s squares in an n−code (n ≥ 4)
form a key.
• b.) Find the smallest t ∈ N such that any t squares along the diagonals of
an n-code (n ≥ 4) form a key.
64. (China TST 1994, Problem 3) Find the smallest n ∈ N such that if any
5 vertices of a regular n-gon are colored red, there exists a line of symmetry l
of the n-gon such that every red point is reflected across l to a non-red point.
65. (China TST 1995, Problem 3) 21 people take a test with 15 true or
false questions. It is known that every 2 people have at least 1 correct answer
in common. What is the minimum number of people that could have correctly
answered the question which the most people were correct on?
66. (China TST 1995, Problem 4) Let S = {A = (a1 , . . . , as ) | ai = 0 or
1, i = 1, . . . , 8}.PFor any 2 elements of S, A = {a1 , . . . , a8 } and B = {b1 , . . . , b8 }.
Let d(A, B) = i=1 8|ai − bi |. Call d(A, B) the distance between A and B. At
most how many elements can S have such that the distance between any 2 sets
is at least 5?
67. (China TST 1996, Problem 4) 3 countries A, B, C participate in a
competition where each country has 9 representatives. The rules are as follows:
every round of competition is between 1 competitor each from 2 countries. The
winner plays in the next round, while the loser is knocked out. The remaining
country will then send a representative to take on the winner of the previous
round. The competition begins with A and B sending a competitor each. If all
competitors from one country have been knocked out, the competition continues
between the remaining 2 countries until another country is knocked out. The
remaining team is the champion.
• I. At least how many games does the champion team win?
• II. If the champion team won 11 matches, at least how many matches
were played?
68. (China TST 1998, Problem 5) Let n be a natural number greater than
2. l is a line on a plane. There are n distinct points P1 , P2 , , Pn on l. Let the
product of distances between Pi and the other n − 1 points be di (i = 1, 2, , n).
There exists a point Q, which does not lie on l, on the plane. Let the distance
Pn
c2
from Q to Pi be Ci (i = 1, 2, , n). Find Sn = i=1 (−1)n−i dii .
10
69. (China TST 2000, Problem 2) Given positive integers k, m, n such that
1 ≤ k ≤ m ≤ n. Evaluate
n
X
i=0
1
(m + n + i)!
·
.
n + k + i i!(n − i)!(m + i)!
70. (China Team Selection Test 2002, Day 1, Problem 3) Seventeen
football fans were planning to go to Korea to watch the World Cup football
match. They selected 17 matches. The conditions of the admission tickets they
booked were such that
• One person should book at most one admission ticket for one match;
• At most one match was same in the tickets booked by every two persons;
• There was one person who booked six tickets.
How many tickets did those football fans book at most?
71. (China Team Selection Test 2003, Day 1, Problem 2) Suppose
A ⊆ {0, 1, . . . , 29}. It satisfies that for any integer k and any two members
a, b ∈ A(a, b is allowed to be same), a + b + 30k is always not the product of two
consecutive integers. Please find A with largest possible cardinality.
72. (China Team Selection Test 2003, Day 2, Problem 2) Suppose
A = {1, 2, . . . , 2002} and M = {1001, 2003, 3005}. B is an non-empty subset of
A. B is called a M -free set if the sum of any two numbers in B does not belong
to M . If A = A1 ∪ A2 , A1 ∩ A2 = ∅ and A1 , A2 are M -free sets, we call the
ordered pair (A1 , A2 ) a M -partition of A. Find the number of M -partitions of
A.
1.3.2
Vietnam IMO Team Selection Test Problems
73. (Vietnam TST 1994, Problem 6) Calculate
T =
X
1
n1 ! · n2 ! · · · · n1994 ! · (n2 + 2 · n3 + 3 · n4 + . . . + 1993 · n1994 )!
where the sum is taken over all 1994-tuples of the numbers n1 , n2 , . . . , n1994 ∈
N ∪ {0} satisfying n1 + 2 · n2 + 3 · n3 + . . . + 1994 · n1994 = 1994.
74. (Vietnam TST 1996, Problem 5) There are some people in a meeting;
each doesn’t know at least 56 others, and for any pair, there exist a third one
who knows both of them. Can the number of people be 65?
75. (Vietnam TST 1996, Problem 1) In the plane we are given 3 · n points
(n >1) no three collinear, and the distance between any two of them is ≤ 1.
Prove that we can construct n pairwise disjoint triangles such that: The vertex
set of these triangles are exactly the given 3n points and the sum of the area of
these triangles < 1/2.
11
76. (Vietnam TST 1999, Problem 6) Let a regular polygon with p vertices
be given, where p is an odd prime number. At every vertex there is one monkey.
An owner of monkeys takes p peanuts, goes along the perimeter of polygon
clockwise and delivers to the monkeys by the following rule: Gives the first
peanut for the leader, skips the two next vertices and gives the second peanut
to the monkey at the next vertex; skip four next vertices gives the second peanut
for the monkey at the next vertex ... after giving the k-th peanut, he skips the
2 · k next vertices and gives k + 1-th for the monkey at the next vertex. He does
so until all p peanuts are delivered.
• I. How many monkeys are there which does not receive peanuts?
• II. How many edges of polygon are there which satisfying condition: both
two monkey at its vertex received peanut(s)?
77. (Vietnam TST 2001, Problem 3) Some club has 42 members. Its known
that among 31 arbitrary club members, we can find one pair of a boy and a girl
that they know each other. Show that from club members we can choose 12
pairs of knowing each other boys and girls.
78. (Vietnam TST 2001, Problem 5) Let an integer n > 1 be given. In the
space with orthogonal coordinate system Oxyz we denote by T the set of all
points (x, y, z) with x, y, z are integers, satisfying the condition: 1 ≤ x, y, z ≤ n.
We paint all the points of T in such a way that: if the point A(x0 , y0 , z0 ) is
painted then points B(x1 , y1 , z1 ) for which x1 ≤ x0 , y1 ≤ y0 and z1 ≤ z0 could
not be painted. Find the maximal number of points that we can paint in such
a way the above mentioned condition is satisfied.
79. (Vietnam TST 2002, Problem 4) Let n ≥ 2 be an integer and consider
an array composed of n rows and 2n columns. Half of the elements
in the array
are colored in red. Prove that for each integer k, 1 < k ≤ n2 + 1, there exist
k rows such that the array of size k × 2n formed with these k rows has at least
k!(n − 2k + 2)
(n − k + 1)(n − k + 2) · · · (n − 1)
columns which contain only red cells.
80. (Vietnam TST 2003, Problem 1) Let be four positive integers m, n, p, q,
with p < m given and q < n. Take four points A(0; 0), B(p; 0), C(m; q) and
D(m; n) in the coordinate plane. Consider the paths f from A to D and the
paths g from B to C such that when going along f or g, one goes only in the
positive directions of coordinates and one can only change directions (from the
positive direction of one axe coordinate into the the positive direction of the
other axe coordinate) at the points with integral coordinates. Let S be the
number of couples (f, g) such that f and g have no common points. Prove that
n
q
q
n
.
·
−
·
S=
m+n−p
m+q
m+q−p
m+n
12
81. (Vietnam TST 2003, Problem 5) Let A be the set of all permutations a = (a1 , a2 , . . . , a2003 ) of the 2003 first positive integers such that each
permutation satisfies the condition: there is no proper subset S of the set
{1, 2, . . . , 2003} such that {ak |k ∈ S} = S. For each a = (a1 , a2 , . . . , a2003 ) ∈ A,
P2003
2
let d(a) = k=1 (ak − k) .
• I. Find the least value of d(a). Denote this least value by d0 .
• II. Find all permutations a ∈ A such that d(a) = d0 .
1.3.3
Other Problems
82. (APMO 2006, Problem 3) Let p ≥ 5 be a prime and let r be the number
of ways of placing p checkers on a p × p checkerboard so that not all checkers
are in the same row (but they may all be in the same column). Show that r is
divisible by p5 . Here, we assume that all the checkers are identical.
83. (APMO 2006, Problem 5) In a circus, there are n clowns who dress
and paint themselves up using a selection of 12 distinct colours. Each clown
is required to use at least five different colours. One day, the ringmaster of
the circus orders that no two clowns have exactly the same set of colours and
no more than 20 clowns may use any one particular colour. Find the largest
number n of clowns so as to make the ringmaster’s order possible.
84. (USAMO 2006, Problem 2) For a given positive integer k find, in terms
of k, the minimum value of N for which there is a set of 2k + 1 distinct positive
integers that has sum greater than N but every subset of size k has sum at most
N
2.
85. (China Girls Math Olympiad 2008, Problem 1)
• Determine if the set {1, 2, . . . , 96} can be partitioned into 32 sets of equal
size and equal sum.
• Determine if the set {1, 2, . . . , 99} can be partitioned into 33 sets of equal
size and equal sum.
86. (USA TST 2008, Day 1, Problem 1) There is a set of n coins with
distinct integer weights w1 , w2 , . . . , wn . It is known that if any coin with weight
wk , where 1 ≤ k ≤ n, is removed from the set, the remaining coins can be split
into two groups of the same weight. (The number of coins in the two groups
can be different.) Find all n for which such a set of coins exists.
87. (USA TST 2008, Day 1, Problem 3) For a pair A = (x1 , y1 ) and
B = (x2 , y2 ) of points on the coordinate plane, let d(A, B) = |x1 −x2 |+|y1 −y2 |.
We call a pair (A, B) of (unordered) points harmonic if 1 < d(A, B) ≤ 2.
Determine the maximum number of harmonic pairs among 100 points in the
plane.
13
88. (Germany Bundeswettbewerb Mathematik 2008, Round 2, Problem 4) On a bookcase there are n ≥ 3 books side by side by different authors.
A librarian considers the first and second book from left and exchanges them iff
they are not alphabetically sorted. Then he is doing the same operation with the
second and third book from left etc. Using this procedure he iterates through
the bookcase three times from left to right. Considering all possible initial book
configurations how many of them will then be alphabetically sorted?
89. (All Russian Olympiads 2002) There are some markets in a city. Some
of them are joined by streets with one-sided movement such that for any square,
there are exactly two streets to leave it. Prove that the city may be partitioned
on 1014 districts such that streets join only markets from distinct districts, and
by the same way for any two districts (either only from first to second, or vice
versa).
90. (All Russian Olympiads 2005) Given 2005 distinct numbers a1 , a2 , . . . ,
a2005 . By one question, we may take three different indices 1 ≤ i < j < k ≤ 2005
and find out the set of numbers {ai , aj , ak } (unordered, of course). Find the
minimal number of questions, which are necessary to find out all numbers ai .
91. (All Russian Olympiads 2005 - Problem 9.8) 100 people from 50
countries, two from each countries, stay on a circle. Prove that one may partition
them onto 2 groups in such way that neither no two countrymen, nor three
consecutive people on a circle, are in the same group.
92. (Germany, Bundeswettbewerb Mathematik 1991, Round Two,
Problem 2) In the space there are 8 points that no four of them are in the plane.
17 of the connecting segments are coloured blue and the other segments are to
be coloured red. Prove that this colouring will create at least four triangles.
Prove also that four cannot be subsituted by five.
Remark: Blue triangles are those triangles whose three edges are coloured blue.
93. (China West Mathematical Olympiad 2003, Problem 8) 1650 students are arranged in 22 rows and 75 columns. It is known that in any two
columns, the number of pairs of students in the same row and of the same sex
is not greater than 11. Prove that the number of boys is not greater than 928.
94. (China Girls Mathematical Olympiad 2005, Problem 4) Determine
all positive real numbers a such that there exists a positive integer n and sets
A1 , A2 , . . . , An satisfying the following conditions:
• every set Ai has infinitely many elements;
• every pair of distinct sets Ai and Aj do not share any common element
• the union of sets A1 , A2 , . . . , An is the set of all integers;
• for every set Ai , the positive difference of any pair of elements in Ai is at
least ai .
14
95. (Germany Bundeswettbewerb Mathematik 2007, Round 2, Problem 2) At the start of the game there are r red and g green pieces/stones on
the table. Hojoo and Kestutis make moves in turn. Hojoo starts. The person
due to make a move, chooses a colour and removes k pieces of this colour. The
number k has to be a divisor of the current number of stones of the other colour.
The person removing the last piece wins. Who can force the victory?
96. (Germany Bundeswettbewerb Mathematik 2008, Round 1, Problem 1) Fedja used matches to put down the equally long sides of a parallelogram
whose vertices are not on a common line. He figures out that exactly 7 or 9
matches, respectively, fit into the diagonals. How many matches compose the
parallelogram’s perimeter?
97. (Tuymaada 2008, Senior League, First Day, Problem 1) Several
irrational numbers are written on a blackboard. It is known that for every
a
and
two numbers a and b on the blackboard, at least one of the numbers b+1
b
is
rational.
What
maximum
number
of
irrational
numbers
can
be
on
the
a+1
blackboard?
98. (Tuymaada 2008, Senior League, Second Day, Problem 5) Every
street in the city of Hamiltonville connects two squares, and every square may
be reached by streets from every other. The governor discovered that if he closed
all squares of any route not passing any square more than once, every remained
square would be reachable from each other. Prove that there exists a circular
route passing every square of the city exactly once.
99. (Tuymaada 2008, Junior League, First Day, Problem 3) 100 unit
squares of an infinite squared plane form a 10 × 10 square. Unit segments
forming these squares are coloured in several colours. It is known that the
border of every square with sides on grid lines contains segments of at most
two colours. (Such square is not necessarily contained in the original 10 × 10
square.) What maximum number of colours may appear in this colouring?
100. (Iran PPCE 1997, Exam 2, Problem 1) Let k, m, n be integers such
that 1 < n ≤ m − 1 ≤ k. Determine the maximum size of a subset S of the set
{1, 2, 3, . . . , k − 1, k} such that no n distinct elements of S add up to m.
15