0% found this document useful (0 votes)
157 views4 pages

A) Division of Identical Items Into Distinct Groups: QA - Distribution

This document discusses distribution and division problems involving identical and distinct items divided into groups. It provides formulas to calculate the number of ways to divide items among groups in different scenarios: 1) Dividing identical items among groups using (n + r - 1Cr - 1) or (n - 1Cr - 1) formulas depending on minimum requirements. 2) Dividing distinct items among distinct groups is r^n ways. 3) Dividing distinct items into unequal groups is (m + nCm) * nCn ways or (m + n + pC m) * (n + pCn) * pCp ways for three groups. 4) Dividing distinct items equally into groups

Uploaded by

chaostheorist
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
0% found this document useful (0 votes)
157 views4 pages

A) Division of Identical Items Into Distinct Groups: QA - Distribution

This document discusses distribution and division problems involving identical and distinct items divided into groups. It provides formulas to calculate the number of ways to divide items among groups in different scenarios: 1) Dividing identical items among groups using (n + r - 1Cr - 1) or (n - 1Cr - 1) formulas depending on minimum requirements. 2) Dividing distinct items among distinct groups is r^n ways. 3) Dividing distinct items into unequal groups is (m + nCm) * nCn ways or (m + n + pC m) * (n + pCn) * pCp ways for three groups. 4) Dividing distinct items equally into groups

Uploaded by

chaostheorist
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/ 4

QA – Distribution

A) DIVISION OF IDENTICAL ITEMS INTO DISTINCT GROUPS

Say you go to party and there is a plate with 6 sweets on it. Its decision making time. What do
you do now?
You may pick none, or 1 or 2 or 3 or 4 or 5 or 6 ( if no one’s looking)
So you have 7 choices
Now the number of sweets you pick and the number of sweets left on the tray will always equal
6 as there were 6.
So if A represents the number of sweets left on the tray and B represents the number of sweets
you picked, then we can construct and equation:
A+B=6
And we know that this equation will have 7 solutions
So if m identical items are to be divided in 2 distinct groups it can be done in m+1 ways

Now if extend this problem to 3 groups. Say a friend comes along and let the number of sweets
picked by him be C
So now equation will be
A+B+C=6
So possible solutions can be
A= 0, B= 1, C=5
A=1, B=2, C=3
And there will many more solutions which makes the task of enumeration very difficult
In such cases we can use the following formulae

1. The number of ways of dividing n identical things among r persons (or groups), each of
whom, can receive zero or more things is n + r – 1Cr – 1 where 0 ≤ r ≤ n.
2. The number of ways of dividing n identical things among r persons, each one of whom
receives at least one item is n – 1Cr – 1 where 1 ≤ r ≤ n.

So using the first formulae


A+ B+C=6
So the n=6 and r=3, so 6+ 3 – 1C3 – 1 = 8C2 = 28

Say the person carrying the tray insist that both of you pick at least 1 sweet and both of you are
also mindful of the fact that you should leave at least 1 sweet on the tray, then in the equation
A+B+C=6, each of A, B and C will have minimum value of 1
So we can use the 2nd formulae: n – 1Cr – 1 = 6 – 1C3 – 1 = 5C2 = 10

The 2nd formulae is derived from the 1st formulae. For example in the 2nd case, what is each of
you pick at least 1 sweet, and also leave one on the tray, then there are 3 sweets to be
distributed amongst you, your friend and the tray.
So the equation will be A+ B+ C = 3

Proprietary and Confidential ABS Classes 1


QA – Distribution

We can use the first formulae here as each of the groups have the minimum requirement of 1
sweet and therefore can afford to have no more
So the answer will be 3+ 3 – 1C3 – 1 = 5C2 = 10

The number of ways of dividing n identical things among r persons, with each having different
minimum requirement of (p, q, r…) items is n –(p+q+r..) + r - 1Cr – 1 where 1 ≤ r ≤ n.

For example, on Valentine’s Day, Raj has 12 roses to be distributed amongst Simran, Neha and
Puja. He must give at least 1 to Pooja, at least 2 to Neha and at least 3 to Simran.
So out of 12 roses if he gives away the minimum required he is left with 6 roses and now he is
in a position where he may not give any more rose to some girl.
So equation will be
Simran + Pooja + Neha = 6
Answer will be : 6+ 3 – 1C3 – 1 = 8C2 = 28

A teacher wants to distribute 25 identical pens among 4 children. In how many ways can he do
them if the first child should get atleast 4, the second should get atleast 3, the third atleast 2 &
last 1
After distribution the minimum required of each student i.e. 1+2+3+4 (=10), he is left with 25-
10= 15 pens
And he may not give a pen to a student; so the minimum of each group is now 0, so we can use
the first formulae
A  B  C  D  15
So, 18!
3!15!

B) DIVISION OF DISTINCT ITEMS INTO DISTINCT GROUPS

The number of ways in which ‘n’ distinct things can be distributed to r different groups = rn.

1) 10 different balls have to be distributed in 5 different boxes. In how many ways can this
be done.

Here the balls are the objects being distributed and boxes are the groups
 5 & NOT 10  common mistake
10 5

2) 5 letters are to be posted in 3 post boxes.

Since we are taking letters and post boxes we presume they are distinct. Either the letters are
addressed to different people or will have different content and the post boxes will be different
bu virtue of their location. SO this is a case of distinct items in distinct groups. Items are letters

Proprietary and Confidential ABS Classes 2


QA – Distribution

and groups are post boxes. Choice is with the letters. Any letter can selct any of the 3 post
boxes.
So number of ways = 3 x 3 x3 x 3 x 3 = 35

C) DIVISION INTO GROUPS


1) Division of Distinct Items into Distinct Groups of Unequal Size
The number of ways in which (m + n) different things can be divided into two groups
( )
containing m and n things respectively is
Since m things can be selected out of (m + n) things in m + nCm ways and each time when
m things are taken, n things left out to form the other group of n things in nCn ways i.e.,
in 1 way only.
( )
Hence the required number of ways = m + nCm =

The number of ways in which (m + n + p) different things can be divided into three
( )
groups containing m, n and p things respectively is

2) Division of Distinct Items into Distinct Groups of Equal Size


The number of ways in which mn different things can be divided equally into m identical
( )
groups, each group containing n things =( )
( )

3) Division of Distinct Items into Identical Groups of Equal Size


The number of ways in which mn different things can be distributed equally into m
( )
distinct groups, each group containing n things = ( )

Examples:
1) 15 books, each from a different author can be arranged in 3 bundles equally in how
many ways?

Say we select the first 5 books in 15C5 ways, then there are 10 books left so we select the next 5
in 10C5 ways and finally only 5 books are left so we can select the next 5 in 5C5 ways
So total ways = 15C5 x 10C5 x 5C5 ways =
However this method implies that groups have distinct identity since we are selecting the books
in a certain order, so some cases will be repeated. However the question implies that the
bundles are identical
So we take out the arrangement of the bundles.
There are 3 bundles, so there can be 3! = 6 arrangements

Proprietary and Confidential ABS Classes 3


QA – Distribution

So answer is ( )/6

2) 15 books, each from a different author can be arranged in 3 distinct bundles equally in
how many ways?

Number of ways =

3) 15 books, each from a different author are to be arranged in 3 identical bundles with 6,
5 and 4 books in the 3 bundles. This can be done in how many ways?

Though the bundles are identical, the fact that each will have different number of books make
them distinct.
So number of ways: 15C6 x 9C5 x 4C4 ways =

4) There are 6 plays to be staged on 2 days, so that 2 are on the first day & 4 on the second
day. (CAT question)

Here not only we need to distribute the 6 plays over 2 days, the order of screening on each day
is also important. So arrangement of the plays is also to be taken into account.
Number of ways: 6P x 4P =
2 4

Proprietary and Confidential ABS Classes 4

You might also like