GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 12 Dec 2019, 19:30

Close

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

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel

What is the remainder when the positive integer n is divided by 2?

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

Hide Tags

Find Similar Topics 
Manager
Manager
User avatar
Joined: 10 Sep 2014
Posts: 61
What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 08 Mar 2015, 04:59
8
00:00
A
B
C
D
E

Difficulty:

  95% (hard)

Question Stats:

51% (02:35) correct 49% (02:27) wrong based on 178 sessions

HideShow timer Statistics

What is the remainder when the positive integer n is divided by 2?

(1) When n is divided by 13, the remainder is 3
(2) n + 2 is a multiple of 7
Most Helpful Expert Reply
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 59712
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 08 Mar 2015, 07:43
4
7
What is the remainder when the positive integer n is divided by 2?

The remainder upon division n by 2 can be 0 (when n is even) or 1 (when n is odd). So, the question basically asks whether n is even or odd.

(1) When n is divided by 13, the remainder is 3 --> n = 13q + 3 --> n can be: 3, 16, 29, 42, 55, 68, ... So, n can be even as well as odd. Not sufficient.

(2) n + 2 is a multiple of 7 --> n is 2 less than a multiple of 7, or, which is the same, n is 5 more than a multiple of 7 --> n = 7p + 5: 5, 12, 19, 26, 33, 40, 47, 54, 61, 68, ... So, n can be even as well as odd. Not sufficient.

(1)+(2) From n = 13q + 3 and n = 7p + 5, we can get that n = 91k + 68 (check HERE to know to to derive general formula from these two), so n can be 68, 159, ... So, again, n can be even as well as odd. Not sufficient.

Answer: E.

Hope it's clear.
_________________
General Discussion
Manager
Manager
User avatar
Joined: 10 Sep 2014
Posts: 61
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 09 Mar 2015, 14:05
Thanks Bunuel. Basically, i was confused about finding n = 91k + 68. Now, its clear.
Current Student
User avatar
S
Joined: 25 Jul 2015
Posts: 110
Location: Thailand
Concentration: Entrepreneurship, Marketing
GMAT 1: 550 Q37 V28
GMAT 2: 660 Q47 V34
GMAT 3: 650 Q44 V35
GMAT 4: 680 Q49 V32
GMAT 5: 740 Q49 V42
GPA: 3.33
Reviews Badge
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 16 Nov 2016, 01:11
Could someone explain how n = 7p + 5 was derived?
_________________
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 59712
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 16 Nov 2016, 01:41
Current Student
User avatar
B
Status: DONE!
Joined: 05 Sep 2016
Posts: 354
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 17 Nov 2016, 22:33
(1) n = 13q+3 (3,16,29,...)

if we try to divide each possible value of n by 2, we find R is not consistent (i.e. R = 1, R=0, R=1...)

NOT SUFFICIENT

(2) n+2 =7#

say n+2=7 --> n=5 --> 5/2 --> R = 1
say n+2=14 --> n=12 --> 12/2 --> R = 0

inconsistent remainders, thus NOT SUFFICIENT

(1) + (2)
13q+5=7#

13 is a prime number. There is no way we would be able to obtain 13 by subtracting 5 from a multiple of 7.

Thus, insufficient.

E
Target Test Prep Representative
User avatar
G
Status: Head GMAT Instructor
Affiliations: Target Test Prep
Joined: 04 Mar 2011
Posts: 2809
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 29 Nov 2016, 16:45
TARGET730 wrote:
What is the remainder when the positive integer n is divided by 2?

(1) When n is divided by 13, the remainder is 3
(2) n + 2 is a multiple of 7


We need to determine the remainder when the positive integer n is divided by 2. Keep in mind that when a positive integer is divided by 2, the remainder is either 0 (if the number is even) or 1 (if the number is odd).

Statement One Alone:

When n is divided by 13, the remainder is 3.

There are many possible values for n. For example, n could be 16 or n could be 29. If n = 16, the remainder is 0 when n is divided by 2. However, if n = 29, the remainder is 1 when n is divided by 2. Statement one alone is not sufficient to answer the question. We can eliminate answer choices A and D.

Statement Two Alone:

n + 2 is a multiple of 7.

There are many possible values for n. For example, n could be 5 or n could be 12. If n = 5, the remainder is 1 when n is divided by 2. However, if n = 12, the remainder is 0 when n is divided by 2. Statement two alone is not sufficient to answer the question. We can eliminate answer choice B.

Statements One and Two Together:

Even with the two statements, there are still many possible values for n. For example, n could be 68 or n could be 159. If n = 68, the remainder is 0 when n is divided by 2. However, if n = 159, the remainder is 1 when n is divided by 2. The two statements together are still not sufficient to answer the question.

Answer: E
_________________

Jeffrey Miller

Head of GMAT Instruction

Jeff@TargetTestPrep.com
TTP - Target Test Prep Logo
122 Reviews

5-star rated online GMAT quant
self study course

See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews

If you find one of my posts helpful, please take a moment to click on the "Kudos" button.

Manager
Manager
User avatar
S
Joined: 05 Dec 2016
Posts: 232
Concentration: Strategy, Finance
GMAT 1: 620 Q46 V29
GMAT ToolKit User
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 14 Feb 2017, 07:01
Bunuel wrote:
What is the remainder when the positive integer n is divided by 2?

The remainder upon division n by 2 can be 0 (when n is even) or 1 (when n is odd). So, the question basically asks whether n is even or odd.

(1) When n is divided by 13, the remainder is 3 --> n = 13q + 3 --> n can be: 3, 16, 29, 42, 55, 68, ... So, n can be even as well as odd. Not sufficient.

(2) n + 2 is a multiple of 7 --> n is 2 less than a multiple of 7, or, which is the same, n is 5 more than a multiple of 7 --> n = 7p + 5: 5, 12, 19, 26, 33, 40, 47, 54, 61, 68, ... So, n can be even as well as odd. Not sufficient.

(1)+(2) From n = 13q + 3 and n = 7p + 5, we can get that n = 91k + 68 (check HERE to know to to derive general formula from these two), so n can be 68, 159, ... So, again, n can be even as well as odd. Not sufficient.

Answer: E.

Hope it's clear.


Hi Bunuel,

Could you please advise if we can just add one equation to another? In that case we would have n=20k+1. By picking the numbers we see that it can either be even OR odd, so we get E as the answer.
This approach is presented by MGM for tackling extra remainders problems.

Thanks.
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 59712
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 14 Feb 2017, 07:06
1
Alexey1989x wrote:
Bunuel wrote:
What is the remainder when the positive integer n is divided by 2?

The remainder upon division n by 2 can be 0 (when n is even) or 1 (when n is odd). So, the question basically asks whether n is even or odd.

(1) When n is divided by 13, the remainder is 3 --> n = 13q + 3 --> n can be: 3, 16, 29, 42, 55, 68, ... So, n can be even as well as odd. Not sufficient.

(2) n + 2 is a multiple of 7 --> n is 2 less than a multiple of 7, or, which is the same, n is 5 more than a multiple of 7 --> n = 7p + 5: 5, 12, 19, 26, 33, 40, 47, 54, 61, 68, ... So, n can be even as well as odd. Not sufficient.

(1)+(2) From n = 13q + 3 and n = 7p + 5, we can get that n = 91k + 68 (check HERE to know to to derive general formula from these two), so n can be 68, 159, ... So, again, n can be even as well as odd. Not sufficient.

Answer: E.

Hope it's clear.


Hi Bunuel,

Could you please advise if we can just add one equation to another? In that case we would have n=20k+1. By picking the numbers we see that it can either be even OR odd, so we get E as the answer.
This approach is presented by MGM for tackling extra remainders problems.

Thanks.


No, this would be incorrect.

You cannot add n = 13q + 3 and n = 7p + 5 to get n = 20k + 1. Notice that the quotients there are different: q and p. The way you can get the general formula is given in the solution.
_________________
Target Test Prep Representative
User avatar
G
Status: Head GMAT Instructor
Affiliations: Target Test Prep
Joined: 04 Mar 2011
Posts: 2809
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 15 Feb 2017, 16:19
1
TARGET730 wrote:
What is the remainder when the positive integer n is divided by 2?

(1) When n is divided by 13, the remainder is 3
(2) n + 2 is a multiple of 7


We need to determine the remainder when n is divided by 2.

Statement One Alone:

When n is divided by 13, the remainder is 3.

Statement one alone is not sufficient to answer the question. For example, when n = 3, the remainder when n is divided by 2 is 1. However, when n = 16, the remainder when n is divided by 2 is 0.

Statement Two Alone:

n + 2 is a multiple of 7.

Statement two alone is not sufficient to answer the question. For instance, when n = 5, the remainder when n is divided by 2 is 1. However, when n = 12, the remainder when n is divided by 2 is 0.

Statements One and Two Together:

Let’s list out possible values of n from statement one:

From statement one:

n = 3, 16, 29, 42, 55, 68

We see that from the above list, 68 (since 68 + 2 = 70 is a multiple of 7) fulfills both statements one and two and provides a remainder of 0 when divided by 2.

To determine the next value in the list, we can use the least common multiple of 13 and 7, which is 13 x 7 = 91. Thus, the next number that could be n is 68 + (7 x 13) = 159. Since 159 has a remainder of 1 when divided by 2, the two statements together are still not sufficient to answer the question.

Answer: E
_________________

Jeffrey Miller

Head of GMAT Instruction

Jeff@TargetTestPrep.com
TTP - Target Test Prep Logo
122 Reviews

5-star rated online GMAT quant
self study course

See why Target Test Prep is the top rated GMAT quant course on GMAT Club. Read Our Reviews

If you find one of my posts helpful, please take a moment to click on the "Kudos" button.

Non-Human User
User avatar
Joined: 09 Sep 2013
Posts: 13743
Re: What is the remainder when the positive integer n is divided by 2?  [#permalink]

Show Tags

New post 07 Feb 2019, 21:30
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.
_________________
GMAT Club Bot
Re: What is the remainder when the positive integer n is divided by 2?   [#permalink] 07 Feb 2019, 21:30
Display posts from previous: Sort by

What is the remainder when the positive integer n is divided by 2?

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





cron

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