When positive integer n is divided by 3, the remainder is 1. When n is

Question

When positive integer n is divided by 3, the remainder is 1. When n is divided by 7, the remainder is 5. What is the smallest positive integer p, such that (n + p) is a multiple of 21?

(A) 1
(B) 2
(C) 5
(D) 19
(E) 20

v12345 · Accepted Answer

given number is of the form 3x + 1 and 7y + 5

=> 3x + 1 = 7y + 5

=> x = (7y + 4) / 3

the lowest integer values which satisfies this are y = 2 and x = 6
and number = 7y + 5 = 19

therefore lowest value to be added to 19 make it divisible by 21 is 2

answer choice B

kudos if you like the explanation

Abhishek009 · Answer

n = { 4 , 7 , 10 , 13, 16,  19  ........}

n = { 12 ,  19  ........}

19 + p = 21  { Smallest multiple of 21 }

So, p = 2

Hence answer is (B) 2

camlan1990 · Answer

n+p=3a+1+p = 7b+5+p = 21m
=>p+1=3m and p+5=7t
=>p=3m-1 and p=7t-5

P is positive so m>=1 and t>=1
p is the smallest positive when m=1 and t=1
=> p=2

Ans: B

Nevernevergiveup · Answer

When positive integer n is divided by 3, the remainder is 1 i.e., n=3x+1
values of n can be one of {1, 4, 7, 10, 13, 16, 19, 22..............49, 52, 59..................}

Similarly,
When n is divided by 7, the remainder is 5..i.e., n=7y+5
values of n can be one of {5, 12, 19, 26, 32, 38, 45, 52, 59........}

combining both the sets we get
n={19, 52, ...........}

What is the smallest positive integer p, such that (n + p) is a multiple of 21 or 21x i.e., {21, 42, 63, 84..........}.
in case of n=19 p=2
in case of n=52 p=11
.
.
.
.
so on

as we observe the value of p increases as the value of n increases.
so for min value of p, we take min value of n.
B is the answer.

apple08 · Answer

Could shed some light on how the second 2) is derived , many thanks 
1) n+p=3a+1+p = 7b+5+p = 21m
2) =>p+1=3m and p+5=7t
3) =>p=3m-1 and p=7t-5

P is positive so m>=1 and t>=1
p is the smallest positive when m=1 and t=1
=> p=2

apple08 · Answer

Many thanks abishek009 really appreciate it

Vashishtha · Answer

n/3 = q +1
n/7= q + 5

n+p : possible values ; 21,42,63
 we need smallest value of p

now guess value of n based on values of n+p i.e, close to 21,42,63

try 20; fails first

try 40
first ; ok
second condition ok
therefore n can be 40 in which case p has to be 2

Senthil7 · Answer

The smallest integer that leaves a remainder 1 when divided by 3 and remainder of 5 when divided by 7 is 19.

Smallest multiple of 21 is 21 itself hence smallest value of P = 21-19 =  2.

gracie · Answer

When positive integer n is divided by 3, the remainder is 1. When n is divided by 7, the remainder is 5. What is the smallest positive integer p, such that (n + p) is a multiple of 21?

(A) 1
(B) 2
(C) 5
(D) 19
(E) 20

n=3q+1
n=7p+5
3q+1=7p+5➡
3q-7p=4
least multiple of 3 that is four greater than multiple of 7 is 18
q=6
p=2
n=19
21-19=2=p
B

Ilomelin · Answer

Hello, could you please explain how you got to that equation?

Greetings.

gracie · Answer

hi, Ilomelin
in looking at the possible values of n 
for 3--1,4,7,10,13,16,19--
and for 7--5,12,19--
I noted that 
for 3, 19 is the 7th option
for 7, 19 is the 3rd option
and derived an equation
let r=remainder
d=divisor
n=r1+d1(d2-1)
I hope this helps
gracie

ScottTargetTestPrep · Answer

Since when n is divided by 3, the remainder is 1, n could be:

1, 4, 7, 10, 13, 16, 19, 22, …

Since when n is divided by 7, the remainder is 5, n could be:

5, 12, 19, 26, …

We can see that n = 19 satisfies both division/remainder criteria. And if p = 2, we have n + p = 19 + 2 = 21, which is a multiple of 21.

Answer: B

Praveenksinha · Answer

1) 3K+1 = 1,4,7,10,13,16,19,22,25........
2) 7N+5 = 5,12,19......
so the this number should be of form 21M+19 and therefore for n+p to be a multiple of 21 we need to add 2
ANS B

jantwarog · Answer

Easiest way is to just plug in.

A) if p=1 then n=20 >>> 20/3=6 r.2 - incorrect as the question says the remainder has to be 1
B) if p=2 then n=19 >>> 19/3=6 r.1 & 19/7=2 r.5 - everything fits

Answer: B

bumpbot · Answer

Automated notice from GMAT Club BumpBot: 

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

 This post was generated automatically.

When positive integer n is divided by 3, the remainder is 1. When n is

Prep Toolkit

Top 5 GMAT Debrief Videos

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards

GMAT Problem Solving (PS) Questions

When positive integer n is divided by 3, the remainder is 1. When n is

Prep Toolkit

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards