Assignment I - B.E.

III rd Semester
CGT
last date for submission - will be announced in the class

Four students can submit one assignment

1. Eleven scientists are working on a secret project. They wish to lock up the documents
in a cabinet so that the cabinet can be opened if and only if six or more of the scientists
are present. What is the smallest number of locks needed? What is the smallest number
of keys to the locks each scientist must carry?

2. We need to choose a team of 11 from a pool of 15 players and also select a captain. Find
the number of different ways this can be done.

3. In how many ways can four numbers be selected from the numbers 1,2,3, ..., 1000 such
that their sum is divisible by 4.

4. Suppose warden wants to schedule special dinners (non distinct) three times each week.
How many ways he can make this.

5. Suppose warden wants to schedule north indian special dinners,south indian special din-
ners and western special dinners each week. How many ways he can make this.

6. In how many ways can three examinations be sheduled within five day period so that no
two examination are scheduled on the same day. Assume one day maximum one exam.

7. From n distict integers,two groups of integers are to be selected with k1 integers in the
first group and k2 integers in second group,where k1 and k2 are fixed and k1 + k2 n.
In how many ways can the selection be made such that the smallest integer in the first
group is larger than the larger integer in the second group.

8. prove that (2n)!/2n and (3n)!/(2n + 3n ) are integers.

9. Prove that when repetition in the selection of the objects are allowed, then the number
of ways of selecting r-objects from n-distinct objects is C(n+r-1,r).

10. In how many ways can we distribute 7 apples and 6 oranges among four children.

11. Five distinct letters are to be transmitted through a communication channel. A total of
15 blanks are to be inserted between the letters with at least three blanks between every
two letters. In how many ways can the letters and blanks be arranged.

12. Determine the number of ways to seat five boys in a row of 12 chairs.

13. When three dice (indistinguishable) are rolled. Find the number of possible outcome.
14. When three dice (distinguishable) are rolled. Find the number of possible outcome.

15. How many solutions are there to the equation

x1 + x2 + x3 + x4 + x5 = 21 where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that
(a) xi 0? for i = 1, 2, 3, 4, 5? (b) x1 1?
(c) 0 xi 2 for i = 1, 2, 3, 4, 5?
(c) 2 xi 10? for i = 1, 2, 3, 4, 5?

16. How many ways n-books be placed on k-distinguishable shelves (positions of the books
on the shelves matters).

17. Find the number of times x = x + 1 is executed by each loop: After this generalize this
formula for r loops.
for (i = 1 to n) do
for (j = 1 to i) do
for (k = 1 to j) do
x=x+1

18. In how many ways can 15 people be seated at a round table if B refuses to sit next to
A? What if B only refuses to sit on As right?

19. Find the number of paths in the xy plane between the origin (0, 0) and point (m, n),
where m and n are nonnegative integers, such that each path is made up of a series of
steps, where each step is a move one unit to the right or a move one unit upward. (No
moves to the left or downward are allowed.) Also find the number of paths which does
not rise above the line y = x.

20. Find the number of ways to parenthesize the n-matrices.

21. Find the number of paths in the xy plane from the point (2, 1) to the point (7, 6) which
does not rise above the line y = x 1 , such that each path is made up of a series of
steps, where each step is a move one unit to the right or a move one unit upward. (No
moves to the left or downward are allowed.)

22. Show that any integer composed of 3n identical digits is divisible by 3n .

23. How many integers between 1 and 1000 are not divisible by any of 2, 3, 11, 13?

24. Using inclusion and exclusion principles, find the number of primes less than 150.

25. Mr. Fastfood takes at least one pizza a day for 15 days. If he takes 25 pizzas altogether,
show that in some sequence of consecutive days he takes exactly 4 pizzas.

26. Assume that in a group of six people, each pair of individuals consists of two friends or
two enemies. Show that there are either three mutual friends or three mutual enemies
in the group.

27. During the year 2005, a book store, which was open 7 days a week, sold at least one book
each day, and a total of 600 books over the entire year. Show that there must have been
a period of consecutive days when exactly 129 books were sold.

2
28. A chess master who has 11 weeks to prepare for a tournament decides to play atleast
one game every day but in order not to tire himself he decides not to play more than 12
games during any one week.Show that there exists a succession of days during which he
would have played exactly 21 games.

29. Find the number of permutations of the letters a,b,c,d,e, and f in which neither the
pattern ace nor the pattern fd appears.

30. Find the number of permutations of the 26 letters A,B,...,X,Y,Z that do not contain the
patterns JOHN, PAUL and SMITH.

31. Let n books be distributed to n children. The books are returned and distributed to the
children again later on. In how many ways can the books be distributed so that no child
will get same book twice.

32. In how many ways can the letters a,a,a,a,b,b,b,c and c can be arranged so that all the
letters of the same kind are not in the same block?

33. In how many ways can the integers 1,2,3,4,5,6,7,8 and 9 be permuted such that no odd
integers will be in its natural position.