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

 It is currently 24 Apr 2015, 22:34

### 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
TAGS:
Senior Manager
Joined: 07 Mar 2006
Posts: 352
Followers: 1

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

When positive integer n is divided by 3, the remainder is 2; [#permalink]  29 Jul 2006, 22:01
00:00

Difficulty:

(N/A)

Question Stats:

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

(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
Senior Manager
Joined: 22 May 2006
Posts: 375
Location: Rancho Palos Verdes
Followers: 1

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

Re: DS: Gmat prep [#permalink]  29 Jul 2006, 22:19
zoom612 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

C must be it!

Given
n = 3k+2 and t=5l+3

S1. n-2 = 5m => n = 5m+2
Thus, n = 15q+2 insufficient.

S2. t = 3m
Thus, t= 15Q+3 insufficient.

Combine S1 and S2
nt = (15q+2)(15Q+3)
remainder is 2*3 = 6
sufficient
_________________

The only thing that matters is what you believe.

Re: DS: Gmat prep   [#permalink] 29 Jul 2006, 22:19
Similar topics Replies Last post
Similar
Topics:
When positive integer n is divided by 3, the remainder is 2; 2 01 Jun 2008, 04:49
When positive integer n is divided by 3 the remainder is 2; 11 11 May 2008, 18:37
When positive integer n is divided by 3, the remainder is 2; 5 18 Nov 2007, 08:06
2 When positive integer n is divided by 3, the remainder is 2; 9 27 Aug 2006, 01:18
When positive integer n is divided by 3, the remainder is 2; 4 06 Dec 2005, 13:09
Display posts from previous: Sort by