Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 29 Jun 2016, 15:44

### GMAT Club Daily Prep

#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# What is the remainder when the positive integer x is divided

Author Message
Manager
Joined: 03 Jan 2008
Posts: 109
Followers: 1

Kudos [?]: 44 [0], given: 0

What is the remainder when the positive integer x is divided [#permalink]

### Show Tags

08 Apr 2008, 13:35
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

What is the remainder when the positive integer x is divided by 8?
(1) When x is divided by 12, the remainder is 5.
(2) When x is divided by 18, the remainder is 11.
A. Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
B. Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
C. BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is
sufficient.
D. EACH statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.

Last edited by notahug on 08 Apr 2008, 20:41, edited 1 time in total.
Director
Joined: 10 Sep 2007
Posts: 947
Followers: 8

Kudos [?]: 254 [0], given: 0

### Show Tags

08 Apr 2008, 15:07
Statement 1:
Examples, 5, 17, 29, 41, 53, 65, 77, 89, 101...
If divided by 8 they leave either 1 or 5 as remainders, so not sufficient.

Statement 2:
Examples, 11, 29, 47, 65, 83, 101...
If divided by 8 they leave different remainders, so not sufficient.

Combining Statement 1 and 2

Examples 29, 65, 101
Divided by 8 leaves remainder 1, and 5, so again insufficient.

Last edited by abhijit_sen on 08 Apr 2008, 21:27, edited 1 time in total.
Manager
Joined: 03 Jan 2008
Posts: 109
Followers: 1

Kudos [?]: 44 [0], given: 0

### Show Tags

08 Apr 2008, 15:19
is there other way to approach this?
SVP
Joined: 28 Dec 2005
Posts: 1575
Followers: 3

Kudos [?]: 122 [0], given: 2

### Show Tags

08 Apr 2008, 17:54
i thought it was E ... 29/8 gives remainder 5, but 65/8 gives remainder 1.
Current Student
Joined: 28 Dec 2004
Posts: 3385
Location: New York City
Schools: Wharton'11 HBS'12
Followers: 14

Kudos [?]: 239 [0], given: 2

### Show Tags

08 Apr 2008, 18:03
yeah..this should be E..
SVP
Joined: 04 May 2006
Posts: 1926
Schools: CBS, Kellogg
Followers: 21

Kudos [?]: 778 [0], given: 1

### Show Tags

08 Apr 2008, 19:37
notahug wrote:
is there other way to approach this?

I have the same problem as your. I do not master this skill of number plugging. I did tried but it did not work for me. The other way does not help me more!

1. 12k + 5 = (8k +8)+(4k-3)

4k-4 divided by 8 produce some remainders so not sufficient

2. 18n+11 = 16n + 8 + (2n+3)

2n+3 also produces some remainders when it divided by 8, not sufficient

When combining, I stop thinking, I apply the way Walker suggest but it seems difficult for me. Any other help?
_________________
Manager
Joined: 03 Jan 2008
Posts: 109
Followers: 1

Kudos [?]: 44 [0], given: 0

### Show Tags

08 Apr 2008, 20:41
What is the best way to solve this, any more idea?

Walker?
CEO
Joined: 17 Nov 2007
Posts: 3580
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 485

Kudos [?]: 2802 [0], given: 359

### Show Tags

08 Apr 2008, 21:13
Expert's post
My approach for the problems with remainder is the same as abhijit_sen wrote: I simply write out a few integers:

12k+5: 5, 17, 29, 41, 53, 65

18m+11: 11, 29, 47, 65

29 and 65 satisfies both conditions but have different remainders: 5 and 1

So, E

I do not know faster way....
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Manager
Joined: 03 Jan 2008
Posts: 109
Followers: 1

Kudos [?]: 44 [0], given: 0

### Show Tags

08 Apr 2008, 21:31
walker wrote:
My approach for the problems with remainder is the same as abhijit_sen wrote: I simply write out a few integers:

12k+5: 5, 17, 29, 41, 53, 65

18m+11: 11, 29, 47, 65

29 and 65 satisfies both conditions but have different remainders: 5 and 1

So, E

I do not know faster way....

Tks I think most of us consider "plugging" the best way.
CEO
Joined: 17 Nov 2007
Posts: 3580
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 485

Kudos [?]: 2802 [0], given: 359

### Show Tags

08 Apr 2008, 21:50
Expert's post
At the beginning I tried to use "mod" approach to solve such problems but found it too clumsy and sometimes this approach lead me to deadlock ... On the other hand, the plugging numbers seems to be not so nice but work well for almost all reminder problems.
_________________

HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android) - The OFFICIAL GMAT CLUB PREP APP, a must-have app especially if you aim at 700+ | PrepGame

Display posts from previous: Sort by