Last visit was: 18 Jun 2024, 14:39 It is currently 18 Jun 2024, 14:39

Close

GRE Prep 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 GRE 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.

Close

Request Expert Reply

Confirm Cancel
Verbal Expert
Joined: 18 Apr 2015
Posts: 28951
Own Kudos [?]: 33733 [1]
Given Kudos: 25368
Send PM
Most Helpful Community Reply
Retired Moderator
Joined: 10 Apr 2015
Posts: 6218
Own Kudos [?]: 11808 [8]
Given Kudos: 136
Send PM
General Discussion
avatar
Intern
Intern
Joined: 25 Dec 2019
Posts: 12
Own Kudos [?]: 2 [1]
Given Kudos: 0
Send PM
avatar
Intern
Intern
Joined: 14 Mar 2020
Posts: 41
Own Kudos [?]: 25 [1]
Given Kudos: 0
Send PM
Re: When the positive integer n is divided by 3, the remainder i [#permalink]
1
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?
avatar
Manager
Manager
Joined: 09 Mar 2020
Posts: 164
Own Kudos [?]: 200 [0]
Given Kudos: 0
Send PM
Re: When the positive integer n is divided by 3, the remainder i [#permalink]
2
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.
avatar
Intern
Intern
Joined: 14 Mar 2020
Posts: 41
Own Kudos [?]: 25 [0]
Given Kudos: 0
Send PM
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?
avatar
Manager
Manager
Joined: 09 Mar 2020
Posts: 164
Own Kudos [?]: 200 [0]
Given Kudos: 0
Send PM
Re: When the positive integer n is divided by 3, the remainder i [#permalink]
1
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 Image
avatar
Intern
Intern
Joined: 14 Mar 2020
Posts: 41
Own Kudos [?]: 25 [0]
Given Kudos: 0
Send PM
Re: When the positive integer n is divided by 3, the remainder i [#permalink]
1
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 Image


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 :)
User avatar
Senior Manager
Senior Manager
Joined: 10 Feb 2020
Posts: 496
Own Kudos [?]: 340 [0]
Given Kudos: 299
Send PM
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.

Answer: 11

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?
Moderator
Moderator
Joined: 02 Jan 2020
Status:GRE Quant Tutor
Posts: 1088
Own Kudos [?]: 896 [1]
Given Kudos: 9
Location: India
Concentration: General Management
Schools: XLRI Jamshedpur, India - Class of 2014
GMAT 1: 700 Q51 V31
GPA: 2.8
WE:Engineering (Computer Software)
Send PM
When the positive integer n is divided by 3, the remainder i [#permalink]
1
Given that when n is divided by 3, the remainder is 2 and when n is divided by 5, the remainder is 1. And we need to find the least possible value of n

Theory: Dividend = Divisor*Quotient + Remainder

n is divided by 3, the remainder is 2

n -> Dividend
3 -> Divisor
a -> Quotient (Assume)
2 -> Remainders
=> n = 3*a + 2 = 3a + 2

n is divided by 5, the remainder is 1

=> n = 5b + 1 (Assume b is the quotient)

So, that value of n is possible which will satisfy both the conditions
=> n = 5b + 1 = 3a + 2
=> 5b = 3a + 2 - 1 = 3a + 1
=> b = \(\frac{3a+1}{5}\)
So, for b to be integer 3a + 1 should be a multiple of 5
a = 1, 3a + 1 = 3*1 + 1 = 4
a = 2, 3a + 1 = 3*2 + 1 = 7
a = 3, 3a + 1 = 3*3 + 1 = 10 => POSSIBLE

=> n = 3a + 2 = 3*3 + 2 = 11

So, Answer will be 11
Hope it helps!

Watch the following video to learn the Basics of Remainders

Prep Club for GRE Bot
[#permalink]
Moderators:
Moderator
1088 posts
GRE Instructor
218 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne