You are on page 1of 9

# 256! is expanded and expressed in base 576 .

how many zeroes will this expression have on its right end?

such questions are same as finding maximum power of 576 in 256! 576 = 2^6 x 3^2 to get six 2s i have to travel eight places...1x2x3x4x5x6x7x8 has seven 2s. but to two 3s i have to travel only six places...1x2x3...6 has two 3s...hence 2 will be the constrain. total 2s in 256! = 255 hence, no. of zeroes = 256/6 = 42. just to check...3s = 126, 126/2 = 63>42 ans-42

Type # 4 What if there is no relation between divisors n remainders? e.g. find the smallest no. that leaves remainders 1 with 5, 4 with 7, 6 with 11 and 7 with 13. we can c...there's no relation among these divisor-remainder sets...neither is the remainder constant...nor is the difference b/w divisor n remainder a constant. in such cases...take 1 case n target another case... e.g. i take the case 7 with 13...and target 6 with 11. which is the smallest no. that leaves 7 with 13? 7 itself...right? so all nos of the form 7 + 13k will give 7 rem with 13. now am targeting 6 with 11...so i divide 7 + 13k by 11...i get remainder 7 + 2k...now 7 + 2k = 6,17,28,39,50...so that the remainder with 11 is 6. a no. that gives integral value of k is 17 i.e. 7 + 2k = 17. hence, k =5 and the no. that satisfies these two conditions is 7 + 13 x 5 = 72 now that 2 conditions are fulfilled, lets target a third condition...say 4 with 7. to 72, if v add lcm of 11, 13 i.e 143, 2 conditions awready satisfied wud continue being satisfied... hence the no. is of the form 72 + 143 k. 72 + 143k % 7 = 2 + 3k

now 2 + 3k shud be = 4,11,18,25,32... to satisfy the condition of 4 rem with 7.. a no. that gives integral soln is 11..i.e. 2 + 3k = 11, k = 3. hence, the no. that satisfies all 3 conditions is 72 + 143 x 3 = 501. now if v see carefully...4th condition...remainder 1 with 501 has already been satisfied...so the no. v have been looking for is 501.

Hi Puys! Here is something i used and doubt if many are aware of... This is a method to divide quickly (very Quickly ) and get results with amazing accuracy... But let me forewarn you, it needs good amount of practice before you can even think of trying it in exam hall... And yes, this is not my creation. Credits to Rahul and company who shared this with me 2 yrs ago so here we Go!!! The approach would be to get the denominator to either a 100 or a 1000 because that is what percentages is all bout. Simply focus on the fact that how do the given denominators reach 100/1000. I have left some blank because they are very obvious. The following are the stations between 100 and 1000 100 111 125 133 150 166 182 200 222 250 273 300 333 364 400 455 500 555 600 666 700 750 800 833 875 900 910 950 1000

Reduce 10% Multiply by 8 Reduce 1/4 Reduce 1/3 Multiply by 6 Add 10% Reduce 10% Add 10% Reduce 10%

Add 10% Reduce 10% Add Half Add 1/3 Add 20% Add 1/7 Add 9% Add 5%

So Task (1) you have to mug up the values of these stations. It is very important that these values are memorized because this will help you in knowing which number to reach from any given number. e.g. if the denominator is 887 you know you have to reach for 900 or 875 and so on.

Task (2) Practice! Below is an approach to tackle (three digit /three digit) with consummate ease. We shall attempt to understand it with examples. Example 3: 532/745? Tough??? This's how it can be approached: # Nearest station.........750.................so add 5..............about 1% or less..add 1% damnit # Numerator now is 537.............(added 1%) # Fraction is 537/750 add 1/3 each...........it is 71 something. Remember here don't even attempt to do...537/3. Because denominator is a 1000 and not a 100. So one digit is redundant. So all I do is........53/3 approx..18...plus..53 = 71%..(will do if answer are spaced...) answers not spaced? Then 537 +537/3 = 537+179 = 716 which makes it 71.6 (calculator is 71.5) Dont worry if the last few statements were difficult to digest. Try solving a few questions and you'll get the crux of it. Remember in CAT we don't find answers... we choose them! Happy Computing

Solve these............

Okay.. These are one of the more trickier problems in Quants... Problem #1 A person walking takes 26 steps to come down on a escalator and it takes 30 seconds for him for walking. The same person while running takes 18 second and 34 steps. How many steps are there ?? Problem #2 An escalator is descending at constant speed. A walks down and takes 50 steps to reach the bottom. B runs down and takes 90 steps in the same time as A takes 10 steps. How many steps are visible when the escalator is not operating? Problem #3 There is a escalator and 2 persons move down it. A takes 50 steps and B takes 75 steps while the escalator is moving down. Given that the time taken by A to take 1 step is equal to time taken by B to take 3 steps, find the no. of steps in the escalator while it is staionary.

Problem #4 Rahul walks down an up-escalator and counts 150 steps. Aarav walks up the same escalator and counts 75 steps. Rahul takes three times as many steps in a given time as Aarav. How many steps are visible on the escalator? (a) 180 (b) 150 (c) 210 (d) 120

concept: to have first n last term as the given terms...the difference b/w the two terms shud be divisible by the common difference. so u basically have to find how many such common differences exist...for every common difference...u'll get a new AP. for practice, lets take a small interval [1,15] the difference is 15-1=14. now 14 is divisible by 1,2,7,14...four different integers... so v can have four different APs...if v take a common difference other than these four values...the last term wont lie in that AP. e.g if v take the common diff = 4, the AP wud be 1,5,9,13,17...see 15 didnt lie... so, 4 APs are possible. now if a conditions is attached...there shud be atleast three terms...it means that AP with 2 terms shud be neglected... 1,15 is an AP with jus 2 terms...so it shud be beglected...remember, an AP with 2 terms always lies in any interval. so the answer wud be 4-1 = 3 if the condition is atleast four terms...then the AP with 2 terms as well as the AP with 3 terms shud be neglected. we know that an AP with 2 terms is bound to exist...lets c if an AP with 3 terms also exists. an AP with 3 terms will look like... 1, x, 15 see...there are 2 intervals... x-1 and 15-x. hence for a 3 term AP to exist, the difference shud be divisible by 2. since 14 is divisible by 2, we further reduce the answer by 1...so APs with atleast 4 terms are 3-1 =2 now, if the conditions is...atleast 5 terms...v need to check if AP with 4 terms exists... such an AP wud luk like... 1, x, y, 15 see, there are 3 intervals...since 14 is not divisible by 3, such an AP does not exist. so the answer remains 2. similarly, for atleast 6 terms, v check if 14%4 = 0...since no, the answer is again 2 for 7 terms 14%5 is not 0, the answer is 2 for atleast 8 terms...14%6 is not 0 so the answer is again 2. for 9 terms, 14%7 = 0. hence answer becomes 2-1 =1 keep on proceeding like this...the soln wont be so bulky...its been done like this for ease of understanding...for ease of calculation...see how to proceed...

how many A.Ps are possible such that first term is 1235 and the last term is 3535 and there are atleast... 5. 3 terms 6. 4 terms 7. 5 terms

8. 6 terms

3535 - 1235 = 2300. 2300 = 23x2^2x5^2 . hence, no. of factors = 3x3x2 = 18. (check yesterday's concept if missed) how many APs...18. how many with atleast 3 terms? since 2300%1 = 0, 18-1 = 17 how many with atleast 4 terms? 2300%2 = 0, hence 17-1 = 16 how many with atleast 5 terms? 2300%3 =/ 0, answer remains 16. where =/ means not equal to how many with atleast 6 terms? 2300%4 = 0, 16-1 = 15 how many with atleast 7 terms? 2300%5 = 0, 15-1 = 14 how many with atleast 8 terms? 2300%6 =/ 0 , answer remains 14 how many with atleast 9 terms? 2300%7 =/ 0, answer remains 14 and so on... to check for atleast n terms, v need divisibility till n-2...i'll appreciate if u dont cram...but understand it...i've neva learnt it...its jus an observation... so, the answers to above 3 questions wud be 17,16,16,15.

finally... How many values of a are possible if x^2 + ax + 2400 has... 9. integral roots 10. roots which are natural nos.

## this is an actually tricky problem...sad that nobody came up with this...see...

concept: to solve ax2 + bx + c =0, we break it as ax2 + mx + nx + c = 0, such that m*n = a*c.

here, a*c = 1*2400 = 2400. so v need to find in how many ways can 2400 be expressed as product of 2 nos. every such pair of nos. will give a new value of the coefficient of x. 2400 = 2^5 x 5^2 x 3 no. of factors = 6x3x2 = 36. but these factors have to exist in pairs...e.g when v use one factor 2 (to express 2400 as 2x1200) the other factor...1200 is automatically used...so total pairs possible are ... 36/2 = 18. but relax...this is not it....again...equal no. of negative pairs exist...i.e. 2x1200 corresponds to -2 x -1200. although the product is same as the reqd product i.e 2400...the sum is different...its 1202 n -1202...n v need to find different values of sum...hence the answer wud 18x2 = 36 again... 9. integral roots 10. roots which are natural nos. 9. for integral roots...the answer wud be 36 10. values wud be 1/2 the total possible values as negative roots aint allowed...36/2 = 18 is the answer

how many different values can 'A' take if x2 + Ax + 2500 has ... 10. integral roots----16 2500 = 2^2 x 5^4. hence no. of factors are 3x5 = 15. no. of pairs = {15 / 2 } = 8. {} = least integer function...plz check...rounded it off to higher value...the value is odd because of 50 x 50 = 2500...giving only one combiantion seen both wat...while other combinations give 2 different cominations when the order is changed...for example...250 x 10 and 10 x 250... but 50 + 50 will give a new sum 100...so it shud be counted. so the answer in above case wud be {15/2}x2 = 8x 2 =16. for better understanding...lets take one more example with smaller value of a x c. e.g. x2 + Ax + 4 = 0. A can +/- (2+2 or 4 +1)...so 4 combinations...while 4 = 2^2...hence having 3 factors...to get the answer, we'll perform the following opeartn...{3/2} x 2(for negative counterparts) = 4.

11. negative roots----infinitely many great job rockeezee...its not mentioned negative integral roots...so infinitely many... i know many of u tuk out answer bcoz of faith in my typing errors...n must have thought that i forgot to type integer...well, in that case..the answer is 16/2 = 8. as 0 cannot be a root of above expression.

One of the smaller sides of a right angled triangle is (2^2)*(3^3)*(4^4)*(5^5)*(6^6)*(7^7) . It is known that other two sides are integers.How many triangles of this type are possible.

The approach mentioned was: the given number is 2^16 * 3^9 * 5^5 *7^7 a^2 = c^2 - b^2 = c-b * c+b both c-b and c+b be either odd or even ..but here both cannt be odd.. so both even to write as a product of 2 numbers we can use all powers of 2 excepth the 32th power.. so no of triangles = (31*19*11*15 -1 )/2 I did not understand the highlighted part... could someone plz explain this or any other approach to solve the ques.???? well i thought dis ques was worth a discussion in this thread vanis query was also not ans der.. i too hv the same query i think the ans should be 17*10*6*8-1/2 number of ways the samller side cn be expressed as a product of two no
hi rock...thanx for bringing this to the thread... this question has to do with a concept i've already discussed on this thread...concept of factors...yeah...this question has lotsa twists n turns attached. the final answer given by whoever answered it is correct but the xplanation has more than one mistake...seems the question was solved after seeing the correct answer...another mal-practice that must be avoided...lets have an elaborate discussion... the given number is 2^16 * 3^9 * 5^5 *7^7 a^2 = c^2 - b^2 = c-b * c+b for convenience, take c-b = t, c + b = u. both t and u shud be either odd or even ..but here both cannt be odd (since a pythagorian triplet with hypotenuse = even n rest 2 sides = odd does not exist) so both even now a^2 = 2^32 * 3^18 * 5^10 *7^14. now, since both t & u are even, 2x2 already exists in t * u. so the powers of 2 which can be floated across 2 terms to be multiplies reduces by 2. i.e. 32 -2 = 30. now, the no. of ways in which pairs can be formed are 31 * 19 * 11 * 15. but lets not forget out of these cases, there lies a case when t = u....or lets say b = 0. that particular case shud be discarded... since the factors wud be used in pairs, answr shud be half the no. of factors...so the final answer is... (31*19*11*15 -1 )/2

## Questions for today..

1. last digit of 3677^400 - 689^84 2. last digit of 11^11 + 12^12....1000^1000. 3. Last 2 digits of : 233527 x 54725 x 64535379 x 64536247 x 63546342 x 435272599 x 7454453279 x 63546337 x 543624334547 x 74547459 x 7454373 x 6545347359 x 735473451...do i need to say....its tricky...not lengthy!! 6. Last non-zero digit of 25! 7. Last non-zero digit of 1! x 2! x 3!...15!

Find last 2 digits of... 8. 81^(371)^(372)^...(400) 9. 11 ^ (25)^(31)^(41)...(1001) 10. 7 ^ 2501. 11. 3^2537837.

If a+b+c=0,then the roots are 1 and If a+c=b, then the roots are -1 and If the roots are in the ratio m:n then

If one root is p times the other root then If one root is equal to the n th power of the other root then

If one root is square of the other, then If roots differ by unity, then

In todays paper there was an ambigous question In th LR sec... Though I am aware NDA'ss but still feel it is necessary to bring this issue Up... Question was: 6 dice were rolled simultaneously...Cond'n are: 1: only 1 dice will have 6 as result. 2. At most,exactly 3 dice's can have 4 or more on its faces after rolling.

3. Exactly 3 dices will have 3 same no as result of rolling. 4. there will be exactly 3 distinct no. as result of rolling. Q1. Min sum on the six dices if the 3 dice with same no is 2. a. 21 b. 22 c. 16 d. 14 Q2. Max sum on the dice if the 3 dice with same no is 3. a. 25 b. 23 c. 15 d. 16