#PnC_basics

1) Number of ways of selecting r things out of n distinct things is nCr.

2) Number of ways of selecting r things out of n identical things is always 1.

Q1) Number of ways of choosing 5 things out of 10 distinct things is ?

Q2) Number of ways of choosing 5 things out of 10 identical things is ?

OA:
1.10c5 , 2. 1

3) Number of ways of choosing any number of things out of n distinct things is 2^n

4) Number of ways of choosing atleast one thing out of n distinct things is 2^n -1

Reasoning in comment

3) Number of ways of choosing any number of things out of n distinct things means you can
either select 0 nunber of things in nC0 ways
or you can choose 1 number of thing out of n in Nc1 ways
or you can choose 2 things in nC2 ways.

upto you can choose upto n thing in s nCn ways

total nC0+nc1+nc2+...ncn = 2^n

4) when it says atleast 1 means we have to eleminate the case when 0 number of things are
chosen in Nc0 = 1 way

so total 2^n - 1

Q3) Number of ways of choosing atleast 2 things out of 10 distinct things is ?

oa: 2^10 -11

soln: total ways - number of ways of selecting 0 - number of ways of selecting 1 thing

= 2^10 -10c0 - 10c1 = 2^10-1-10 = 2^10 - 11

Q4) Number of ways of selecting atleast 4 things out of 10 identical things is ?

Oa: 7

Atleast 4
So 4,5,6,7,8,9,10 can be chosen

Each in 1 way only

So 1+1+1+1+1+1+1=7 .

#PnC_basics

5) Number of ways of selecting any number things from n identical things is n+1

6) Number of ways of selecting atleast 1 number of things from n identical things is n.

5) In here number of ways of selecting everythign is 1 as point 3)

so number of ways of selecting 0 things is 1,

selecting 1 thing is 1
selecting 2 thing is 1

upto selecting n thing is 1

so total 1+1+...n+1 time s= n+1

2) Number of ways of selecting 3 things out of 5 things is 1

5) Number of ways of selecting any number of things out of 5 identical thigns means number of
ways of selecting 0 thing, or 1 thing or 2 thign or 3 or 4 or 5 things

and for each there is 1 way of chosing so 1+1+1+1+1+1 = 6

#PnC_basics

7) Number of ways of distributing n identical things among r people/groups such that any person
may get any number of things is (n+r-1)C(r-1)

8) Number of ways of distributing n identical things among r people/groups such that all get
atleast 1 is (n-1)C(r-1)

Lets assume there are 5 identical balls to be distributed among 3 distinct boxes.

5 cases =>
5,0,0 : 3!/2= 3 ways
4,1,0 : 3!=6
3,2,0, : 3!=6
3,1,1 : 3!/2 = 3
2,2,1 : 3!/2=3

Total : 21 ways

Which can also be solved using partition method. Where we assum the two partitions as balls
and select them in 7c2=21 ways

7 aa gya then usi se derrive karlo 8.

Take example of a + b + c = 5

If there was no restriction then it would have been (5+3-1)C(3-1) = 7C2

Now as each should have atleast 1

So add +1 to each variable

(a+1)+(b+1)+(c+1)= 5

a+b+c = 2

And now take its soln (2+3-1)C(3-1)= 4C2

Which is same as (n-1)C(r-1) for a+b+c=5 .

Q. How many ways can you distribute 4 identical balls into 5 distinct boxes

Q. How many ways can you distribute 4 distinct balls into 5 distinct boxes

1) (4+5-1)C(5-1) = 8C4

2) where^what => 5^4

Q) How many 3 digit numbers can be made if first digit can take numbers from 1 to 5 , second
digit can take 3 to 6 and last can take all digits ?
OA: 200=5*4*10

#PnC_basics last question application of this.

MNP rule : For counting number of ways of doing 3 things and each of them has to be done
and there are m ways of doing first ghing, n ways of doing second and p ways of doing third
thing then total number of ways of doing all the things is m*n*p

Q) How many ways we can choose a vowel and a consonant from PERMIT ?

Q) How many ways can we choose 2 vowels or 1 consonant from PERMIT ?

Oa : 1. 2C1*4C1 = 8

2. 2C2+4C1 = 5
Its just selection.

Note:

AND / OR rule :

Whenever you see there is AND used, replace that word with multiplication sign

Whenever you see OR being used, replace it with addition sign.

#Circular_Permutation

The number of ways in which n distinct things can be placed around a circle is (n-1)!. The need
to reduce 1 is due to the fact that there is no defined starting point.

So to remove symmetry we just put one of them in 1 way, and as now the symmetry is removed
hence remaining is arranged in the normal way in (n-1)!.

#PnC_basics

When there is no distinction between clockwise and anticlockwise in a circular permutations

then (n-1)!/2, As in the case of beads , as half of the cases looks same from two sides.

Q. How many ways to arrange 7 distinct balls around a circle ?

Q. How many ways a necklace can.be made from 6 different flowers ?

Oa :

6!=720

5!/2=60

PNC -2
#Veryimportant

1) Number of non negative integer solutions of x+y+z+...(r terms) = n is => (n+r-1)C(r-1)

2) Number of positive integer solutions of x+y+z+...(r terms) = n is => (n-1)C(r-1)

3) Number of integral solutions of x+y+z+....(r terms) = n is => infinite

4) Number of real or real positive or real non negative solutions for x+y+z....(r terms) = n is
infinite in any of the case.

● Positive Integers = Natural numbers

● Non negative = Whole Numbers

2) Number of non negative integral solutions of a+b+c+d+e+f+...+z = 4000 is ?

Oa : (4000+26-1)C(26-1) = 4025C25. (Y)

3) Number of even natural solutions of x+y+z+w = 100 is ?

oa: 49c3

Soln: Just express all as even numbers that x = 2a, y = 2b, z= 2c, w = 2d

so 2a+2b+2c+2d = 100,

a+b+c+d = 50,

so its natural solutions will be (50-1)c(4-1) = 49c3.

4) Number of even non negative integral solutions of a+b+c+d+...+j = 1000 is ?

All correct now (y)

a+b+c+d+...+j = 1000

so number will be of 2k form

2(a+b+c+d+e+f+g+h+i+j) = 1000

so (a+b+c+d+e+f+g+h+i+j = 500

So its non -ve solution

(500+10-1)C(10-1)=509c9

5) Number of odd non negative integral solutions for x+y+z = 99 is ?

Oa: 50c2

Soln : as all are odd numbers so

x=2a+1, y = 2b+1, c= 2z+1

so we get (2a+1)+(2b+1)+(2c+1)=99

a+b+c = 48, => 50c2

6) Number of odd natural solutions for x+y+z = 149 is ?

Oa= 75c2

Soln : putting x = 2a+1

(2a+1)+(2b+1)+(2c+1)= 149

a+b+c= 73

a,b,c can be 0 , why ?

Just see it as 2a+1 = smallest odd natural k liye a should be equal to what ?

a=0 hence we will take non negative soln here for the changed equation.

so (73+3-1)C(3-1)= 75c2

7) Number of odd natural solutions for a+b+c+..+j= 999 is ?

Oa : 0

10 odd numbers will sum upto an even number.

8) Number of integral solutions of x+y+z = 10, such that all are greater than 2 is ?

Solution: All greater than 2, means all must be alteast 3,

so if you add 3 to all , ie., x+3 and get non negative integral solution then even if x= 0 you get 3
as minimum hence do same with all variable

(x+3)+(y+3)+(z+3) = 10

x+y+z = 1, => 3c2=3.

Note : as all greater than 2 hence they all are already natural numbers hence cant be infinite.
9. How many ways 36 can be represented as sum of 3 natural numbers ?
Oa:
35c2-3*17-1/6+18

#Important

Now pay attention, this is a very basic but very important which very few people know i assure
you. That the post i gave was x+y+z .. = n

but here i gave just sum of few numbers = n,

what is the difference ? looks same right ?

but no first one ie., x+y+z= n, gives the ordered solution while later one should give unordered
solution.

Former one is ordered because x, should take all the possible values which even y and z took

eg.. x+y+z = 2, its non negative solutions are = 1,1,0, 0,1,1 or 1,0,1 or 2,0,0, or 0,2,0 or 0,0,2 so
total 6 solutions = (2+3-1)c(3-1) = 4c2 = 6

but when asked sum of three numbers = 2 then its just 1,1,0 and (2,0,0) ie., just 2

●So two important points to note●

■1) number of even solutions or odd solutions isnt (Total solutions)/2 .

Why ? Coz there are some solutions which are all even or all odd but there are also some
solutions which consists of both odd and even numbers.

Hence we cant divide it directly by 2.

■2) Whenever variables are mentioned we take ordered solutions and when variables arent
mentioned we take unordered solutions .

Q) Number of intersections from 11 lines is ?

Maximum : 11c2 ( when all are non collinear )

Minimum : 0 ( when all are parallel)

Note : number of intersections among n "non-parallel lines" in nC2

PNC -3
1. How many ways can we represent 49 as sum of two non negative integers ?
Oa: 25

Soln : x+y=49, => 50c1=50 ordered solutions

but as i have already told, when nothing mentioned we find unordered solutions,

so its 50/2! = 25

2. So how many ways 100 can be represented as sum of 3 natural numbers ?

OA:
a+b+c=100 so 99C2
aab: (11 98) to (49 49 2)
so (99C2-49*3)/3! +49

■ Detail Solution ( take your time) :

Q. So how many ways 100 can be represented as sum of 3 natural numbers ?

●As i told in the earlier class, that when x,y,z variables are not mentioned then we will find out
unordered solutions.

When we do x+y+z = 100, => 99C2, we get all ordered solutions.

Now See in 99c2 we have all the ordered solutions, in which there are two types of solutions
which are (a,b,c) each arranged in 3! ways and another type is (a,a,b) each arranged in 3!/2
ways

what we are doing is just dividing distinct set by 3! (as each set is repeated 3! times) and those
set (a,a,b) type in 3!/2 ways .

It means the set of type (a,b,c)

(1,2,97), (1,97,2),(2,97,1),(2,1,97),(97,1,2),(97,2,1) are arranged in 3! = 6 ways in ordered
solutions but in case of unordered we consider all these as just 1 set. ie., (1,2,97) .
and a set like (a,a,b) ie., (1,1,98) is arranged in 3!/2 = 3 ways in ordered but need to be taken
only once.

Now first calculate a,a,b type here two are equal ie., x= y

2x+y =100, x => can go from 1 to 49, while each can be arranged in 3!/2 =3 ways

after we remove it from total ie., 99c2, we are left with all distincrt.

ie., 99c2 - 3*49 contains all distinct set, and we know all distinct sets are arranged in 3! ways so
divide it by 3!

(99c2-3*49)/3!. This gives distinct unordered set,

and we already have 49 unordered (a,a,b) type set

so total (99c2-3*49)/3! + 49

3. How many ways can we represent 200 as sum of 3 natural numbers ?

All correct (y)

Ordered :
a,a,b type = 2a+b=200--->1 to 99 = 3*99
a,b,c type = 199c2 - 3*99
a,a,a type = 0

Unordered Solution =(a,b,c type)/3! + (a,a,b type)/3+(a,a,a type)

=> (199c2 - 3*99)/3!+99

4. How many ways can we represent 198 as sum of three non negative integers ?

All wrong. Observe clearly.

Oa: ( 200c2 - 3*99-1)/3! + 100

Soln: x+y+z=198, => 200c2

when x=y, 2x+y=198, x=> 0 to 99, =>100 values

when x=y=z=66, only 1 which already got included in x=y case

so there are 99 x=y case each arranged in 3 ways . ( excluding 1 x=y=z case)

so required = ( 200c2 - 3*99-1)/3! + 99 + 1

■So basically funda is

●Remove all aab and aaa type from total.

●We will be left with distinct only.

●Then divide by 3! to get distinct unordered.

●Then add unordered aab and aaa cases separately.

=> ( Total - 3*aab - aaa)/3! + aab + aaa

5. How many distinct natural solution for x+y+z = 99 ?

Great to see all are learning so fast _/\_

Last batch of last year mostly got it wrong.

Soln: here as x,y,z are given so we will find ordered solution but distinct

so x+y+z = 99, => 98c2

when x=y, 2x+y=99, x=> 1 to 49,

when x=y=z=33, only 1 which is included in above 49

So removing these cases from total we will be left with distinct ordered

required = ( 98c2-3*48-1) is your answer, we wont divide by 3! as we dont need unordered

here.

Q. Number of ways 96 can be represented as product of two factors is ?

oa : 6

we need unordered positive solutions so just number of factor pairs = number of factors/2 = 12/2
=6

Q. Number of integral solutions of xy = 96 is ?

oa : 24

we need ordered integral solutions,

so first positive ordered = number of factors = 12,

but as both x and y can be negative too so double cases

2*12 = 24.

PNC -4

Ques: 1) Number of ways of distributing 5 identical balls into 3 distinct boxes are ?

Oa : (5+3-1)C(3-1) = 7c2 =21

2) Number of ways of distributing 10 distinct balls into 5 distinct boxes are ?

Distinct to distinct

Where = boxes = 5
What = balls = 10

Where^what => 5^10

4th case. Pic me ek typo hai. Wo +1 hoga instead of +3 (third last line )

4) Number of ways of distributing 17 identical balls into 3 identical boxes are ?

Identical to identical case hai

So just unordered version of

a+b+c=17

Total ordered : 19c2

When a=b
2a+b=17, a=> 0 to 8 : 9 cases

So unordered : (19c2-3*9)/3!+9

5) Number of ways of distributing 37 identical balls into 3 identical boxes such that there are
atleast 3 balls in each box are ?

Atleast 3 so replace variables a with a+3

So unordered solution of

(a+3)+(b+3)+(c+3)=37,
a+b+c=28, => 30C2

when a=b

2a+b=37, a=> 3 to 17 => 15 solutions

Required : (30c2-3*15)/3! + 15 = 80

6) How many ways can you distribute 15 identical marbles among 3 groups ?

So a + b + c = 15

Total ways : 14c2

When a=b
2a+b=15, a= 1 to 7
a=b=c=5 , 1 case

So (14c2-3*6-1)/3!+7 is the Oa.

Every one get a doubt why 14c2 instead of 17c2.

Coz a group with 0 balls doesnt exist. Hence will take natural solutions.

Boxes are present really in front of you .

Groups are imaginary !!

A) 3 boxes , 5 balls ( even If third box has 0 the box is still there

B)2 groups , 5 balls ( coz there is nothing in that group )

AIMCAT 1615 question

How many ways can we distribute 14 identical balls in 3 groups ?

(13c2-6*3)/3!+6

All correct. Oa : 16

I think everyone is clear now. Last year everyone did it wrong in aimcat mock.

let's move to next concept !!

Now a few got doubt regarding distinct to identical case that why only the case of (5,0,0) is
removed and not (3,1,1) or (2,2,1)

■Identical boxes
■Distinct balls

A) first two cases seems identical or

B) last two ?

Yup. Same thing i wanted to explain

In case of identical boxes and distinct balls . ( take 5 balls 3 boxes)

5,0,0
4,1,0
3,2,0
3,1,1
2,2,1

Only case identical will be when there are two zeroes ie 5,0,0 case

So total 3^5
In which all are distinct arranged in 3! Ways

except 5,0, 0 case arranged in 3!/2!= 3 ways

So unordered: (3^5-3*1)/3!+1 = 41

For the concept :

https://facebook.com/events/737168319747571?view=permalink&id=737235979740805

Q)Number of ways of distributing 4 distinct balls into 3 identical boxes are ?

Solution:

(4,0,0) => 4c4=1

(3,1,0) => 4c3*1c1=4
(2,2,0) => 4c2*2c2/2! =3
(2,1,1) => 4c2*2c2*1c1/2! =6

Total : 14

Alternative : ordered : 3^4

Unordered : (3^4-3)/3!+1=14

7) Number of ways of distributing 8 distinct balls into 3 identical boxes are ?

2^8 if distinct boxes

(2^8-2)/2!+1 if identical = same as 2^8/2!=128

Q)No of ways of distributing 8 distinct balls in two identical boxes..

2^8 if distinct boxes

(2^8-2)/2!+1 if identical = same as 2^8/2!=128

PNC-5
First lets do some basic questions.

|x|=100,
How many

1) integral solutins
2) Natural solutions
3) Real solutions

Oa :

1) 2--- -100,+100
2) 1---100
3) 2 ----100,+100

Any doubt ?

Q) Number of solutions of xy=100

1) natural
2) integral
3) real

oa : 9,18 , infi

Solution: 1) Number of factors

2) 2*number of factors

3) its always infinite in case of real numbers.

Number of factors gives ordered, as variables are mentioned so we take ordered .

if the question was in how many ways 100 can be written as product of two numbers, then we
will take unordered.

Q) Number of ways 100 can be written as product of 3 factors is ?

Solutions :

100 = 2^2*5^2

ordered, = 4c2*4c2=36

(36-12)/3!+4= 8

i think jada logo ko samajh ni aya ye ? haina?

■Shortcut for finding a,a,b and a,a,a, triplets

=> a,a,b will be same as number of perfect square in the number, as we need any number twice
to satisfy, hence.

■a,a,a, will always be 1 at max, as its a triplet, hence only one possible way . ( possible only if
the number is cube)

note: in case there is an (a,a,a,) triplet possible, then automatically a,a,b triplet will get one less
just like we did in sum of 3 numbers unorder ways .

Q) Number of ways 540 can be written as product of 3 numbers is ?

Awesome _/\_

solution : 540 = 2^2*3^3*5

ordered: x+y+z=2, => 4c2

x+y+z=3, => 5c2
x+y+z=1, => 3c2
=> 4c2*5c2*3c2= 180

(a,a,b) type = 2*2=4,

unordered = (180-3*4)/3!+4 = 32
Q) x*y*z=1000,

1) natural solutions
2) integral solutions

Oa: 100, 400

Solution 1000=2^3*5^3

Natural : 5c2*5c2=100

Integral. : here we can have any two out of 3 elements as negative. ( if abc = (-a)(-b)c

So for negative any two of the three can be negative in 3c2=3 ways so 3*100=300 negative
solutions

Total = 100+300=400

Do it carefully. It Checks all the concepts taught today.

Q. Number of ways 216 can be written as product of 3 natural numbers is ?

Oa: 19

216 =2^3*3^3

Ordered : 5c2*5c2

a,a,b = 2*2=4
a,a,a => 1. ie 6*6*6 ie 1 which got included in a a b

So a a b => 4-1=3

Unordered : (100-3*3-1)/6+3+1= 19

Q) How many ways 27000 can be written as product of 3 integers ?

Oa: 675

27000 = 2^3*3^3*5^3

ordered positive = 5c2*5c2*5c2 = 1000,

ordered integral = 4*1000 = 4000,

total perfect squares = 2*2*2=8,

cube =1,
so a,a,b = 7, and a,a,a, = 1
unordered positive = (1000 - 3*7-1)/3! + 8 = 171

now for integral, a,a,b,, each of it can be (-a,-a,b) and (-a,-a,a) will be included in a,a,b only, so
there will be 2*8-1 = 15 a,a,b type and only 1 a,a,a, type

unordered integral = (4000 - 15*3-1)/3! + 16 = 675

#Concept
●Number of perfect squares in 2^5*3^7 is

Squares = even powers

So First find even powers of each prime.

2^5 => 2^0, 2^2, 2^4 : 3

3^7 => 3^0, 3^2, 3^4, 3^6 : 4

Total perfect squares = 3*4

● Cubes = 3k form

So First find 3k form powers of each prime.

2^5 => 2^0, 2^3, : 2

3^7 => 3^0, 3^3, 3^6 : 3

Total perfect cubes = 2*3=6

PNC -6
■Reasoning behind last post.

Let's assume 3 non consecutive to be selected out of 10 .

a + b + c = 10

Now between b and c one each can't be selected .

So a+1+b+1 + c = 10

a, b ,c to be selected out of 10-2=8

So 8c3 is your answer .

By formula (10-3+1)C3=8c3

Generalisation : (n-r+1)Cr

Q 1) How many ways can you select 10 non consecutive bats out of 30 distinct bats arranged in
a row ?

OA: 21c10

2) In how many ways can you select 5 non consecutive books out of 20 distinct books arranged
in a circle ?

Oa:
16c5-14c3
3) How many ways can we select 4 things out of 20 distinct things in a row such that all are
consecutive ?

Oa : 17.

It's consecutive .. not " non consecutive"

So 1234
2345
3456
.
.
17,18,19,20

Total 17 ways.

Or just 20-4+1=17 .

4) Number of ways of arranging 5 things out of 20 things in a row such that all are consecutive
?

Oa: 16*5!

Its arrangement not selection

Select 5 in 20-5+1=16 ways

Now arrange those 5 in 5! Ways

So 16*5! Ways
Q) Number of ways of putting 5 caps on its pen such that no cap is put on its actual pen is ?

Oa: 44

Q) Number of ways of arranging 7 letters in their envelopes such that exactly 3 doesnt get into
its correct envelope is ?

solution : first select any 3 out of 7 in 7c3 ways, and their derangement D(3)=2,

while remaining 4 has to go into its correct address in only 1 way

so total 7c3*2

In Ring finger few gets doubt about r^n part. Reasoning here :
Q. 4 letters has 4 respective envelopes, how many ways can you go wrong if you arrange ?

OA:
There is only one correct way ie when all goes in correct envelope.

So wrong ways : Total - 1

=> 4! -1 = 23

Q) How many ways can you select 10 bats such that there are atleast 2 bats in between out of
30 distinct bats arranged in a row ?

Non consecutive me we used to put a gap of one by keeping +1 in between variables means
there is atleast one in between.

Here the question is atleast two in between. So

a+2+b+2...+i+2+j = 30

a+b+c....=30-2*9=12

So select 10 amongst 12 in 12c10=66 ways

Q) How many ways can you arrange 5 identical rings in 10 fingers ?

OA: 14C9

Q) On Kanika's birthday 5 handsome boys gifted her 10 distinct rings. In how many ways can
she arrange them in her 5 fingers such that there are atleast 1 ring in each finger?

Oa : 9c4*10!
Q; How many ways can you step up a 10 stair if you can use only 1 or 2 or 3 steps at a time ?

Oa: 274
PNC -6(MUTUAL EXCLUSION PRINCIPLE)

Q) In how many ways can you distribute 6 distinct balls into 3 distinct boxes such that no boxes
remain empty ?

Oa: 3^6 - (3c1 * 2^6) +3c2*1 = 540

Once you understand the pattern it's very easy

Q) How many ways can 3 couples be seated around table such that none sit together ?

You all forgot to substract one more term.

one way is to remember by pattern,

see that factorial part keeps getting less by 1 after each term
so 5,4,3 and then 2.

another is after we select 3 couples to sit together, we only have to arrange 3 items around the
circle in (3-1)! =2!

oa: 5!-3c1*4!*2+ 3c2*3!*2^2-3c3*2!*2^3 = 32

Q) How many ways can you arrange 7 balls into 3 boxes such that none is empty? (both
distinct)

OA:
3^7-3c1*2^7+3C2*1^7

Q) How many ways can you arrange 5 balls into 4 boxes such that none is empty? (both
distinct)

Oa:
4 ^ 5 -(4c1 * 3^5) + (4c2 * 2^5) - (4c3*1^5)

Q) How many ways can you arrange 6 distinct balls into 3 identical boxes such that none is
empty?

Oa: [3^6 - (3c1 * 2^6) +3c2*1]/3! = 90

Same as distinct, just divide by 3!.

No 8c2 coz that case is when identical balls into distinct boxes.

Other way

411 : 6c4*2c1/2 = 15
3,2,1 : 6c3*3c2*2c1= 60
2,2,2 : 6c2*4c2*2c2/3! = 15

Total : 15+60+15= 90.

Q) How many ways can you arrange 7 distinct balls into 4 identical boxes such that none is
empty?

Oa:
(4^7-4c1*3^7+4c2*2^7-4c3*1^7)4!
Q) In how many ways can you distribute 6 distinct balls into 3 distinct boxes such that atleast
one boxe remain empty ?

Oa:
Atleast one box empty =

Total - no box empty .

=> 3^6 -( 3^6 - 3c1 * 2^6 +3c2*1)

=> 729-540 = 189

Q) In how many ways can you distribute 5 distinct balls into 3 distinct boxes such that atleast
one box remain empty ?

Oa:
3^5-(3^5-3c1*2^5+3c2)

= 3c1*2^5 - 3c2 = 93

PNC-7
#Basic Test

Number of integral solutions of x+y+z=10, such that all are greater than 2 is ?

Solution: All greater than 2, means all must be alteast 3,

so if you add 3 to all , ie., x+3 and get non negative integral solution then even if x= 0 you get 3
as minimum hence do same with all variable

(x+3)+(y+3)+(z+3) = 10

x+y+z = 1, => (1+3-1)C(3-1) = 3c2= 3

Q. How may 5 digit numbers have sum of digits = 12 ?

Take your time to understand the concept

#Solution 1for : Number of 5 digit numbers with sum of digits = 12 ?

Sum of 5 digit numbers = 12

a+b+c+d+e=12

First digit here can't be 0, so make it (x+1) so that it's minimum possible value is atleast 1.
Now x varies from 0 to 8

(x+1)+b+c+d+e=12
x+b+c+d+e=11,
Total cases => (11+4)C4=15c4

But it includes cases when b,c,d,e is >9 and a>8 which needs to be removed

when b>9 , add b+10

x+b+c+d+e=11-10=1, => 5c4 which applies for all of b c d e so 4*5c4

While for x >8

So x+b+c+d+e=2, => 6c4

Required => 15c4 - 4*5c4 - 6c4

Q. Number of ways of getting sum = 20 when we throw 4 dice is ?

Hmmmmm. Wrong.

Problem is

As we do a + b + c + d = 20.

19c3 is total.

And when we removed (a+6)+b+c+d=20

=> 4*13c3

Which is wrong . Because whenever there are more than two variables > 6 possible we can't do
this way as there will be repitions .

So for such cases we replace each variable with (6-x) so that it's always less than 6.

(6-x) + (6-y) + (6-w) + (6-z) = 20

As we replaced a = 6-x =1, x =5

a = 6-x=6, x =0
So new range of x,y,z,w is 0 to 5.

x+y+z+w=4

=> 7c3

Q. Find the Coefficient of x^4 in (x+x^2+x^3+x^4+x^5+x^6)^4 .

Take this as Dice problem as powers of x ranging from 1 to 6

As whole power is 4, hence number of dice = 4 .

Now as Coefficient of x^4 is asked so sum =4

So we just need to find solutions for a + b + c + d = 4,

=> 3c3 =1.

I correlated and derrived it for easy calculation and it works for any other x^n too.

Q) Number of 8 digit numbers with sum of digits = 66 is?

Solution : This concept we applied

previously in case of dice that whenever there are more than one digit greater than 9 possible
then do it (9-x) way.

So

we know that all digits less than or equal to 9 so give limits to all at a time to make it easy .

(9-a)+(9-b)+(9-c)+... (9-h)= 66

a+b+c....+h = 6

=> (8+6-1)C(8-1) = 13c7

Q) Find the Coefficient of x^11 in (x+x^2+x^3+x^4+x^5+x^6)^4 .

Same as dice as x^1 to x^6

Power = Number of Dice = 4

Coefficient of x^11, so sum. = 11

Hence the question is same as how many ways can you get sum = 11 on throwing for dice

So a+b+c+d=11

=> (10c3 - 4*4c3) = 104.

Same as we did for dice :)

Q. Number of ways of getting sum = 11 on throwing 4 dice is ?

Oa:
first find for a+b+c+d=11, => +ve solution 10c3

Now when any one is >6

(a+6)+b+c+d=11
a+b+c+d=5, => +ve solution 5-1c4-1=4c3
For all 4 variables in 4*4c3 ways

Total 10c3 -4*4c3

Q ) How many 4 digit numbers with sum = 15 ?

Oa: 17c3 - 3*7c3-8c3

Solution :

a + b + c + d = 15

(x+1) + b + c + d = 15

x + b + c + d = 14, => 17c3

Remove cases when x>=9

(x+9) + b + c + d = 14,
x + b + c + d = 5, => 8c3

And when b,c,d >=10

x+(b+10)+c+d=14
x + b + c + d =4, => 7c3
Required : 17c3 - 3*7c3-8c3

Past CAT Question .

Q. Number of ways getting sum = 19 on throwing 4 dice is ?

Great (y)

Oa : (6-a) + (6-b) + (6-c) +(6-d) =19

a+b+c+d=5

=> (5+4-1)C(4-1) = 8c3 = 56 .

#Note : Point to remember is we can do directly only in case when only one variable > 6 is
possible .
If more than one possible then do (6-a)+(6-b) ... karke

Here sum = 19 = 7+7+3+2, two greater possible . Hence (6-a)... Way.

#Last concept of the day.

■Number of Triangles with Integer sides for a given perimeter.

●If the perimeter p is even then, total triangles is [p^2]/48.

●If the perimeter p is odd then, total triangles is [(p+3)^2]/48

● If it asks for number of scalene triangle with a given perimeter P, then subtract 6 and apply the
same formula . For even [(p-6)^2]/48 and for odd [(p-3)^2]/48.

Where [x] represents neatest integer function.

For those who don't want to remember formula but conceptual way then read this article on I
Quanta : http://iquanta.in/triangles-and-perimeters/

PNC -8 (PRACTICE)
Q. Number of 4 digits numbers with sum of digits = 13 is ?

Great to see all getting correct in just one explanation :)

Solution :

a + b + c + d = 13

(x+1) + b + c + d = 13

x + b + c + d = 12, => 15c3

Remove cases when x>=9

(x+9) + b + c + d = 12,
x + b + c + d = 3, => 6c3

And when b,c,d >=10

x+(b+10)+c+d=12
x + b + c + d =2, => 5c3

Required : 15c3 - 3*5c3-6c3

Q. Number of ways to get a sum = 21 on throwing 4 dice is ?

Oa:
(6-a) + (6-b) + (6-c) + (6-d) = 21

a+b+c+d=3

=> 6c3

Q. Number of ways to get a sum = 10 on throwing 5 dice is ?

a + b + c + d + e = 10

=> 9c4

When any > 6

Now even if one is 7 , and others = 1

The. It cant be equal to 10 as 7+1+1+1+1=11

So no cases when any of them > 6

So simply 9c4
Q. Number of ways to get a sum = 12 on throwing 4 dice is ?

a + b + c + d = 12

=> 11c3

When any > 6

(a +6) + b + c + d = 12

a+b+c+d=6
=> 5c3 , for all 4 variables

So required : 11c3 - 4*5c3

■Important■Few conceptual points to remember

● Whenever the given sum is nearer to the total , we apply (6-x) + (6-y)+... way.. ..( coz in this
case more than one variable is greater than 6)

If given sum is small then just do it directly.

Same way we can apply for sum of digits.

● Now in case of Dice to remove the variables > 6 we did (x+6) and not (x+7). Why ?

Coz we are finding natural solutions here . So the minimum possible value of x = 1 ,

And to get minimum out of range value it will be 1+6=7, so just (x+6)

=> if it was whole solution then (x+7) xoz then minimum value of x =0,

And to get minimum out of range value it will be 0+7=7, so just (x+7)

Q) how many integers between 1 and 10^6 have sum of digits equal to 18?

Below 10^6 there will be 6 variables

So a + b + c + d + e + f = 18

=> 23c3

Now when any variable > 9

( a + 10) + b + c + d + e + f = 18
a+b+c+d+e+f=8
=> 13c5

So required 23C5 - 6*13c5

Note : why we dint add +1 to a ?

Coz here question asked is for all numbers between 1 and 10^6

So if a = 0, you get a 5 digit number

If a=b=0, you get a 4 digit number... so on covers all.

So if by just not adding +1 to a we are covering all the smaller digit cases. (Y)

Q) how many integers between 1 and 9999 have sum of digits equal to 12 ?

15c3 - 4 * 5c3

Q. Coefficient of x^4 in (1+ x + x^2 + ..x^5)^4 is ?

External power =4 = number of variables

Power of x : 0 to 5

So limit of these 4 variables is 0 to 5

Now we need to find for x^4

So a + b + c + d = 4

=> (4+4-1)(4-1)= 7c3

Q. Coefficient of x^9 in (1+ x + x^2 + ..x^6)^4 is ?

External power =4 = number of variables

Power of x : 0 to 6

So limit of these 4 variables is 0 to 6

Now we need to find for x^9

So a + b + c + d = 9

=> (9+4-1)(4-1)= 12c3

Now removing cases when any > 6

(a+7) + b + c + d = 9
a+b+c+d=2
=> 5c3 , for all 4

So ans : 12C3 - 4*5c3

Q. Coefficient of x^11 in (x + x^2 + ..x^7)^5is ?

Oa:
10c4

#NewConcept

Q) What is the sum of all the 3 digit numbers which can be made by using the digits 1 to 6 ?

Solution : see there is a basic funda , that whenever we are using formula, many remember it
just as n^(n-1)*sum*111....n times but that is only in case when number of digits n being used is
same as n digit number.

this formula is used taking each digit fixed then finding all other possible digits at each units or
tens or thousands digits like that.

so its a 3 digit number, keep first digit fixed, and remianing 2 digits can attain digits in 6*6 ways,
and sum of each digit bieng (1+2+3+4+5+6)=21,
and sum at each units, tens thousands digits,,, ie, (1+10+100+1000)..
though here its 3 digits so only upto (1+10+100)= 111

required answer => 6^2*21*111

Q) Sum of all the 4 digit numbers formed by using digits 2,3,5,7,9 with repition is ?

26*5^3*1111

Q) Sum of all the 4 digit numbers formed by using digits 2,3,5,7,9,0 with repition is ?

total : keep first digit fixed, now left with 3 digits with each having 6 choices so 6*6*6 = 6^3
sum = 26, and multiply with (1111)
=> 6^3*26*1111

now we need to remove cases when first digit was 0, so when it was 0 it means we need to
remove cases of all 3 digit numbers as
0abc same as 3 digit number
so => 6*6(sum)*111 = 6^2*26*111

required 6^3*26*1111 - 6^2*26*111

Q) Sum of all the 4 digit numbers formed by using digits 2,3,5,7,9,0 with repition is ?

total : keep first digit fixed, now left with 3 digits with each having 6 choices so 6*6*6 = 6^3
sum = 26, and multiply with (1111)
=> 6^3*26*1111

now we need to remove cases when first digit was 0, so when it was 0 it means we need to
remove cases of all 3 digit numbers as
0abc same as 3 digit number
so => 6*6(sum)*111 = 6^2*26*111

required 6^3*26*1111 - 6^2*26*111

Q) How many 5 digit numbers can be made from digits 2,3,6,7,8,9 without repeatition.

Oa : 6! :p