Welcome to Beat The GMAT, the world's largest GMAT & MBA forum. Please join our rich community of friendly members. Get free help from
experts who teach at the leading GMAT & MBA prep companies — Kaplan, Veritas Prep, Manhattan GMAT and Stacy Blackman Consulting.

Announcement: Apply for the Beat The GMAT/Veritas Prep MBA Fast Track Scholarship, featuring $20,000 in prizes.

gmatprep remainder question


 
Post new topic   Reply to topic    Beat The GMAT Forum Index -> GMAT Math -> Data Sufficiency
View previous topic :: View next topic  
Author Message
gmatjoe
Just gettin' started!


Joined: 06 Feb 2008
Posts: 19

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Thu May 01, 2008 2:51 am    Post subject: gmatprep remainder question Reply with quote

Hi,

Could anybody explain me statement 2?
I thought that it has no link with the question stem...

Thanks, Joe.

This post contains an attachment. You must be logged in to download/view this file.
Please login or register as a user.

Back to top


View user's profile Send private message
codesnooker
GMAT Destroyer!


Joined: 18 Jan 2008
Posts: 361

Thanks given: 8
Thanked 18 times in 18 posts


Test Date: Not Decided
Target GMAT Score: 800
GMAT Score: 580

PostPosted: Thu May 01, 2008 4:04 am    Post subject: Reply with quote

Solution:

Equation = 3^(4n+2) + m

It can be reduced as

= 3^4n + 3^2 + m
= 3^4n + 9 + m

According to 2nd statement, m = 1

= 3^4n + 9 + 1
= 3^4n + 10

Now if you can check,
3^0 = 1
3^1 = 3
3^2 = 9
3^3 = 27
3^4 = 81
3^8 = 81 * 81 = 6561

So, it means no matter what is the value of n (0, 1, 2, ....) the last digit would be always 1.
Now if you add 10 this number, the unit digit will always be 1. So, when the number would be divided by 10, then the reminder would always be 1.

Hence, statement (2) is alone sufficient to deduce the answer.

_________________
Code Snooker | Happy to Help
---------------------------------
Born to WIN
http://btg760.blogspot.com/
Back to top


View user's profile Send private message Visit poster's website
gmatjoe
Just gettin' started!


Joined: 06 Feb 2008
Posts: 19

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Thu May 01, 2008 5:09 am    Post subject: Reply with quote

Thanks codesnooker, I agree with your calculation.
However, how did you arrive at 3^((4n+2)+m)?
I cannot make this out of the question stem, I read that the n could be n as in stat1 or m as in stat2...
Back to top


View user's profile Send private message
codesnooker
GMAT Destroyer!


Joined: 18 Jan 2008
Posts: 361

Thanks given: 8
Thanked 18 times in 18 posts


Test Date: Not Decided
Target GMAT Score: 800
GMAT Score: 580

PostPosted: Thu May 01, 2008 6:06 am    Post subject: Reply with quote

Unbelievable!!!

The question is misprinted. Same question I solved yesterday that I found at this forum.

Here is the link of correct question statement.

http://www.beatthegmat.com/gmat-prep-question-t10282.html

Check it and you can understand it yourself.

_________________
Code Snooker | Happy to Help
---------------------------------
Born to WIN
http://btg760.blogspot.com/
Back to top


View user's profile Send private message Visit poster's website
gmatjoe
Just gettin' started!


Joined: 06 Feb 2008
Posts: 19

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Thu May 01, 2008 7:21 am    Post subject: Reply with quote

thanks, it's indeed unbelievable. i already started to doubt about my reading skills. browsing around, this is already the second misprint i encountered.
anyone knows of gmac updating gmatprep once and a while?
Back to top


View user's profile Send private message
gmatjoe
Just gettin' started!


Joined: 06 Feb 2008
Posts: 19

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Thu May 01, 2008 7:32 am    Post subject: Reply with quote

I opened a thread in the gmat math general folder to collect these kinds of errors...

http://www.beatthegmat.com/misprints-in-gmatprep-t10344.html#41767
Back to top


View user's profile Send private message
onlyGmat2008
Just gettin' started!


Joined: 21 May 2008
Posts: 9

Thanks given: 0
Thanked 0 times in 0 posts


PostPosted: Sat May 24, 2008 1:12 am    Post subject: Reply with quote

Hi codesnooker,

How can Equation = 3^(4n+2) + m be reduced as 3^4n + 3^2 + m.

shoouldn't it be 3^(a+b) is 3^a . 3^b . Please correct if i am misinterpreting something.

Also i didn't understand the final solution where you say that the last digit is always 1. Could you please help me understand this?

Thanks.
Back to top


View user's profile Send private message
gmataug08
Just gettin' started!


Joined: 17 May 2008
Posts: 4

Thanks given: 0
Thanked 1 times in 1 posts


PostPosted: Fri Jun 13, 2008 11:13 am    Post subject: Reply with quote

the equation : 3^(4n+2) + m

with considering the second data information m = 1

3^(4n+2) + 1 => 3^4nx3^2 + 1 => 3^4nx9 + 1

now considering 3^4n
3^4 = 81 , hence whatever the value of n it would be so many times multiples of 81.
for ex :
when n =1 ==> 3^(4x1) ==> 3^4 ==> 3x3x3x3 =>81
when n =2 ==> 3^(4x2) ==> 3^8 ==> 3x3x3x3x3x3x3x3 => 81x81
when n =3 ==> 3^(4x3) ==> 3^12 ==> 81x81x81

so, irrespective of n's value the unit digit is always going to be 1

now back in equation ,
3^4nx9 would always have a unit digit of 9 ( as the unit digit is going to be 1 always for 3^4n) .... adding 1 to that value would make the unit digit to be always 0.

so when dividing this number by 10 , the reminder will always be 0.
so the second equation alone enough .

hence answer B.
Back to top


View user's profile Send private message
Display posts from previous:   
Post new topic   Reply to topic    Beat The GMAT Forum Index -> GMAT Math -> Data Sufficiency All times are GMT - 7 Hours
Page 1 of 1

 
Jump to:  
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You cannot download files in this forum



"GMAT" and other GMAC™ trademarks are registered trademarks of the Graduate Management Admission Council™. The Graduate Management Admission Council™ does not endorse, nor is it affiliated in any way with the owner or any content on this website. The opinions expressed here are solely those of the author or those of the members of this website. Copyright © 2008 BTG Test Prep, LLC. Powered by phpBB © 2001, 2005 phpBB Group.