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

 It is currently 28 Aug 2016, 14:50

### 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

# When positive integer n is divisible by 3, the remainder is

Author Message
Manager
Joined: 07 Dec 2006
Posts: 168
Followers: 1

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

When positive integer n is divisible by 3, the remainder is [#permalink]

### Show Tags

30 Jan 2008, 02:04
1
KUDOS
00:00

Difficulty:

45% (medium)

Question Stats:

77% (01:47) correct 23% (01:42) wrong based on 13 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

When positive integer “n” is divisible by 3, the remainder is 2; and when positive integer “t” is divided by 5, the remainder is 3. What is the remainder when the product “nt” is divided by 15?

1) n-2 is divisible by 5.
2) t is divisible by 3.

OPEN DISCUSSION OF THIS QUESTION IS HERE: when-positive-integer-n-is-divided-by-3-the-remainder-is-86155.html
[Reveal] Spoiler: OA
Senior Manager
Joined: 26 Jan 2008
Posts: 267
Followers: 3

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

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

30 Jan 2008, 02:39
GHIBI wrote:
When positive integer “n” is divisible by 3, the remainder is 2; and when positive integer “t” is divided by 5, the remainder is 3. What is the remainder when the product “nt” is divided by 15?

1) n-2 is divisible by 5.
2) t is divisible by 3.

Could you please explain in detail?
Thank you.

1) and 2) alone are insufficient

The answer should be (C). The remainder will come to 6

n = 3k + 2
t = 5m + 3

Also (n-2) is divisible by 5
=> 3k is divisible by 5
=> k is divisible by 5

Similarly, m is divisible by 3

nt = (3k + 2) * (5m + 3)
=> nt = 15km + 9k + 10m + 6

when divided by 15, you get
nt = 15(km + 3k/5 + 5m/3) + 6
since k is divisible by 5 and m is divisible by 3, the first 3 terms are not relevant to the remainder, leaving 6 as the answer.
_________________
CEO
Joined: 17 Nov 2007
Posts: 3589
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 501

Kudos [?]: 3069 [0], given: 360

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

30 Jan 2008, 02:48
E

Thanks for the excellent question! +1
It is my weak point.

a wild solution:

n can be {2,5,8,11,14,17}
t can be {3,8,13,18}

1. n can be {2,17}.
nt=2*3 has reminder 6, nt=2*8 has reminder 1
insuff.

2. t can be {3,18}.
nt=2*3 has reminder 6, nt=8*3 has reminder 9
insuff.

1&2. n can be {2,17}, t can be {3,18}.
nt=2*3 has reminder 6, nt=17*18 has reminder 2
insuff.

eschn3am and maratikus, please, help to find the fast and clear 1-min 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

Senior Manager
Joined: 26 Jan 2008
Posts: 267
Followers: 3

Kudos [?]: 99 [1] , given: 1

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

30 Jan 2008, 03:49
1
KUDOS
walker wrote:
E

Thanks for the excellent question! +1
It is my weak point.

a wild solution:

n can be {2,5,8,11,14,17}
t can be {3,8,13,18}

1. n can be {2,17}.
nt=2*3 has reminder 6, nt=2*8 has reminder 1
insuff.

2. t can be {3,18}.
nt=2*3 has reminder 6, nt=8*3 has reminder 9
insuff.

1&2. n can be {2,17}, t can be {3,18}.
nt=2*3 has reminder 6, nt=17*18 has reminder 2
insuff.

eschn3am and maratikus, please, help to find the fast and clear 1-min way!

Won't the remainder for 17*18 be 6, as opposed to 2?
_________________
CEO
Joined: 17 Nov 2007
Posts: 3589
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 501

Kudos [?]: 3069 [0], given: 360

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

30 Jan 2008, 03:53
incognito1 wrote:
Won't the remainder for 17*18 be 6, as opposed to 2?

Thanks. You are right. A stupid mistake.
+1
_________________

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

Director
Joined: 12 Jul 2007
Posts: 862
Followers: 15

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

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

30 Jan 2008, 05:22
GHIBI wrote:
When positive integer “n” is divisible by 3, the remainder is 2; and when positive integer “t” is divided by 5, the remainder is 3. What is the remainder when the product “nt” is divided by 15?

1) n-2 is divisible by 5.
2) t is divisible by 3.

Could you please explain in detail?
Thank you.

n: 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38
t: 8, 13, 18, 23, 28, 33, 38

1. n: 17, 32
2. t: 18, 33

1. 17*3*3*2/3*5 = 17*3*2/5 = remainder 2
2. 17*3*11/3*5 = 17*11/5 = 187/5 = remainder 2
3. 16*2*2*3*3/3*5 = 16*2*2*3/5 = 192/5 = remainder 2
4. 16*2*3*11/3*5 = 16*2*11/5 = 352/5 = remainder 2

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

Kudos [?]: 3069 [0], given: 360

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

30 Jan 2008, 13:03
Can anyone provide fast "mod" - approach to the problem?
Thanks.
_________________

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

Director
Joined: 01 May 2007
Posts: 792
Followers: 1

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

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

31 Jan 2008, 15:03
Look for a fast answer approach as well. These types of problems kick my a.
Director
Joined: 01 May 2007
Posts: 792
Followers: 1

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

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

31 Jan 2008, 15:09
incognito1, can you break this down some more...

nt = (3k + 2) * (5m + 3)
=> nt = 15km + 9k + 10m + 6

when divided by 15, you get
nt = 15(km + 3k/5 + 5m/3) + 6
since k is divisible by 5 and m is divisible by 3, the first 3 terms are not relevant to the remainder, leaving 6 as the answer.
Director
Joined: 01 May 2007
Posts: 792
Followers: 1

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

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

31 Jan 2008, 15:24
I think there is a math error in the yellow.

incognito1 wrote:
GHIBI wrote:
When positive integer “n” is divisible by 3, the remainder is 2; and when positive integer “t” is divided by 5, the remainder is 3. What is the remainder when the product “nt” is divided by 15?

1) n-2 is divisible by 5.
2) t is divisible by 3.

Could you please explain in detail?
Thank you.

1) and 2) alone are insufficient

The answer should be (C). The remainder will come to 6

n = 3k + 2
t = 5m + 3

Also (n-2) is divisible by 5
=> 3k is divisible by 5
=> k is divisible by 5

Similarly, m is divisible by 3

nt = (3k + 2) * (5m + 3)
=> nt = 15km + 9k + 10m + 6

when divided by 15, you get
nt = 15(km + 3k/5 + 5m/3) + 6
since k is divisible by 5 and m is divisible by 3, the first 3 terms are not relevant to the remainder, leaving 6 as the answer.
Senior Manager
Joined: 26 Jan 2008
Posts: 267
Followers: 3

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

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

31 Jan 2008, 17:38
jimmyjamesdonkey wrote:
I think there is a math error in the yellow.

incognito1 wrote:
GHIBI wrote:
When positive integer “n” is divisible by 3, the remainder is 2; and when positive integer “t” is divided by 5, the remainder is 3. What is the remainder when the product “nt” is divided by 15?

1) n-2 is divisible by 5.
2) t is divisible by 3.

Could you please explain in detail?
Thank you.

1) and 2) alone are insufficient

The answer should be (C). The remainder will come to 6

n = 3k + 2
t = 5m + 3

Also (n-2) is divisible by 5
=> 3k is divisible by 5
=> k is divisible by 5

Similarly, m is divisible by 3

nt = (3k + 2) * (5m + 3)
=> nt = 15km + 9k + 10m + 6

when divided by 15, you get
nt = 15(km + 3k/5 + 5m/3) + 6
since k is divisible by 5 and m is divisible by 3, the first 3 terms are not relevant to the remainder, leaving 6 as the answer.

Jimmy you're right - it should be 2m/3 instead of 5m/3, but shouldn't affect the overall solution
_________________
SVP
Joined: 29 Aug 2007
Posts: 2492
Followers: 66

Kudos [?]: 693 [0], given: 19

Re: GMAT prep : DS - Remainder [#permalink]

### Show Tags

01 Feb 2008, 04:58
GHIBI wrote:
When positive integer “n” is divisible by 3, the remainder is 2; and when positive integer “t” is divided by 5, the remainder is 3. What is the remainder when the product “nt” is divided by 15?

1) n-2 is divisible by 5.
2) t is divisible by 3.

Could you please explain in detail?
Thank you.

I remember I was exposed to this question and found the link: 7-p397597?t=55775&hilit=divisible#p397597
_________________

Gmat: http://gmatclub.com/forum/everything-you-need-to-prepare-for-the-gmat-revised-77983.html

GT

Re: GMAT prep : DS - Remainder   [#permalink] 01 Feb 2008, 04:58
Display posts from previous: Sort by

# When positive integer n is divisible by 3, the remainder is

 Powered by phpBB © phpBB Group and phpBB SEO Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.