Given that n is an integer, is n 1 divisible by 3? : Data Sufficiency (DS)

cipher

Manager

Joined: 25 Jun 2009

Posts: 132

Own Kudos [?]: 333 [2]

Given Kudos: 6

Q49 V22 GMAT 2: 700 Q50 V35

Send PM

Re: is n — 1 divisible by 3? [#permalink]

18 May 2010, 05:59

2

Kudos

dimitri92 wrote:

Given that n is an integer, is n — 1 divisible by 3?
(1) n^2 + n is not divisible by 3
(2) 3n +5 >= k+8 , where k is a positive multiple of 3

A,

St1 $n^2 + n = n* (n +1)$ is not divisible by 3

which means neither n nor n+1 is divisble by 3 hence n-1 will be divisble by 3

St2 - 3n +5 >= k +8 = > 3n >= K

Now n can be a divisble by 3 or not

for .e g take n = 3 and k = 2 then n is divisble by 3 but if n =4 and k = 2 then n is not.

OA please?

gurpreetsingh

SVP

Joined: 12 Oct 2009

Status:<strong>Nothing comes easy: neither do I want.</strong>

Posts: 2279

Own Kudos [?]: 3594 [2]

Given Kudos: 235

Location: Malaysia

Concentration: Technology, Entrepreneurship

Schools: ISB '15 (M)

GMAT 1: 670 Q49 V31

GMAT 2: 710 Q50 V35

Send PM

Re: is n — 1 divisible by 3? [#permalink]

18 May 2010, 07:48

1

Kudos

dimitri92 wrote:

Given that n is an integer, is n — 1 divisible by 3?
(1) n^2 + n is not divisible by 3
(2) 3n +5 >= k+8 , where k is a positive multiple of 3

IMO C.

n^2+n = n(n+1) is not divisible by 3 => n-1 is divisible by 3 IF N is no equal to 0,1,-1 else this wont hold true, thus not sufficient.

3n +5 >= k+8
=> 3n >= k+3 , take k = 3m as k is positive multiple of 3

=> 3n>=3m+3
=> n >= m+1 => n>1 Not sufficient.

But if we combine the both then n-1 is divisible by 3 when n>1
Thus C

cipher

Manager

Joined: 25 Jun 2009

Posts: 132

Own Kudos [?]: 333 [2]

Given Kudos: 6

Q49 V22 GMAT 2: 700 Q50 V35

Send PM

Re: is n — 1 divisible by 3? [#permalink]

18 May 2010, 07:55

2

Kudos

gurpreetsingh wrote:

dimitri92 wrote:

Given that n is an integer, is n — 1 divisible by 3?
(1) n^2 + n is not divisible by 3
(2) 3n +5 >= k+8 , where k is a positive multiple of 3

IMO C.

n^2+n = n(n+1) is not divisible by 3 => n-1 is divisible by 3 IF N is no equal to 0,1,-1 else this wont hold true, thus not sufficient.

3n +5 >= k+8
=> 3n >= k+3 , take k = 3m as k is positive multiple of 3

=> 3n>=3m+3
=> n >= m+1 => n>1 Not sufficient.

But if we combine the both then n-1 is divisible by 3 when n>1
Thus C

n^2+n = n(n+1) is not divisible by 3 => n-1 is divisible by 3 IF N is no equal to 0,1,-1 else this wont hold true, thus not sufficient.

I guess you overlooked some facts,

Let me try to explain them with examples,

Say, n=0 then n(n+1) = 0 -> which is divisble by 3 and hence the st 1 is not valid for this example
Now let n=1 then n(n+1) - > 2 which is not diviable by 3 but then n-1 = 0 which is divisble by 3
Now let n=-1 then n(n+1) = 0 which is again divisble y 3 and hence St 1 does not hold true for this example as well.

Cheers,

skipjames

Manager

Joined: 08 May 2010

Posts: 102

Own Kudos [?]: 115 [0]

Given Kudos: 39

Send PM

Re: is n — 1 divisible by 3? [#permalink]

18 May 2010, 22:39

I completely understand how statement 1 is sufficient, but am going to have to review statement 2 further to understand why it is not sufficient. I understand the simple math just not the explanation that follows.

Good question though. Had me thinking. Thank you very much.

Testluv

Kaplan GMAT Instructor

Joined: 21 Jun 2010

Posts: 55

Own Kudos [?]: 452 [2]

Given Kudos: 2

Location: Toronto

Send PM

Re: Good one [#permalink]

02 Jul 2010, 21:45

2

Kudos

(1) states that n^2 + n is not divisible by 3.

Or, n*(n+1) is not divisible by 3.

Thus, neither "n" nor "n+1" is a multiple of 3.

Since every 3rd integer on the number line is a multiple of 3, this means that "n+2" is a multiple of 3. And, again, since every 3rd number is a mutiple of 3, (n+2)-3 or "n-1" is a multiple of 3.
Sufficient.

(2) is an inequality. Even if it said:

n-1>= a multiple of 3 (or n-1>= non-multiple of 3)

it would still be insufficient because you can be greater than a multiple of 3 (or a non-multiple of 3) with or without being a multiple of 3 yourself.
Insufficient.

Choose A.

sudhir18n

Current Student

Joined: 26 May 2005

Posts: 356

Own Kudos [?]: 566 [0]

Given Kudos: 13

Send PM

Re: is n — 1 divisible by 3? [#permalink]

19 Jul 2011, 03:30

its MGMAT

The OE for statement 1.

Since we are told in Statement (1) that the product n^2+n is not divisible by 3, we know that neither n nor n +
1 is divisible by 3. Therefore it seems that n — 1 must be divisible by 3.
However, this only holds if the integers in the consecutive set are nonzero integers. Since Statement (1) does
not tell us this, it is not sufficient.

I dont buy this ...

pike

Current Student

Joined: 08 Jan 2009

Posts: 245

Own Kudos [?]: 441 [1]

Given Kudos: 7

GMAT 1: 770 Q50 V46

Send PM

Re: is n — 1 divisible by 3? [#permalink]

19 Jul 2011, 03:45

1

Kudos

sudhir18n wrote:

its MGMAT

The OE for statement 1.

Since we are told in Statement (1) that the product n^2+n is not divisible by 3, we know that neither n nor n +
1 is divisible by 3. Therefore it seems that n — 1 must be divisible by 3.
However, this only holds if the integers in the consecutive set are nonzero integers. Since Statement (1) does
not tell us this, it is not sufficient.

I dont buy this ...

Neither.

Here is my logic:

We know this from the question stem:
n = Set of all integers = {..., -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, ... }

1) n^2 + n is not divisible by 3

We now know:
n = {... -11, -8, -5, -2, 1, 4, 7, 10, ...} <--- very clear pattern here

We are interested in n-1 (but only from the above set, which meet our condition imposed on 1)
n - 1 = {..., -12, -9, -6, -3, 0, 3, 6, 9, ... }

Let's check these against what ware testing for, are these divisible by three? Very clearly, yes.

1 is sufficient.

fluke

Retired Moderator

Joined: 20 Dec 2010

Posts: 1114

Own Kudos [?]: 4702 [0]

Given Kudos: 376

Send PM

Re: is n — 1 divisible by 3? [#permalink]

19 Jul 2011, 05:48

sudhir18n wrote:

its MGMAT

The OE for statement 1.

Since we are told in Statement (1) that the product n^2+n is not divisible by 3, we know that neither n nor n +
1 is divisible by 3. Therefore it seems that n — 1 must be divisible by 3.
However, this only holds if the integers in the consecutive set are nonzero integers. Since Statement (1) does
not tell us this, it is not sufficient.
I dont buy this ...

Thanks Sudhir. Please notify MGMAT. Product of three consecutive integers must be divisible by 3 irrespective of 0, -ves or +ves.

(n-1)n(n+1) must be divisible by 3.
n(n+1): Not Divisible
(n-1): must be divisible

LalaB

Current Student

Joined: 23 Oct 2010

Posts: 235

Own Kudos [?]: 1111 [0]

Given Kudos: 73

Location: Azerbaijan

Concentration: Finance

Schools: HEC '15 (A)

GMAT 1: 690 Q47 V38

Send PM

Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

31 Mar 2013, 07:16

Can experts say the final word regarding option (1)? I wonder whether A is sufficient

karjan07

Intern

Joined: 28 Jan 2013

Posts: 7

Own Kudos [?]: 5 [0]

Given Kudos: 27

Location: India

Concentration: Marketing, International Business

Schools: HBS '16 HEC Jan'16

GPA: 3

WE:Marketing (Manufacturing)

Send PM

Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

02 Jun 2013, 13:25

Bunuel wrote:

LalaB wrote:

Can experts say the final word regarding option (1)? I wonder whether A is sufficient

Given that n is an integer, is n — 1 divisible by 3?

(1) n^2 + n is not divisible by 3 --> n(n+1) is not divisible by 3 --> neither n nor n+1 is divisible by 3. Now, n-1, n and n+1 are three consecutive integers, thus one of them must be divisible by 3, so if n and n+1 are NOT, then n-1 must be. Sufficient.

(2) 3n +5 >= k+8 , where k is a positive multiple of 3. Not sufficient.

Answer: A.

Hope it's clear.

Can you kindly explain why B is not sufficient...

L

Bunuel

Math Expert

Joined: 02 Sep 2009

Posts: 92914

Own Kudos [?]: 618951 [3]

Given Kudos: 81595

Send PM

Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

02 Jun 2013, 13:56

2

Kudos

1

Bookmarks

Expert Reply

karjan07 wrote:

Bunuel wrote:

LalaB wrote:

Can experts say the final word regarding option (1)? I wonder whether A is sufficient

Given that n is an integer, is n — 1 divisible by 3?

(1) n^2 + n is not divisible by 3 --> n(n+1) is not divisible by 3 --> neither n nor n+1 is divisible by 3. Now, n-1, n and n+1 are three consecutive integers, thus one of them must be divisible by 3, so if n and n+1 are NOT, then n-1 must be. Sufficient.

(2) 3n +5 >= k+8 , where k is a positive multiple of 3. Not sufficient.

Answer: A.

Hope it's clear.

Can you kindly explain why B is not sufficient...

Sure.

(2) says that 3n +5 >= k+8 , where k is a positive multiple of 3 --> k=3x, for some positive integer x --> $3n +5\geq{3x+8}$ --> $3n-3\geq{3x}$ --> $n-1\geq{x}$. So, basically we just have that n-1 is greater or equal to some positive integer x, thus it may or may not be a multiple of 3.

Hope it's clear.

obs23

Intern

Joined: 06 Feb 2013

Posts: 35

Own Kudos [?]: 206 [0]

Given Kudos: 35

Send PM

Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

03 Sep 2013, 06:12

Quote:

(2) says that 3n +5 >= k+8 , where k is a positive multiple of 3 --> k=3x, for some positive integer x --> $3n +5\geq{3x+8}$ --> $3n-3\geq{3x}$ --> $n-1\geq{x}$. So, basically we just have that n-1 is greater or equal to some positive integer x, thus it may or may not be a multiple of 3.

Just to go a bit further on this, in what case would $n-1$ be divisible by $3$? Say if you ended up with $n-1\geq{3x}$ it would still be insufficient, is not it so? The fact that we have $\geq$ seems to necessarily mean that $n-1$ may not necessarily be divisible because we have so many options, or I am missing the point here?

jlgdr

VP

Joined: 06 Sep 2013

Posts: 1345

Own Kudos [?]: 2391 [0]

Given Kudos: 355

Concentration: Finance

Schools: Wharton '17 (A) HBS '17 (WA$)

Send PM

Re: Given that n is an integer, is n 1 divisible by 3? [#permalink]

30 Dec 2013, 10:10

dimitri92 wrote:

Given that n is an integer, is n — 1 divisible by 3?

(1) n^2 + n is not divisible by 3
(2) 3n +5 >= k+8 , where k is a positive multiple of 3

The product of three consecutive integers (n-1)(n)(n+1) must be divisible by 2

Statement 1

If n^2+n= n(n+1) is not divisible by three then (n-1) must be divisible by 3

Suff

Statement 2

If k is a multiple of three
Then we get that 3n >= k + 3
This only tell us that n >=1 but nothing else. Could be any number

Hence, answer is A

Hope it helps
Cheers!
J

That means that n

B

amitpassionate

Intern

Joined: 22 Jun 2017

Posts: 13

Own Kudos [?]: 0 [0]

Given Kudos: 6

Location: India

GMAT 1: 670 Q48 V34

GPA: 4

Send PM

Re: Given that n is an integer, is n 1 divisible by 3? [#permalink]

18 Sep 2017, 03:13

n can not be 0 as o is multiple of every number and not and factor of ant number. OA seems wrong it should be A

L

Bunuel

Math Expert

Joined: 02 Sep 2009

Posts: 92914

Own Kudos [?]: 618951 [0]

Given Kudos: 81595

Send PM

Re: Given that n is an integer, is n 1 divisible by 3? [#permalink]

18 Sep 2017, 03:33

Expert Reply

amitpassionate wrote:

n can not be 0 as o is multiple of every number and not and factor of ant number. OA seems wrong it should be A

The OA is correct.

For (1) n cannot be 0, because in this case n^2 + n = 0, which IS divisible by 3, so it would contradict this statement. But how this changes the answer? Please re-read the solutions above.

bumpbot

Non-Human User

Joined: 09 Sep 2013

Posts: 32674

Own Kudos [?]: 821 [0]

Given Kudos: 0

Send PM

Re: Given that n is an integer, is n 1 divisible by 3? [#permalink]

05 Aug 2023, 08: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.

gmatclubot

Re: Given that n is an integer, is n 1 divisible by 3? [#permalink]

05 Aug 2023, 08:30

GMAT Data Sufficiency (DS) Questions

Given that n is an integer, is n 1 divisible by 3?