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.

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: If a positive integer n, divided by 5 has a remainder 2
[#permalink]

Show Tags

20 Mar 2013, 16:40

2

If a positive integer n,divided by 5 has a remainder 2,which of the following must be true I. n is odd II. n+1 cannot be a prime number III. (n+2)divided by 7 has remainder 2

Some valid values for n: 7, 12, 17, 22, 27, 32... or, in other words: \(n=(i * 5) + 2\) for i=1,2,3...

I. FALSE: we see that n can we odd or even. II. FALSE: (n+1) could be a prime number. Example: n=12 --> (n+1)=13 is prime. Other example: for n=22, (n+1)=23 is prime. III. FALSE: for n=12, (n+2)=14, divided by 7 has remainder zero.

Re: If a positive integer n, divided by 5 has a remainder 2
[#permalink]

Show Tags

20 Mar 2013, 21:54

chiccufrazer1 wrote:

If a positive integer n,divided by 5 has a remainder 2,which of the following must be true I. n is odd II. n+1 cannot be a prime number III. (n+2)divided by 7 has remainder 2

A.none B.I only C.I and II only D.II and III only E.I,II and III

n can be written as :

n = 5k+2. Thus, taking k=0, we have n=2.

I.n=2,even.False II.2+1=3, is a prime. False. III.n+2 = 4,4 divided by 7 leaves a remainder of 4. False.

Re: If a positive integer n, divided by 5 has a remainder 2
[#permalink]

Show Tags

21 Mar 2013, 01:36

chiccufrazer1, you forgot to provide the OA in your post. Just make sure you do provide it for your future problems.

Alright, let's solve this :

We know that n, a positive integer, yields a remainder of 2 when divided by 5. So according to the algebraic form of the division operation, we'll have :

\(n = 5*q + 2\) with q being a positive integer as well.

This expression allows us to give out some valid possibilities for n by playing with the value of q, such as :

q = 0 => n = 2 q = 1 => n = 7 q= 2 => n =12

Now, from these first values we can already cross off statement I.(n is odd), since n can be 7 (which is odd) or n can be 12 (which is even).

Statement II. (n+1 cannot be a prime number) can also be crossed off. Consider n = 12, which is not a prime number and yields a remainder of 2 when divided by 5. If we add 1 to it, we get 13, which IS a prime number, so that contradicts statement II.

Finally, statement III. (n+2 yields a remainder of 2 when divided by 7) can also be crossed off. Again consider n = 12. Add 2 to it and we get a 14 which is a multiple of 7.

In short, all statements have been contradicted and the correct answer choice to the question is A : none of the statements above are true.

If a positive integer n, divided by 5 has a remainder 2
[#permalink]

Show Tags

Updated on: 06 Jul 2017, 09:24

1

Bunuel wrote:

If a positive integer n, divided by 5 has a remainder 2, which of the following must be true

I. n is odd II. n+1 cannot be a prime number III. (n+2) divided by 7 has remainder 2

A. None B. I only C. I and II only D. II and III only E. I, II and III

Quote:

A positive integer n, divided by 5 has a remainder 2 --> \(n=5q+2\), so n could be 2, 7, 12, 17, 22, 27, ...

I. n is odd. Not necessarily true, since n could be 2, so even.

II. n+1 cannot be a prime number. Not necessarily true, since n could be 2, so n+1=3=prime.

III. (n+2) divided by 7 has remainder 2. Not necessarily true, since n could be 7, so n+2=9.

Answer: A.

Hope it's clear.

Bunuel , I am confused by your analysis of III: (n+2) divided by 7 has remainder 2

If n = 7 and (n + 2) = 9, then \(\frac{9}{7}\) = 1 + R2.

n could be 2, 7, 12, 17 ...

If n = 12, then (n+2) = 14, which, when divided by 7, leaves remainder 0.

If n = 17, (n+2) = 19, which, when divided by 7, leaves remainder 5.

Those two examples (or others) seem to me to be what should be used to show that III does not satisfy the condition "must be true."

The one you chose proves that III could be true; I'm having a hard time understanding how n = 7 proves that III does not have to be true. Am I missing something?
_________________

In the depths of winter, I finally learned that within me there lay an invincible summer. -- Albert Camus, "Return to Tipasa"

Originally posted by generis on 06 Jul 2017, 09:11.
Last edited by generis on 06 Jul 2017, 09:24, edited 1 time in total.

Re: If a positive integer n, divided by 5 has a remainder 2
[#permalink]

Show Tags

06 Jul 2017, 09:21

genxer123 wrote:

Bunuel wrote:

If a positive integer n, divided by 5 has a remainder 2, which of the following must be true

I. n is odd II. n+1 cannot be a prime number III. (n+2) divided by 7 has remainder 2

A. None B. I only C. I and II only D. II and III only E. I, II and III

Quote:

A positive integer n, divided by 5 has a remainder 2 --> \(n=5q+2\), so n could be 2, 7, 12, 17, 22, 27, ...

I. n is odd. Not necessarily true, since n could be 2, so even.

II. n+1 cannot be a prime number. Not necessarily true, since n could be 2, so n+1=3=prime.

III. (n+2) divided by 7 has remainder 2. Not necessarily true, since n could be 7, so n+2=9.

Answer: A.

Hope it's clear.

Bunuel , I am confused by your analysis of III: (n+2) divided by 7 has remainder 2

If n = 9, then \(\frac{9}{7}\) = 1 + R2.

n could be 2, 7, 12, 17 ...

If n = 12, then (n+2) = 14, which, when divided by 7, leaves remainder 0.

If n = 17, (n+2) = 19, which, when divided by 7, leaves remainder 5.

Those two examples (or others) seem to me to be what should be used to show that III does not satisfy the condition "must be true."

The one you chose proves that III could be true; I'm having a hard time understanding how n = 7 proves that III does not have to be true. Am I missing something?

You are right. Edited the question.
_________________

Re: If a positive integer n, divided by 5 has a remainder 2
[#permalink]

Show Tags

13 Nov 2017, 15:12

1

Top Contributor

chiccufrazer1 wrote:

If a positive integer n, divided by 5 has a remainder 2, which of the following must be true

I. n is odd II. n+1 cannot be a prime number III. (n+2) divided by 7 has remainder 2

A. None B. I only C. I and II only D. II and III only E. I, II and III

-----------------ASIDE---------------------------------- 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. ------ONTO THE QUESTION!!!------------------------

Positive integer n, divided by 5 has a remainder 2 Some possible values of n: 2, 7, 12, 17, 22, 27, 32, 37, . . . etc

Now let's examine the statements: I. n is odd. This need not be true. Among the possible values of n, we see that n need not be odd So statement 1 is FALSE

II. n+1 cannot be a prime number. Not true. Among the possible values of n, we see that n COULD equal 2 2+1 = 3, and 3 IS a prime number So, n+1 CAN BE a prime number So statement 2 is FALSE

NOTE: Since statements I and II are false, we need not examine statement III, since there are no answer choices that suggest that only statement III is true. So, the correct must be A

RELATED VIDEO FROM OUR COURSE

_________________

Brent Hanneson – Founder of gmatprepnow.com

gmatclubot

Re: If a positive integer n, divided by 5 has a remainder 2 &nbs
[#permalink]
13 Nov 2017, 15:12