Euler's Totient Eulers totient, (n), of a a number n is the number of positive integers less than or equal to n that are

coprime to n. If n = (p1)^a*(p2)^b*(p3)^c*......, where p1, p2, p3, .... are prime numbers then (n) = n(1 - 1/p1)(1 - 1/p2)(1 - 1/p3)..... For ex:147 = 3*7^2 (147) = 147(1 - 1/3)(1 - 1/7) = 84 Eulers's Theorem If {(a^(n)) - 1} is divisible by n, where (n) is Euler's totient of n and n is coprime to a. That means a^(n) = 1 (mod n) For ex:We have to find the remainder when 5^180 is divided by 209. Now, 209 = 11*19 => (209) = 209*(1 - 1/11)(1 - 1/19) = 180 => Since 5 and 209 are coprime, we can say that 5^180 = 1 (mod 209) Fermat's Little Theorem It is an extension of Euler's Theorem. If in Euler's theorem n is a prime number, then a^(n - 1) - 1 will be divisible by n is a and n are coprime. We can see that (n), where n is a prime no will be:(n) = n(1 - 1/n) = n - 1 That why when n is prime we can write a^(n - 1) - 1 will be divisible by n. An application of Euler's Theorem Suppose we have number N having digit 'a' written 'k' times, where k is Euler's totient of 'n'. We have to find the remainder when N is divided by 'n' and it is also given that n and 10 are coprime N = aaa...a (k times) = (a/9)(10^k - 1) Now, since 10 and n are coprime, we can say that (10^k - 1) is divisible by n as k is Euler's totient of 'n'. Now since n and 9 are also coprime, we can say that

(a/9)(10^k - 1) will be divisible by n. That means any digit written (n) times will be divisible by n if n is coprime to 9 and 10 For ex:Find the remainder when 99999....9(54 times) is divided by 19. Now, we know that (19) = 18 and 54 = 3*18 and also 19 is coprime to 10 and 9. Hence we can say that:99999....9(54 times) is divisible by 19

The approach I apply for this kind of prob is of %age and u really need to be very fast and calculative for this. Consider 117/229. Now its obvious from numerator(N) and denominator(D) that the value is somewhere around 50%. 1%=2.29 and 10%=22.9 =>50%=114.5 now whats left is (117-114.5)/2.29 2.5/2.29 Again it comes out around 1 So the value would be 51.XXX Now to find that .XXX u need to do some calculations finally (2.5-2.29)/2.29 =0.31/2.29 = 0.135(upon solving) Here too the same approach can be followed but be cautious while dealing with decimals. (.31-.229)/2.29 = .1XX Ando so on. U can at times approximate decimal part coz generally the fractions given dont vary that minutely. But then again u need fast calculation. And it comes out to be 51.135% Similarly you can find the value for others too. See half the work is done as u see through the N & D. Just make out a division result in %age.

If a number N, upon division with 7,8,9 leaves remainder 2,3,4 then We can find that number N using Chinese Remainder Theorem. N can be written as 7x+2 = 8y+3 = 9z+4 i) 7x+2 = 8y+3 = N1 7x-8y = 1 x = (1+8y)/7 => put y = 0,1,2 ... x is integer when y = 6 and here x is 7 N1 = 51 ii) LCM(7,8 )*m + N1 = 9z + 4 56m+51 = 9z + 4 9z - 56m = 47 z = (47+56m)/9 => (2 + 2m)/9 => m = 8 here z = 55 => N = 9*55 + 4 = 499 so, 499 is the least such number. For this question, you first need to understand Chinese remainder theorem and Euler's number. Say a number N can be expressed as N=a^x*b^y*c^z....... where, a,b,c... are the prime factors of N and x,y & z ....are the respective powers. And Euler of such numbers are expressed as, E(N)=N(1-1/a)(1-1/b)(1-1/c)...... e.g, Say, N=72 so 72=2^3*3^2 E(N)=72(1-1/2)(1-1/3)=24 Now according to Euler's theorem if the divisor and the dividend are co primes to each other then, (Dividend)^E(Divisor) mod Divisor =1 In that particular question 9 & 1000 are co-primes to each other so, 9^E(1000) mod 1000=1 E(1000)=400 So 9^400 mod 1000 =1 but here we have the power as less than 400 so there comes the Chinese remainder theorem.

Express 1000 as a product of two or more co-primes and divide the dividend by those factors 1000=8*125 so 9^100 mod 8=(8+1)^100 mod 8=1 So when we divide the number by 8 it leaves a remainder 1. So the number is in the form 8x+1 and 9^100 mod 125=1 [look here E(125)=125(1-1/5)=100) So the number is in the form 125y+1 (same reason as above) So according to Chinese remainder theorem we need to find the smallest number which follows both the condition,i.e, the number is in both the form 8x+1 & 125y+1. So 8x+1=125y+1 The smallest number which satisfy the equation is 1 where x=y=0. So the remainder would be 1 only. (Put value of x or y in 8x+1 or 125y+1 respectively where x or y give some integers) CONCEPT Say a person has to measure all the weights from 1 kg to 127 kg and only 1 side of a balance weight can be used to put the weights. What is the minimum number of weights that he needs? The highest weight that has to be measured is 127. The least power of 2 greater than 127 is 7(say n). Now the minimum number of weights required is n=7. These weights are in powers of 2. In this case the weights are 2^0=1, 2^1=2, 2^2=4, 2^3=8, 2^4=16,2^5=32, 2^6=64. Now let us that weights can be put in both sides of a balance weight. In this case the weights are in powers of 3. 3^0=1, 3^1=3, 3^2=9, 3^3=27, 3^4=81 and 3^5= 243. Hence the minimum number of weights required would be 6. Now attempt these questions: 1. Rooney had 3000 bananas with him and he had to take them to a market 1000 km away on his only camel, which can carry a maximum of 1000 bananas at a time. The camel eats 1 banana for every 1km, or a part thereof, that it travels while carrying the bananas.What is the maximum number of bananas that Rooney can take to the market? 2. There are 1000 bottles containing water. One of the bottle contains poison. There are 1000 prisoners available who are willing to drink the water in order to find out the bottle containing poison. Each person can drink the water only once from any bottle or any combination of bottles. (a).What is the minimum number of prisoners who must drink the water in order to determine the bottle containing poison? (b). Now minimum number of people are selected to drink the water. All those prisoners who survive after drinking water are set free. What is the minimum and maximum number of prisoners that will be set free?

i was taught by sumit sir once.. and i must say .. he with vikas sir are among the best quant teacher around in chandigarh here is one funda second last digit of a cube numbers ending in 0 -- 0 numbers ending in 1 -- 0 to 9 numbers ending in 2 -- 0,2,4,6,8 numbers ending in 3 -- 0 to 9 numbers ending in 4 -- 0,2,4,6,8 numbers ending in 5 -- 2,7 numbers ending in 6 -- 1,3,5,7,9 numbers ending in 7 -- 0 to 9 numbers ending in 8 -- 1,3,5,7,9 numbers ending in 9 -- 0 to 9

another one -1=1 35=8 7 9 11 = 27 13 15 17 19 = 64 notice something .. sum of odd numbers = cube ======================================== Suppose we have to find the number of ways in which an ordered pair (a, b), where a and b are natural numbers, can be choosen such that LCM of a and b is (p^x)*(q^y)*(r^z)*... Let a = (p^x1)*(q^y2)*(r^z3)*... and b = (p^x2)*(q^y2)*(r^z2)*... Since LCM of a and b is (p^x)*(q^y)*(r^z)*..., we can say that max(x1, x2) = x => one of x1 and x2 has to be x, this can be done in (x + 1)^2 - x^2 = (2x + 1) ways Similarly, max(y1, y2) = y => (2y + 1) ways & max(z1, z2) = z => (2z + 1) ways

So, total number of such ordered pairs = (2x + 1)(2y + 1)(2z + 1).. Had the question been that in how many ways two numbers can be choosen such that their LCM is (p^x)*(q^y)*(r^z)*..., then the answer would be {(2x + 1)(2y + 1)(2z + 1).... + 1}-1/2 -1 because the lcm itself is repeated only once .. all its factors repeated twice

CALENDARS BASICS 101 Many people do disasters when they face questions related to calculation of dates. So I am today posting some concepts on Calendars which can help u guys in calculating any day of any date or year. Firstly let me brush up some basics : (a) : A Leap year is a year which is divisible by 4. (b) : A Leap Century is a century which is divisible by 400. (c) : A century is a multiple of 100 i.e. 100,200,500,800 etc (d) : ODD DAYS : remainder obtained when divided by 7. (e) : Every Leap year has 2 odd days and Every ordinary year has 1 odd day. ODD days in a year or a no of years are the left over days which are extras and cant be filled within a week i.e. the days left when all the weeks are counted and is calculated as a remainder by dividing by 7. Calculation of ODD days Suppose we want to find the no of odd days within a century i.e. 100 years. -> the first step is to divide the century into no of leap years and ordinary years. -> 100 / 4 = 25 -> now in 25 years the 100th year is not a leap year becoz as i told a century shud be divisible by 400 to be a leap year. so subtract 1 from 25 i.e. 24 is the no of Leap years and (100-24) i.e. 76 is the no of ordinary years. -> 100 = 24 LY + 76 OY -> As i told every Leap year has 2 odd days and Every ordinary year has 1 odd day. So 100 = 24(2) + 76(1) = 124 odd days -> divide 124 odd days into weeks by dividing by 7 and we get 5 left odd days. Therefore we found a Century has 5 odd days. It is benificial to remember :

200 years = 3 odd days. (found using same method but subtract 2 dis time coz neither 100th year nor 200th year are leap years) 300 years = 1 odd day. 400 years = 0 odd day. and Every Multiple of 400 = 0 odd day or we can say a year repeats after 400 years (f) : Every year repeats after 400 years Now Some Examples : (a) Direct Method Q. 21st Jan 1932 was my birthday, which day was I born ? Solution: Remember, always find odd days till a year less and then calculate further for the year required. In dis case we calculate till 1931. 1931 can be written as 1600 + 300 + 31 years Now check odd days in all these years - we know 1600 years will have 0 odd days being a multiple of 400 - 300 years will have 1 odd day as i mentioned before - Now Calculate no of odd days in 31 years by the method i explained earlier. 31 years = 7 LY + 24 OY = 7(2) + 24(1) = 38 odd days = 3 odd days left. Total odd days = 0+1+3 = 4 odd days Now check year 1932. we require days will 21st jan 1932 = 21 days = 0 odd day Grand total of odd days = 4+0 = 4 odd days. Taking 0 odd day as sunday We see that 4 will be Thursday. dis means 21st Jan 1932 will be thursday. PS : This method is lengthy but will clear some basics CAT requires a method in which u may be knowing some day beforehand. (b) My Method Q1. My Dad was Born in 14th Nov 1984 and dat was Wednesday. I am his Son and

scheduled to be born in 15 Dec 2020. Can u tell me the day Solution : According to my method we can get the day in the same date of the required year i.e. 14th Nov 2020 -> 2020 - 1984 = 36 years -> find odd days in 36 years by the same method i explained before. -> 36 years = 9 LY + 27 OY = 9(2) + 27 = 45 odd days = 3 odd days left. -> Now add 3 more days to wednesday which gives us Saturday. -> So, 14th Nov 2020 will be a Saturday. But we Require 15th Dec 2020. So calculate days left upto 15th dec 2020 from 14th Nov 2020. Nov = 16 days Dec = 15 days Total = 16+15 = 31 days = 3 odd days left. Now Finally add 3 more days to Saturday which gives us Tuesday. Therefore 15th Dec 2020 will be a Tuesday. Q2. In the above Question If I was to be born in 15th Sept 2020 then wat shall be the day ?? Solution. We found 14th Nov 2020 will be a Saturday. We have to think that after 15th Sept 2020 we added some odd days to dat day and reached 14th Nov 2020 and found dat it was a Saturday. -> So let the day of 15th Sept 2020 be x. (x is the day like 0 is a sunday,1 is monday and so on) -> Sept = 15 days left, Oct = 31 days left, Nov = 14 days upto 14th Nov -> Total days = 60 = 4 odd days -> this means (x + 4)%7 = Saturday = 6 (becoz 6 is a saturday ) -> this means x-2 is divisible by 7 which means x shud be 2 (becoz 0 is divisible by 7) Now x=2 which means x is a Tuesday P.S : I have written dis post keeping in mind dat not everyone has a high IQ and made every statement and concept very clear for a layman to understand. P.S.S : I hope I have covered every important concept so guys thode bahot thanks maar dena agar achcha lage toh
if this date, month, year falls on this day ,on which day date fall? we often see questions like this..

there is a trick for this one .. jus a few additions and then division , u r done.. let me jus say it in few steps and then illustrate with an example

1.date , month , year are the inputs and among these date doesnt need to be converted to other number .. 2.for months , we need to remember a code for each month.. 733614625735... what i insist is that remember this number as 4 triplets - 733 , 614 , 625 , 735.. eg for august its 2 -- thats eighth number.. occtober its 7.. 3. for year , i take 1900 as reference .. so whatever year is asked , subtract it by 1900 .. eg 2008 , its 2008 - 1900 = 108... 4. difference got in previous step is divided by 28 and we need to note the remainder... eg 2008 - --- > 108 % 28 = 24 5. next is the code of 7 numbers for years which is easy to remember . first number 0 , next three first three odd number in descending order and then next three , first three even number in descending order thats 0 5 3 1 6 4 2.. the next question in ur mind , what for these number .. this is the code for years... 0 for remainder 0 5 for remainder 4 3 for remainder 8 1 for remainder 12 6 for remainder 16 4 for remainder 20 2 for remainder 24

lets say if the remainder is 26 what is the code for year ? we know for 24 its 2 , 26 = 24 + 2 .. so code is jus 2 + 2{ second two jus mere two - not any code} = 4 let me jus brush the year concept with one illustration. 1995 step 1 - 1995 - 1900 = 95 step 2 - 95 % 28 = 11 step 3 = 11 = 8 + 3 step 4 code is 3 + 3 = 6.. coming back to our problem , day now can be found by adding date , code for month and year... divide that final added value with 7 , if o is remainder its sunday , 1 - monday ..... 6 - saturday... let me wrap this up with a small example .. problem .. koushik was born on july 5th 1988 ..on what day he will celebrate his 21st bday ? obviously date is 1988 + 21 = july 5th 2009 let me do that with this method .. month code is 733614625735 year code : 2009 - 1900 = 109 .. 109 % 28 = 25 ====> 24 + 1 ------> 2 + 1 = 3 add the value : 5 (date ) + 6 (month ) + 3 (year) = 14 14 is perfectly divisible by 7.. so sunday ... hope this helps.

Last non-zero digit of a factorial. R(n!) = Last Digit of [ 2^a x R(a!) x R(b!) ] where n = 5a + b

Example: What is the rightmost non-zero digit of 25! ? a=5 and b=0 hence, R (25!) = Last Digit of [ 2^5 x R (5!) x R (0!) ] Now, R(5!)= 2^1 =2 as 5=5*1+0 i.e. a=1 R (25!) = Last Digit of [ 2 x 2 x 1 ] = 4

APPROXIMATION TECHNIQUES for DI The most important strategy in solving the DI questions in IIFT is Approximation technique. Let us take an example we easily come across computing values like 1617/1760. Here you should think of approximation, what one will do is reduce the numerator to 1600 and increase the denominator to 1800. And hence the approximate value should be 1600/1800 = 8/9 thus the value being equal to 88.88 %. And if we have two close answers like 89% and 92% ,we cannot definitely come to a conclusion. Hence we should tune our approximation. How to tune your approximation, let see here. If one changes the value of the numerator(Increase or Decrease), then an opposite change has to be incorporated in the final value. In our example we have reduced the numerator by 17. Hence we have to increase the final value and the extent of increase in value is computed by 17/1617 which is approximately 1 %. If one changes the value of the denominator(Increase or Decrease), then a similar change has to incorporated in the final value. In our example we have increased the denominator by 40. Hence we have to increase the final value and the extent of increase in value is computed by 40/1760 which is approximately 2.5 %. Hence the final value has to be adjusted by 3.5% which in our case would then turn out to be (approximately) 92%.