It is currently 19 Oct 2017, 04:12

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 divided by 3, the remainder is 2;

Author Message
Senior Manager
Joined: 05 Oct 2005
Posts: 485

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

When positive integer n is divided by 3, the remainder is 2; [#permalink]

Show Tags

06 Dec 2005, 14:09
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 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 divided 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

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

Senior Manager
Joined: 03 Nov 2005
Posts: 380

Kudos [?]: 68 [0], given: 17

Location: Chicago, IL

Show Tags

06 Dec 2005, 19:32
C.
Combining statements, n/15=q and t/15=15q then n*t/15=15q

So, n*(t+2)=15q+2 remainder is 2.
_________________

Hard work is the main determinant of success

Kudos [?]: 68 [0], given: 17

Manager
Joined: 30 Aug 2005
Posts: 184

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

Show Tags

10 Dec 2005, 06:58
When you combine 1 and 2,

t=18
n=17 gives a nt/15 remainder of 6
But n=32 gives a n/15 remainder of 11. insuff

I pick E.

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

SVP
Joined: 24 Sep 2005
Posts: 1884

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

Re: GMATPrep Question - DS [#permalink]

Show Tags

10 Dec 2005, 07:33
yb wrote:
When positive integer n is divided 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

n= 3k+2 (k is integer) and t= 5m+3 (m is integer)

1. n-2 is divisible by 5 , n-2= 3k ----> 3k is divisible by 5 -----> 3k is divisible by 15 ----> n-2 is divisible by 15
nt= (n-2)*t+2t -----> the remainder then nt is divided by 15 is determined by 2t ( becaue (n-2) is divisible by 15 ---> (n-2)*t is divisible by 15)
2t = 2*(5m+3) = 10m + 6
m=1 --> 2t=16 ---> the remainder is 1
m=0 ----> 2t= 6 ----> the remainder is 6
-----> stmt 1 is insuff

2. t is divisible by 3 ----> 5m+3 is divisible by 3 ----> 5m is divisible by 3 ----> 5m is divisible by 15 -----> 5m+3 divided by 15 has remainder of 3 ----> t divided by 15 has remainder of 3 ----> t= 15v + 3 ( v is integer)

nt= (3k+2) ( 15v+3) = 45kv + 9k +30v + 6 ----> the remainder is determined by 9k+6
k=0 ----> the remainder is 6
k= 1 ----> the remainder is 0
----> stmt 2 is insuff

Combine 1 and 2
nt= (n-2)t + 2t
(n-2)t is divisible by 15 as proved above ---> the remainder is determined by 2t
2t= 2* ( 15v+3)= 30 v +6 ----> 2t divided by 15 has remainder of 6
-----> nt is divided by 15 has remainder of 6 ---->suff

C it is.

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

Manager
Joined: 30 Aug 2005
Posts: 184

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

Show Tags

10 Dec 2005, 14:24
rianah100 wrote:
When you combine 1 and 2,

t=18
n=17 gives a nt/15 remainder of 6
But n=32 gives a n/15 remainder of 11. insuff

I pick E.

Here is what I did wrong
But n=32 gives a n/15 remainder of 6. suff

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

10 Dec 2005, 14:24
Display posts from previous: Sort by

When positive integer n is divided by 3, the remainder is 2;

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne 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®.