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

 It is currently 18 Jun 2018, 20: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

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

Author Message
TAGS:

Hide Tags

Senior Manager
Affiliations: SPG
Joined: 15 Nov 2006
Posts: 310
Given that n is an integer, is n 1 divisible by 3? [#permalink]

Show Tags

18 May 2010, 05:36
2
11
00:00

Difficulty:

55% (hard)

Question Stats:

68% (01:11) correct 32% (01:27) wrong based on 465 sessions

HideShow timer Statistics

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
Senior Manager
Joined: 25 Jun 2009
Posts: 287
Re: is n — 1 divisible by 3? [#permalink]

Show Tags

18 May 2010, 05:59
1
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.

CEO
Status: Nothing comes easy: neither do I want.
Joined: 12 Oct 2009
Posts: 2657
Location: Malaysia
Concentration: Technology, Entrepreneurship
Schools: ISB '15 (M)
GMAT 1: 670 Q49 V31
GMAT 2: 710 Q50 V35
Re: is n — 1 divisible by 3? [#permalink]

Show Tags

18 May 2010, 07:48
1
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
_________________

Fight for your dreams :For all those who fear from Verbal- lets give it a fight

Money Saved is the Money Earned

Jo Bole So Nihaal , Sat Shri Akaal

GMAT Club Premium Membership - big benefits and savings

Gmat test review :
http://gmatclub.com/forum/670-to-710-a-long-journey-without-destination-still-happy-141642.html

Senior Manager
Joined: 25 Jun 2009
Posts: 287
Re: is n — 1 divisible by 3? [#permalink]

Show Tags

18 May 2010, 07:55
1
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,
Manager
Joined: 04 Feb 2010
Posts: 59
Schools: IESE '13
WE 1: Engineer
Re: is n — 1 divisible by 3? [#permalink]

Show Tags

18 May 2010, 19:47
5
1 - neither n or n+1 are divisible by 3. Thus, n-1 must be divisible by 3, since every 3rd integer is divisible by 3. SUFF

2 - 3n + 5 >= k + 8

3n - 3 >= k

3(n-1) >= k

Because we know k is divisible by 3, but not 9 (3x3), n-1 could or could not be divisible by 3. INS

Manager
Joined: 08 May 2010
Posts: 133
Re: is n — 1 divisible by 3? [#permalink]

Show Tags

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.
Current Student
Joined: 26 May 2005
Posts: 532
Re: is n — 1 divisible by 3? [#permalink]

Show Tags

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.

Current Student
Joined: 08 Jan 2009
Posts: 309
GMAT 1: 770 Q50 V46
Re: is n — 1 divisible by 3? [#permalink]

Show Tags

19 Jul 2011, 03:45
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.

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.
Math Forum Moderator
Joined: 20 Dec 2010
Posts: 1901
Re: is n — 1 divisible by 3? [#permalink]

Show Tags

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.

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
_________________
Senior Manager
Joined: 23 Oct 2010
Posts: 364
Location: Azerbaijan
Concentration: Finance
Schools: HEC '15 (A)
GMAT 1: 690 Q47 V38
Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

Show Tags

31 Mar 2013, 07:16
Can experts say the final word regarding option (1)? I wonder whether A is sufficient
_________________

Happy are those who dream dreams and are ready to pay the price to make them come true

I am still on all gmat forums. msg me if you want to ask me smth

Math Expert
Joined: 02 Sep 2009
Posts: 46130
Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

Show Tags

31 Mar 2013, 07:55
5
1
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.

Hope it's clear.
_________________
Intern
Joined: 28 Jan 2013
Posts: 9
Location: India
Schools: HBS '16, HEC Jan'16
GPA: 3
WE: Marketing (Manufacturing)
Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

Show Tags

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.

Hope it's clear.

Can you kindly explain why B is not sufficient...
Math Expert
Joined: 02 Sep 2009
Posts: 46130
Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

Show Tags

02 Jun 2013, 13:56
2
1
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.

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.
_________________
Manager
Joined: 06 Feb 2013
Posts: 56
Re: Given that n is an integer, is n 1 divisible by 3? (1) n^2 + [#permalink]

Show Tags

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?
_________________

There are times when I do not mind kudos...I do enjoy giving some for help

SVP
Joined: 06 Sep 2013
Posts: 1885
Concentration: Finance
Re: Given that n is an integer, is n 1 divisible by 3? [#permalink]

Show Tags

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

Hope it helps
Cheers!
J

That means that n
Intern
Joined: 22 Jun 2017
Posts: 11
Location: India
GMAT 1: 670 Q48 V34
GPA: 4
Re: Given that n is an integer, is n 1 divisible by 3? [#permalink]

Show Tags

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
Math Expert
Joined: 02 Sep 2009
Posts: 46130
Re: Given that n is an integer, is n 1 divisible by 3? [#permalink]

Show Tags

18 Sep 2017, 03:33
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.
_________________
Re: Given that n is an integer, is n 1 divisible by 3?   [#permalink] 18 Sep 2017, 03:33
Display posts from previous: Sort by

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

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.