Some of the factorials that might speed up your calculation are: 0! = 1; 1! = 1; 2! = 2; 3! = 6; 4! = 24; 5! = 120; 6! = 720; 7! = 5040.

Funda 1: Rightmost non-zero digit of n! or R(n!) R(n!) = Last Digit of [ 2 x R(a!) x R(b!) ] where n = 5a + b Example: What is the rightmost non-zero digit of 37! ? R (37!) = Last Digit of [ 2 x R (7!) x R (2!) ] R (37!) = Last Digit of [ 8 x 4 x 2 ] = 4
7 a

Example: What is the rightmost non-zero digit of 134! ? R (134!) = Last Digit of [ 2
26

x R (26!) x R (4!) ]

R (134!) = Last Digit of [ 4 x R (26!) x 4 ] We need to find out R (26!) = Last Digit of [ 2 x R (5!) x R (1!) ] = Last digit of [ 2 x 2 x 1 ] = 4 R (134!) = Last Digit of [ 4 x 4 x 4 ] = 4
5

Funda 2: Power of a prime p in a factorial (n!) The biggest power of a prime p that divides n! (or in other words, the power of prime p in n!) is given by the sum of quotients obtained by successive division of n by p. Example: What is the highest power of 7 that divides 1342! [1342 / 7] = 191 [191 / 7] = 27 [27 / 7] = 3 Power of 7 = 191 + 27 + 3 = 221

Example: What is the highest power of 6 that divides 134! ? As 6 is not a prime number, we will divide it into its prime factors. 3 is the bigger prime, so its power will be the limiting factor. Hence, we need to find out the power of 3 in 134! [134/3] = 44

 [44/3] = 14 [14/3] = 4 [4/3] = 1 Power of 3 in 134! = 44 + 14 + 4 + 1 = 63

Example: What is the highest power of 9 that divides 134! ? As 9 is not a prime number, we will divide it into its prime factors. 9 is actually 3 . The number of 3s available is 63, so the number of 9s available will be [63/2] = 31. Highest power of 9 that divides 134! is 31.
2

Highest power of 18 and 36 will also be 31. Highest power of 27 will be [63/3] = 21.

Note: To find out the highest power of a composite number, always try and find out which number (or prime number) will become the limiting factor. Use that to calculate your answer. In most cases you can just look at a number and say that which one of its prime factors will be the limiting factor. If it is not obvious, then you may need to find it out for two of the prime factors. The above method can be used for doing the same.

Funda 3: Number of ending zeroes in a factorial (n!) Number of zeroes is given by the sum of the quotients obtained by successive division of n by 5. This is actually an extension of Funda 1. Number of ending zeroes is nothing else but the number of times n! is divisible by 10 or in other words, the highest power of 10 that divides n!. 10 is not a prime number and its prime factors are 2 and 5. 5 becomes the limiting factor and leads to the above-mentioned idea. Example: What is the number of ending zeroes in 134! ? [134/5] = 26 [26/5] = 5 [5/5] = 1 Number of ending zeroes = 26 + 5 + 1 = 32 I hope that this gets you started with factorials and you might start singing this song.

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 C 5 ways. 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 C 5 = 2 x 56 = 112 ways.
8 8 n

Funda 2: Partitioning

n identical items No restrictions: inr distinct No group empty: groups n distinct objects inr distinct groups No restrictions:

n+r-1 n-1

C r-1

C r-1

rn

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

C 2 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

C 2 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 5 4 choices each. So, the total number of ways of distribution is = 4 x 4 x 4 x 4 x 4 = 4 . This is n 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