Remainder problem in Gmatprep

This topic has expert replies
User avatar
Community Manager
Posts: 789
Joined: Sun Jan 28, 2007 3:51 pm
Location: Silicon valley, California
Thanked: 30 times
Followed by:1 members

Remainder problem in Gmatprep

by jayhawk2001 » Sat Apr 14, 2007 1:57 pm
Any quick way to solve this. I got this question on gmatprep and
ended up fumbling (and moving on in the interest of time).

Upon reviewing I found out what the error was on my part but
would like to hear alternate approaches to attack this kind of problem.
Attachments
gmatprep_q17.JPG

User avatar
Legendary Member
Posts: 1275
Joined: Thu Sep 21, 2006 11:13 pm
Location: Arabian Sea
Thanked: 125 times
Followed by:2 members

Re: Remainder problem in Gmatprep

by ajith » Sat Apr 14, 2007 7:35 pm
jayhawk2001 wrote:Any quick way to solve this. I got this question on gmatprep and
ended up fumbling (and moving on in the interest of time).

Upon reviewing I found out what the error was on my part but
would like to hear alternate approaches to attack this kind of problem.
1 is sufficient
it refers to a number of the format 6k+3 (k an integer)
[ a number not divisible by 2 can be represented 2k+1
when this number is divisible by 3 it can be represented 3*(2k+1)
]

so when divided by 6 it will leave a remainder of 3

2 is also sufficient
it refers to a number of the format 12k+3 (k an integer)
which leaves a remainder of 3 when divided by 6
Always borrow money from a pessimist, he doesn't expect to be paid back.

Senior | Next Rank: 100 Posts
Posts: 36
Joined: Fri Mar 02, 2007 7:15 am

by nauman » Sat Apr 14, 2007 8:09 pm
Agree with Ajith D is the answer.

User avatar
Community Manager
Posts: 789
Joined: Sun Jan 28, 2007 3:51 pm
Location: Silicon valley, California
Thanked: 30 times
Followed by:1 members

by jayhawk2001 » Sun Apr 15, 2007 8:37 am
Yes, the answer is indeed D. Thanks guys.