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

 It is currently 25 Aug 2016, 05:06

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 5, the remainder is 1.

Author Message
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 34432
Followers: 6255

Kudos [?]: 79447 [1] , given: 10016

When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

30 Jan 2014, 01:51
1
KUDOS
Expert's post
27
This post was
BOOKMARKED
00:00

Difficulty:

15% (low)

Question Stats:

77% (02:34) correct 23% (01:40) wrong based on 705 sessions

HideShow timer Statistics

The Official Guide For GMAT® Quantitative Review, 2ND Edition

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

(A) 3
(B) 4
(C) 12
(D) 32
(E) 35

Problem Solving
Question: 68
Category: Arithmetic Properties of numbers
Page: 70
Difficulty: 650

GMAT Club is introducing a new project: The Official Guide For GMAT® Quantitative Review, 2ND Edition - Quantitative Questions Project

Each week we'll be posting several questions from The Official Guide For GMAT® Quantitative Review, 2ND Edition and then after couple of days we'll provide Official Answer (OA) to them along with a slution.

We'll be glad if you participate in development of this project:
2. Please vote for the best solutions by pressing Kudos button;
3. Please vote for the questions themselves by pressing Kudos button;
4. Please share your views on difficulty level of the questions, so that we have most precise evaluation.

Thank you!
[Reveal] Spoiler: OA

_________________
Math Expert
Joined: 02 Sep 2009
Posts: 34432
Followers: 6255

Kudos [?]: 79447 [4] , given: 10016

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

30 Jan 2014, 01:51
4
KUDOS
Expert's post
14
This post was
BOOKMARKED
SOLUTION

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

(A) 3
(B) 4
(C) 12
(D) 32
(E) 35

Positive integer n is divided by 5, the remainder is 1 --> $$n=5q+1$$, where $$q$$ is the quotient --> 1, 6, 11, 16, 21, 26, 31, ...
Positive integer n is divided by 7, the remainder is 3 --> $$n=7p+3$$, where $$p$$ is the quotient --> 3, 10, 17, 24, 31, ....

There is a way to derive general formula for $$n$$ (of a type $$n=mx+r$$, where $$x$$ is divisor and $$r$$ is a remainder) based on above two statements:

Divisor $$x$$ would be the least common multiple of above two divisors 5 and 7, hence $$x=35$$.

Remainder $$r$$ would be the first common integer in above two patterns, hence $$r=31$$.

Therefore general formula based on both statements is $$n=35m+31$$. Thus the smallest positive integer k such that k+n is a multiple of 35 is 4 --> $$n+4=35k+31+4=35(k+1)$$.

More about deriving general formula for such problems at: manhattan-remainder-problem-93752.html#p721341
_________________
Moderator
Joined: 25 Apr 2012
Posts: 728
Location: India
GPA: 3.21
Followers: 42

Kudos [?]: 615 [1] , given: 723

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

30 Jan 2014, 03:07
1
KUDOS
When positive integer n is divided by 5, the remainder is 1. When n is divided by 7, the remainder is 3. What is the smallest positive integer k such that k + n is a multiple of 35 ?

(A) 3
(B) 4
(C) 12
(D) 32
(E) 35

Sol: Given n=5a+1 where a is any non-negative integer and also n=7b+3 where b is any non-negative integer.....so n is of the form

Possible values of n in case 1 : 1,6,11,16,21,26,31....
Possible value of n in case 2 : 3,10,17, 24,31...

So, n=35C+ 31....Now for K+ n to be multiple of 35 K needs to be 4 so that k+n = 35C+31+4 or 35(c+1)

Ans B.

650 level is okay
_________________

“If you can't fly then run, if you can't run then walk, if you can't walk then crawl, but whatever you do you have to keep moving forward.”

Senior Manager
Joined: 20 Dec 2013
Posts: 273
Location: India
Followers: 0

Kudos [?]: 76 [0], given: 29

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

30 Jan 2014, 03:26
Ans.B
n=5p+1=>n=6,11,16,21,26,31,36...
n=7q+3=>n=10,17,24,31,...
First no. common to both the series=31.We have to add 4.

I know there is a better way of doing this kind of question.
Manager
Joined: 04 Oct 2013
Posts: 162
Location: India
GMAT Date: 05-23-2015
GPA: 3.45
Followers: 3

Kudos [?]: 96 [2] , given: 54

When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

31 Jan 2014, 10:06
2
KUDOS
2
This post was
BOOKMARKED
When positive integer n is divided by 5, the remainder is 1. When n is divided by 7, the remainder is 3. What is the smallest positive integer k such that k + n is a multiple of 35 ?

(A) 3
(B) 4
(C) 12
(D) 32
(E) 35

Method 1

n is divided by 5, the remainder is 1 ---> $$n= 5x + 1$$
or, n + k = 5x + (1 + k)
So, n + k is divisible by 5, when (1+ k) is a multiple of 5.
Or, Possible values of k are 4, 9, 14,19, 24, 29, 33,.....

n is divided by 7, the remainder is 3 ----> $$n=7y + 3$$
Or, n + k = 7y +(3 + k)
So, n + k is divisible by 7, when (3+ k) is a multiple of 7.
Or, Possible values of k are 4, 11, 18, 25, 32, 39,.....

As the lowest common value is 4, the answer is (B).

Last edited by arunspanda on 29 Jan 2015, 22:26, edited 1 time in total.
Manager
Joined: 23 May 2013
Posts: 127
Followers: 1

Kudos [?]: 48 [0], given: 110

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

31 Jan 2014, 20:34
is there any other way, than number plugging? What if instead of 5 and 7, the question is changed to some scary numbers like 263 and 911?
_________________

“Confidence comes not from always being right but from not fearing to be wrong.”

Math Expert
Joined: 02 Sep 2009
Posts: 34432
Followers: 6255

Kudos [?]: 79447 [0], given: 10016

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

01 Feb 2014, 08:49
Expert's post
1
This post was
BOOKMARKED
SOLUTION

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

(A) 3
(B) 4
(C) 12
(D) 32
(E) 35

Positive integer n is divided by 5, the remainder is 1 --> $$n=5q+1$$, where $$q$$ is the quotient --> 1, 6, 11, 16, 21, 26, 31, ...
Positive integer n is divided by 7, the remainder is 3 --> $$n=7p+3$$, where $$p$$ is the quotient --> 3, 10, 17, 24, 31, ....

There is a way to derive general formula for $$n$$ (of a type $$n=mx+r$$, where $$x$$ is divisor and $$r$$ is a remainder) based on above two statements:

Divisor $$x$$ would be the least common multiple of above two divisors 5 and 7, hence $$x=35$$.

Remainder $$r$$ would be the first common integer in above two patterns, hence $$r=31$$.

Therefore general formula based on both statements is $$n=35m+31$$. Thus the smallest positive integer k such that k+n is a multiple of 35 is 4 --> $$n+4=35k+31+4=35(k+1)$$.

More about deriving general formula for such problems at: manhattan-remainder-problem-93752.html#p721341
_________________
Manager
Joined: 18 Oct 2013
Posts: 81
Location: India
Concentration: Technology, Finance
GMAT 1: 580 Q48 V21
GMAT 2: 530 Q49 V13
GMAT 3: 590 Q49 V21
WE: Information Technology (Computer Software)
Followers: 3

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

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

14 Feb 2014, 09:59
1
KUDOS
According to me simplest way to solve this problem is given below:

Let N=5P+1 or N=7Q+3

So 5P+1=7Q+3 => P=Q+((2Q+2)/5) .. Check for value of 2Q+2 divisible by 5 i.e. 4 and hence P=6
So smallest value of N=31 for P=6 and Q=4.

So, N is 31 and smallest number K , which add to N to make it multiple of 35 is 4. so K=4

Intern
Joined: 27 Mar 2014
Posts: 26
Followers: 0

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

When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

24 Jun 2014, 02:27
n+k is a multiple of 35 then n+k = 35x => n = 35x - k.
When positive integer n is divided by 5, the remainder is 1 => when integer k is divided by 5, the remainder is 4 => B

[or
When n is divided by 7, the remainder is 3 => when integer is divided by 7, the remainder is 4 => B or C, but we do not need to check this case]
Intern
Joined: 04 Jun 2014
Posts: 49
Followers: 0

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

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

15 Aug 2014, 03:14
Bunuel or anyone else: Could you post links to practice similar problems? I am having severe problems with this type of question at the moment..
Manager
Status: folding sleeves up
Joined: 26 Apr 2013
Posts: 154
Location: India
Concentration: Finance, Strategy
GMAT 1: 530 Q39 V23
GMAT 2: 560 Q42 V26
GPA: 3.5
WE: Consulting (Computer Hardware)
Followers: 1

Kudos [?]: 65 [0], given: 39

When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

17 Sep 2014, 10:24
Bunuel wrote:
The Official Guide For GMAT® Quantitative Review, 2ND Edition

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

(A) 3
(B) 4
(C) 12
(D) 32
(E) 35

Problem Solving
Question: 68
Category: Arithmetic Properties of numbers
Page: 70
Difficulty: 650

GMAT Club is introducing a new project: The Official Guide For GMAT® Quantitative Review, 2ND Edition - Quantitative Questions Project

Each week we'll be posting several questions from The Official Guide For GMAT® Quantitative Review, 2ND Edition and then after couple of days we'll provide Official Answer (OA) to them along with a slution.

We'll be glad if you participate in development of this project:
2. Please vote for the best solutions by pressing Kudos button;
3. Please vote for the questions themselves by pressing Kudos button;
4. Please share your views on difficulty level of the questions, so that we have most precise evaluation.

Thank you!

Sol:

n=5a+1 => Remainder is 1 or -4
n=7b+3 => Remainder is 3 or -4

i.e. if I add +4 to the number the number will be perfect multiple of 35
SVP
Status: The Best Or Nothing
Joined: 27 Dec 2012
Posts: 1858
Location: India
Concentration: General Management, Technology
WE: Information Technology (Computer Software)
Followers: 37

Kudos [?]: 1659 [1] , given: 193

When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

02 Oct 2014, 03:10
1
KUDOS
1
This post was
BOOKMARKED
Picked up 7 & added 3 = 10

10 gives a remainder 3 when divided by 7

Wrote down similar numbers. We are looking for numbers which would either end by 1 or 6 (so they would provide a remainder 1 when divided by 5)

10
17
24
31 ........ stop

31 is the number when divided by 5, provides remainder 1 (Its already tested that it provides remainder 3 when divided by 7)

First available multiple of 35 is 35, which is just 4 away from 31

_________________

Kindly press "+1 Kudos" to appreciate

Intern
Joined: 26 Jan 2010
Posts: 13
Location: chile
WE 1:
WE 2:
WE 3:
Followers: 0

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

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

26 Nov 2014, 12:23
REMAINDER

It is suggested to use the division algorithm.

By dividing a positive integer N for 5, residue 1 is obtained.

The algorithm is associated 5X + 1 = N, where N is the dividend, the divisor, and X is 1 is the remainder.

By dividing the same N for 7, remainder 3 is obtained.

The associated algorithm is N = 7Y + 3, where N is the dividend and the divisor and 3 is the remainder.

You have:

N = 5X + 1 and N = 7Y +3

Since N = N, equaling have:

5X +3 +1 = 7Y

Grouping variables, with positive results, it:

5X - 7Y = 2

It is suggested to start giving positive integers X, then watch multiple of 7 is closer to 5X, and meets equality:

Multiples of 5: 5, 10, 15, 20, 25, 30, 35, 40, 35, 50, .....

Multiples of 7: 7, 14, 21, 28, 35, 42, 49, 56, 63, 70, ....

The condition is:

Multiple of 5 - multiple of 7 = 2

30-28 = 2

Then X = 6 and Y = 4

Thus we obtain N = 31

Smaller value for K, if (K + N) is a multiple of 35?

This value is 4, because 4 + 31 = 35, and 35 is a multiple of 35.

claudio hurtado GMAT GRE SAT math classes part
Senior Manager
Status: Math is psycho-logical
Joined: 07 Apr 2014
Posts: 443
Location: Netherlands
GMAT Date: 02-11-2015
WE: Psychology and Counseling (Other)
Followers: 2

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

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

12 Jan 2015, 12:11
Can't we just do this:

n=5q+1= 1,6,11,16,21,26,31,36,41,46,...
n=7q+3= 3,9,17,24,31...

k+31> 35
k> 35-31
k> 4

35 is anyway the first multiple of 35 (35*1). Is this wrong..?
Senior Manager
Status: Math is psycho-logical
Joined: 07 Apr 2014
Posts: 443
Location: Netherlands
GMAT Date: 02-11-2015
WE: Psychology and Counseling (Other)
Followers: 2

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

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

12 Jan 2015, 12:15
Sorry, I forgot to mention the reasoning behind k+31> 35.

I thought that since k + n is a multiple of 35, it cannot be smaller. It should actually have a larger or equal sign there. So, this is why it is k+31> 35.

I always do that to remember while solving the problem that a multiple is larger (in comparison to a factor which is smaller).
Intern
Joined: 13 Mar 2015
Posts: 4
Followers: 0

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

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

24 Mar 2015, 13:24
The fastest way here is to realize that 35 is a factor of both 5 and 7. So you need to add a number to the remainder of both situations so that each number a factor of 5 and 7. By adding 4 to 1 it becomes a factor of 5, and by adding 4 to 3 it becomes a factor of 7. So B must be true
Director
Joined: 10 Mar 2013
Posts: 605
Location: Germany
Concentration: Finance, Entrepreneurship
GMAT 1: 580 Q46 V24
GPA: 3.88
WE: Information Technology (Consulting)
Followers: 8

Kudos [?]: 181 [0], given: 200

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

26 Aug 2015, 14:41
Hi all, actually we don't need pluging all those values for x,y...
n=5x+1 and n=7y+3 --> n+k=> (5x+1+k)/35 so 1+k must be a multiple of 5 if we want this expression to yield an integer so k=4
Use same logic here (7y+3+k)/35 -> 3+k must be a multiple of 7, so k=4
_________________

When you’re up, your friends know who you are. When you’re down, you know who your friends are.

800Score ONLY QUANT CAT1 51, CAT2 50, CAT3 50
GMAT PREP 670
MGMAT CAT 630
KAPLAN CAT 660

Senior Manager
Joined: 29 Oct 2013
Posts: 297
Concentration: Finance
GMAT 1: 750 Q V46
GPA: 3.7
WE: Corporate Finance (Retail Banking)
Followers: 13

Kudos [?]: 329 [1] , given: 197

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

01 Dec 2015, 14:44
1
KUDOS
N+4 is multiple of both 5 and 7 so N+4 must be an LCM of 5 and 7 i.e. 35. So the smallest value needed to make it multiple of 35 is 4
_________________

My journey V46 and 750 -> http://gmatclub.com/forum/my-journey-to-46-on-verbal-750overall-171722.html#p1367876

VP
Joined: 09 Jun 2010
Posts: 1331
Followers: 3

Kudos [?]: 96 [0], given: 768

Re: When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

10 May 2016, 09:05
i dont think that gmat test us the formular

just pick some specific numbers. and find 31
Manager
Affiliations: Target Test Prep
Joined: 04 Mar 2011
Posts: 190
Followers: 8

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

When positive integer n is divided by 5, the remainder is 1. [#permalink]

Show Tags

03 Aug 2016, 09:45
Quote:
When positive integer n is divided by 5, the remainder is 1. When n is divided by 7, the remainder is 3. What is the smallest positive integer k such that k + n is a multiple of 35 ?

(A) 3
(B) 4
(C) 12
(D) 32
(E) 35

We can find the value of n first by just strategically find values that when divided by 5 have a reminder of 1. For example, since the remainder is 1 when n is divided by 5, n will be a [(multiple of 5) + 1] and thus must be one of the following numbers:

1, 6, 11, 16, 21, 26, 31, …

Now we have to find out which of these numbers when divided by 7, have a remainder of 3.

1/7 = 0 remainder 1

6/7 = 0 remainder 6

11/7 = 0 remainder 6

6/7 = 1 remainder 4

16/7 = 2 remainder 2

21/7 = 3 remainder 0

26/7 = 3 remainder 5

31/7 = 4 remainder 3

We can see that 31 is the smallest value of n that satisfies the requirement. So we must determine the value of k such that k + n is a multiple of 35. Obviously, since 4 + 31 = 35 and 35 is a multiple of 35, then the smallest positive integer value of k is 4.

_________________

Jeffrey Miller
Jeffrey Miller

When positive integer n is divided by 5, the remainder is 1.   [#permalink] 03 Aug 2016, 09:45

Go to page    1   2    Next  [ 21 posts ]

Similar topics Replies Last post
Similar
Topics:
N is a positive integer. When N + 1 is divided by 5, the remainder is 6 31 Jan 2016, 08:04
12 When positive integer n is divided by 3, the remainder is 1. When n is 11 20 Oct 2015, 12:20
13 When positive integer n is divided by 5, the remainder is 1. When n is 8 09 Apr 2011, 16:08
12 When 10 is divided by the positive integer n, the remainder 35 15 Sep 2008, 14:33
90 When positive integer n is divided by 5, the remainder is 1 24 03 Jan 2010, 16:00
Display posts from previous: Sort by