 It is currently 30 Sep 2020, 22:29 ### 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

#### Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here. # When the positive integer n is divided by 3, the remainder i  Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:
Founder  Joined: 18 Apr 2015
Posts: 13432
Followers: 292

Kudos [?]: 3418 , given: 12318

When the positive integer n is divided by 3, the remainder i [#permalink]
Expert's post
When the positive integer n is divided by 3, the remainder is 2 and when n is divided by 5, the remainder is 1. What is the least possible value of n?

[Reveal] Spoiler: OA
11

Math Review
Question: 15
Page: 220
Difficulty: medium

_________________

Need Practice? 20 Free GRE Quant Tests available for free with 20 Kudos
GRE Prep Club Members of the Month: Each member of the month will get three months free access of GRE Prep Club tests. GRE Instructor Joined: 10 Apr 2015
Posts: 3841
Followers: 149

Kudos [?]: 4514  , given: 69

Re: When the positive integer n is divided by 3, the remainder i [#permalink]
5
KUDOS
Expert's post
Carcass wrote:
When the positive integer n is divided by 3, the remainder is 2 and when n is divided by 5, the remainder is 1. What is the least possible value of n?

When it comes to remainders, we have a nice rule that says:
If N divided by D leaves remainder R, then the possible values of N are R, R+D, R+2D, R+3D,. . . etc.

For example, if k divided by 5 leaves a remainder of 1, then the possible values of k are: 1, 1+5, 1+(2)(5), 1+(3)(5), 1+(4)(5), . . . etc.

GIVEN: When the positive integer n is divided by 3, the remainder is 2
The possible values of n are: 2, 5, 8, 11, 14, 17, 20,...

GIVEN: When n is divided by 5, the remainder is 1
The possible values of n are: 1, 6, 11, 16, 21,...

11 is the smallest value that appears in both lists of possible n-values.

Cheers,
Brent
_________________

Brent Hanneson – Creator of greenlighttestprep.com
If you enjoy my solutions, you'll like my GRE prep course. Intern Joined: 25 Dec 2019
Posts: 10
Followers: 0

Kudos [?]: 0 , given: 6

Re: When the positive integer n is divided by 3, the remainder i [#permalink]
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. If n-2 is divisible by 5 and t is divisible by 3. What is the remainder when the product nt is divided by 15 ?

a)0 b)1 c)2 d)3 e)5
Intern Joined: 14 Mar 2020
Posts: 41
Followers: 0

Kudos [?]: 19 , given: 66

Re: When the positive integer n is divided by 3, the remainder i [#permalink]
sandeep1995 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. If n-2 is divisible by 5 and t is divisible by 3. What is the remainder when the product nt is divided by 15 ?

a)0 b)1 c)2 d)3 e)5

can anyone solve this problem with a short trick? Manager Joined: 09 Mar 2020
Posts: 164
Followers: 0

Kudos [?]: 148  , given: 16

Re: When the positive integer n is divided by 3, the remainder i [#permalink]
2
KUDOS
asmasattar00 wrote:
sandeep1995 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. If n-2 is divisible by 5 and t is divisible by 3. What is the remainder when the product nt is divided by 15 ?

a)0 b)1 c)2 d)3 e)5

can anyone solve this problem with a short trick?

You can use trail and error method.
The remainder is 1 when divided by 5, thus the number should be greater than multiple of 5 by 1.
5*1 = 5 + 1 = 6. On dividing with 5 gives remainder 1, but is perfectly divisible by 2. This does not satisfy the condition.
5*2 = 10 + 1 = 11. And then divide the number by 3 to see if you get the remainder as 2. This satisfies the condition.

When the numbers are bigger, this method might be time consuming.
Intern Joined: 14 Mar 2020
Posts: 41
Followers: 0

Kudos [?]: 19 , given: 66

Re: When the positive integer n is divided by 3, the remainder i [#permalink]
sandeep1995 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. If n-2 is divisible by 5 and t is divisible by 3. What is the remainder when the product nt is divided by 15 ?

a)0 b)1 c)2 d)3 e)5

is option A(0) is the right answer? Manager Joined: 09 Mar 2020
Posts: 164
Followers: 0

Kudos [?]: 148  , given: 16

Re: When the positive integer n is divided by 3, the remainder i [#permalink]
1
KUDOS
asmasattar00 wrote:
sandeep1995 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. If n-2 is divisible by 5 and t is divisible by 3. What is the remainder when the product nt is divided by 15 ?

a)0 b)1 c)2 d)3 e)5

is option A(0) is the right answer?

Let's try to solve n first. It is given that when n is divided by 3, we get 2 as remainder and also that n-2 must be divisible by 5. Start looking at the table of 3, we can see that n can be 17, since 3*5 = 15 and when remainder is added, we get 17, plus n-2 = 15 is divisible by 5.
For t, start with the table of 3, and we can see that when t=18, this is divisible by 3 and when it is divided be 5, you get a remainder of 3.
Hence, n=17 and t=18.
Thus, nt = 17*18 = 306.
On dividing it with 15, you should get 6 as remainder.
Please check if the options you've typed are correct.

Posted from my mobile device  Intern Joined: 14 Mar 2020
Posts: 41
Followers: 0

Kudos [?]: 19  , given: 66

Re: When the positive integer n is divided by 3, the remainder i [#permalink]
1
KUDOS
sukrut96 wrote:
asmasattar00 wrote:
sandeep1995 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. If n-2 is divisible by 5 and t is divisible by 3. What is the remainder when the product nt is divided by 15 ?

a)0 b)1 c)2 d)3 e)5

is option A(0) is the right answer?

Let's try to solve n first. It is given that when n is divided by 3, we get 2 as remainder and also that n-2 must be divisible by 5. Start looking at the table of 3, we can see that n can be 17, since 3*5 = 15 and when remainder is added, we get 17, plus n-2 = 15 is divisible by 5.
For t, start with the table of 3, and we can see that when t=18, this is divisible by 3 and when it is divided be 5, you get a remainder of 3.
Hence, n=17 and t=18.
Thus, nt = 17*18 = 306.
On dividing it with 15, you should get 6 as remainder.
Please check if the options you've typed are correct.

Posted from my mobile device thanks! I got your point , but for T I solve it as
t =3 , 3/3----> fully divisible and 3/5---> remainder is 3

so 17*3=51
51/15 generates a remainder 6
once again thanks for your productive response Senior Manager  Joined: 10 Feb 2020
Posts: 483
Followers: 1

Kudos [?]: 119 , given: 293

Re: When the positive integer n is divided by 3, the remainder i [#permalink]
GreenlightTestPrep wrote:
Carcass wrote:
When the positive integer n is divided by 3, the remainder is 2 and when n is divided by 5, the remainder is 1. What is the least possible value of n?

When it comes to remainders, we have a nice rule that says:
If N divided by D leaves remainder R, then the possible values of N are R, R+D, R+2D, R+3D,. . . etc.

For example, if k divided by 5 leaves a remainder of 1, then the possible values of k are: 1, 1+5, 1+(2)(5), 1+(3)(5), 1+(4)(5), . . . etc.

GIVEN: When the positive integer n is divided by 3, the remainder is 2
The possible values of n are: 2, 5, 8, 11, 14, 17, 20,...

GIVEN: When n is divided by 5, the remainder is 1
The possible values of n are: 1, 6, 11, 16, 21,...

11 is the smallest value that appears in both lists of possible n-values.

Cheers,
Brent

its easy to understand this rule, just one question, when we should apply this? because questions are really different every time, so how to recognize where this rule will be applicable?
_________________

Ever Tried? Ever Failed? No Matter. Try Again. Fail Again. Fail Better!! Re: When the positive integer n is divided by 3, the remainder i   [#permalink] 06 May 2020, 08:59
Display posts from previous: Sort by

# When the positive integer n is divided by 3, the remainder i  Question banks Downloads My Bookmarks Reviews Important topics  Powered by phpBB © phpBB Group Kindly note that the GRE® test is a registered trademark of the Educational Testing Service®, and this site has neither been reviewed nor endorsed by ETS®.