official quant thread for cat08 - Page 101 - PaGaLGuY.com - The Everything of MBA in India and Abroad, CAT 2009, GMAT, XAT, MAT
PaGaLGuY.com - The Everything of MBA in India and Abroad, CAT 2009, GMAT, XAT, MAT
Forum Rules
» Sponsors
  PaGaLGuY.com - The Everything of MBA in India and Abroad, CAT 2009, GMAT, XAT, MAT > Exam Resources > Quantitative Questions and Answers
official quant thread for cat08
Quantitative Questions and Answers Discuss Quantitative and other Math related questions. Post your math doubts and get it solved by the smartest brains this side of the universe !

Tags: , ,

» Thread Closed
 
LinkBack Thread Tools Display Modes
  (#1001)
asghan asghan is offline
has no status.
Expert PaGaL
 
Posts: 150
Join Date: May 2007
Location: Hyderabad
Groans: 5
Groaned at 5 Times in 1 Post
Thanks: 49
Thanked 26 Times in 19 Posts
Re: official quant thread for cat08 - 10-04-2008, 01:03 PM

Quote:
Originally Posted by esh.nil View Post
Using the Inverse Euler shld be the shortest method for this problem..
123 = 3*41
E(123) = 40
31^40%123 = 1
we have 31^78 = 31^(80-2)%123 = 31^-2%123
Let me give a small intro on inverse euler,
For Inverse Euler,
When u have a problem like this 7^94%1000,
u know the Euler of 1000 w.r.t to 7 is 100 ,
so we know 7^100%1000 = 1
but we have 7^94,
so we write 7^94%1000 as 7^100.7^-6%100 = 7^-6%1000
now we have n^-b%p
we need to find a no A such that a*n%p = 1
and this number a^b%p = 1
this is Inverse Euler theorem.
so in our problem, 143*7%1000 = 1
a= 143,
so 143^6%1000 = 1
this looks a lot easier and better than 7^94%1000..
This is Inv euler theorem, for more on this u can look the concepts total fundas thread and the thread posted my marijuana_user...


so here the problem becomes 31^-2%123
we need to find n where n*31%123 = 1
n = 4
so 4^2%123 = 16.
hence the answer
Hi esh I am getting the euler of 1000 as 400 and 123 as 80, I am following this method

for 123, 123(1-1/41)*(1-1/3), 123*40/41 *2/3 = 40 * 2 = 80, and the same method for 1000 also,

is there anything wrong in my approach ???
Digg this Post!Add Post to del.icio.usStumble this Post!
Sponsored Links
  (#1002)
guneet_01 guneet_01 is offline
Is LiVin LiFe QuEeN sIzE...
Trainee PaGaL
 
guneet_01's Avatar
 
Posts: 71
Join Date: Feb 2008
Location: Ludhiana
Age: 21
Groans: 0
Groaned at 1 Time in 1 Post
Thanks: 115
Thanked 40 Times in 18 Posts
Re: official quant thread for cat08 - 10-04-2008, 01:37 PM

I had made a small mistake in the question posted earlier.. Missed on the highlighted part.. pls tell me if that changes the answer..

This is question no. 14 in LOD 2 of Time Speed Distance chapter in Arun Sharma's Quant book:
Two indian tourists in the US cycled towards each other, one from point A and the other from point B. The first tourist left point A 6 hrs later than the second left point B, and it turned out on their meeting that he travelled 12 km less than the second tourist. After their meeting, they kept cycling with the same speed, and the first tourist arrived at B 8 hours later and the second arrived at A 9 hours later. Find the speed of the faster tourist.
(a) 4 km/hr
(b) 6 km/hr
(c) 9 km/hr
(d) 2 km/hr
(e) 5 km/hr
Digg this Post!Add Post to del.icio.usStumble this Post!
The Following User Says Thank You to guneet_01 For This Useful Post:
naveentiptur (23-10-2008)
  (#1003)
apatchofsnow apatchofsnow is offline
Midterm blues
Hardcore PaGaL
IIM Lucknow

 
Posts: 385
Join Date: Jan 2008
Location: Bangalore
Age: 25
Groans: 0
Groaned at 9 Times in 6 Posts
Thanks: 199
Thanked 544 Times in 157 Posts
Re: official quant thread for cat08 - 10-04-2008, 02:10 PM

Quote:
Originally Posted by guneet_01 View Post
I had made a small mistake in the question posted earlier.. Missed on the highlighted part.. pls tell me if that changes the answer..

This is question no. 14 in LOD 2 of Time Speed Distance chapter in Arun Sharma's Quant book:
Two indian tourists in the US cycled towards each other, one from point A and the other from point B. The first tourist left point A 6 hrs later than the second left point B, and it turned out on their meeting that he travelled 12 km less than the second tourist. After their meeting, they kept cycling with the same speed, and the first tourist arrived at B 8 hours later and the second arrived at A 9 hours later. Find the speed of the faster tourist.
(a) 4 km/hr
(b) 6 km/hr
(c) 9 km/hr
(d) 2 km/hr
(e) 5 km/hr

I don't think anything changes................
Digg this Post!Add Post to del.icio.usStumble this Post!
  (#1004)
isimplyrock isimplyrock is offline
has no status.
 
Posts: 1
Join Date: Sep 2007
Location: Pune
Groans: 0
Groaned at 0 Times in 0 Posts
Thanks: 0
Thanked 0 Times in 0 Posts
Re: official quant thread for cat08 - 10-04-2008, 03:12 PM

Hi Avinav,

I tend to disagree with your answer. The answer according to me is 660 Km.

Here is the explanation:

1) Since all the three run at constant speeds, the ratio of the distance traveled by the dog towards the thief and that traveled towards the police in one round trip should be constant.
Let’s find this ratio for the dog’s first round-trip.
Distance towards the thief during the first round trip (dt) = 360 km
Distance towards the police during the first round trip (dp) = 360/11 km

Therefore, dp = dt / 11

2) Now, the police caught the thief after 12 hrs. So the dog runs for a total of 12 hrs or 720 km.

Therefore,
Total distance traveled by dog towards thief + Total distance traveled by dog towards police = 720 km that is, dt + dp = 720km

Substituting dp = dt / 11 (from 1), we get dt = 660. Therefore the total distance traveled by dog towards the thief is 660 km.
Digg this Post!Add Post to del.icio.usStumble this Post!
  (#1005)
naga25french naga25french is offline
is going for the kill :P
Certified PaGaL
PG MADCAPZ

 
naga25french's Avatar
 
Posts: 2,661
Join Date: Jan 2008
Location: chennai
Age: 22
Groans: 313
Groaned at 44 Times in 26 Posts
Thanks: 8,117
Thanked 4,482 Times in 1,312 Posts
Send a message via Yahoo to naga25french
Re: official quant thread for cat08 - 10-04-2008, 04:08 PM

Quote:
Originally Posted by vivek417 View Post
Thanks for such a useful post. I got stuck when I reached power of (-2) on 31.

Naga can you pls tell if the answer is correct?

@@@@@@@@@@@@

'Always see a glass as half full rather than half empty.'
@vivek

the answer is 16..

@esh.nil approach is right...

anyways i will explain how i worked out using inverse euler concept...

31*4=124=123+1....its clear..i know
=======> 31*4 =1mod123
31^78=31^80*31^-2
thus,
31^78=31^-2 mod123..
we can write it as:-
=31^-2 * 4^-2 *4^2 mod123
=(31*4)^-2*4^2 mod 123
=124^-2 * 4^2 mod123
=1*4^2mod123
=16mod123
so remainder = 16
hope its clear...
this is the shortest possible method i could work out...
@ jha june...

there is nothing in practising the remainder problem again... only practice makes man perfect... pls bear with me man.. dont mind to reply to those question..


Love asks me no questions,And gives me endless support

Post for inspiration
|orkut|
PG Prep|Blog|135 min

Last edited by naga25french; 10-04-2008 at 04:27 PM. Reason: correction
Digg this Post!Add Post to del.icio.usStumble this Post!
  (#1006)
esh.nil esh.nil is offline
back to spamming ways :)
Hardcore PaGaL
 
esh.nil's Avatar
 
Posts: 632
Join Date: Apr 2007
Location: Bangalore
Age: 24
Groans: 0
Groaned at 4 Times in 4 Posts
Thanks: 675
Thanked 581 Times in 238 Posts
Re: official quant thread for cat08 - 10-04-2008, 04:25 PM

Quote:
Originally Posted by asghan View Post
Hi esh I am getting the euler of 1000 as 400 and 123 as 80, I am following this method

for 123, 123(1-1/41)*(1-1/3), 123*40/41 *2/3 = 40 * 2 = 80, and the same method for 1000 also,

is there anything wrong in my approach ???

@asghan... when u are finding the euler of a non-prime number,
Use the LCM of the eulers of it's prime factors.
so 123 = 3*41
E(3)=2
E(41) = 40
LCM of 40,2 = 40
Hence the Euler of 123 though acc to euler theorem is 80,
the cyclicity of the remainders is exhibited even at 40..
Try that out..


IIML 2010 Batch
IIML GD/PI Mentorship Program
IIML 2008 GD/PI Experiences

UDT'07 Member

I don't believe in fate, bcos I don't like the idea that I'm not in control of my life....

http://journeytotheinevitable.blogspot.com/
Digg this Post!Add Post to del.icio.usStumble this Post!
The Following 2 Users Say Thank You to esh.nil For This Useful Post:
asghan (10-04-2008), atshubha (10-04-2008)
  (#1007)
smartie smartie is offline
has no status.
Expert PaGaL
 
Posts: 195
Join Date: Mar 2007
Location: kolkata
Age: 22
Groans: 0
Groaned at 0 Times in 0 Posts
Thanks: 154
Thanked 121 Times in 51 Posts
Re: official quant thread for cat08 - 10-04-2008, 05:01 PM

Quote:
Originally Posted by naga25french View Post
is q =2 and s = 3 ?????

so answer according to my calculations
1. 3] 2
2. 1] 3

correct me if i am wrong..
please explain the solution....i dint understand the question itself..
In (pqr)q(qs) what is the relation between (pqr) and q and s?


XLRI
Class of 2011
Digg this Post!Add Post to del.icio.usStumble this Post!
  (#1008)
asghan asghan is offline
has no status.
Expert PaGaL
 
Posts: 150
Join Date: May 2007
Location: Hyderabad
Groans: 5
Groaned at 5 Times in 1 Post
Thanks: 49
Thanked 26 Times in 19 Posts
Re: official quant thread for cat08 - 10-04-2008, 05:37 PM

Quote:
Originally Posted by esh.nil View Post
@asghan... when u are finding the euler of a non-prime number,
Use the LCM of the eulers of it's prime factors.
so 123 = 3*41
E(3)=2
E(41) = 40
LCM of 40,2 = 40
Hence the Euler of 123 though acc to euler theorem is 80,
the cyclicity of the remainders is exhibited even at 40..
Try that out..
So for 1000 = 125 * 8, we are finding euler of 125 which is 100 and 8 which is 4 hence LCM of these number 100, So i guess we can use this funda for a number like 5^3 * 2^3 and not for 5 and 3 which will give lcm of its euler number as 4....... Please comment @esh
Digg this Post!Add Post to del.icio.usStumble this Post!
  (#1009)
esh.nil esh.nil is offline
back to spamming ways :)
Hardcore PaGaL
 
esh.nil's Avatar
 
Posts: 632
Join Date: Apr 2007
Location: Bangalore
Age: 24
Groans: 0
Groaned at 4 Times in 4 Posts
Thanks: 675
Thanked 581 Times in 238 Posts
Re: official quant thread for cat08 - 10-04-2008, 05:58 PM

Quote:
Originally Posted by asghan View Post
So for 1000 = 125 * 8, we are finding euler of 125 which is 100 and 8 which is 4 hence LCM of these number 100, So i guess we can use this funda for a number like 5^3 * 2^3 and not for 5 and 3 which will give lcm of its euler number as 4....... Please comment @esh
Sorry for my poor choice of words... It's not the prime factors,
instead split the given number into the product of co-prime numbers...
so 1000 shall be split into 125*8
the highest power of the prime factor available...


IIML 2010 Batch
IIML GD/PI Mentorship Program
IIML 2008 GD/PI Experiences

UDT'07 Member

I don't believe in fate, bcos I don't like the idea that I'm not in control of my life....

http://journeytotheinevitable.blogspot.com/
Digg this Post!Add Post to del.icio.usStumble this Post!
  (#1010)
satanica satanica is offline
is drrrunk
Hardcore PaGaL
IIM Calcutta

 
satanica's Avatar
 
Posts: 302
Join Date: Oct 2006
Location: Sin City
Groans: 77
Groaned at 13 Times in 6 Posts
Thanks: 339
Thanked 646 Times in 153 Posts
Re: official quant thread for cat08 - 10-04-2008, 05:58 PM

Quote:
Originally Posted by esh.nil View Post
Using the Inverse Euler shld be the shortest method for this problem..
123 = 3*41
E(123) = 40
31^40%123 = 1
we have 31^78 = 31^(80-2)%123 = 31^-2%123
Let me give a small intro on inverse euler,
For Inverse Euler,
When u have a problem like this 7^94%1000,
u know the Euler of 1000 w.r.t to 7 is 100 ,
so we know 7^100%1000 = 1
but we have 7^94,
so we write 7^94%1000 as 7^100.7^-6%100 = 7^-6%1000
now we have n^-b%p
we need to find a no A such that a*n%p = 1
and this number a^b%p = 1
this is Inverse Euler theorem.
so in our problem, 143*7%1000 = 1
a= 143,
so 143^6%1000 = 1
this looks a lot easier and better than 7^94%1000..
This is Inv euler theorem, for more on this u can look the concepts total fundas thread and the thread posted my marijuana_user...

so here the problem becomes 31^-2%123
we need to find n where n*31%123 = 1
n = 4
so 4^2%123 = 16.
hence the answer
This method rocks...

U made a mistake though..
I guess when U are refering to Euler, U mean Euler's Totient function of 1000 which will be 400 and also it is independent of 7, with the only thing to be kept in mind that HCF(1000,7) = 1.

I solved the same in a totally different manner.

123 = 3 * 41

31 mod 3 = 1
31^78 mod 3 = 1

31 mod 41 = -10
-10^3 mod 41 = -16
-16^2 mod 41 = 10
which means -10^6 mod 41 = 10
31^78 mod 41 = -10^78 mod 41 = (-10^6)^13 mod 41 = 10^13 mod 41 = 10^12 mod 41 * 10 = 10^3 mod 41 = 16

Now, the solution is 'x' where..
x mod 3 = 1
x mod 41 = 16

By observation..
x=16



"You laugh at me because I am different, but I laugh at you because you are all the same."

Last edited by satanica; 10-04-2008 at 06:01 PM.
Digg this Post!Add Post to del.icio.usStumble this Post!
The Following User Says Thank You to satanica For This Useful Post:
esh.nil (10-04-2008)
» Thread Closed

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are Off

Forum Jump

» Sponsors

PaGaLGuY.com is not responsible for the views and opinions of the posters.
PaGaLGuY.com is an Inzane Labs Private Limited production.