Scribd
Upload
145 views2 pages

Combinatorics Subjective Class 11 & 12

The document contains 14 combinatorics problems involving determining the number of arrangements, permutations, partitions, and other counting problems with sets and functions. The problems cover topics such as counting the number of onto functions between sets, ways of distributing identical symbols into boxes, counting partitions of a set into classes, and determining the number of equivalence classes that can be formed from a set of integers.

Uploaded by

Shaswata Mondal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
145 views2 pages

Combinatorics Subjective Class 11 & 12

The document contains 14 combinatorics problems involving determining the number of arrangements, permutations, partitions, and other counting problems with sets and functions. The problems cover topics such as counting the number of onto functions between sets, ways of distributing identical symbols into boxes, counting partitions of a set into classes, and determining the number of equivalence classes that can be formed from a set of integers.

Uploaded by

Shaswata Mondal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Combinatorics Problem Sheet

www.fractionshub.com
Contact: +91-8247590347

Notation. Instructions: Please show complete work. Due Date: 10.06.2022 R denotes the set of
all real numbers. R denotes the set of all real numbers.
C denotes the set of all complex numbers.

1. In a club of 80 members, 10 members play none of the games Tennis, Badminton and Cricket.
30 members play exactly one of these three games and 30 members play exactly two of these
games. 45 members play at least one of the games among Tennis and Badminton, whereas 18
members play both Tennis and Badminton. Determine the number of cricket playing members.

2. A function f from a set A into a set B is a rule which assigns to each element x in A, a unique
(one and only one) element (denoted by f (x)) in B. A function f from A into B is called an
onto function, if for each element y in B there is some element x in A, such that f (x) = y.
Now suppose that A = {1, 2, . . . , n} and B = {1, 2, 3}. Determine the total number of onto
function from A into B.

3. Find the number of ways in which 5 different gifts can be presented to 3 children so that each
child receives at least one gift.

4. x red balls, y black balls and z white balls are to be arranged in a row. Suppose that any
two balls of the same colour are indistinguishable. Given that x + y + z = 30, Show that the
number of possible arrangements is the largest for x = y = z = 10.

5. All the permutation of the letters a, b, c, d, e are written down and arranged in alphabetical
order as in a dictionary. Thus the arrangement abcde is in the first position and abced is in the
second position. What is the position of the arrangement debac?

6. (a) Given m identical symbols, say H 0 s, show that the number of ways in which you can
distribute them in k boxes marked 1, 2, . . . . . . , k, so that no box goes empty is m−1
k−1
(b) In an arrangement of m H 0 s and n T 0 s an uninterrupted sequence of one kind of symbol is
called a run. (For example, the arrangement HHHT HHT T T H of 6 h0 s and 4 T 0 s opens
with an H− run of length 3, followed successively by a T − run of lenght 1, an H-run
of length 2, a T -run of length 3 and, finally, an H-run of length 1.) Find the number of
arrangement of m H 0 s and n T 0 s is which there are exactly k H-runs. [You may use (a)
above]

7. Show that the number of ways one can choose a set of distinct positive integers, each smaller
that or equal to 50, such that their sum is odd, is 249 .
8. Let S = {1, 2, . . . , n}. Find the number of unordered pairs {A, B} of subsets of S such that A
and B are disjoint, where A or B or both may be empty.

9. A partition of a set S is formed by disjoint, nonempty subsets of S whose union is S. For


example {{1, 3, 5}, {2}, {4, 6}} is a partition of the set T = {1, 2, 3, 4, 5, 6} consisting of subsets
{1, 3, 5}, {2} and {4, 6}. However, {{1, 2, 3, 5}, {3, 4, 6}} is not partition of T . If there are k
nonempty subsets in a partition, then it is called a partition into k classes. Let Skn stand for
the number of different partition of a set with n elements into k classes.

(a) Find S2n .


(b) Show that Skn+1 = Sk−1
n
+ kSkn .

10. Show that the number of ways in which four distinctinteger can be chosen from 1, 2, . . . , n(n ≥
7) such that no two are consecutive is equal to n−3
4
.

11. How many 6-letter words can be formed using the letter A, B and C so that each letter appears
at least once in the word ?

12. In a certain game, 30 balls of k different colours are kept inside a sealed box. You are told only
the value of k, but not the number of balls of each colour. Based on this, you have to guess
whether it is possible to split the ball into 10 groups of 3 each, such that in each group the
three balls are of different colours. Your answer is to be a simple Y ES or N O. You win or lose
a point according as your guess is correct or not. For what values of k, you say N O and b4
sure of winning ? For what values of k, you can say yes and be sure of winning ? Justify your
solution.

13. Consider the set of points

S = {(x, y) : x, y are non-negative integers ≤ n}.

Find the number of squares that can be formed with vertices belonging to S and sides parallel
to the axes.

14. Consider the set S of all integers between and including 1000 and 99999. Call two integers x
and y in S to be in the same equivalence class if the digits appearing in x and y are the same
equivalence classes that can be formed out of S.

You might also like