Remainder problem in Gmatprep

[This topic has 3 member replies]

Free $100 Amazon.com Gift Card - Buy a GMAT course using a Beat The GMAT discount code between Mar 8-22 and get a $100 Amazon.com Gift Card. Learn more!

« View previous topic

View next topic »

jayhawk2001
Moderator

Joined: 28 Jan 2007
Posts: 789

Thanks given: 0
Thanked 15 times in 14 posts
Location: Silicon valley, California

Topic: Remainder problem in Gmatprep

Sat Apr 14, 2007 2:57 pm

	Elapsed Time:	00:00		Why a timer is critical to improving your score
	Lap #[LAPCOUNT] ([LAPTIME])

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

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

Reply from Top Beat The GMAT Member

See All Top Members

ajith
Moderator

Most Thanked Member Most Active Member Most Responsive Member

Joined: 22 Sep 2006
Posts: 1147

Thanks given: 31
Thanked 89 times in 88 posts
Location: Arabian Sea

Test Date: April 2010
Target GMAT Score: 740

Sat Apr 14, 2007 8: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.