Select Page

Division and distribution of objects into groups is one of the most important and frequently tested topics under permutation and combination in quantitative aptitude. It is asked in almost every competitive exam including CAT, SSC CGL, SSC CHSL, Bank PO, Bank Clerk, Railway RRB and CSAT. A strong understanding of division and distribution concept, formulas and tricks is essential for scoring well in these exams. This post covers all four cases — distinct objects into distinct groups with fixed and non-fixed group sizes, identical objects into distinct groups, distinct objects into identical groups using Stirling numbers and identical objects into identical groups using partition functions — all explained with clear formulas and solved examples.

Division & Distribution of objects into Groupscase (1):Distinct objectDistinct Group(i). Group size Fixed(ii). Group size Not Fixed(A)(B)(C)Group sizes are distinctGroup sizes are equalGroup sizes are mix of distinct & equalcase (2):Identical objectDistinct Groupcase (3):Distinct objectIdentical GroupAnyway (i.e. No Restriction)Each Group must contain at least one object(1)case (4):Identical objectIdentical GroupAnyway (i.e. No Restriction)Each Group must contain at least one object(1)
case (1) → (i) → (A)Distinct objectDistinct Group(i) Group size fixed(A) Group sizes are distinct
1037Distinct objectsGroup sizes are fixedBut group sizes are distinct

∴ Total number of ways of division = ¹⁰C₃ × 1 = ¹⁰C₇ × 1
=  \(\frac{{10!}}{{3!7!}}\)

now if we are also to distribute these divided objects into two distinct groups then there are 2! ways to distribute two distinct object into two person
Hence number of ways of distribution  = \(\frac{{10!}}{{3!7!}}\) × 2!

1037Distinct objectsGroup sizes are fixedBut group sizes are distinctDivisionDistribution× 2!

Example (2).

10235DistinctDistinct

number of ways of Division = ¹⁰C₂ × ⁸C₃ × ⁵C₅
=  \(\frac{{10!}}{{2!8!}} \;\times\; \frac{{8!}}{{3!5!}}{\rm{ \;\times\; }}\frac{{5!}}{{5!0!}}\)
=  \(\frac{{10!}}{{2!3!5!}}\)

Now these divided packets can be arranged themselves into 3! ways.
Hence number of ways of Distribution = \(\frac{{10!}}{{2!3!5!}}\) × 3!

10235DistinctDistinctDivisionDistribution× 3!
case (1) → (i) → (B)Distinct object Distinct group(i) Group size fixed(B) Group sizes are equal
422DistinctGroup sizes are equalDistinct

number of ways of division =  \(\frac{{4!}}{{2!2!}}\) =  \(\frac{{4 \times 3}}{2}\) = 6

BUT WAIT Let do it manually

Let's objects are a, b, c, dDivide into two-two groupsab cdac bdad bcbc adbd accd abSo actual number of Division is 3i.e. = 3But when Group sizes are distinct431a, b, c, da bcdb cdac dabd abc4= = 4

Let’s take another example:-

a, b, c, d, e, fa, b, c, d, e, f624633 = 20ab cdefac bdefad bcefae bcdfaf bcdebc adefbd acefbe acdfbf acdecd abefce abdfcf abdede abcfdf abceef abcdTotal = 15abc defabd cefabe cdfabf cdeacd beface bdfacf bdeade bcfadf bceaef bcdGroups more than these are repeating groupsHence total number of ways of division = 10i.e. actual number of waysof division = × = 10
Example-1022222Objects are distinctGroups are distinct but group sizes are sameDivision × Distribution

Example:- Distribute 52 cards among 4 players equally.
Solution:-

5213131313Objects are DistinctDivisonDistributionDistinct players (Groups)but group sizes are same
case (1) → (i) → (C)Distinct object Distinct group(i) Group size fixed(C) Group sizes are mix of distinct & equal
Example÷102233distinct groupgroup size fixedgroups are mix of distinct and equaldistinct objectDivisionDistribution
Example÷20233444group are distinctgroup size fixedgroup sizes are mix ofdistinct & equaldistinct objectsDivisionDistribution

(Q). Distribute 8 distinct objects into 3 distinct groups such that each group has at least 2 objects.
Solution:-

OR+Answer88222433

(Q.) We have to distribute n distinct objects among n children such that exactly one child get no onject.
Solution:-

........02111(n-2) childrendistinctdistinct∴ number of ways of division = ×& number of waysof distribution = n

(Q). In how many ways 8 toys can be distributed among three brothers such that such that each one receive at least one toy & no two get same number of toys & the youngest one receives the maximum number of toys.
Solution:-

8111Distinct8 - 3 = 555 0 04 1 03 2 02 2 1OR88121435distinctdistinctYoungestYoungest+Answer

(Q). In how many ways 10 distinct toys can be distributed among three brothers such that each one receive at least one toy & no two get same number of toys & the youngest one receives the maximum number of toys.
Solution:-

10111Distinct10 - 3 = 777 0 06 1 05 2 05 1 1OR101012637distinctdistinctYoungestYoungest+Answer4 3 04 2 13 3 13 2 2OR101014535distinctdistinct12++ORYoungestYoungest

(Q). Distribute 5 different fruits among 3 bucket such that each bucket has at least one fruit.
Solution:-

OR+Answer55111322

(Q). A teacher has 31 students in his class. one day he decided to take all students for a picnic. So he called 3 cars & 4 auto rickshaws. He himself will go with his bike. In how many ways he can make them sit in vehicle, if seating capacity of car is 5 & that of auto rickshaw is 4. Internal arrangement within vehicle does not matter.
Solution:-

315554444CCCAAAADivisionDistributionBecause student of car (5) can not sit in auto rickshawas capacity of auto rickshaw is 4. So arrange studentof car in themselves & student of auto rickshaw in theselves

(Q). In the previous Example if 3 particular students insist on going by the same car then find the number of ways.
Solution:-

282554444CCCAAAA3+Total = 5∴ number of ways = Answer

(Q). Distribute 5 different books among 3 students such that each student gets at least one book, also order of the books matters which a student has.
Solution:-

55311221OR+= 360 + 360= 720 Answer

⇒ Actually in this question value of distinct object (5) & distinct groups (3) is less. So we can do it manually but if these values becomes more then it will become very difficult to do it manually. So in that case we will be required a formula to solve this type of problem quickly.
In Distribution of distinct object in distinct groups if arrangemet of objects within group is also important then:-
Number of ways to arrange n distinct object into r distinct group is:
                = n!.ⁿ ⁺ ʳ ⁻ ¹Cᵣ ₋ ₁    if blank group are allowed
                = n!ⁿ ⁻ ¹Cᵣ ₋ ₁         if blank group are not allowed i.e. each group must have at least one object

(Q). In the previous question:-
                  n = 5          r = 3

5DistinctDistinctDistribution when arrangement within group also matters

(i) when empty group not allowed
                = 5!.⁵⁻¹C₃₋₁ = 5!.⁴C₂ = 5!.6 = 720 Answer

(ii) when empty group alloweed
                = 5!.⁵⁺³⁻¹C₃₋₁ = 5!.⁷C₂ = 120×21 = 2520 Answer

(Q) In how many ways 10 different rings can be worn on 5 fingers if arrangement of rings in a finger matters.
(i) Any Finger has any number of rings.
(ii) Each Finger should have at least one ring.
Solution:-

n = 10
r = 5

10DistinctDistinctDistribution when arrangement within group also matters

(i) 10!.¹⁰⁺⁵⁻¹C₅₋₁ = 10!.¹⁴C₄ = \(10!.\frac{{14!}}{{10!4!}} = \frac{{14!}}{{4!}}\) Answer

(ii) 10!.¹⁰⁻¹C₅₋₁ = 10!.⁹CAnswer

 

(Q). In how many ways 5 distinct books can be distributed among 10 students such that each student gets at most 1 book.
Solution:-

11111SSSSSSSSSS5Hence ×5! = P = = AnswerORAnswerDivisionDistribution

(Q). In how many ways 5 distinct books can be distributed among 10 students such that each student gets at least 1 book.
Solution:- 

Since number of books (5) is less than number of students (10) & each student should get at least one book. So there is no such way.
Hence Answer

case (1) → (ii)Distinct objectDistinct group(ii) Group size NOT fixed

Example:- Distribute 10 distinct object among 3 person in anyway.
Solution:- 

Here 1ˢᵗ object can be distributed in 3 ways.
Similarly 2ⁿᵈj object can be distributed in 3 ways.
3ʳᵈ object can be distributed in 3 ways




10ᵗʰ object can be distributed in 3 ways

Hence total number of ways of distribution
                  = 3×3×3×…………..10 times
                  = 3¹⁰ Answer

(Q). Distribute 100 letters in 10 letter boxes anyway.
Solution:-

1ˢᵗ letter can be distributed in 10 ways.
Similarly 2ⁿᵈ letter can be distributed in 10 ways.
3ʳᵈ letter can be distributed in 10 ways




100ᵗʰ letter can be distributed in 10 ways.

Hence total number of ways = 10×10×10×…………100 times
=10¹⁰⁰ Answer

(Q). A person has 5 servant at his home. He has 4 friends. He has to invite his friends by giving one letter to each. He tells his servants to invite his friends. In how many ways he can invite his friends.
Solution:-

S₁            F₁
S₂            F₂
S₃            F₃
S₄            F₄
S₅

which servant gives letter to friend will be a way.

∴ F₁ can be invited in 5 ways.
similarly F₂ can be invited in 5 ways
F₃ can be invited in 5 ways
F₄ can be invited in 5 ways

Hence total number of ways = 5×5×5×5
                                                    = 5⁴ Answer

(Q). Distribute 10 distinct books among 5 students if one particular person gets exactly 3 books.
Solution:- 

10Distinct

& Remaining 7 books will be distributed among remaining 4 students in anyway  number of ways sof doing this = 4⁷

Hence total number of ways = ¹⁰C₃×4⁷ Answer

(Q). Distribute 10 distinct books among 5 students if each one is entitled to get at most 9 books.
Solution:-

Required Answer = Total number of ways to distribute in any way – number of ways to distribute in which all 10 books are given to any single student
                                 = 5¹⁰ – 5 Answer

case (2): Identical objectDistinct group

Example:- Distribute 10 identical chocolate among 3 students such that each student gets none or more chocolate.
Solution:-

SSSSSSSSSSSSSo clearly we have total 12 (10 + 2) objectsof which 10 are identical of one kind & other 2 are identicalof another kind & we are to arrange these among themselveschocolateLines

This type of problem we have studied earlier in word formation when we were to find total number of words from the letters of the word
MISSISSIPPI
n = 11 (total number of letters)
p = 4 (S)
q = 4 (I)
r = 2 (P)

∴ total number of words =  \(\frac{{11!}}{{4!4!2!}}\)

Here also the same condition, where

102ChocolateLines

∴ total ways = \(\frac{{12!}}{{10!2!}}\) Answer
This can be co-related with number of integral solution of equation.
In above question Let students be x, y & z
then

x + y + z = 10identical& the condition is÷x⩾0y⩾0z⩾0

Here in place of ‘Lines(┃)’ we have used just ‘+’ symbol
To divide between 3 students we will be requiring 2 lines & in place of lines we have used ‘+’ sign.
∴ number of ways = number of solutions of above equation
                                  = ¹²C₂
                                  =  \(\frac{{12!}}{{2!10!}}\) Answer

 

(Q). In how many ways 5 identical chocolates can be distributed among 10 students if there is no restriction.
Solution:-

S₁ + S₂ + S₃ + S₄ + S₅ + S₆ + S₇ + S₈ + S9 + S₁₀ = 5
                                          S₁, S₂, S₃, ……. S₁₀ ≥ 0
total ‘+’ sign = 9
Hence number of ways = ¹⁴C₉ = \(\frac{{14!}}{{5!9!}}\) Answer

(Q). In how many ways 10 identical books can be distributed among 3 students if each student gets at least 1 book.
Solution:-

 

x + y + z = 10identical& the condition is÷x⩾1y⩾1z⩾1x + y + z = 71 1 1= C Answer

(Q). In how many ways 10 identical chocolates can be distributed among 4 children if a child has at most 1 chocolate.
Solution:-
                                
0 Answer

(Q). In how many ways 4 identical chocolate can be distributed among 10 children such that a child gets at most 1 chocolate.
Solution:-

 

SSSSSSSSSS1111

Simply we have to find number of ways of selecting 4 children out of 10 children.
¹⁰C₄ Answer

If chocolates are also 10 then number of ways = ¹⁰C₁₀ = 1 Answer

(Q). we have 30 identical pens. These are to be distributed among 4 students A, B, C, D such that student A gets at least 4 pens, student B gets none or more pens(Any nubmer of pen), student C gets at least 5 pens & student D gets at least 1 pen. Then in how many ways pen can be distributed.
Solution:-

A + B + C + D = 30identical& the condition is÷A⩾4B⩾0C⩾5D⩾1A + B + C + D = 204 5 1

now distribute 20 pens among A, B, C, D in anyway = ²³C₃ Answer

(Q). Find the number of terms in the expansion of (x + y + z)¹⁰⁰.
Solution:-

(x + y)² = x² + 2x¹y¹ + y²
               = x²y⁰ + 2x¹y¹ +x⁰ y²
i.e. sum of powers of variable x, y in every term = 2
Here total number of terms = number of ways to distribute power 2 i.e. 2 identical objects between 2 person x, y in anyway.

⇒(x + y)³ = x³ +3x²y¹ +3x¹y² + y³ 

Sum of power of variable x, y in every term = 3
∴ Number of terms = number of ways to distribute power 3 i.e. 3 identical object between 2 person x, y in any way.
∴ (x + y + z)¹⁰⁰ ⇒ Total numbers of terms
x + y + z = 100
                 & condition is x≥0
                                            y≥0
                                            z≥0
¹⁰²C₂ Answer

case (3):Distinct objectIdentical groupAny way (No Restriction)Each group must containatleast one object (⩾1)

In this type of question wee will be required to find the value of Stirling Number of Second Kind.
Stirling Number of Second Kind:
Formula for Stirling number of second kind is :-

S(n,r) = S(n-1, r-1) +r.S(n-1, r)Recursive formulaSpecial cases: - S(0, 0) = 1S(n, n) = 1S(n, 1) = 1S(n, 2) = 2 - 1S(n, n-1) = S(n, k) = 0 if k>nDirect formula: -S(n, r) = - C (r-1) + C (r-2) - ......... + (-1) C1]Let us calculate the value of S(9, 4) using Recursive method: - S(9, 4) = S(8, 3) + 4.S(8, 4) = S(7, 2) + 3.S(7, 3) + 4[S(7, 3) + 4.S(7, 4)] = (2 - 1) + 3[S(6, 2) + 3.S(6,3)] + 4S(7, 3) + 16S(7, 4)

= 63 + 3S(6, 2) + 9S(6, 3) + 4S(7, 3) + 16S(7, 4)
= 63 + 3(2⁶⁻¹ – 1) +9S(6, 3) + 4S(7, 3) + 16S(7, 4)
= 63 + 3×31 + 9[S(5, 2) + 3S(5, 3)] + 4[S(6, 2) + 3S(6, 3)] + 16[S(6, 3) + 4S(6, 4)]
= 156 + 9(2⁵⁻¹ – 1) +27S(5, 3) +4(2⁶⁻¹ – 1) + 12S(6, 3) + 16S(6, 3) + 64S(6, 4)
= 156 + 9×15 + 27S(5, 3) + 4×31 + 28S(6, 3) + 64S(6, 4)
= 415 + 27[S(4, 2) + 3S(4, 3)] + 28[S(5, 2) + 3S(5, 3)] + 64[S(5, 3) + 4S(5, 4)]
= 415 + 27[(2⁴⁻¹ – 1) + 3×⁴C₂] + 28[(2⁵⁻¹ – 1) + 3S(5, 3)] + 64[S(5, 3) + 4×⁵C₂]
= 415 + 27×7 + 81×6 + 28×15 + 84S(5, 3) + 64S(5, 3) + 64×4×10
= 4070 + 148S(5, 3)
= 4070 + 148[S(4, 2) + 3S(4, 3)]
= 4070 + 148[(2⁴⁻¹ – 1) + 3×⁴C₂]
 4070 + 148[7 + 3×6]
 = 4070 + 148×25
7770 Answer

Let us calculate the value of S(9, 4) using direct formula:-

S(9, 4) = = - 4×1] = ×186480 = 7770 Answern r

Now come to question:-
(Q). In how many ways 7 people can be divided into 3 identical groups.
Solution:-

Since Groups are identical i.e. indistinguishable. So a particular object is in which group it does not matter. The only thing which matters is which objects are selected together.

7Identicalcase (1): 7 0 0case(2): 6 1 0case(3): 5 2 0case(4): 5 1 1case(5): 4 3 0case(6): 4 2 1case(7): 3 3 1case(8): 3 2 2

∴ Total number of ways = 1 + 7 + 21 + 21 + 35 + 105 + 70 + 105
                                           =  365 ways Answer

(Q). In the previous question if the condition is that no group should be empty i.e. all groups should have at least one object.
Solution:-

So we need to consider only 4ᵗʰ, 6ᵗʰ, 7ᵗʰ & 8ᵗʰ cases.
which gives  21 + 105 + 70 + 105 = 301 ways Answer

⦿ These were the manual way to do these type of questions. Now we will use Stirling number to solve these type of problems:-

case (3):Distinct objectIdentical groupAny way (No Restriction)Each group must containatleast one object (⩾1)(n)(r)rS(n, i)S(n, r)

(Q). (previous question); In how many ways 7 people can be distributed into 3 identical groups anyway.
Solution:-

\(\sum\limits_{i = 1}^3 {S(7,i)} \) = S(7, 1) + S(7, 2) + S(7, 3)
= 1 + (2⁷⁻¹ – 1) + S(7, 3)
= 64 + S(7, 3)
= 64 + \(\frac{1}{{3!}}\)[³C₀ 3⁷ – ³C₁ 2⁷ + ³C₂ 1⁷ ]
= 64 + \(\frac{1}{6}\)[ 1×2187 – 3×128 + 3×1 ]
= 64 +  \(\frac{1}{6}\)×1806
= 64 + 301
365 Answer

(Q). In how many ways 7 people can be distributed into 3 identical groups if each group gets at least 1 people(i.e. no group is empty).
Solution:-

S(7, 3) = 301 Answer

(Q). In how many ways 5 distinct balls can be distributed to 10 identical bags:-
(i) without any restriction
(ii) each bag gets atleast 1 ball
(iii) each bag gets at most 1 ball.
Solution:-

(i)= S(5, 1) + S(5, 2) + S(5, 3) + S(5, 4) + S(5, 5) + S(5, 6) + S(5, 7) + S(5, 8) + S(5, 9) + S(5, 10)= 1 + (2 - 1) C + 1 + 0 + 0 + 0 + 0 + 0S(5, 3) = [ C 3 -C 2 + C 1 ] = = = 25Hence Answer = 1 + 15 + 25 + 10 + 1 = 52 Answer

(ii) 0 Answer

(iii) 1 Answer

case (4):Identical objectIdentical groupsAny way (No Restriction)Each group must containatleast one object (⩾1)

To solve these type of problems knowledge of generating functions will be required.

P(n, r) = P(n-r, r) + P(n-1, r-1)Recursive formoulaSpecial cases: -P(0, 0) = 1P(n, n) = 1P(n, 1) = 1P(n, 2) = if n is even = if n is oddP(n, n-1) = 1P(n, r) = 0 if r>n
case (4):Identical objectIdentical groupsAny way (No Restriction)Each group must containatleast one object (⩾1)(n)(r)P(n, r)

(Q). In how many ways 5 identical balls can be distributed to 10 identical bags if:
(i) There is no restriction
(ii) Each bag must contain atleast 1 ball
(iii) Each bag must contain at most 1 ball
(iv) Each bag must contain exactly 1 ball
Solution:-

Let first do it manually:-

5IdenticalIdentical1234567BBBBBBBBBB5433221111122111111100000000000000000000000000000000000000000000000000

Let’s take 3rd case:-
3 2 0 0 0 0 0 0 0 0
Here it does not matter that these 3 & 2 balls packet are given to which bag because bags are identical i.e. indistinguishable.
Also since balls are also identical so there is always 1 way to select any these 3 & 2 balls out of 5 balls.
So there is only 1 way to distribute this division.

Similar situation applies for all other cases.
Hence total number of ways to distribute = Answer

(ii) 0 (see diagram) Answer

(iii) 1 (7ᵗʰ case) Answer

(iv) 0 (see diagram) Answer

n = 5
r = 10

(i)= P(5, 1) + P(5, 2) + P(5, 3) + P(5, 4) + P(5, 5) + P(5, 6) + P(5, 7) + P(5, 8) + P(5, 9) + P(5, 10) 0 0 0 0 0 Since P(n, r) = 0 if r>n= P(5, 1) + P(5, 2) + P(5, 3) + P(5, 4) + P(5, 5) = 1 + + + 1 12now P(5, 3) = P(2, 3) + P(4, 2)0 = 2= 0 + 2 = 2Hence value of equation (i) will be = 1 + 2 + 2 + 1 + 1 = 7 Answer (ii) P(5, 10) = 0 Answerequation (i)

⦿ Now Let us take another example.
(Q). In how many ways 12 identical chocolates can be distributed to 5 identical bags:-
(i) Any way
(ii) Each bag contains atleast 1 chocolate
(iii) Each bag contains at most 1 chocolate
(iv) Each bag contains exactly 1 chocolate
Solution:-

 

(i) = P(12, 1) + P(12, 2) + P(12, 3) + P(12, 4) + P(12, 5) 1 6equation (i)⦿ now P(12, 3) = P(9, 3) + P(11, 2)= = 5= P(9, 3) + 5= P(6, 3) + P(8, 2) + 5 4= P(6, 3) + 9= P(3, 3) + P(5, 2) + 9= 1 + 2 + 9= 12⦿ now P(12, 4) = P(8, 4) + P(11, 3) = P(4, 4) + P(7, 3) + P(8, 3) + P(10, 2) = 1 + P(7, 3) + P(8, 3) + 5 = 6 + P(4, 3) + P(6, 2) + P(5, 3) + P(7, 2)1 3 3= 6 + 1 + 3 + P(5, 3) + 3= 13 + P(5, 3)= 13 + P(2, 3) + P(4, 2) = 13 + 0 + 2= 15⦿ now P(12, 5) = P(7, 5) + P(11, 4) = P(2, 5) + P(6, 4) + P(7, 4) + P(10, 3)0= P(2, 4) + P(5, 3) + P(3, 4) + P(6, 3) + P(7, 3) + P(9, 2)= 0 + P(5, 3) + 0 + P(6, 3) + P(7, 3) + 4= 4 + P(5, 3) + P(6, 3) + P(7, 3)= 4 + P(2, 3) + P(4, 2) + P(3, 3) + P(5, 2) + P(4, 3) + P(6, 2)= 4 + 0 + 2 + 1 + 2 + 1 + 3= 13 Hence value of equation (i) will be = 1 + 6 + 12 + 15 + 13 = 47 Answer

(ii) P(12, 5) = 13 Answer

(iii) 0 Answer

(iv) 0  Answer

❓ Frequently Asked Questions on Division and Distribution of Objects into Groups

Q1. What are the four cases of division and distribution of objects into groups?

Division and distribution of objects into groups has four cases based on whether objects and groups are distinct or identical. Case 1 is distinct objects into distinct groups with fixed or non-fixed group sizes. Case 2 is identical objects into distinct groups. Case 3 is distinct objects into identical groups solved using Stirling numbers of second kind. Case 4 is identical objects into identical groups solved using partition functions. This is a core topic in combinatorics and is frequently tested in CAT, SSC CGL and Bank PO exams.

Q2. How to distribute distinct objects into distinct groups when group size is fixed?

When group sizes are distinct the number of ways of division is found using combinations and for distribution we multiply by the factorial of number of groups. For example dividing 10 distinct objects into groups of 3 and 7 gives 10C3 ways of division and 10C3 × 2! ways of distribution. When group sizes are equal we divide by the factorial of number of equal groups to avoid repetition. For example dividing 4 objects into two equal groups of 2 gives 4!/(2!×2!×2!) = 3 ways of division.

Q3. How to distribute distinct objects into distinct groups when group size is not fixed?

When group size is not fixed each object can go to any group independently. So if there are n distinct objects and r distinct groups then total number of ways = rⁿ. For example distributing 10 distinct objects among 3 persons = 3¹⁰ ways. Distributing 100 letters into 10 letter boxes = 10¹⁰⁰ ways. This is one of the most straightforward cases in distribution problems and is frequently asked in CAT and SSC CGL exams.

Q4. How to distribute identical objects into distinct groups?

Distributing n identical objects among r distinct groups is equivalent to finding the number of non-negative integral solutions of x₁ + x₂ + … + xᵣ = n. The formula is (n+r-1)Cᵣ₋₁. For example distributing 10 identical chocolates among 3 students = 12C2 ways. If each student must get at least 1 then we first give 1 to each and distribute the remaining giving (n-1)Cᵣ₋₁ ways. This concept also applies to finding number of terms in expansion of (x+y+z)¹⁰⁰ = 102C2.

Q5. What is Stirling number of second kind and how is it used?

Stirling number of second kind S(n,r) gives the number of ways to distribute n distinct objects into r identical non-empty groups. The recursive formula is S(n,r) = S(n-1,r-1) + r×S(n-1,r). Special cases include S(n,1) = 1, S(n,n) = 1 and S(n,2) = 2ⁿ⁻¹ – 1. For distributing n distinct objects into r identical groups with no restriction the answer is S(n,1) + S(n,2) + … + S(n,r). For example distributing 7 people into 3 identical groups with no restriction = S(7,1) + S(7,2) + S(7,3) = 365 and with each group non-empty = S(7,3) = 301.

Q6. What is partition function and how is it used in distribution problems?

Partition function P(n,r) gives the number of ways to distribute n identical objects into r identical groups with each group having at least 1 object. The recursive formula is P(n,r) = P(n-r,r) + P(n-1,r-1). Special cases include P(n,1) = 1, P(n,n) = 1 and P(n,r) = 0 if r > n. For distributing n identical objects into r identical groups with no restriction the answer is P(n,1) + P(n,2) + … + P(n,r). For example distributing 5 identical balls into 10 identical bags with no restriction = P(5,1) + P(5,2) + P(5,3) + P(5,4) + P(5,5) = 7.

Q7. How to find number of integral solutions of an equation using distribution concept?

The number of non-negative integral solutions of x₁ + x₂ + … + xᵣ = n is (n+r-1)Cᵣ₋₁. This directly corresponds to distributing n identical objects among r distinct groups. For positive integral solutions where each variable is at least 1 the formula becomes (n-1)Cᵣ₋₁. For example the number of terms in expansion of (x+y+z)¹⁰⁰ = number of non-negative integral solutions of x+y+z = 100 = 102C2. This concept is frequently asked in CAT and SSC CGL exams.

Q8. Where can I practice division and distribution questions?

After understanding the concept you can practice on our Division and Distribution Exercise page which contains a large number of solved practice questions covering all four cases. You can also check our Selection and Combination Concept and Permutation and Combination Concept pages for related topics.