BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Remainder problem in Gmatprep

Expert replies
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
Join the discussion
Source: — Data Sufficiency |

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.
Join the discussion

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

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