Enumerative Combinatorics

1. How many solutions are there to the equation:

x1 + x2 + x3 + x4 + x5 + x6 = 30 in each of the following cases:
i) xi , i = 1, · · · , 6, is positive integer
ii) xi , i = 1, · · · , 6, is nonnegative integer
iii) xi , i = 1, · · · , 6, is nonnegative integer and x1 ≤ 5
iv) xi , i = 1, · · · , 6, is nonnegative intege, x1 ≤ 7 and x2 ≥ 9.
2. How many ways are there to distribute m balls into n boxes in
each of the following cases:
i) The balls are distinguishable and the boxes are
distinguishable.
ii) The balls are distinguishable, the boxes are distinguishable
and no box has more than 1 ball.
iii) The balls are indistinguishable and the boxes are
distinguishable.
iv) The balls are indistinguishable, the boxes are
indistinguishable and the difference between the number of
balls in each pair of boxes does not excess 1.
3. How many numbers between 2015 and 5000 which has sum of
its digits is divisible by 5 ?
3. How many numbers between 2015 and 5000 which has sum of
its digits is divisible by 5 ?
4. Find the sum of all three-digit numbers that can be written
using the digits 1, 2, 3, 4 (the numbers may be repeated).
3. How many numbers between 2015 and 5000 which has sum of
its digits is divisible by 5 ?
4. Find the sum of all three-digit numbers that can be written
using the digits 1, 2, 3, 4 (the numbers may be repeated).
5. How many ways are there to arrange 5 black balls, 5 red balls
and 5 green balls in a line so that no black balls stand next to
another black ball.
3. How many numbers between 2015 and 5000 which has sum of
its digits is divisible by 5 ?
4. Find the sum of all three-digit numbers that can be written
using the digits 1, 2, 3, 4 (the numbers may be repeated).
5. How many ways are there to arrange 5 black balls, 5 red balls
and 5 green balls in a line so that no black balls stand next to
another black ball.
6. There are 2n apples, 2n oranges and 2n peaches. How many
ways are there to divide the fruits between two persons so
that each get 3n fruits.
7. 2n players enter a tennis tournament. Find the number of
pairing for the fist round.
7. 2n players enter a tennis tournament. Find the number of
pairing for the fist round.
8. How many permutations of {1, 2, · · · , n} are there such that 1
stands before 2 and 2 stands before 3.
7. 2n players enter a tennis tournament. Find the number of
pairing for the fist round.
8. How many permutations of {1, 2, · · · , n} are there such that 1
stands before 2 and 2 stands before 3.
9. Given a convex n-gon. Suppose that no three diagonals pass
through a point inside the polygon.
i) How many diagonals are there?
ii) How many points of intersection of diagonal are there
inside the polygon?
iii) In to how many parts is the n-gon divided by the
diagonals?
iv) How many different triangles can form by drawing all the
diagonals ?
10. How many ways can you make change for a 50 dollar bill
using 5, 10, and 20 dollar bills.
10. How many ways can you make change for a 50 dollar bill
using 5, 10, and 20 dollar bills.
11. How many zic-zag path consists of white squares going down
from the top row to the bottom row of an 8 × 8 chessboard.
10. How many ways can you make change for a 50 dollar bill
using 5, 10, and 20 dollar bills.
11. How many zic-zag path consists of white squares going down
from the top row to the bottom row of an 8 × 8 chessboard.
12. How many ways are there to choose an ordered tuple of 6 not
necessary distinct subsets (A1 , · · · , A6 ) of {1, 2, · · · , n} such
that each numbers i belongs to at least 3 subsets.
13. Consider an equilateral triangle of side length n(n odd) ,
which is divided into unit triangles, as shown. Let f (n) be the
number of paths from the triangle in the top row to the
middle triangle in the bottom row, such that adjacent
triangles in our path share a common edge and the path never
travels up (from a lower row to a higher row) or revisits a
triangle. An example of one such path is illustrated below for
n = 5. Determine the value of f (2015).
14. A school which has n students want to form 4 clubs: math
club, sport club, physics club and photography club. How
many way are there to form the clubs given that
1) the math club and sport club have at least one common
member;
2) the sport club and physics club have at least one common
member;
3) the physics club and photography club have at least one
common member.
15. Given a rectangular board of side m × n. Find the number of
ways to color some of the cells black so that in any row or
column the number of black cells is even
15. Given a rectangular board of side m × n. Find the number of
ways to color some of the cells black so that in any row or
column the number of black cells is even
16. Let S = {1, 2, ..., 1990}. A 31-element subset of S is called
good if the sum of its elements is divisible by 5. Find the
number of good subsets of S.
15. Given a rectangular board of side m × n. Find the number of
ways to color some of the cells black so that in any row or
column the number of black cells is even
16. Let S = {1, 2, ..., 1990}. A 31-element subset of S is called
good if the sum of its elements is divisible by 5. Find the
number of good subsets of S.
17. Find the number of permutations a1 , a2 , · · · an of 1, 2, · · · , n
satisfying: at least of of the number ai + 1 or ai − 1 lying in
the left of ai for every i = 2, 3, · · · , n.
18. A round table were prepared for a committee of 12 men with
the name in each place. Nicholas, who come first,
absentmindedly sit not on his own place, but on the next
clockwise position. Each person comes to the table then takes
his place, or if it was already taken, goes around the table
clockwise and sits down on the first free place. The sitting
location of the committee depends on the order in which they
come to the table. How many different ways can the
committee sit in the table?
19. An (n − 1) × (n − 1) square is divided into (n − 1)2 unit
squares in the usual manner. Each of the n2 vertices of these
squares is to be colored red or blue. Find the number of
different colorings such that each unit square has exactly two
red vertices. (Two coloring schemes are regarded as different
if at least one vertex is colored differently in the two schemes.)
20. 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?
21. A football team consists of n players wearing shirts numbered
from 1 to n. Suppose that they stand in a row in an increasing
order of numbers. If every 2 adjacent players exchange the
shirts exactly once in an arbitrary order, how many different
ways of numbering the players can they get?
21. A football team consists of n players wearing shirts numbered
from 1 to n. Suppose that they stand in a row in an increasing
order of numbers. If every 2 adjacent players exchange the
shirts exactly once in an arbitrary order, how many different
ways of numbering the players can they get?
22. Let an be the number of binary sequences of length n which
do not contain 3 consecutive terms 010 and bn the number of
binary sequences of length n which do not contain 4
consecutive terms 0011 or 1100. Prove that bn+1 = 2an .
23. A frog jumping on the tops of the hexagon ABCDEF, each
time moving to a neighboring vertex.
a) In how many ways she can get from A to C of n jumps?
b) The same question, but with the restriction that it is not
allowed to jump in D ?
23. A frog jumping on the tops of the hexagon ABCDEF, each
time moving to a neighboring vertex.
a) In how many ways she can get from A to C of n jumps?
b) The same question, but with the restriction that it is not
allowed to jump in D ?
24. How many strings of length 999 consist of 3 letters A, B, C
such that each letter appears an odd number of times.
25. Let n ≥ 2 be a positive integer. Find the number of functions
f : {1, 2, ..., n} → {1, 2, 3, 4, 5} which satisfy
|f (k + 1) − f (k)| ≥ 3 for k = 1, 2, · · · , n − 1.
25. Let n ≥ 2 be a positive integer. Find the number of functions
f : {1, 2, ..., n} → {1, 2, 3, 4, 5} which satisfy
|f (k + 1) − f (k)| ≥ 3 for k = 1, 2, · · · , n − 1.
26. How many words with n digits can be formed from the
alphabet {0, 1, 2, 3, 4}, if neighboring digits must differ by
exactly one?
25. Let n ≥ 2 be a positive integer. Find the number of functions
f : {1, 2, ..., n} → {1, 2, 3, 4, 5} which satisfy
|f (k + 1) − f (k)| ≥ 3 for k = 1, 2, · · · , n − 1.
26. How many words with n digits can be formed from the
alphabet {0, 1, 2, 3, 4}, if neighboring digits must differ by
exactly one?
27. Let p, n be positive integers. Show that there are
(p + 1)n+1 − p n+1 functions
f : {1, 2, · · · , n} → {−p, −p + 1, · · · , p} such that
|f (i) − f (j)| ≤ p for all 1 ≤ i, j ≤ n.
28. A binary string is called balance if in any consecutive block the
difference between the number of 0’s and 1’s does not excess
2. How many balance binary strings of length n are there?
29. Let p be a fixed prime number. How many ordered tuple
(a1 , . . . , ap ) which satisfies the all the following conditions:
i) 0 ≤ ai ≤ p − 1, ∀i;
ii) a1 + a2 + · · · ap is not divisible by p;
iii) a1 a2 + a2 a3 + · · · ap a1 is divisible by p.
30. Initially, an ant is at the origin of the coordinate plane. In
each step, the ant may go 1 unit upward, leftward or
rightward, but it cannot go to any point which it had reached
before. After 2015 steps, how many different possible
positions of the ant are there?
30. Initially, an ant is at the origin of the coordinate plane. In
each step, the ant may go 1 unit upward, leftward or
rightward, but it cannot go to any point which it had reached
before. After 2015 steps, how many different possible
positions of the ant are there?
31. How many ways to color the faces of a cube by 6 colors (not
require to use all of the colors) so that 2 adjacent faces have
different colors. (2 colored cubes are considered the same if
one can be obtained from the other by rigid motion in R3 )
30. Initially, an ant is at the origin of the coordinate plane. In
each step, the ant may go 1 unit upward, leftward or
rightward, but it cannot go to any point which it had reached
before. After 2015 steps, how many different possible
positions of the ant are there?
31. How many ways to color the faces of a cube by 6 colors (not
require to use all of the colors) so that 2 adjacent faces have
different colors. (2 colored cubes are considered the same if
one can be obtained from the other by rigid motion in R3 )
32. Find the number of coloring the vertices of a regular
dodecagon (12 sides) by 2 colors so that the it contains no
regular polygons whose vertices are of the same color.