Documente Academic
Documente Profesional
Documente Cultură
http://www.pagalguy.com/forum/quantitative-questions-and-answers/23536-
concepts-total-fundas.html
#31
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.
100
111 - Reduce 10%
125 - Multiply by 8
133 - Reduce 1/4
150 - Reduce 1/3
166 - Multiply by 6
182 - Add 10%
200
222 - Reduce 10%
250
273 - Add 10%
300
333 - Reduce 10%
364
400
455 - Add 10%
500
555 - Reduce 10%
600
A Collection by ymafreak@PG Page 2
666 - Add Half
700
750 - Add 1/3
800
833 - Add 20%
875 - Add 1/7
900
910 - Add 9%
950 - Add 5%
1000
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.
Below is an approach to tackle (three digit /three digit) with consummate ease. We shall attempt to understand it
with examples.
Example 1:
What is 145/182 ------------------79.5
Steps
1. add 10% to numerator and denominator...
2. it becomes 159/200 ...............which is 79.5
( the answer from the calculator is 79.6)
Example 2:
123/178....???
Step1:- which station is closest to it?.............................200?...or some say 150. Either is good. (identification
took 2 seconds)
Step 2:- what do I have to do to go from 178 to 200/150..................add 22/subtract 28... (another 2 seconds.)
Step 3:- so if I add 22................i am actually adding slightly less than 13% of 178 to itself.
So 12% = 15?
So it becomes 138/200 = 69%?
(calculator answer is 69.1).
All you require to calculate is what is 10% 1%...and approx stuff...any damn calculation works in less than 8
seconds.:satisfie:
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.
Libocta
#35
Quote:
Can you orally find out cube roots? I know many of you may know this, but for the sake of those who do not...
lets say cube root of 328509??????
Fisrt of all lets find out whats the cube of all single digit numbers
1 cube = 1
Whoever undertakes to set himself up as a judge of truth and knowledge is shipwrecked by the laughter of the
Gods
Finding out smallest no. which leaves specific remainders with specific divisors.
#18
Type # 1.
find smallest no. other than k, that leaves remainder k when divided by w,x,y...
e.g. find Smallest no. other than 4, that leaves remainder 4 when divided by 6,7,8 or 9...
Type # 2
find smallest no. that leaves remainder 3,5,7 when divided by 4,6,8 respectively.
unlike last case, this time the remainder is not constant. but if u see carefully, difference b/w divisor n remainder is constant. i.e. 4-
3=6-5=8-7=1
in such questions, take lcm of divisors n subtract the common difference from it
Type # 3
we have just seen a way to tackle the first 3 conditions...the no. wud be lcm of 5,6,7 - 2 = 208
concept => to a no. if v add lcm of divisors...the corresponding remainders dont change.
i.e to 208, if v keep adding 210 ... the first 3 conditions will continue being fulfilled.
so, let 208 + 210k be the no. that will satisfy the 4th condition...viz (208 + 210k)% 11 = 1
208%11 = 10
210k%11 = k
e.g. find the smallest no. that leaves remainder 2 when divided by 3,4 or 5 and is divisible by 7
hence, 122 + 120k is the required no. which reduces to 3 + 2k when divided by 7...now 3+2k shud be a multiple of 7...easily, k=2 and
the required no. is 122 + 120 x 2 = 362
Type # 4
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.
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...
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.
For ease of calculation, start from biggest divisor n gradually move to smaller ones...u'll always see that last 1-2 conditions will
be satisfied automatically.
there are theorems for solving above questions...viz chinese theorem etc...but i solve such questions by the way i've suggested...i find
this approach very practical as the flow of nos. is very much visible...n i believe i can tackle any twist in the question devised by cat
makers thru this method...there are lotsa other questions based on this concept which i'll soon post but the basic concept remains the
same...
***dont let concepts go away believing such questions can be easily dealt with thru options...the question may not always be find the
smallest no. which...... at times it may be ..find the sum of integers of smallest no. which leaves remainders...blah blah...
****there may be a case when they put an option which satisfies all the conditions but is not the smallest poss value...n put another
option...our favorite...none of these!!! lets not undermine genius of cat makers!!
hope the post helps...puys...come up with ur own...sweet methods...which are confined in ur sharp brains...i'll also appreciate if u can
come up with feedbacks/suggestions...like today i thought its better to give answers a day late...
regards
maxximus
Smallest no. that must be subtracted from 1000 so that the resultant no. leaves remainders 1,3,4,8 with
divisors 2,6,5,13 respectively.
from yesterday's approach, v can find out...the smallest no. satisfying all 4 conditions is 99. now to 99 if v add
lcm of 2,6,5,13 i.e. 390, the remainders will remain unchanged.
so v need 99 + 390k such that the resultant value is just below 1000.
easily, for k=2, we get one such value....99+390x2 = 879.
Type#6
smallest no. that leaves remainders 3,2,4 when successively divided by 5,6,7 respectively.
Type#7
a no. leaves remainder 3 when divided by 5 and remainder 8 when successively divided by 11. what is the
remainder when this no. is divided by 55?
look at this question carefully...55 is lcm of earlier divisors 11,5... in such a case...the remainder with lcm as
divisor wud be constant.
an easy approach for this problem...start from the rear end...take a small no. that leaves rem. 8 with 11...lets take
8.
this 8 is quotient when the main no. is divided by 5...it also leaves remainder 3.
8x5 + 3 = 43
43%55 = 43 answer.
Find the largest no. that leaves same remainder when it divides 3398 and 6578.
the concept is very simple...to leave same remainder...difference between two dividents must be divisible by the
divisor.
i.e. 6578-3398 = 3180 shud be divisible by the divisor to leave same remainders.
Type#9
Find the largest no. that leaves same remainder when it divides 16009,9009,7509 and 14009.
the approach is same... take difference of the nos in ascending or descending order....
i.e. 16009-14009=2000,
14009-9009=5000
9009-7509=1500.
now to leave same remainder, each of the interval shud be divisible by the divisor.
Type#10
If a no. is divided by 15, it leaves a remainder 7, if thrice the no. is divided by 5, then what is the
remainder?
options...1,2,3,4,0
such questions are difficult to frame as one has to find a pattern b/w divisors n remainders...i know these
questions are easy n v all can crack it easily...but the reason y am putting it here is bcoz i have a very
short...practical approach for solving this question..
thrice 7 = 21
since, the no. shud give same result for all values that give 7 rem. with 15, its better to take sum value n solve it
hence, answer is 1.
kudos to vani for the active participation n gett'n most answers correct.
Today's questions...
1. smallest no. that must be added to 1000 so that the resultant no. leaves remainders 2,3,4,5 with 5,6,7,11
respectivelt
2. smallest no. that leaves remainders 1,2,5,6, when divided successively by 2,3,4,23.
3. smallest no. that leaves remainders 4 everytime when successively divided by 7,5,10,13 respectively.
4. a no. leaves remainders 2,5,3,7 when successively divided by 3,7,6,9. what is the remainder when this no. is
divided by 126?
5.find the largest no. that leaves same remainder when it divides 2345,7645,9845,6595 and 10095.
6.a no. when divided 88 leaves remainder 3. what is the remainder when its divided by 11?
7.a no. when divided by 391 leaves rem. of 49. find the remainder when its divided by 39...options 29,10,none
of these,cannot be determined.
#322
Remainder questions can be broadly divided into 2 types...
1). LCM based questions. e.g. a no. leaves remainders 3,2 when successively divided by 5,6...what will be the
remainder when this no. is divided by 30?
A Collection by ymafreak@PG Page 10
2). Power based questions. e.g. remainder when (31)^[(373)^(432)] is divided by 7.
we have already discussed type 1 in two parts...those who have missed it or wish to revisit the concept may use
the link below.
first half
second half
so what we're left to discuss is type 2 mentioned above...i think there are 3 ways of solving these questions...v
gotto use our own sensibility to c which approach suits where...
for better understanding, i'll divide this post into 3 parts...n will discuss one approach in each part...
nC0 x^n + nC1 x^(n-1)y^1 + nC2 x^(n-2)y^2 + .......... nCr x^(n-r)y^r + ..... nCn y^n
concept:
first term, i.e nC0 x^n is the only term that is independent of y and last term, i.e nCn y^n is the only term that is
independent of x. rest, all the terms are divisible by both x & y.
e.g. 28^37 % 9 = ?
see...v can express it as (27 + 1 )^37 % 9. now, since 27 is a multiple of 9, the only term that'll be independent
of 9 will be the last term i.e. nCn 27^0 * 1^n = 1.
important observation:
we know 1^ (any damn thing...even infinity) = 1 and (-1)^(anything) = 1 or -1 with even and odd values of
power respectively. so we'll try getting a form of (nD +/-1)^N. so that v r ultimately left with (+/-1)^N.
342^423 % 7 = ?
342%7 = 6.
so the question becomes...
6^423 % 7.
express 6 as 7 - 1.
(7-1)^423.
523^325 % 7 =?
=> 5^325 % 7.
= (-1)^108 x 5
529^700000 % 7
= 4^700000
(31)^[(373)^(432)] % 7 = ?
31 % 7 = 3
hence,
=(3)^[(373)^(432)]
= 3^3 ^ [(373^432)/3]
(373^432)%3 = 1.
I = (373^432 - 1)/3 and is of the form (odd-odd) / odd = even/odd = even for sure!!
(3^3)^(even I) x 3 % 7
= (-1)^even integer x 3 = 1 x 3 = 3
hence, remainder = 3.
in such questions, v try to reduce power by increasing the value of base and bringing it close to a multiple of
divisor.
e.g. 2^35 % 61 = ?
v know 2^6 = 64
2^6 % 61 = 3.
= 3^4 x 3 x 2^5
=3^4 % 61 = 20.
hence, 20 x 35 % 61 = 700%61
hope the concept helps...will shortly post the remaining 2 parts as well...
regards
maxximus
#52
Today's concept...few tricky questions on divisibility
concepts...
when last n digits of a no. are divided by 2^n, the remainder is same as the remainder when the entire no.
is divided by 2^n.
1. smallest no. that must be added to 1000 so that the resultant no. leaves remainders 2,3,4,5 with 5,6,7,11
respectivelt----667
3. smallest no. that leaves remainders 4 everytime when successively divided by 7,5,10,13 respectively.----872
4. a no. leaves remainders 2,5,3,7 when successively divided by 3,7,6,9. what is the remainder when this no. is
divided by 126?----80
5.find the largest no. that leaves same remainder when it divides 2345,7645,9845,6595 and 10095.----50
6.a no. when divided 88 leaves remainder 3. what is the remainder when its divided by 11? ----3
7.a no. when divided by 391 leaves rem. of 49. find the remainder when its divided by 39...options 29,10,none
of these,cannot be determined.---cannot be detrmnd
7. 32
8. 64
regards
Maximums
#59
Quote:
Originally Posted by junoonmba
Hey, Can anybody tell me the logic behind the following-----
The logic should be the same for the last funda given by maxximus.............
Why dont the digits from left hand side matters..??
regards
maxximus
concepts...
e.g 1260^4.
=>now add 1 to the powers of every prime no. n multiply them all...u get the total no. of factors of 1260^4.
leave power of 2 and multiply powers of all other prime nos after adding one to them.
#4 to find in how many ways can a given no. be represented as product of two relatively prime factors.
in this case, the power of prime no. becomes irrelevant as all the powers shud lie with the same factor else the
two factors wont be relatively prime.
now powers 8,8,4,4 have no importance...whats important is how many prime nos. are there...they are four...viz
2,3,5,7. hence 4.
similarly here, answer wud be 4C0 + 4C1 + 4C2 ...4C4 = 2^4 = 16.
but the factors have to exist in pairs...hence 2^4/2 = 8 factors are possible.
on a general note...a no. formed of n prime nos has 2^(n-1) pair of co-prime factors
6. 16----7
7. 32----23
kudos to irevani, gk who got all correct...so too to deep, rockeezee...who got jus 1 wrong....bhaiyon...if a
no. is divisible by 80...its obviously divisible by 40 n 20.
on the very simple fundas above, very tricky questions can be framed.
1. 16 factors
2. 12 factors
3. 60 factors
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
9. integral roots
regards
maxximus
#323
This approach is useful when the divisor is small or at times when it is a factor of 100.
3^327%7 = ?
3^1 % 7 = 3
3^2 % 7 = 2
3^3 % 7 = 6
3^4 % 7 = 4
3^5 % 7 = 4x3 % 7 = 5
3^6 % 7 = 5 x 3 % 7 = 1
3^7 % 7 = 1 x 3 % 7 = 3
remainder with first power is same as remainder with 7th power...hence v can say that cyclicity in remainders is
7-1 = 6.
so, 327 % 6 = 3,
326^524 % 9 =?
326 % 9 = 2
hence, 2^524
now,
2^1 % 9 = 2
2^2 % 9 = 4
2^3 % 9 = 8
2^4 % 9 = 7
2^5 % 9 = 5
2^6 % 9 = 1.
2^7 % 9 = 2
524 % 6 = 2
81^502 % 100
502 % 100 = 2.
similarly...this method can be effectively used when remainders are other factors of 100.
viz, when the factors are 20,25,50,100...knowing last 2 digits wud suffice knowing the remainders...we've
already discussed this concept while discussing cyclicity...
important: dont try this method when the divisors are complex...viz 37,73 etc...the cylicty wud come very late n
calculations will grow cumbersome...when divisors are complex, there must be sum other catch in the
question...look for that catch...e.g. last type discussed in the binomial method...
regards
maxximus
#325
Finding remainders using Euler's theorem.
(special thanks to junoonmba for this)
This method is very useful when the divisor and dividend are relatively prime numbers...
powers of the prime nos. have no significance...its jus the prime no. that matters...
euler's no (e for convenience) = divisor x (1-1/first prime factor) x (1-1/second prime factor) x ... (1-1/last prime factor)
= 40.
that means e for 100 = 40. or, in other words, 100 divisor will definetly show a cylicity of 40 in the remainders.
whenever the power of a relatively prime no. will be a multiple of 40, the expression wud show a remainder 1 with 100.
7^100 % 45 = ?
45 = 3x3x5
hence, 7^24 % 45 = 1
= 2401 % 45
with this, we have finished the conceptual part of remainders...now what we seek is practice...we need to solve a wide variety of
problems to improve our reflexes while choosing the best method for solving a question....
a sincere request to everybody around...please drop in the most difficult questions on remainders u've eva encountered...let's
solve them thru various approaches and discuss our solutions...for the coming few days...lets know remainders inside out...
regards
maxximus
stmt 1. p > q
stmt 2. q is not = 1. (edited...made q is not= 1, hint for all...whether its p not =1 or q not = 1, answer
remains unchanged)
stmt 1. p>q
stmt 2. p is prime.
5. is X > Y?
i hope we get them all soon...there's sum catch in every question....so come up with ur answers as well as
xplanations...
regards
maxximus
1. Going by the basics
Suppose we have r no. of rows and c no. of columns and they have f1, f2 flowers each respectively...
keeping f1=f2=f (say), we get, r X c X f^2, which may be or may not be equal to
3576876767576654544334538, hence statement 1 alone is not sufficient.
hence we get r X c X z^2, which again may be or may not be equal to 3576876767576654544334538 , hence
f1=f2=f and r=c=z, hence we are getting (fz)^2, which is a perfect square and hence can not have 8 as the last
digit ( credits to CAT 2007 ) and hence the number in question cannot be the solution...
keeping statement 1 and 2 together we get the no of flowers to be r X c X f1 X f2, which is an even quantity, so
both of them together also are not sufficient. Hence the answer is 5
3. statement 1 : p>q, now the p, being 17 and q being 2 and also p being 289 and q being 1 are few possible
options, that satisfy statement 1, but gives different (non-unique) solution for the equation in question.... hence
statement 1 alone is insufficient...
p=17, q=2
p=289^4, q=0.25, etc...
which give non-unique solution to the equation in question, hence statement 2 alone is also not sufficient...
p=17, q=2
p=289^4, q=0.25,
which, as explained for statement 2, are not sufficient to decide. hence the answer is 5
4. statement 1 : p>q, which as explained in the previous question is not sufficient alone.
statement 2 : p is prime, now there can be many possible values of p and q, i.e
p=3, q = (log 289/ log 3)
p=17, q = 2 etc...
which do not give the same result for the equation, in question.... hence statement 2 alone is insufficient
5. statement 1 : 2/5 X > 3/8 Y, or X > 15/16 Y, which does not tell whether X is greater than Y or not, for
example X can be 15.5 and Y can be 16 and also X can 17 and Y can be 16. So statement 1 alone is not
sufficient.
X > 0.9375 Y
The two statements are not satisfy, hence its not a possibility
I know that lots of the question(s) will be wrong, please tell the correct approach(es) for them....
Thanks
Mohit
#76
Today's concept...to solve tricky questions based on no. of factors of a number.
Despite the interest shown in the concept yesterday, not many cud solve the question efficiently...so, best concept for the day can be to
discuss yesterday's problems...have a quick, practical solution to them...and practice a lot of similar, different questions on same
concept. here we go...
1. 16 factors
2. 12 factors
3. 60 factors
questions are lil tricky...but if u get the concept...they become child's play...see how...
16 factors...that mean product of (powers +1) of all the prime nos = 16.
16
8x2
4x4
2x4x2
2x2x2x2.
by sheer common sense, v can say the highest power shud go to the smallest prime no. i.e. 2....and as v proceed,
smaller powers shud be given to higher prime nos.
Concept:
powers shud reduce and the corresponding prime nos. shud increase.
so...
first three nos can be easily discarded as they are too big...just calculate last two nos, they are 120 and 210...120
is smaller and hence the answer.
important: please avoid craming...in few cases last way might give best answer..in other cases, 2nd last
one...its always advicable to form patterns n check the closer ones.
2. 12 factors
similarly, Q3 also.
i realy wonder y nobody cud get this right...u just need to form combinations and check which
combinations give u cubes...they are 27000,27,1000, etc. am not discussing this question...i hope when i
give a similar question today...i get few correct answers.
This question is still open for answers/discussion (so are others...but if u can answer this...with an
xplanation, it'll be gr8 )
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
concept:
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...
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.
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.
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
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...
5. 3 terms
6. 4 terms
7. 5 terms
8. 6 terms
2300 = 23x2^2x5^2 . hence, no. of factors = 3x3x2 = 18. (check yesterday's concept if missed)
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...
9. integral roots
concept:
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.
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
Kudos to rockeezee...who got 5 correct answers...so too to junoonmba,vani for their active
participation!!! wud love to see all of u gett'n of the following correct today...
1. 20 factors
2. 36 gactors
3. 30 factors
how many APs are possible such that the first term is 2454 , last term is 4254 and there are atleast...
4. 5 terms
5. 7 terms
6. 10 terms.
how many different values can 'A' take if x2 + Ax + 2500 has ...
13. find the no. of factors 15! has (here comes the season of fresh concepts...which'll derive from older ones...he
he)
Happy solving!!!!!
1. 20 factors---240
2. 36 factors----1260
3. 30 factors----720
how many APs are possible such that the first term is 2454 , last term is 4254 and there are atleast...
4. 5 terms----33
5. 7 terms----31
6. 10 terms.----29
express it as 16^2 x 625^1 x 4...since 16, 625 have perf fourth roots...so will their cominations...i.e. 3x2 = 6 of
them.
express it as 8^3 x 125^1 x 10...since 8,125 are perfect cubes...their combinations wud yield perf cubes...their
no. are... (3+1) x (1+1) = 8
how many different values can 'A' take if x2 + Ax + 2500 has ...
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.
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.
...great job rock, junoon...try coming up xplanations as well...18! has 16 2s, 8 3s, 3 5s, 2 7s, 1 11, 1 13, 1 17.
added one to the no. of times each prime no. existed and multiplied them...
hope this post clears few concepts....wud suggest u all to kindly go thru this post n the original post once more
to cement the concept...
wud love to hear from u guys to make this thread more effective...as per the feedbacks so far, am trying to make
it slow n steady...
i know most of us wud know this....if v have few nos., 20,40,50,80,180...to find their LCMs, HCF...there's a slightly quick method...
20 = 2^2 x 5
40 = 2^3 x 5
50 = 5^2 x 2
80 = 2^4 x 5
180 =3^2 x 2^2 x 5
now to HCF, see highest power of all prime nos. that are common to all nos.
2-2
3- 0
5-1
to find lcm...see highest power of all prime nos across all nos.
2-4
3-2
5-1
2222....30 times.
3333....70 times.
for HCF..
take hcf of no. of time these nos. are being repeated...i.e. hcf of 30 n 70...thats 10.
For LCM...
take lcm of no. of time these nos. are being repeated...i.e. lcm of 30 n 70...thats 210.
2^300 - 1, 8^250 - 1.
the idea is..a^n - b^n is always divisible by a-b. so v need to find highest a-b that will divide a^n - b^n and smallest term that'll be
divisible by a^n - b^n.
to find hcf...
to find lcm....
Questions :
stmt 1 - a=72,b=4,c=6
stmt 2 - d= 8, e = 27.
regards
maxximus
#120 Solution
1.2222...250 times and 8888...300 times----22..50 times, 88..1500times.2. 333....120 times and 1111...400 times---11..40 times,
33..1200 times.
4. HCF of 33333...200 times. and 777777.....300 times --- 11..100 times, lcm is diff to find... (33333...200 times. * 777777.....300
times) / 11...100 times.
regards
maxximus
#129
Quote:
Originally Posted by Rockeeze
hi
was going thru the concept of lcm n hcf
type #2
222.........30 times
333..............70 times
the method is fine, but cud nt find a logic for taking the lcm of 30 n 70
22......... 30 times=2*111..........30 times
n 333......70 times=3*111.........70 times
similarly..
please note that 10 times is the max no. of times 11..can be written so that it divides both 30 times n 70 times...
while finding lcm, v need 11... as many times that 11...70 times as well as 11..30 times...so it shud be 111....210
times.
regards
maxximus
#127
Quote:
Originally Posted by Rockeeze
originally posted by iyervani 30.05.07
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.
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...
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.
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
maxximus
Type # 1:
concept:
Last n digits of any product depends on the product of last n digits. so just multiply last n digits of each term...find the
product, take last n digits of the product n multiply it with the next term...continue this for all terms.
3 x 4 = 12. dont worry abt 1 in 12. just remember 2 and multiply it with next no. 2 x 6 = 12. so 2, 2 x 1= 2, 2 x 2 = 4, 4 x 4 = 16.
so, the ans is 6.
03 x 04 x 06 x 01 x 02 x 04 = 76
trust me, last 4 digits wont be asked...as then it becomes bulky...questions in cat are tricky...
Type # 2:
look for the variation in last digit of higher powers of last digit of the base...i.e. 2 here.
2^1 = >2
2^2 => 4
2^3 => 8
2^4 => 6
2^5 => 2
so we can say that 2,4,8,6 will keep repeating...no. of different digits that the last digits of higher powers can take is known as
cyclicity. every digit has a cyclicity.
take,
432^43567.
Type # 3
when the last digit is 1,9,0,5...try finding a pattern in last 2 digits...u'll get one...then solve the question accordingly...
see, we again got 91 as last 2 digits...so v can say that the cyclicity of 91 for last 2 digits is 11 -1 = 10
see...
can v say that for all odd powers, answer wud be 01?
(49)^(37)^(38 )^(39)...(3700)%100 = ?
answer wud be 01%100 = 1
(49)^(37)^(38 )^(39)...(3700) % 20 = ?
answer wus be 01 % 20 = 1.
bcoz, to c remainder with 20, v need last 2 digits only.
this method might become tedious when the last 2 digits are unfriendly...like 37, 82 etc. but i have neva seen
such figures appearing in cat...to solve such figures, v need euler's or binomial...ill be taking it when v discuss
remainders...today's questions are based on the above concept only..
8. 81^(371)^(372)^...(400)
9. 11 ^ (25)^(31)^(41)...(1001)
10. 7 ^ 2501.
11. 3^2537837.
#137
hey maximus,
thnks for such great posts..
cud u just explain the above type 3 again..
thanks,
rushi
[/quote]
wud've been gr8 if u cud cum up with a specific doubt instead of a mere 'please repeat'... i think i was quite
lucid....if u can read the post 2-3 times, am sure u'll understand...or will atleast cum up with a specific
doubt...anyway...i'll try my best again...
see last 2 digits of base...n try finding a pattern in last 2 digits of its higher powers..
o1^1 = 01
01^2 = 01
01^3 = 01
so no matter wat is the power of last digits are bound to be 01. hence answer is 01.
23252399 ^ 54635372528263
99 ^ 1 = 99
99^2 = 9801
cn v say that wheneva power is odd, answer is 99...when its even, answer is 01.
hope its clear now...do feel free to revert...lemme know if its still murky..
about the next part...dont be confused...if u know last 2 digits of a no. i can find remainders with 100, 50 , 10,
20 , 25, by merely dividing last digits with the divisor...think for a while over this...u'll understand..
please read this as well as original post 2-3 times, the concept wud be cemented...in cat, we generally find
questions which are more tricky n less formula based...the examples taken here, as well as questions in today's
post form a gud set of tricky questions...
a sincere request to everybody...kindly read the posts more than one time when u aint able to undertsand a
concept...so that u know in which specific step u have a query...else i wud be unnecessarily elaborating over
concept awready clear...if the entire process is not clear, plz mention it...i'd tell sum other approach...but plz be
clear in the posts as to where exactly the doubt lies...that wud save a lot of time n space...
@rockeezee....u're absolutely right bro!!!..dont have to actually take an ex. if two nos are both even or both
odd...their sum as well as difference shud be even...just an observation...
@rushi, everybody...thanx look good only below the posts that u appreciate...i dont think v need to pay personal
thanx in a post meant for quiries...let thx be jus official...wat say guys??...
regards
maxximus
total = 56
8. 81^(371)^(372)^...(400)---81
9. 11 ^ (25)^(31)^(41)...(1001)----51
10. 7 ^ 2501.----07
11. 3^2537837.----63
2. 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
#344
-----------------------------------------------------------
Quantitative Question # 49
------------------------------------------------------------
Question:
Twinkle tells Raveena that she has got 3 kids and 2 of these kids are twins, and also that their
ages are all integers. She tells Raveena the sum of the ages of her kids and also the product of
their ages. Raveena says that she has insuficient information to determine the ages, but one
possibility is that the twins are a prime number of years old. If Twinkle’s twins are teenagers
and their age is not prime, then the sum of the ages of her kids is
Hi puys,
Its been many days since I last posted on PG, but I was occupied with unavoidable commitments , and now it
seems, I have lot of catching up to do...
As its mentioned in the question that the age of the twins is a teen non-prime no. hence it can be either 14, 15,
16 or 18....
15, 15, X 30 + X 225X 3,3, 25X (satisfies all criteria for X=1)
Regards,
Mohit
PS - There have been some doubts regarding this question. Kindly read the conversation between me and
vineetvijay, from here onwards..... it will help, grasping the problem..
#345
There are 1000 soliders with a no. on their T Shirts (1,2,3.....999,1000) standing on a circular track.
Man with no.1 is carrying a sword in his hand. He kills man at no. 2 and pass on sword to no. 3.
This goes on until we have only one solider on the track.
What will be the no. on his T-Shirt?
If n is the last number on the T-shirt (or n is the total number of people), then we observe the following pattern
so for n=1023, the surviour will be 1023. and from back tracking from 1022 to 1000, we get for n=1000, the
surviour will be 1023-2*23 = 1023-46 = 977
Regards,
Mohit
#192
wud request everybody to pour in their self-discovered / short cut methods....
The remainder when divided by 100, depends upon the last two digits...
2. 2^20,000----76
2^20000=(2^4)^5000=16^5000
3. 1^1 + 21 ^21 + 31^31 + ....1001^1001----90 (thanx for noticing missing 11^11...ya i know i have a history
of typo...still...as rock said...its always safe to solve wats printed!!)
(01 + 21+ ..... +91 )+ (01+11 + 21 +...... +91 .... 10 times(till 991) + 01 (for 1001)
so the answer is 90
89 + 99*99 = 89 + 01 = 90
kudos to MOHIT, ROCK, SAURABH, SUMI, JHA for their correct answers as well as for the healthy
discussions....keep up the spirit guys!!!!
regards
maximus
#193
Today's concept : Mastering Data suffieciency.
With no. of options for every question increased to 5, the expected answer set for D.S. is...
do not forget...
1). The answer shud be unique...even 2 cases suggest that the statement is not suffiecient.
2). The answer shud be consistent...if the answer is no...it shud be always no...if yes...always yes.
3). Both statement can give different answers...they're independent till used together...so even if the answers r
different...the answer wud optn 4 if each statement satisfies above 2 conditions independently.
4). at times u'll see that question can be answered using any one option as well as both options...in such a case,
answer wud be 1 or 2 and not 3.
5) the most important rule....everytime u're able to sort a D.S. question easily...check twice...there must
be a catch sumwhere...
1. is X positive?
stmt 1. x^2 - 5x + 10 = 7
stmt 2. sqrt (x) is real.
3. three packages combinedly weight 60 kg. what is the weight of heaviest package ?
4. is X > Y?
stmt 1. p > q
stmt 2. p is not = 1.
stmt 1. p>q
stmt 2. p is prime.
10. x = ?
st. 1 x^2 - 5x + 6 = 0
Happy solving!!!
regards
maxximus
#Solution 193
2. statement 1 alone is not sufficient and but statement 2 alone can be, so the answer is 2
one more thing maximmus, in the question, we have to just na that whether we can find out the condition or
not... as in, if we can find using any of the 2 statements (or both of them), that x is odd, we can answer the
question "is X even?" clarify please..
3. statement 1 alone is not sufficient, but statement 2 alone is sufficient (32>60's 50 %), hence the answer is 2
4. statement 1 alone is sufficient and statement 2 alone is also sufficient, hence answer is 4
5. statement 1 alone is not suffcient and statement 2 alone is also not sufficent.and even 1 and 2 both do not lead
to imply a unique result .Hence answer is 5
6.statement 1 alone as not suffcient and statement 2 alone is also not sufficent.and still 1 and 2 both do not lead
to imply a unique result (p being 17 and q being 2 or p being 289 ^ 4 and q being 0.25).Hence answer is 5.
7. These kinda question would be easy with the help of venn-diagrams, I suppose. But still, as per max's
method.....
statement 1 alone is not sufficient and statement 2 is also not sufficient alone and both of them together also do
not lead to a conclusion. hence the answer is
8. statement 1 alone is not sufficient and statement 2 alone is not sufficient. even 1 and 2 together do not lead to
a unique solution.... Hence the answer is 5
10. statement 1 alone is not sufficient. but statement 2 alone is sufficent. So the answer is 2
As i am the first to answer , I have taken the liberty to quote the questions.....
Concept-2:-
Now why I modified is because it will remove the burden to learn where to add 1 or subtract 1
And
(198!+177)%199
then we can say 198!%199 leaves reamainder 198 .Therefore 198+177=375%199 leaves remainder -23 i.e
176..........
Correct me If i Am Wrong...............