When positive integer n is divided by 3, the remainder is 2 : GMAT Data Sufficiency (DS)
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 21 Jan 2017, 04:10

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

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

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:

### Hide Tags

Manager
Joined: 30 Apr 2009
Posts: 134
Followers: 1

Kudos [?]: 86 [3] , given: 9

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

### Show Tags

01 Nov 2009, 12:06
3
This post received
KUDOS
23
This post was
BOOKMARKED
00:00

Difficulty:

75% (hard)

Question Stats:

60% (03:16) correct 40% (02:11) wrong based on 478 sessions

### HideShow timer Statistics

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.
[Reveal] Spoiler: OA

_________________

Trying to make CR and RC my strong points

"If you want my advice, Peter," he said at last, "you've made a mistake already. By asking me. By asking anyone. Never ask people. Not about your work. Don't you know what you want? How can you stand it, not to know?" Ayn Rand

Math Expert
Joined: 02 Sep 2009
Posts: 36590
Followers: 7089

Kudos [?]: 93307 [5] , given: 10557

Re: GMAT Prep 2 remainder [#permalink]

### Show Tags

01 Nov 2009, 13:07
5
This post received
KUDOS
Expert's post
14
This post was
BOOKMARKED
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.

From the stem: $$n=3p+2$$ and $$t=5q+3$$.
$$nt=15pq+9p+10q+6$$, we should find the remainder when this expression is divided by 15.

(1) $$n-2=5m$$ --> $$n=5m+2=3p+2$$ --> $$5m=3p$$, $$15m=9p$$ --> $$nt=15pq+9p+10q+6=15pq+15m+10q+6$$. Clearly $$15pq$$ and $$15m$$ are divisible by 15, so remainder by dividing these components will be 0. But we still know nothing about $$10q+6$$. Not sufficient.

(2) t is divisible by 3 means that $$5q+3$$ is divisible by 3 --> 5q is divisible by 3 or q is divisible by 3 --> $$5q=5*3z=15z$$ --> $$10q=30z$$ --> $$nt=15pq+9p+10q+6=15pq+9p+30z+6$$. $$15pq$$ and $$30z$$ are divisible by 15. Know nothing about $$9p+6$$. Not sufficient.

(1)+(2) $$9p=15m$$ and $$10q=30z$$ --> $$nt=15pq+9p+10q+6=15pq+15m+30z+6$$. Remainder when this expression is divided by 15 is 6. Sufficient.

Answer: C.

OR:

From the stem: $$n=3p+2$$ and $$t=5q+3$$.

(1) n-2 is divisible by 5 --> $$n-2=5m$$ --> $$n=5m+2$$ and $$n=3p+2$$ --> general formula for $$n$$ would be $$n=15k+2$$ (about deriving general formula for such problems at: good-problem-90442.html#p723049 and manhattan-remainder-problem-93752.html#p721341) --> $$nt=(15k+2)(5q+3)=15*5kq+15*3k+10q+6$$ --> first two terms are divisible by 15 ($$15*5kq+15*3k$$) but we don't know about the last two terms ($$10q+6$$). Not sufficient.

(2) t is divisible by 3 --> $$t=3r$$ and $$t=5q+3$$ --> general formula for $$t$$ would be $$t=15x+3$$ --> $$nt=(3p+2)(15x+3)=15*3px+9p+15*2x+6$$. Not sufficient.

(1)+(2) $$nt=(15k+2)(15x+3)=15*15kx+15*3k+15*2x+6$$ this expression divided by 15 yields remainder of 6. Sufficient.

Answer: C.
_________________
Intern
Joined: 24 May 2010
Posts: 6
Location: New York, USA
Followers: 4

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

Re: GMAT Prep 2 remainder [#permalink]

### Show Tags

24 May 2010, 16:52
If the explanation above is not helpful, you may find a step by step video solution of this question useful. On GMATFix site, this is GMATPrep question 1045

Best of luck,
-Patrick
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 7125
Location: Pune, India
Followers: 2137

Kudos [?]: 13676 [14] , given: 222

Re: DS problem : remainders [#permalink]

### Show Tags

28 Nov 2010, 17:36
14
This post received
KUDOS
Expert's post
6
This post was
BOOKMARKED
hogwarts wrote:
Saw this question on a GMATPrep test, and I can't figure out how to get to the correct answer. Can anyone help? Thanks!

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.

The correct answer is (C) - both statements together are sufficient, but neither statement alone is sufficient. Can anybody out there help explain to me how to get to this answer though? Thanks!

This is how I would approach this question.

When positive integer n is divided by 3, the remainder is 2;
I say n = 3a + 2 ( a is a non negative integer)

and when positive integer t is divided by 5, the remainder is 3.
So t = 5b + 3 (b is a non negative integer.)

What is the remainder when the product nt is divided by 15?
So nt = (3a + 2)(5b + 3) = 15ab + 9a + 10b + 6
15ab is divisible by 15. But I don't know anything about (9a + 10b + 6) yet.

Stmnt 1: n-2 is divisible by 5.
From above, n - 2 is just 3a. If n - 2 is divisible by 5, then 'a' must be divisible by 5. So I get that 9a is divisible by 15. I still don't know anything about b. If b = 1, remainder of nt is 1. If b = 2, remainder of nt is 11 and so on... Not sufficient.

Stmnt 2: t is divisible by 3.
If t is divisible by 3, then (5b + 3) is divisible by 3. Therefore, b must be divisible by 3. (If this is unclear, think: 15 + 3 will be divisible by 3 but 20 + 3 will not be. If the second term is 3, the first term must also be divisible by 3 to make the whole expression divisible by 3). So 10b is divisible by 15 but we do not know anything about a. If a = 1, remainder of nt is 0, if a = 2, remainder of nt is 9. Not sufficient.

Using both statements together, we know 9a and 10b are divisible by 15. So remainder must be 6. Sufficient.

Answer (C).
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for \$199

Veritas Prep Reviews

Manager
Status: what we want to do, do it as soon as possible
Joined: 24 May 2010
Posts: 114
Location: Vietnam
WE 1: 5.0
Followers: 2

Kudos [?]: 61 [1] , given: 315

Re: GMAT Prep 2 remainder [#permalink]

### Show Tags

15 Mar 2011, 23:55
1
This post received
KUDOS
Bunuel 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.

Answer: C.

I have another approach to this ds, plz correct me if i'm wrong.
n=3x + 2
t = 5y + 3
Clearly we cannot solve the problem with either n or t. We need both information concerning n and t because we need to figure out the remaining of n*t. => left with C or E

(1): n-2 is divisible by 5 & n=3x + 2 => x is multiple of 5.
(2): t is divisible by 3. & t = 5y + 3 => y is multiple of 3
(1)& (2) => n*t = (3x+2) (5y+3) = (3x*5y) + (9x) + (10y) + 6
we know that: x is multiple of 5, y is multiple of 3 so:
(3x*5y) + (9x) + (10y) + 6 will have remaining of 6 because: each (3x*5y); (9x); (10y) is all multiple of 15.
_________________

Consider giving me kudos if you find my explanations helpful so i can learn how to express ideas to people more understandable.

SVP
Joined: 16 Nov 2010
Posts: 1672
Location: United States (IN)
Concentration: Strategy, Technology
Followers: 33

Kudos [?]: 514 [1] , given: 36

Re: GMAT Prep 2 remainder [#permalink]

### Show Tags

16 Mar 2011, 23:34
1
This post received
KUDOS
I tried plugging numbers:

n = 3k + 2 = 2,5,8,11,14,17

t = 5m + 3 = 3,8,13,18,23,28

(1) n - 2 = 5l

=> n = 5l + 2 = 2,7,12,17

So n = 15k + 2 = 2,17,32,47

But n* t = 6 (2*3), 16(2*8) so n/15 can have rem 1 or 6

Hence (1) is not enough

(2) t = 3p = 3,6,12,15,18,21

So t = 15q + 3 = 3,18,33,48

But n*t = 6, 15, so rem can be 6, 0 etc.

Combining (1) and (2), it can be seen that nt = 15 * an integer + 6, so remainder is 6, answer is C.
_________________

Formula of Life -> Achievement/Potential = k * Happiness (where k is a constant)

GMAT Club Premium Membership - big benefits and savings

Manager
Status: Quant 50+?
Joined: 02 Feb 2011
Posts: 107
Concentration: Strategy, Finance
Schools: Tuck '16, Darden '16
Followers: 1

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

Re: GMAT Prep 2 remainder [#permalink]

### Show Tags

02 Oct 2011, 16:42
I did a similar thing with plugging numbers.

First you have to see that (1) and (2) alone are not sufficient alone before it really works in a time effective manner though.

(1) n = 17,32,47,etc, t still has so many values and remainder can differ (17*3 and 17*8 for example)
(2) t = 18,33,48,etc, same as above but with n

(1)+(2)

(15p+2)(15p+3) will always have r6 when divided by 15

breaking it out in factored form like that is helpful for me to see it very clearly.
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 13472
Followers: 575

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

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

### Show Tags

07 Oct 2013, 20:15
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Intern
Joined: 11 Jul 2013
Posts: 34
Followers: 0

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

Re: DS problem : remainders [#permalink]

### Show Tags

19 Oct 2013, 07:00
VeritasPrepKarishma wrote:
hogwarts wrote:
Saw this question on a GMATPrep test, and I can't figure out how to get to the correct answer. Can anyone help? Thanks!

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.

The correct answer is (C) - both statements together are sufficient, but neither statement alone is sufficient. Can anybody out there help explain to me how to get to this answer though? Thanks!

This is how I would approach this question.

When positive integer n is divided by 3, the remainder is 2;
I say n = 3a + 2 ( a is a non negative integer)

and when positive integer t is divided by 5, the remainder is 3.
So t = 5b + 3 (b is a non negative integer.)

What is the remainder when the product nt is divided by 15?
So nt = (3a + 2)(5b + 3) = 15ab + 9a + 10b + 6
15ab is divisible by 15. But I don't know anything about (9a + 10b + 6) yet.

Stmnt 1: n-2 is divisible by 5.
From above, n - 2 is just 3a. If n - 2 is divisible by 5, then 'a' must be divisible by 5. So I get that 9a is divisible by 15. I still don't know anything about b. If b = 1, remainder of nt is 1. If b = 2, remainder of nt is 11 and so on... Not sufficient.

Stmnt 2: t is divisible by 3.
If t is divisible by 3, then (5b + 3) is divisible by 3. Therefore, b must be divisible by 3. (If this is unclear, think: 15 + 3 will be divisible by 3 but 20 + 3 will not be. If the second term is 3, the first term must also be divisible by 3 to make the whole expression divisible by 3). So 10b is divisible by 15 but we do not know anything about a. If a = 1, remainder of nt is 0, if a = 2, remainder of nt is 9. Not sufficient.

Using both statements together, we know 9a and 10b are divisible by 15. So remainder must be 6. Sufficient.

Answer (C).

so from statement 1 we got 10b+6 if b=1 we get 16 then rem =1
if b=2 we got 106 so remainder =1
if b=3 we get 1006 so remainder =1 ..............................so i think a is sufficient .............what am i doing wrong
Math Expert
Joined: 02 Sep 2009
Posts: 36590
Followers: 7089

Kudos [?]: 93307 [1] , given: 10557

Re: DS problem : remainders [#permalink]

### Show Tags

20 Oct 2013, 04:38
1
This post received
KUDOS
Expert's post
tyagigar wrote:
VeritasPrepKarishma wrote:
hogwarts wrote:
Saw this question on a GMATPrep test, and I can't figure out how to get to the correct answer. Can anyone help? Thanks!

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.

The correct answer is (C) - both statements together are sufficient, but neither statement alone is sufficient. Can anybody out there help explain to me how to get to this answer though? Thanks!

This is how I would approach this question.

When positive integer n is divided by 3, the remainder is 2;
I say n = 3a + 2 ( a is a non negative integer)

and when positive integer t is divided by 5, the remainder is 3.
So t = 5b + 3 (b is a non negative integer.)

What is the remainder when the product nt is divided by 15?
So nt = (3a + 2)(5b + 3) = 15ab + 9a + 10b + 6
15ab is divisible by 15. But I don't know anything about (9a + 10b + 6) yet.

Stmnt 1: n-2 is divisible by 5.
From above, n - 2 is just 3a. If n - 2 is divisible by 5, then 'a' must be divisible by 5. So I get that 9a is divisible by 15. I still don't know anything about b. If b = 1, remainder of nt is 1. If b = 2, remainder of nt is 11 and so on... Not sufficient.

Stmnt 2: t is divisible by 3.
If t is divisible by 3, then (5b + 3) is divisible by 3. Therefore, b must be divisible by 3. (If this is unclear, think: 15 + 3 will be divisible by 3 but 20 + 3 will not be. If the second term is 3, the first term must also be divisible by 3 to make the whole expression divisible by 3). So 10b is divisible by 15 but we do not know anything about a. If a = 1, remainder of nt is 0, if a = 2, remainder of nt is 9. Not sufficient.

Using both statements together, we know 9a and 10b are divisible by 15. So remainder must be 6. Sufficient.

Answer (C).

so from statement 1 we got 10b+6 if b=1 we get 16 then rem =1
if b=2 we got 106 so remainder =1
if b=3 we get 1006 so remainder =1 ..............................so i think a is sufficient
.............what am i doing wrong

10b above means 10*b, 10 multiplied by b.

If b=2, then 10b+6=10*2+6=26 not 106;
If b=2, then 10b+6=10*3+6=36 not 1006.

Does this make sense?
_________________
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 13472
Followers: 575

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

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

### Show Tags

27 Oct 2014, 22:58
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Intern
Joined: 31 Oct 2015
Posts: 37
Followers: 0

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

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

### Show Tags

11 Nov 2015, 19:57
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?

n = 3a + 2, t = 5b + 3. Q: (3a + 2)(5b + 3)/15 = c + r/15. What is the value of r?

r is knowable only if it can be determined that each of 3a and 5b are divisible by 15, or in other words that a is divisible by 5 and b is divisible by 3, in which case the remainder would be the only remaining element that is clearly not divisible by 15.

nt = (3a +2)(5b +3) = 3a x 5b + 3a x3 + 10b + 6

if the first three elements of this equation are divisible by 15 the remainder would be 6. If divisibility of any of the variable-containing elements of this equation cannot be determined then the remainder cannot be determined.

St1: n-2 is divisible by 5.

n = 3a + 2
3a = n-2

if n-2 divisible by 5, then 3a is divisible by 5 (at least one factor of a = 5), and therefore 3a is divisible by 15.

However, divisibility of 5b by 15 cannot be determined, and therefore the value of r cannot be determined.

INSUFF.

(2) t is divisible by 3.

t = 5b + 3
5b + 3 is divisible by 3, therefore 5b is divisible by 3(at least one factor of b is 3) and 5b is divisible by 15.

However, divisibility of 3a by 15 cannot be determined, and therefore the value of r cannot be determined.

INSUFF.

Combined: 3a, and 5b are both divisible by 15, and therefore, all variable-containing elements of the equation nt = (3a +2)(5b +3) = 3a x 5b + 3a x3 + 10b + 6 are divisible by 15 and the remainder is 6.

SUFF.

Answer is C.
Manager
Joined: 07 May 2015
Posts: 106
Followers: 0

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

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

### Show Tags

28 Feb 2016, 09:09
Hi Bunuel,

thanks for the solution. I tried to solve statement two and I below is what I am getting. What am i doing wrong?

T = 5q+3 (given)
T = 3k (statement 2)
So 5q + 3 = 3k --> 10q + 6 = 6k and this does not assures that 10q+6 is a multiple of 15. What am i missing in solving it this way?

Thanks in advance!

Bunuel 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.

From the stem: $$n=3p+2$$ and $$t=5q+3$$.
$$nt=15pq+9p+10q+6$$, we should find the remainder when this expression is divided by 15.

(1) $$n-2=5m$$ --> $$n=5m+2=3p+2$$ --> $$5m=3p$$, $$15m=9p$$ --> $$nt=15pq+9p+10q+6=15pq+15m+10q+6$$. Clearly $$15pq$$ and $$15m$$ are divisible by 15, so remainder by dividing these components will be 0. But we still know nothing about $$10q+6$$. Not sufficient.

(2) t is divisible by 3 means that $$5q+3$$ is divisible by 3 --> 5q is divisible by 3 or q is divisible by 3 --> $$5q=5*3z=15z$$ --> $$10q=30z$$ --> $$nt=15pq+9p+10q+6=15pq+9p+30z+6$$. $$15pq$$ and $$30z$$ are divisible by 15. Know nothing about $$9p+6$$. Not sufficient.

(1)+(2) $$9p=15m$$ and $$10q=30z$$ --> $$nt=15pq+9p+10q+6=15pq+15m+30z+6$$. Remainder when this expression is divided by 15 is 6. Sufficient.

Answer: C.

OR:

From the stem: $$n=3p+2$$ and $$t=5q+3$$.

(1) n-2 is divisible by 5 --> $$n-2=5m$$ --> $$n=5m+2$$ and $$n=3p+2$$ --> general formula for $$n$$ would be $$n=15k+2$$ (about deriving general formula for such problems at: good-problem-90442.html#p723049 and manhattan-remainder-problem-93752.html#p721341) --> $$nt=(15k+2)(5q+3)=15*5kq+15*3k+10q+6$$ --> first two terms are divisible by 15 ($$15*5kq+15*3k$$) but we don't know about the last two terms ($$10q+6$$). Not sufficient.

(2) t is divisible by 3 --> $$t=3r$$ and $$t=5q+3$$ --> general formula for $$t$$ would be $$t=15x+3$$ --> $$nt=(3p+2)(15x+3)=15*3px+9p+15*2x+6$$. Not sufficient.

(1)+(2) $$nt=(15k+2)(15x+3)=15*15kx+15*3k+15*2x+6$$ this expression divided by 15 yields remainder of 6. Sufficient.

Answer: C.
Intern
Joined: 03 Jan 2016
Posts: 6
Followers: 0

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

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

### Show Tags

05 May 2016, 19:29
kt00381n 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.

As per the stated,
n = 3p + 2 => n-2 = 3p i.e. n-2 is a multiple of 3.
t = 5q + 3 => t-3 = 5q i.e. t-3 is a multiple of 5.

Statement 1 says n-2 is a multiple of 5. Hence, n-2 is divisible by both 3 and 5. So, it should be divisible by 15.
=> n-2 = 15m => n = 15m +2.... (1)
But stat 1 does not say anything about t-2. Hence insufficient. (or so u can deduce)

Statement 2 says t-2 is a multiple of 3. Hence, t-3 is divisible by both 3 and 5. So, it should be divisible by 15.
=> t-3 = 15m => t = 15s +3.... (2)
But stat 2 does not say anything about n. Hence insufficient.

On combining these two statements,
nt= 15m*15s + 15m*3+15s*2+3*2

So nt on dividing by 15 gives 6 as the remainer. (All other terms are divisible by 15)
Director
Joined: 21 Jun 2014
Posts: 504
Concentration: General Management, Technology
GMAT 1: 540 Q45 V20
GPA: 2.49
WE: Information Technology (Computer Software)
Followers: 12

Kudos [?]: 167 [0], given: 92

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

### Show Tags

10 Jun 2016, 11:09
kt00381n 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=3a+2 AND t=5b+3

nt = 15ab + 10b + 9a + 6 ---- divide it by 15

Nt/15 = ab + (2/3)b + (3/5)a + 6/15. We see if we know both b and a are divisible by 3 and 5 respectively then we remainder is 6 else remainder would be something else depending on the value of a and b.

Stmt-1:
As we know n=3a+2 then n-2 = 3a.

Stmt-1 says n-2 is divisible by 5 that is3a is divisible by 5. Hence a is divisible by 5. BUT what about b? INSUFF.

Stmt-2:

As we know t=5b+3

Stmt-2 says t is divisible by 3 that is b is divisible by 3. BUT what about a? INSUFF.

Combining stmt-1 and stmt-2 we know a and b are divisible by 5 and 3 respectively. This is what we required to know as mentioned above. Sufficient.

Answer is C.
_________________

---------------------------------------------------------------
Target - 720-740
helpful post means press '+1' for Kudos!
http://gmatclub.com/forum/information-on-new-gmat-esr-report-beta-221111.html
http://gmatclub.com/forum/list-of-one-year-full-time-mba-programs-222103.html

Manager
Joined: 26 Oct 2016
Posts: 121
Location: United States
Concentration: Marketing, International Business
Schools: HBS '19
GPA: 4
WE: Education (Education)
Followers: 5

Kudos [?]: 14 [0], given: 536

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

### Show Tags

26 Dec 2016, 06:32
VeritasPrepKarishma wrote:
hogwarts wrote:
Saw this question on a GMATPrep test, and I can't figure out how to get to the correct answer. Can anyone help? Thanks!

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.

The correct answer is (C) - both statements together are sufficient, but neither statement alone is sufficient. Can anybody out there help explain to me how to get to this answer though? Thanks!

This is how I would approach this question.

When positive integer n is divided by 3, the remainder is 2;
I say n = 3a + 2 ( a is a non negative integer)

and when positive integer t is divided by 5, the remainder is 3.
So t = 5b + 3 (b is a non negative integer.)

What is the remainder when the product nt is divided by 15?
So nt = (3a + 2)(5b + 3) = 15ab + 9a + 10b + 6
15ab is divisible by 15. But I don't know anything about (9a + 10b + 6) yet.

Stmnt 1: n-2 is divisible by 5.
From above, n - 2 is just 3a. If n - 2 is divisible by 5, then 'a' must be divisible by 5. So I get that 9a is divisible by 15. I still don't know anything about b. If b = 1, remainder of nt is 1. If b = 2, remainder of nt is 11 and so on... Not sufficient.

Stmnt 2: t is divisible by 3.
If t is divisible by 3, then (5b + 3) is divisible by 3. Therefore, b must be divisible by 3. (If this is unclear, think: 15 + 3 will be divisible by 3 but 20 + 3 will not be. If the second term is 3, the first term must also be divisible by 3 to make the whole expression divisible by 3). So 10b is divisible by 15 but we do not know anything about a. If a = 1, remainder of nt is 0, if a = 2, remainder of nt is 9. Not sufficient.

Using both statements together, we know 9a and 10b are divisible by 15. So remainder must be 6. Sufficient.

Answer (C).

Very straight forward, crisp and compact solution to this problem.
_________________

Thanks & Regards,
Anaira Mitch

Intern
Joined: 04 Jan 2017
Posts: 13
Followers: 0

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

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

### Show Tags

15 Jan 2017, 00:38
Hi everyone,

Thanks for all the explanations, it´s always extremely helpful.

I got the right answer but it took me 4min 44 sec. Any suggestions to get get the time down.

Thanks
Math Expert
Joined: 02 Sep 2009
Posts: 36590
Followers: 7089

Kudos [?]: 93307 [0], given: 10557

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

### Show Tags

15 Jan 2017, 00:45
lauramo wrote:
Hi everyone,

Thanks for all the explanations, it´s always extremely helpful.

I got the right answer but it took me 4min 44 sec. Any suggestions to get get the time down.

Thanks

HOW TO IMPROVE YOUR QUANT SCORE?
How to Go From a 48 to 51 in GMAT Quant
Improving from 30-35 to 40-44
Improving from 44 to 50

Other discussions dedicated to this issue:

HOW TO SPEED UP?
Want to speed up? Check this: Timing Strategies on the GMAT
How to Improve Your Timing on the GMAT

Other discussions dedicated to this issue:

_________________
Re: When positive integer n is divided by 3, the remainder is 2   [#permalink] 15 Jan 2017, 00:45
Similar topics Replies Last post
Similar
Topics:
3 If n is a positive integer, what is the remainder when n^2 is divided 5 22 Apr 2016, 05:38
7 What is the remainder when the positive integer n is divided by 2? 6 08 Mar 2015, 03:59
22 What is the remainder when the positive integer n is divided 11 25 Jun 2010, 22:42
30 When positive integer n is divided by 3, the remainder is 2 21 16 Mar 2009, 22:28
7 When the positive integer n is divided by 25, the remainder 20 15 Sep 2007, 10:19
Display posts from previous: Sort by

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

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics

 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®.