Quant by Arun Sharma

amount[ uh-mount]
noun
1.
the sum total of two or more quantities or sums; aggregate.
@hemant89 said: @AsihekAdhvaryu

Q17 . Ranjan purchased a maruti van for rs 1.96000 and the rate of depreciation is 100/7% per annum. Find the value of the van after 2 years?

  1. 140000
  1. 144000
  1. 150000
  1. 160000
  1. None of these

Q21 . Harsha makes a fixed deposit of rs 20000 with the bank of India for a period of 3 year. If the rate of interest be 13% SI per annum charged half yearly what amount will he get after 42 months?

  1. 27800
  1. 28100
  1. 29100
  2. 28500
  3. None of these
both mentioned above
For Q17 the value deprecated for the first year is (196000)*(100/7)*(1/100)=28000
so value of the item after 1st year is (196000-28000)=168000
Now value deprecated at 2nd year is (168000)*(100/7)*(1/100)=24000
so value of the item after 2nd year is (168000-24000)=144000

Or you can use concept of compound interest as rate of deprecation is 100/7% so value after 2 year is

Value= 196000*(1-100*7/100))^2
196000*(1-1/7)^2
196000*(6/7)^2
196000*(36/49)
144000

@[593895:challenger90] you can assume any value of 'a'. the result will always be the same!

How many numbers smaller than 2.10^8 and are divisible by 3 can be written by means of digits 0,1 and 2(exclude single digit and double digit numbers)??

a. 4369
b. 4353
c. 4373
d. 4351
@mitali0390 said:how to solve these questions..
1)find sum of even factors of 2450?
2)find sum of odd factors of 2450?
3)find the sum and number of factors of 1200 such that factors are(a)divisible by 15 and(b)not divisible by 15??
4)find number of divisors of 1080 excluding the throughout divisors which are perfect square?

2450 ... lets do 2nd first

2450 = 2* 5 *5 *7*7

total 18 factors out of which 9 are odd and 9 even

sum of odd factors =((5^3)-1)/(5-1) * ((7^3)-1)/(7-1) =1767

sum of even factors = ((2^2)-1)/(2-1) * ((5^3)-1)/(5-1) + ((7^3)-1)/(7-1)

- ((5^3)-1)/(5-1) * ((7^3)-1)/(7-1) = 3534

am i correct ??

3) to find a) 1200/15 =80

find sum of factors of 80 and multiply it by 15

b)subtract what you got in a) from total factors

4) 1080= 3^3*2^3 *5 number of divisors =32

squares 1,4,9,36

so 28 am i correct??????????

@[349702:techsurge]
i dnt knw the answers of first three questions since they are not given but 4th answer is correct..
and thanx a lot for the approach:)

Answer the following question:
GCD Of 2^100-1 and 2^120-1 is:

Options:
a. 2^20 - 1
b. 2^40 - 1
c. 2^60 - 1
d. 2^10 - 1

I was unable to calculate it so please help Puys..!
@HarshitShah said: Answer the following question:
GCD Of 2^100-1 and 2^120-1 is:
Options:
a. 2^20 - 1
b. 2^40 - 1
c. 2^60 - 1
d. 2^10 - 1
I was unable to calculate it so please help Puys..!
a 2^20-1
@Nihilist1002 said:
a 2^20-1
Please explain how you solved it ?

@[608786:HarshitShah]

Recall that (a^n - b^n) is always divisible by (a-b).

So, 2^100-1 or [ (2^20)^5-1^5 ] is divisble by [ 2^20-1 ].

Similarly 2^120-1 or [ (2^20)^6 - 1^6 ] is divisible by [ 2^20 -1 ]

So, [ 2^20 -1 ] is the GCD.
Is it correct?

@[568667:Psychamour]

your approach is sound bro

@[608786:HarshitShah]--- find out the HCF of 100 and 120 which is 20..
so ans is 2^20 - 1

@ayushbhalotia said:@HarshitShah--- find out the HCF of 100 and 120 which is 20..
so ans is 2^20 - 1
Im quoting this not to demean you but to point out a fatal loophole.
By your approach, gcd( (2^100-2) , (2^120-2) ) should be equal to [ gcd(100,120) - 2].
You can urself figure out if this answer is correct or not.
That puny (-1) has big importance in Qn as well as in the answer.

@[568667:Psychamour]---- No issues man...this forum is to discuss sums and clarify doubts...everyone can share their approach to solve a sum...sometimes its right, sometimes its wrong..

Just tested..this method does not work for 3^4 - 2 and 3^6 -2...

But in some cases it works and in some it does not, so u r right, this method is not a full proof one...Thanks for pointing this out... 😃

hi
Can anyone pls explain why we use the concept of Eulers number of 11 is 10 in the question to find remainder when 50^56^52 is divided by 11.
I am really confused as to why we actually find the remainderof 56^52 by 10 and then that corresponding value becomes the Power of 50 and subsequently find the remanider by 11.

@[412947:vamos]

Query 1 Why Euler no, is used.
Without using Euler you will take time to solve the Qn.
You will first find out the cyclicity of 11. Then try to express the power in terms of that cyclicity. You dont have the luxury of time on ur side to solve the Qn by this straight way.


So , Euler function comes handy here makin our life easier. It tells us that special number to which if we raise the denominator and then divide the resultant by numerator, we get 1 as remainder.

Here, Rem( 50^10 / 11) = 1

So, Rem ( 50^20 / 11 ) = Rem(50^100 / 11 ) = Rem( 50^1250/11) = Rem(50^10*x/11) = 1
That is any multiple of 10 in power will give the remainder as 1.

Now, suppose if I give you a scary number as power, 64928332 and you know that multiple of 10 wil give remainder as 1.
i.e Calculate REM ( 50^64928332/ 11).

What will u do, you will break up this big number in terms of mulitple of 10.

[ 64928332 = 6492833*10 + 2 ].

So you know now that whatever is in multiply with 10 will give 1 as remainder. This leaves only 2 as the power, a small number which you can solve. i.e

[50^64928332 = 50^64928330 * 50^2 ]

Finaly , what did you do here ? how did u break the big number in mulitple of 10?
"You divided the number by 10 and kept only what remained(the 2 in example) ". Isnt it?
That 2 was the Remainder left when you divided the big number by 10.

This should solve your 2nd Query.

Get back if the confusion still lingers.

@[568667:Psychamour]---- Can u pls explain how to solve this sum using Euler's No.:-

Find the remainder?

3^101 / 77

@[361226:ayushbhalotia]

See, its not a thumb rule that u solve every Remainder Qn by Euler's.


The efficient way to solve this Qn should be to use Chinese Remainder Theorem(CRT) along with Euler's Theorem

How do you decide that Euler alone wont be profitable here.

Lets see..
Since 3 and 77 do not have any factor in common, so we can use Euler's Theorem here.
So, calculate Euler function of 77.
77=7*11
Euler of 77 = E(77) = 77*( 1-1/7)*(1-1/11) = 60.

So now we have determined that Rem[ (3^60)/77 ] = 1

Our Qn becomes Rem[ (3^101)/77 ] = Rem[ (3^41)/77 ]
Now you will find urself stuck here. 77 is too big a number to play around with, calculating its powers while taking any exam will waste time.
So we should employ CRT here.

But still, in case you you cannot recall CRT you can continue the above reduction to arrive at the answer.

Rem[ (3^41)/77 ] = R [ ( (81^10).3 )/77 ]
= R[ ( (4^10).3 )/77 ] ......................... { 81 = 77 + 4 }
= R[ ( (64^3).4.3 )/77]
= R[ ((-13)^3).12)/77 ] ......................... { 64 = 77-13 }
= R[ ( (169)(-13)(12) )/77 ]
= R[ ( (15)(-13)(12) )/77 ] .....................Since { 169=77*2+15 }
= R[ ( (-15)(156) )/77 ]
= R[ ( (-15)(2) )/77 ]......................Since { 156=77*2+2 }
=R[ (-30)/77 ]
=77-30 = 47 ...........Answer

**********************************

Now see how CRT makes our life easier.

STEP1:
We have to find REM[ (3^101)/77 ].
Note here that 77=7*11
So , we calculate remainder of 3^101 by both the factors of 77.

REM[ 3^101 / 11 ] = 3 ........................{ Euler(11) = 10, R[3^100/11] = 1 }

REM[ 3^101/ 7 ] = R[ 3^5/7 ] .....................{ Euler(7) = 6 , R[ 3^96/7 ] = 1 }
= R[ ( (9)(9)(3) )/7]
=R[ ( (2)(2)(3) )/7 ] = R[ 12/7 ] = 5 .

STEP2:
As per CRT, we have to find values of x and y such that
7x + 11y = 1
One such pair is x=-3 y=2

STEP3:
Desired Remainder =
7(Remainder from divisn by 11)(value of x) + 11(Remainder from divisn by 7)(Value of y)
= (7)(3)((-3) + (11)(5)(2)
= - 63 + 110
= 47...........Answer

Whooossshh,, That was a pretty long post.

Hope u can understand,

Bounce back in case of any doubt.

Thanks man.....i have never used Euler theorm...this is a good learning...

@ayushbhalotia said: Thanks man.....i have never used Euler theorm...this is a good learning...
http://www.pagalguy.com/news/remainders-reloaded-euler-fermat-wilsons-theorems-cat-2011-a-19067

http://www.totalgadha.com/mod/forum/discuss.php?d=6268

Regards,
Never Back Down

Hi! i wanted to know if solving lod 1 and lod 2 from arun sarma is enough for quant