Aug 22, 2015

Numbers/LCM/220815

Number N which when divided by 11, 9 & 8 gives 5, 6 and 7 as remainder respectively ?

A) find the small possible such number
B) find the largest 4 digit such number

Soln : 11 Q1 + 5 = 9.Q2 + 6 = 8.Q3 + 7
            60 + 55 Q4 = 8 Q3 + 7
         
           Smallest 159 , keep adding lcm of 11,8,9 for subsequent numbers


Aug 21, 2015

Number System : Remainders 1501

N2 leaves a remainder of 1 when divided by 24. What are the possible remainders we can get if we divide N by 12?

1, 5, 7 and 11
1 and 5
5, 9, and 11
1 and 11

DETAILED SOLUTION

This again is a question that we need to solve by trial and error. Clearly, N is an odd number. So, the remainder when we divide N by 24 has to be odd.

If the remainder when we divide N by 24 = 1, then N2 also has a remainder of 1. we can also see that if the remainder when we divide N by 24 is -1, then N2 a remainder of 1.

When remainder when we divide N by 24 is ±3, then N2 has a remainder of 9.
When remainder when we divide N by 24 is ±5, then N2 has a remainder of 1.
When remainder when we divide N by 24 is ±7, then N2 has a remainder of 1.
When remainder when we divide N by 24 is ±9, then N2 has a remainder of 9.
When remainder when we divide N by 24 is ±11, then N2 has a remainder of 1.

So, the remainder when we divide N by 24 could be ±1, ±5, ±7 or ±11.

Or, the possible remainders when we divide N by 24 are 1, 5, 7, 11, 13, 17, 19, 23.

Or, the possible remainders when we divide N by 12 are 1, 5, 7, 11.

Correct Answer: 1, 5, 7, 11

Aug 3, 2015

Number System : General : 109 : ABCDE*4 = EDCBA

ABCDE * 4 = EDCBA. Solve for A,B,C,D, and E where each is a unique integer from 0 to 9.

Solution

It is obvious that A can be no more than 2. If A were 3 then 3BCDE * 4 would be at least 120,000 which is more than five digits. Also A must be an even number because EDCBA is an even number since it is the product of at least one even number (4). We can eliminate A=0 because E would have to be 5 (5*4=0) but BCDE*4 could not hope to reach 50,000. So A must be 2.
Next consider E. E*4 must end in the digit 2. The only numbers that works for are 3 and 8. However with A=2 EDCBA must be at least 80,000. So 8 is the only number that satisifies both conditions.
Next consider B. We already know that 2BCD8*4 is at least 80000 and less than 90000. B can not be more than 2 because then 2BCD8 * 4 would be more than 80000. 2 is already taken so B must be 0 or 1. Lets consider the case that B=0. Then D8 * 4 must end in the digit 02. However there is no D that satisfies this condition. So B must be 1.
Next consider D. D8*4 must end in the digits 12. The only possiblity is D=7 (78*4=312).
Now solve for C:
21C78 * 4 = 87C12.
84312+400C = 87012 + 100C
2700 = 300C
C=2700/300=9.
So ABCDE=21978.

Basics : Number System Remainders 1

When dividend is of the form a + b or a - b :

rule
  1. What is the remainder when (5555) 2222 + (2222) 5555 is divided by 7?
       The remainders when 5555 and 2222 are divided by 7 are 4 and 3 respectively.
       Hence, the problem reduces to finding the remainder when (4) 2222 + (3) 5555 is divided by 7.
       Now (4) 2222 + (3) 5555 = (4 1111 + (3 1111 = (16) 1111 + (243) 1111 .
        Now (16) 1111 + (243) 1111 is divisible by 16 + 243 or
        it is divisible by 259, which is a multiple of 7.
       Hence the remainder when (5555) 2222 + (2222) 5555 is divided by 7 is zero.
  1. 20 2004 + 16 2004 - 3 2004 - 1 is divisible by:    (a) 317 (b) 323 (c) 253 (d) 91
         20 2004 + 16 2004 - 3 2004 - 1 = (20 2004 - 3 2004 ) + (16 2004 - 1 2004 )
         20 2004 - 3 2004 is divisible by 17 (Theorem 3) and
        16 2004 - 1 2004 is divisible by 17 (Theorem 2).
        Hence the complete expression is divisible by 17.

        20 2004 + 16 2004 - 3 2004 - 1 = (20 2004 - 1 2004 ) + (16 2004 - 3 2004 ).
        Now 20 2004 - 1 2004 is divisible by 19 (Theorem 3) and
       16 2004 - 3 2004 is divisible by 19 (Theorem 2).
       Hence the complete expression is also divisible by 19. is divisible by 17 × 19 = 323.



 Fermat's Theorem
rule
  1. What is the remainder when n - n is divided by 42?
Since 7 is prime, n - n is divisible by 7.
 n - n = n(n - 1) = n (n + 1)(n - 1)(n + n + 1)
Now (n - 1)(n)(n + 1) is divisible by 3! = 6
Hence n - n is divisible by 6 x 7 = 42. Hence the remainder is 0.

 Wilson's Theorem

rule
  1. Find the remainder when 16! Is divided by 17.
              16! = (16! + 1) -1 = (16! + 1) + 16 - 17
              Every term except 16 is divisible by 17 in the above expression.
              Hence the remainder = the remainder obtained when 16 is divided by 17 = 16

Numbers : Remainder 105


find the remainder  3^5^7^9 divided by 41.

Soln :
3^4 = 81 = 41(2) - 1. So 3^8 will leave remainder 1 when divided by 41.
That means now we need to find the remainder of power of 3 i.e. 5^7^9 with 8.
Now we know that 5² = 25 = 8(3) + 1 i.e. 57^9 is of the form 52k + 1 and leave remainder 51 = 5 when divided by 8 and is of the form 8k + 5.So finally we need to find the remainder when 38k + 5 is divided by 41 or the remainder when 35 is divided by 41 which is -3 or 38.

Number: 103 : Series 28382th Term 12345678910101213.....

find the 28383rd term of series: 1234567891011121314....

First observe that there are 9 1-digit numbers which take 9*1 = 9 digits, 90 2-digit numbers which take 90*2 = 180digits, 900 3-digit numbers which take 900*3 = 2700 digits, 9000 4-digit numbers which take 9000*4 = 36000 digits.
So it can be concluded easily that our required digit will be some digit in a 4-digit number. Now we need to find out that which digit of what 4-digit number, right?
That can be easily done if I make all numbers 4-digit ones by inserting some 0's before them. Like insert 3 0's before every 1-digit number (i.e. 3*9 = 27 0's), 2 0's before every 2-digit number (i.e. 2*90 = 180 0's) and 1 zero before every 3-digit number (i.e. 1*900 = 900 0's) to meke every number a 4-digit one.

Now we have inserted 27 + 180 + 900 = 1107 zeros in all so we need to find out 28383 + 1107 = 29490th digit in the following sequence: 0001 0002 0003 0004 0005 0006 0007 0008 0009 0010 0011 0012 .....

Which can be easily found as 2nd digit of 7373 i.e. 3 (because 29490 = 4*7372 + 2).

Numbers: Remainder 106


[17^36+19^36]/111 what is the reminder?
Yes the remainder will be 2.

111 = 37 * 3

Φ(111)  = LCM[Φ(37) ,Φ(3)]= 36

1736 mod 111 = 1
1936 mod 111 = 1

Hence 1 + 1 = 2

Numbers System : Remainder N/D, N/12D , N/6D


A no. N when divided by divisor D leaves remainder 23. when same no. N is divided by 12D remainder is 104. what will be the remainder when the no is divided by 6D ?

Soln : If I start from second statement that N = a*12D + 104, so this is same N which when divided by D gives a  remainder of 23. i.e. 104 = b*D + 23 or D is a divisor of 104-23 = 81 and also D is greater than 23. So D = 27 or 81.Thus in any case when same N is divided by 6D, remainder will be given by 104 as a*12D is certainly divisible by 6D. So the required remainder is = 104.

D has to be greater than 23 as remainder on division is 23.
So, 6D > 104
Hence, remainder will be 104

Else,
N = Dx + 23
N = 12Dy + 104
Equating them we will get.
D(x - 12y) = 81
So, D has to be a factor of 81 and greater than 104. So, possible values are 27 and 81
So, 6D is 162 or 324 (both greater than 104)
So, remainder will be 104

Numbers : 9 digit number


Find the number of 9 digits which has the following properties: 
1. The number comprising the leftmost two digits is divisible by 2,that comprising the leftmost three digits is divisible by 3, the leftmost four by 4, the leftmost five by 5, and so on for the nine digits of the number i.e. the number formed from the first n digits is divisible by n, 2<=n<=9.
2. Each digit in the number is different i.e. no digits are repeated.
3. The digit 0 does not occur in the number i.e. it is comprised only of the digits 1-9 in some orde





--------------------------------------------------------------------------- ----------------------
answer is 381654729 

Numbers : Divisibility Osculation


finding the divisibility of a number by 7,13,17,19.the method is known as osculator method.first we have to know the concept of osculator.the osculator of 7 is 2 ( 7* 3 = 21 = 20+1 here we are adding 1 so we need to consider the osculator as negative osculator )
 similarly for 13 ,13 * 3 = 39 = 40-1 so the osculator is 40 and is one more osculator and the value is 4 and for 17 ,17 * 3 = 51 = 50+1 so again the osculator is negative and it is 5 and for 19 it is one more osculator  19 = 20-1 ,so the osculator is 2 .
if you didn't understand the concept of osculator just remember these
for 7 osculator = 2 , sign = ' - '
for 13 osculator = 4 , sign = ' + '
for 17 osculator = 5 , sign = ' - '
for 19 osculator = 2 , sign = ' + '
lets proceed with an example
55277838 is considered and to check it's divisibility by 7.
5527783 8  : 5527783 - 8 *2 =5527767 ( here we have taken the units digit and multiplied it by osculator 2 and subtracted it from the remaining part as the sign is negative as suggested above we have subtracted )
the next step is the following is repeated for the resulting value in the above step
552776   : 552776 - 7 *2 = 552762
55276 2 : 55276 - 2 * 2 = 55272
5527 2 : 5527 - 2 *2 = 5523
552 3 : 552 - 3 *2 = 546
54 6 : 54 - 6*2 = 42 as 42 is divisible by 7 so the number is divisible by 7.

Number System Euler's Theorum

cat mba

Geometry: Quadrilateral 1011

Q)A circle is inscribed in the quadilateral ABCD. Given that AB = 27cm, BC=38m, DC= 25cm and AD is perpendicular to DC. Find the maximum limit of radius and the area of the circle
a)10cm,226cm^2 b) 14cm,616cm^2 c)14cm,216cm^2 d)28cm,616cm^2
e) none of these

Soln : Since OP=OS (radii) and PD=PS(tangents) and angle D= S=P=90 , hence OPDS is a square , i determined AD by foll. method
AD=AP+PD
= 27-TB+PD (since AP= AT as both are tangents and AT= 27-TB)
= 27-(38-SC)+PD
= 27-(38-SC)+(25-SC) (since PD=SD and SD= 25-SC)
AD = 14cm
and as from fig. AD= AP+PD , PD has to be smaller than 14cm under any condition and PD= OS radius of the circle , therefore the radius of the circle will definitely be less than 14cm but Arun Sharma is saying answer as option(d) radius = 28cm which is not possible .

Sep 26, 2013

Probability, Permutation Combination : Test 005

1. 
    A shop sells two kinds of rolls-egg roll and mutton roll. Onion, tomato, carrot, chilli sauce and tomatosauce are the additional ingredients. You can have any combination of additional ingredients, or have standard rolls without any additional ingredients subject to the following constraints:
(a)    You can have tomato sauce if you have an egg roll, but not if you have a mutton roll.
(b)   If you have onion or tomato or both you can have chilli sauce, but not otherwise.
How many different rolls can be ordered according to these rules?

a) 21          b)         33        c)         40        d)         42        e)         None of the above
2.   




          A student wants to make up a schedule for a 7-day period during which she will study one subject each day. She is taking four subjects: mathematics, physics, chemistry and economics. The total number of different schedules is 47. The number of schedules that devote at least one day to each subject is


a)      8400                      b)   8404             c)   8748          d)   None of the above

Aug 30, 2013

1309 : LRDI Reasoning case

Case 80 & 81

There are five machines — A, B, C, D, and E — situated on a straight line at distances of 10 m, 20 m,
30 m, 40 m and 50 m respectively from the origin of the line. A robot is stationed at the origin of the line. The robot serves the machines with raw material whenever a machine becomes idle. All the raw materials are located at the origin. The robot is in an idle state at the origin at the beginning of a day. As soon as one or more machines become idle, they send messages to the robot-station and the robot starts and serves all the machines from which it received messages. If a message is received at the station while the robot is away from it, the robot takes notice of the message only when it returns to the station. While moving, it serves the machines in the sequence in which they are encountered, and then returns to the origin. If any messages are pending at the station when it returns, it repeats the process again. Otherwise, it remains idle at the origin till the next message(s) is(are) received.



80. Suppose on a certain day, machines A and D have sent the first two messages to the origin at the
beginning of the first second, and C has sent a message at the beginning of the 5th second and
B at the beginning of the 6th second, and E at the beginning of the 10th second. How much distance
has the robot travelled since the beginning of the day, when it notices the message of E? Assume
that the speed of movement of the robot is 10 m/s.

a. 140 m b. 80 m c. 340 m d. 360 m

Solution
80. a The robot begins to give material to machine A and then to D, it thus covers 40 m in that time span and takes 4 s. Also then it returns to the origin, and takes 4s, while covering 40 m again. When it arrives at the origin, the messages of B and C are already there, thus it moves to give the material to them, which takes it in total 6 s, and it covers 30 + 30 = 60 m in total. Hence, the distance travelled by the robot will be 40 m+ 40 m + 60 m = 140 m.

-------------------------------------------------------------------------------------------------------------------

81. Suppose there is a second station with raw material for the robot at the other extreme of the line
which is 60 m from the origin, i.e. 10 m from E. After finishing the services in a trip, the robot returns
to the nearest station. If both stations are equidistant, it chooses the origin as the station to return
to. Assuming that both stations receive the messages sent by the machines and that all the other
data remains the same, what would be the answer to the above question?
a. 120 b. 140 c. 340 d. 70

Solution :
81. a In this question, once the robot has delivered the material to machines A and D, it shall reach the origin 2 (nearest), taking 6 s, and covering 60 m. Then it immediately moves to deliver material to machines C and B covering a distance of 40 m and finally back to the origin (nearest). Thus, it cover a distance of 60 m. Hence, it covers a total distance of 120 m.

1308: Number System - Remainder - CAT 2000

The integers 34041 and 32506, when divided by a three-digit integer n, leave the same remainder.
What is the value of n?

a. 289          b. 367         c. 453     d. 307
-----------------------------------------------------------------------------------------



Let r be the remainder. Then 34041 – r and 32506 – r are perfectly divisible by n.
Hence, their difference should also be divisible by the same.
(34041 – r) – (32506 – r) = 1535, which is divisible by only 307.
Answer : D 

1307 : Permutation Combination CAT 2000

One red flag, three white flags and two blue flags are arranged in a line such that:

I. No two adjacent flags are of the same colour
II. The flags at the two ends of the line are of different colours

In how many different ways can the flags be arranged?
   a. 6    b. 4    c. 10   d. 2


------------------------------------------------------------------------------------

Soln : 63. a The possibilities are W@W@W@ (or) @W@W@W,
where 2 blue and 1 red flag occupy the space marked
as @. Hence, the total permutation is 2(3!/2!) = 6

Aug 23, 2013

1305:TSD : Two Pools

A and B are the two opposite ends of a swimming pool and the distance between them is
420 metres. Ankur and Manu start swimming towards each other at the same time from A and B,
with speeds in the ratio 5 : 9 respectively. As soon as any of them reaches an end, he turns back
and starts swimming towards the other end. At what distance (in metres) from A will they meet when
Manu is in his 13th round? Note: A to B is considered one round and B to A another round.

(a) 405 (b) 330 (c) 240 (d) 280


Answer

By the time Manu completes 12 rounds, Ankur will complete × = 5/9 *12 = 6 -2/3 rounds. At this point in time Ankur is moving towards B and is 280 metres away from A whereas Manu is at B.
They will meet at a distance of

9 * (420 -280)/ 5+ 9 = 90 metres from B. This point will be at a distance of 420 – 90 = 330 metres from A.

Answer : B

From Eduventures _Puneet Singh

Aug 19, 2013

1304 : Data Sufficiency CAT 2007

Each question is followed by two statements A and B. Indicate your
response based on the following directives.
Mark (1) if the questions can be answered using A alone but not using B alone.
Mark (2) if the question can be answered using B alone but not using A alone.
Mark (3) if the question can be answered using A and B together, but not using either A or B alone.
Mark (4) if the question cannot be answered even using A and B together.


7. The average weight of a class of 100 students is 45 kg. The class consists of two sections, I and II,
each with 50 students. The average weight, I W , of Section I is smaller than the average weight II W ,
of the Section II. If the heaviest student say Deepak, of section II is moved to Section I, and the
lightest student, say Poonam, of Section I is moved to Section II, then the average weights of the
two sections are switched, i.e., the average weight of Section I becomes II W and that of Section II
becomes I W . What is the weight of Poonam?
A: WII – WI = 1.0 .
B: Moving Deepak from Section II to I (without any move I to II) makes the average weights of the
two sections equal.

8. ABC Corporation is required to maintain at least 400 Kilolitres of water at all times in its factory, in
order to meet safety and regulatory requirements. ABC is considering the suitability of a spherical
tank with uniform wall thickness for the purpose. The outer diameter of the tank is 10 meters. Is the
tank capacity adequate to met ABC’s requirements?
A: The inner diameter of the tank is at least 8 meters.
B: The tank weights 30,000 kg when empty, and is made of a material with density of 3 gm/cc.

9. Consider integers x, y, z. What is the minimum possible value of x2 + y2 + z2 ?
A: x + y + z = 89.
B: Among x, y, z two are equal.


10. Rahim plans to draw a square JKLM with point O on the side JK but is not successful. Why is
Rahim unable to draw the square?
A: The length of OM is twice that of OL.
B: The length of OM is 4 cm.



Solution :
7. 3 Using A: WII = 45.5 and WI = 44.5
Using B: Weight of Deepak = 70kg (Only after using
statement A)
This is sufficient to find weight of Poonam using the
data given in the question statement. Hence option (3)
is correct choice.

8. 2 Using A: Inner radius of the tank is atleast 4 m. So volume
4 3
r where 4 r 10
3
= π < <
This volume can be greater as well as smaller than
400 for different r.
Using B: The given data gives the volume of the material of tank, which can be expressed as
4 3 3
(10 r ),
3
Ï€ − which will give the value of r which is unique and sufficient to judge if the capacity is
adequate. Hence option (2) is correct choice.

9. 1 Using A: x = 30, y = 30 and z = 29 will give the minimum value.
Using B: Nothing specific can be said about the relation between x, y and z.
Hence option (1) is correct choice.


10. 1 Using A:
OM        2
----  =  -----
OL          1

But if O lies on JK, maximum possible value of (when O lies on K)
OM           sqrt 2
------   =  --------
OL            1

So, Rahim is unable to draw such a square Using B: Nothing specific can be said about the
dimensions of the figure. Hence option (1) is correct choice.


1303 : Arithmetic _CAT 2007

A confused bank teller transposed the rupees and paise when he cashed a cheque for Shailaja.
giving her rupees instead of paise and paise instead of rupees. After buying a toffee for 50 paise,
Shailaja noticed that she was left with exactly three times as much as the amount on the cheque.
Which of the following is a valid statement about the cheque amount?
(1) Over Rupees 13 but less than Rupees 14
(2) Over Rupees 7 but less than Rupees 8
(3) Over Rupees 22 but less than Rupees 23
(4) Over Rupees 18 but less than Rupees 19
(5) Over Rupees 4 but less than Rupees 5


Soln :

Suppose the cheque for Shailaja is of Rs. X and Y paise
As per the question: 3 × (100X + Y) = (100Y + X) – 50
⇒ 299X = 97Y – 50
⇒ Y = 299X + 50 /97

Now the value of Y should be a integer. Checking by options only for X = 18, Y is a integer and
the value of Y = 56

From Puneet Singh (www.bsaitmfbd.com) Eduventures

1302 : Arithmetic : Age (CAT2007)

Ten years ago, the ages of the members of a joint family of eight people added up to 231 years. Three years later, one member died at the age of 60 years and a child was born during the same year. After another three years, one more member died, again at 60, and a child was born during the same year. The current average age of this eight-member joint family is nearest to
(1) 23 years (2) 22 years (3) 21 years (4) 25 years (5) 24 years


Solution:
The total age of all the eight people in the family = 231 As per the information given in the question, the total age of all the people in the family= 231 + 3 × 8 – 60 + 0 = 195
Similarly the total age of the people in the family four years ago= 195 + 3 × 8 – 60 + 0 = 159.
Therefore the current average age of all the people in the family159 + 32 /  24
8 years.

Sep 30, 2012

Permutations Combinations.: Distribution of Alike objects

P&C : Distribution of alike objects


Distribution of alike objects
In last article, we found that number of ways in which n identical things can be distributed into r different groups is equivalent to distributing n identical one rupee coins among r beggars when each beggar can get zero or more coins .The number of ways of doing this is
We should know few basics regarding binomial theorem before solving difficult problems of combination with repetition
Binomial theorem for general index
(A).      (1+x)n = 1+ nx + n(n–1)/2! x2 + . . . + n(n–1)…(n–r+1)/r! xr + … terms upto ∞
(B). General term of the series (1+x)-n = Tr+1 = (-1)r xr n(n+1)(n+2)…(n+r–1)/r! xr
(C). General term of the series (1-x)-n = Tr+1 = n(n+1)(n+2)…(n+r–1) / r! xr
Coin – beggar analogy worked well as the questions which we did had only one constraint that is number of coins are bounded below by some constant. But what if, we have questions involving 2 sided constraints.
Before going into that, let us understand distribution of identical objects once again mathematically also with help of example below
Example : Find the number of ways of distributing 3 identical coins to 2 beggars?
Solution:
By previous article we know the number of ways of doing this is same as finding non negative integral solutions of the equation
a+ b = 3 where each of a and b is greater than or equal to zero and the number of ways are
Or infact we could have directly calculated possible solutions are
0 + 3,1+2,2+1,3+0 are the 4 possible solutions                                     (1)

Let us try to analyze it some other way
We try calculating coefficient of x3 in the expansion of (x0+ x1+ x2+ x3) (x0+ x1+ x2+ x3)
Now clearly terms containing x3 will be obtained by multiplying
x0. x3, x1. x2, x2. x1, x3. x0,
which clearly corresponds to solutions obtained in equation  (1)
i.e .We can clearly see now calculating coefficient of x3 in the expansion of
(x0+ x1+ x2+ x3) (x0+ x1+ x2+ x3) is equivalent to distributing 3 identical coins to 2 beggars
NOTE
As per coin beggar story  we looked at coefficient of xin expansion of
(x0+ x1+ x2+ x3) (x0+ x1+ x2+ x3)
(i.e. they were multiplied only twice as number of beggars were only two)
Powers of x varies from 0 to 3 which shows that every beggar can get  minimum zero  and can get atmost 3 coins.
GENERALISATION:
Now we say , distributing n identical one rupee coins among r beggars when each beggar can get zero or more coins equals
Coefficient of xn in the expansion of
(x0+ x1+ x2+ x3+……………….+ xn) (x0+ x1+ x2+ x3+……………….+ xn) …………………………………………(x0+ x1+ x2+ x3+……………….+ xn)  upto r times
{i.e. they were multiplied r times as number of beggars equals r and
Powers of x varies from 0 to n which shows that every beggar can get  minimum zero  and can get atmost n coins }

Note
So as per coin beggar story powers of x varies from 0 to n shows that every beggar can get zero or more coins and can get at most n coins(which was obvious as total number coins were n only).But lets see some problems which we cannot solve directly by coin beggar story
Let us cover few more difficult problems involving two sided constraints i.e. number of coins which each beggar has is bounded below and bounded above also.
QUESTION 1:
In how many ways can 3 persons, each throwing a single dice to have a total score of 14?
SOLUTION:
Let us relate this question to the story of beggars we learnt in previous article.In this, we have to distribute 14 coins to 3 beggars under the condition that each beggar should have atleast 1 coin and atmost 6 coins.Solving this question directly would be difficult as no of coins which each beggar should have is bounded by lower and upper constraint i.e.
1≤no of coins with each beggar ≤ 6
So we solve mathematically by saying that this is equivalent to calculating
= Coefficient of x14 in the expansion of (x1+ x2+ x3+ ………..+ x6)
(x1+ x2+ x3+ ………..+ x6) (x1+ x2+ x3+ ………..+ x6)
= Coefficient of x14 in the expansion of (x1+ x2+ x3+ ………..+ x6)3
= Coefficient of x14 in the expansion of   x3(1+x1+ x2+ ………..+ x5)3
= Coefficient of x14-3 in the expansion of (1+x1+ x2+ ………..+ x5)3
= Coefficient of x11 in the expansion of
(As 1, x, x2….x5 are in G.P.)
= Coefficient of x11 in the expansion of (1 -3 )(1+ 3x + 6x2+ ………..+21 x5+……78x11+…..)
=78-21(3)
=15
QUESTION 2:
An Examination has four papers A,B,C and D .Each paper has maximum of 10 marks .Find the number of ways in which student can score 15 marks in the examination if a student is required to score atleast 1 mark from paper A, atleast 2 marks from paper B, atleast 3 marks from paper C, atleast 4 marks from paper D ?
SOLUTION:
So as per our story we have to distribute 20 coins to four beggars in such a way that
1≤no of coins with beggar A≤15
2≤no of coins with  beggar B≤15
3≤no of coins with beggar C≤15
4≤no of coins with  beggar D≤15
So keeping above conditions in mind, mathematically it is equivalent to calculating
Coefficient of x15 in the expansion of product of (x1+ x2+ x3+ ………..+ x10)
(x2+ x3+ ………..+ x10)(x3+ x4+ ………..+ x10)(x4+ x5+ ………..+ x10)
= Coefficient of x15 –(1+2+3+4) in the expansion of (1+ x+ x2+ ………..+ x9)
(1+ x+ x2+ ………..+ x8)( 1+ x+ x2+ ………..+ x7)(1+ x+ x2+ ………..+ x6)
= Coefficient of x5 in the expansion of (1+ x+ x2+ ………..+ x9)
(1+ x+ x2+ ………..+ x8)( 1+ x+ x2+ ………..+ x7)(1+ x+ x2+ ………..+ x6)
Neglecting the higher powers i.e. powers which are greater than x5



QUESTION 3:
In how many ways Santa Claus can distribute 28 chocolates to 7 kids giving not less than 3 chocolates to any kid?
SOLUTION:
If Santa gives 3 chocolates each to six kids then the number of chocolates received by the seventh kid=28 – 3(6)= 10
If xi denotes the number of chocolates received by  i th kid then as per the given condition
X+ x+ x+ x+ x+  x+ x=28 and each 3 ≤ 10 where i = 1,2,3……….7

So as per our story we have to distribute 28 coins to seven beggars in such a way that any beggar can have atleast 3 and atmost 10 chocolates. Mathematically it is equivalent to calculating


QUESTION 4:
Find the number of ways of distributing 15 balls in three boxes in such a way that each box contains at least 1 ball and also the number of balls in each box are unequal ?
Solution:
Let xdenote the number of balls in the i th box where i varies from 1 to 3.
We can put it in the form of equation as
x+ x+ x=15 where x1 ≥ 1, x2≥ 1, x3≥ 1 s.t. x,xand x3 are unequal.
Since we have to find unequal integral solutions of above equation so
without loss of generality we can assume x< x< x3
Let x1= x  , x2= x +y ,  x3=  x2+ z= x +y+ z
Putting the values of x,x2 , x3 in the given equation we get
x + x +y+ x +y+ z = 15
3x + 2y + z = 15
Number of positive integral solutions of equation
=Coefficient of x15 in the expansion of product of
(x3+ x6+ x9 +………..)(x2+ x4+ x6 +………..)(x1+ x2+ x3+ ………..)
(Because since x varies from 1 ,2,3,4………….. Therefore 3x varies from 3 ,6,9,12…………..Similarly since y varies from 1 ,2,3,4………….. Therefore 2y varies from 2 ,4,6,8…………..)
=Coefficient of x15 –(3 + 2+1) in the expansion of product of
( 1+x3+ x6+ ………..)( 1+x2+ x4+ ………..)(1+x1+ x2+ ………..)
=Coefficient of x9 in the expansion of product of
( 1+x3+ x6+ x9 )( 1+x2+ x4+ x6 +x8 )(1+x1+ x2+ x3+ x4+ x5+ x6+ x7+ x8+ x9)
(After neglecting powers higher than x9)
= Coefficient of x9 in the expansion of product of
(1+x3+ x6+ x9 +x2+ x5 +x8+x11+ x4+ x7+ x10+ x13+ x6+ x9+ x12+ x15+x8+ x11+ x14
+ x17)(1+x1+ x2+ x3+ x4+ x5+ x6+ x7+ x8+ x9)
=(1+x2+x3+ x4+x5 + 2x6+ x7+2x8+2 x9 + x10+2x11+ x12+  x13+ x14+  x15+ x17)(1+x1+ x2+ x3+ x4+ x5+ x6+ x7+ x8+ x9)
=2+2+1+2+1+1+1+1+1+1
=12
But x,x2, xcan be arranged in 3! ways.
Hence required number of solutions is (12)(3!)=72
QUESTION 5:
How many natural numbers between 1 and 10000 have sum of digits as 12?
Solution:
Any number between 1 and 10000 will be four digit number hence it must be of the form `abcd`
where each of a , b ,c and d  varies from 0 to 9
i.e. 0≤ a,b,c ,d≤9


QUESTION 6:
Find the number of ways in which 30 letters can be selected from 20 A`s , 20 B`s and 20 C`s ?
Solution
Let xA`s ,  xB`s and  xC`s be selected
We have
x+ x+ x=30   where    0 ≤ x_1,x_2,x_3≤20
Thus the number of ways
Questions for practice
Q1 Find the number of positive unequal integral solution of the equation
x+ x+ x+ x=20 ?
Ans 552
Q2 How many natural numbers between 1 and 10000 have sum of digits as 12?
Ans 25927
Q3 In how many ways can 3 persons, each throwing a single dice to have a total score of 11?
Ans 27
Q4 . In how many different ways can 30 chocolates be distributed to 10 children if each child should have atleast two chocolates?
Ans
Q5 Find the number of ways in which 24 letters can be selected from 16 A`s , 16 B`s and 16 C`s ?
Ans 217