Natural numbers: the counting numbers {1, 2, 3, ....

} Whole numbers: zero, plus the counting number {0, 1, 2, 3, ... } Integers: the negative and positive whole numbers {... -3, -2, -1, 0, 1, 2, 3, ... } Rational numbers: Numbers of the form m/n, where m and n are integers and n is non-zero. (Note: All whole numbers are rational numbers because they can be expressed as themselves over 1, i.e. 5 = 5/1, 0 = 0/1, 1003 = 1003/1) Irrational numbers: Numbers which are not rational, and whose decimal representation neither terminates nor repeats (example: PI, sqrt(2) ). Real numbers: The set of all rational and irrational numbers. Complex numbers: For i^2 = sqrt(-1), all numbers of the form a + bi, where a and b are real numbers. All natural numbers are whole numbers. All whole numbers are integers. All integers are rational numbers. All rational numbers are real numbers. All irrational numbers are real numbers. All real numbers are complex numbers (i.e. can be expressed as "a + 0i".

The number of circles as well as triangles that can be drawn through n points in a plane, p of which are collinear is =nc3 - pc3 no. of straight lines can be drawn through n points p of which are collinear is = nc2 - pc2 + 1 maximum no. of points of intersection of n circles = np2 maximum no. of points of intersection of n straight lines = nc2 maximum no. of points of intersection of n straight lines and m circles intersect = nc2 + mp2 + 2.m.n

Funda 1: De-arrangement If n distinct items are arranged in a row, then the number of ways they can be rearranged such that none of them occupies its original position is, n! * ((1/0!) (1/1!) + (1/2!) (1/3!) + ((-1) /n!)) Note: De-arrangement of 1 object is not possible. Dearr(2) = 1; Dearr(3) = 2; Dearr(4) =12 4 + 1 = 9; Dearr(5) = 60 20 + 5 1 = 44 Example, A person has eight letters and eight addressed envelopes corresponding to those letters. In how many ways can he put the letters in the envelopes such that exactly 5 of them get delivered correctly? Solution, At first, select the five letters that get delivered correctly. That can be done in C5 ways.
8 n

Now, the other three must get delivered to the wrong address. That can be done in Dearr(3) = 2 ways. So, total ways is 2 x C5 = 2 x 56 = 112 ways.
8

Funda 2: Partitioning n identical items inr distinct groups n distinct objects inr distinct groups No restrictions: No group empty: No restrictions:
n+r-1 n-1

C r-1

C r-1

Arrangement in a group is important: (n + r -1)! / (r-1)!

Note: Other than standard distribution / partitioning problems, these ideas can be used to solve questions in which number of solutions are asked. Example, How many solutions are there to the equation a + b + c = 100; given that a) a, b and c are whole numbers. b) a, b and c are natural numbers. Solution, Case a) is identical to a case in which 100 identical chocolates are being distributed in three kids a, b and c. It is possible that one kid gets all the chocolates. In this case, we will use the formula for distributing n identical items in r distinct groups where n = 100 and r = 3. So, it can be done in
102

C2 ways.

Case b) is identical to one in which 100 identical chocolates are being distributed in three kids a, b and c. Every kid must get at least one chocolate. In this case, we will use the formula for distributing n identical items in r distinct groups where no group is empty and n = 100 and r = 3. So, it can be done in Example, In how many ways can you distribute 5 rings in a) 4 boxes b) 4 fingers Solution, First of all we need to identify the difference between distributing in boxes and distributing in 4 fingers. The distinction is that in case of fingers, unlike boxes, the order in which rings are placed matters.
99

C2 ways.

In Case a; Ring 1 can go in any of the four boxes, so it has four choices. Ring 2 can also go in any of the four boxes, so it has four choices. Similarly for Ring 3, Ring 4 and Ring 5; there are 4 choices each. So, the total number of ways 5 n of distribution is = 4 x 4 x 4 x 4 x 4 = 4 . This is essentially how the formula r is derived.

In Case b) Ring 1 can go in any of the four fingers, so it has 4 choices. Ring 2 can go in any of the four fingers but it has five choices. There is a finger, say F3, which contains the ring R1. Now, on F3, R2 has two choices it can go above R1 or below R1. So, the total number of choices for R2 is 5. Ring 3 can go in any of the four fingers but it now has 6 choices. Ring 4 can go in any of the four fingers but it will now have 7 choices. Ring 5 can go in any of the four fingers but it will now have 8 choices. So, the total number of way of distribution of rings is = 4 x 5 x 6 x 7 x 8 = 8! / 3! This is essentially how the formula (n + r -1)! / (r-1)! is derived.

Funda 3 Number of ways of arranging n items, out of which p are alike, q are alike and r are alike given that p + q + r = n OR Number of ways of distributing n distinct items, in groups of size p, q and r given that p + q + r = n Is equal to, n! / (p! * q! * r!) I hope that this would help you solve problems in the exam. May be the chocolate you end up getting is a Bournville. Maybe you would have earned it.

I would solve the question from AIMCAT1202 to clear the picture : Cars start in opposite direction with speeds 60km/h and 40km/h Relative speed = 100km/h Distance b/w them (d)= 120 km Time taken to cover (d) = 1.2hrs their meeting will go by the general formula ( 2n+1)d, so their next meeting will be when both of them cover distance of 3d,5d,7d.....so on Time taken to cover (2d) = 2.4hrs No of meeting in 20 hrs = [(20 - 1.2)/2.4 ] + 1 = 8 meetings. --------------------------------------------------------------------------------------------

There are 16 teams and they are divided into 2 pools of 8 each. Each team in a group plays against one another on a round-robin basis. Draws in the competition are not allowed. The top four teams from each group will qualify for the next round i.e round 2. In case of teams having the same number of wins, the team with better run-rate would be ranked ahead. 1. Minimum number of wins required to qualify for the next round _____? 2. Minimum number of wins required to guarantee qualification in the next round _____? Now, i don't know how many of you are aware of the following method. But 1 thing I mention in advance that this should take only 30 seconds to solve 1. 1 group is consisting of 8 teams. So each team will play 7 match each. Suppose each of the 8 teams were seeded and we consider the case where a higher seeded team will always win. So the number of wins for the 8 teams would be 7,6,5,4,3,2,1,0 with highest seeded team winning all and lowest seeded team losing all. For minimum number of wins we allow 3 teams to win maximum number of matches. Of the remaining 5 teams just find out the mean of their number of wins. In this case it would be (4+3+2+1+0)/5=2. So 5 teams can end up with 2 wins each and a team with better run rate will qualify with 2 wins. 2. In this case consider the mean of first 5 higher seeded teams (7+6+5+4+3)/5=5 So it may be the case that 5 teams can end up having 5 wins each. And hence 1 team will miss the second round birth. So minimum number of wins to guarantee a place would be 6.

1.

how many ways one can put (a) 4 different boll in 3 different bag (b) 4 identical ball in 3 different bag (C)4 different boll in 3identical bag (d)4 identical boll in 3identical bag 1) 4 identical balls in 4 identical bags: (This is easy one) 5 ways: (4, 0, 0, 0), (3, 1, 0, 0), (2, 2, 0, 0), (2, 1, 1, 0) or (1, 1, 1, 1) (2) 4 identical balls in 4 different bags: (This is also easy one) It is like this: a+b+c+d = 4 where a, b, c and d are number of balls in each bag. So, 7C3 ways (3) 4 different balls in 4 different bags: (This is also easy one) Each ball can go to one of the 4 bags. So, it has 4 choices. So, it will be 4*4*4*4.. 4 choices for each. So, 4^4. (4) 4 different balls in 4 same bags: (This is calculation bsed..) This is based on first case (1) (4, 0, 0, 0) => 1 way only (3, 1, 0, 0) => 4C3 ways

3 balls to be grouped can be chosen in 4C3 ways and remaining one in 1 way (2, 2, 0, 0) => 2 balls can be chosen in 4C2 ways. So, 6 ways. But, as we select 2, at the same time we make one more pair of remaing 2. So, at one time, we take care of 2 cases. So, we can take 4C2/2 = 3 ways. (2, 1, 1, 0) => 4C2 4C2 ways to chose 2 balls and then reaming will be 1 and 1. (1, 1, 1, 1) => 1 way only

--------------------------------------------------------------------------------------------------------------i am posting here to find out a possible solutions for equation let the eqn be 7x+4y = 41 to find out possible combinations , we are using remainder funda divide by 4 so rem(7x/4) = rem(41/4) hence x =3 thn find y= 5 its even better for much bigger values e.g. 99x+2y=5481 here rem(2y/99)=36 y =18 n find x now we can find a series of solutions to find next solution just cross add n subtract othr , 7x+4y=41 we got 1st solution as x=3 y=5 nxt solution will be (3+4,5-7)=>(7,-2) nxt will be (11,-9) we can reverse the operation n get solution in othr way means (4-3,7+5) this method will give u a possible solution sets fr equation hope it helps

If |x| +|y|=a then the area of the region bounded by the given curve will be 2a^2. This is also valid also when |x+k|+|y+k|=a Find the area of the region bounded by the graph |x-7|+|y-9|=12 (AIMCAT 1209) Area bounded by the graph |x-7|+|y-9| = 12 is same as Area bounded by the graph |x|+|y| = 12 and that is =>2*12^2=288 sq units

---------------------------------------------------------------------------------------------------------Some painted cube funda We assume the cube is divided into n^3 small cubes.

no. of small cubes with ONLY 3 sides painted : 8( all the corner cubes ) no. of small cubes with ONLY 2 sides painted : A cube is painted on 2 sides means, it is on the edge of the bigger cube ,and we have 12 edges, each having n cubes. but since the corner cubes are painted on 3 sides, we need to neglect them. so in effect, for each side we will have (n-2) small cubes with only 2 sides painted. thus, then number is, 12 * (n-2) no of small cubes with ONLY 1 side painted : for each face of the cube ( 6 faces ) we have (n-2)^2 small cubes with only one side painted. and we have 6 faces in total. so th number is, 6*(n-2)^2 no of small cubes with NO sides painted : if we remove the top layer of small cubes from the big cube we will end up a chunk of small cubes with no sides painted. this number will be equal to, (n-2)^3.

Also, remember for Cuboids with all different sizes, the following are the results: a x b x c (All lengths different) Three faces - 8 (all the corner small cubes of the cuboid) Two faces - There are two (a-2) units of small cubes on one face of the cuboid and there is a pair of such faces. Hence, number of such small cubes corresponding dimension a of the cuboid = 4(a-2). Similarly, for others. So, total with two faces painted = 4(a - 2) + 4(b - 2) + 4(c - 2) One face - Since each face of the cuboid is a combination two different dimensions, hence for the face which is a combination of a and b dimensions, the number of small cubes is 2* (a-2)(b-2) [multipliesd by 2 because there are 2 such faces for the combination] Similarly, for others. So, total with one face painted = 2(a - 2)(b - 2) + 2(a - 2)(c - 2) + 2(b - 2)(c - 2) Zero faces - The entire volume of small cubes except for two cubes in each of the rows and columns will not be painted at all. hence this is the simplest ... (a - 2)(b - 2)(c - 2) You can put different integer values for number of small cubes producing different edge lengths of cuboid to get varied results. To verify for a cube, put a=b=c=L, you get Three faces - 8 Two faces - 12(L - 2) One face - 6(L - 2)^2 Zero faces - (L - 2)^3

|x-a| + |x-b|......takes minimum value at median of a,b,c,d

a^n + b^n is div by (a+b) if n is odd 2. a^n - b^n is div by (a+b) if n is even 3. a^n - b^n is always div by (a-b)

These questions can be easily found in some or the other MBA exam, some might feel these are easy marks but for some these are leave alone type. So I would try to explain the concept a bit which might help you guys in tackling these questions. Starting from the very beginning for those who are unfamiliar to such questions. The question will be like, there are 64 players in a knock out tournament and every player is ranked (seeded) from 1 - 64. And now the matches are played in such a manner that in round one the 1st seeded player plays with the 64th, 2nd with the 63rd and so on. The players who win move on to the next round whereas others are out of the competition. In second round the winner of match 1 will play winner of the last match (which was between seed 32 and seed 33), and winner of match 2 will meet the winner of second last match in round 1 and so forth. Thus after N number of rounds winner is declared. In these Questions: the term UPSET means when a lower seeded player beats the higher seed. Now the Questions: I will start with basic and gradually move up: Q1: Which seeds will play Match no 4 and Match no 9 in Round 1 of a 32 player tournament? Ans: Easy: 4 Vs 29 & 9 Vs 24 resp Time for trick: Notice one thing the sum of the seedings in every match will be equal to total players + 1. i.e. 1 + 32 = 33, 2 + 31 = 33. In round of 64, sum of seeds will be 65, and in round of 16, sum of seeds will be 17. And so forth. (This will be useful in solving complicated questions) This way we can easily calculate the opponents in any round. For eg: If ques is: In a tournament of 128 players who will play 36 in round II if there are no upsets? No need to do any back calculations: Just see in Round 2 there will be 64 players. So the opponent of 36 will be = 65-36 = 29. Similarly u can calculate for anyone. Now this was without upsets, lets take a ques on upsets: Q: Who will meet Seed 68 in the Quaterfinals of a 128 format tournament, if seed 5 lost in the

prequarters and there was no other upset? Now the ques seems complicated but its not if we go step by step using the above method: try once to solve the ques urself and then read further: So We know Seed 68 is in Quarters that means he has defeated Seed 129 - 68 = 61 in round 1. Now 61 would have played 65 - 61 = 4 in round 2 (Which now 68 will be playing). Now, 68 has defeated 4 as well as he is in quarters. Now look at the quarters opponent of 4 (68 will be playing with him) - its 9-4 = 5. We know 5 has lost in pre quarters where his opponent was 17 - 5 = 12. So opponent of 68 will be 12. Once you are through with the concept these questions will be a cakewalk.

Five balls of different colours are to be placed in three boxes of different sizes.Each box can hold all five balls, The no of ways in which we can place the balls in the boxes so that no box remains empty?? sol:- 3^5 - 3c1*2^5 + 3c2 = 150 ways. The question mean that each box shld get atleast one. We do it using Principle of inclusion-exclusion.we include favorable cases and exclude unfavorable cases. Favorable cases are Total number of ways distributing 5 different balls to 3 different boxes is 3^5. Unfavorable cases are when two boxes not getting any ball.we have to exclude the distributions in this case,this can be done like this select any one box from 3 in 3c1 ways and distribute the balls to the remaining balls in 2^5 ways, hence total ways which we need to exclude is 3c1*2^5 and one more case is when one box not getting any ball, select two and distribute the balls to remaining box in 1^5 ways. hence it is 3^5 - 3c1*2^5 + 3c2*1^5 = 150 ways. Note:It is similar to finding number of ONTO functions. here's a general formula: n^m - nC1*(n-1)^m + nC2*(n-2)^m - nC3*(n-3)^m + ... +(-1)^(n-1)*nC(n-1)

Number System (Concept 2) Minimum cuts required in a cube to cut into K^3 pieces = 3*F[log2(K)], where F is the ceiling function (least integer greater than the number) For example , to make 27 pieces we must have 3*F(log2(3)) =>3*2 = 6 cuts To make 1 miilion pieces we must have 3*F(log2(100)) =>3*7 = 21 cuts only Note that these were not for making identical cuts...