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

It is currently 29 Jun 2016, 00:22
GMAT Club Tests

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

If n is a positive integer, is n^3 - n divisible by 4? 1) n

  post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
Director
Director
avatar
Joined: 06 Sep 2006
Posts: 743
Followers: 1

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

If n is a positive integer, is n^3 - n divisible by 4? 1) n [#permalink]

Show Tags

New post 27 Jul 2007, 21:55
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 1 sessions

HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

If n is a positive integer, is n^3 - n divisible by 4?

1) n = 2k + 1, where k is an integer.

2) n^2 + n is divisible by 6.


Guys, in (1), can k be equal to 0?
Director
Director
avatar
Joined: 06 Sep 2006
Posts: 743
Followers: 1

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

Re: DS - OG 147 [#permalink]

Show Tags

New post 27 Jul 2007, 22:52
asaf wrote:
If n is a positive integer, is n^3 - n divisible by 4?

1) n = 2k + 1, where k is an integer.

2) n^2 + n is divisible by 6.


Guys, in (1), can k be equal to 0?


Well the OA is A.

For 1): If k = 0; then n = 1 ==> n^3 - n = 0 which is not divisible by 4, right?

if n = 3 (k=1) then (n-1) n (n+1) = 2 * 3 * 4 is divisble by 4

Not sufficient, right?
why OA is A?
Senior Manager
Senior Manager
avatar
Joined: 04 Jun 2007
Posts: 346
Followers: 1

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

Re: DS - OG 147 [#permalink]

Show Tags

New post 27 Jul 2007, 23:51
asaf wrote:
asaf wrote:
If n is a positive integer, is n^3 - n divisible by 4?

1) n = 2k + 1, where k is an integer.

2) n^2 + n is divisible by 6.


Guys, in (1), can k be equal to 0?


Well the OA is A.

For 1): If k = 0; then n = 1 ==> n^3 - n = 0 which is not divisible by 4, right?

if n = 3 (k=1) then (n-1) n (n+1) = 2 * 3 * 4 is divisible by 4

Not sufficient, right?
why OA is A?


I think 0 is divisible by all numbers. So A should be sufficient.
VP
VP
User avatar
Joined: 08 Jun 2005
Posts: 1146
Followers: 6

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

 [#permalink]

Show Tags

New post 28 Jul 2007, 02:05
statement 1

n = 2k + 1, where k is an integer.

plug in for n

(2k + 1)^3 - (2k + 1)

(2k + 1)*((2k + 1)^2 - 1)

(2k + 1)*(4k^2 + 4k + 1 - 1)

(2k + 1)*(4k^2 + 4k)

8k^3 + 4k^2 + 4K + 8k^2

4(2k^3 + k^2 + k + 2k^2)

so we can say that n^3 - n divisible by 4

sufficient

0 is divisible by all numbers (see OG 11 page 108) n*0 = 0 so 4*0 = 0 and 0/4 = 0

statement 2

n^2 + n is divisible by 6.

clearly insufficient

the answer is (A)

:-D
Manager
Manager
avatar
Joined: 07 Jul 2007
Posts: 126
Followers: 1

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

 [#permalink]

Show Tags

New post 28 Jul 2007, 04:37
A is correct.
1. n=2k+1 i.e. n will always be odd and that will make n^3-n always even. And since it is sqared so it can be divided by 4
2. It is divided by 6 i.e. it can be divided by 2 and 3 so here n be or odd or even. Not sufficient
SVP
SVP
User avatar
Joined: 01 May 2006
Posts: 1798
Followers: 9

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

 [#permalink]

Show Tags

New post 28 Jul 2007, 06:11
KillerSquirrel wrote:
statement 1

n = 2k + 1, where k is an integer.

plug in for n

(2k + 1)^3 - (2k + 1)

(2k + 1)*((2k + 1)^2 - 1)

(2k + 1)*(4k^2 + 4k + 1 - 1)

(2k + 1)*(4k^2 + 4k)

8k^3 + 4k^2 + 4K + 8k^2

4(2k^3 + k^2 + k + 2k^2)

so we can say that n^3 - n divisible by 4

sufficient

0 is divisible by all numbers (see OG 11 page 108) n*0 = 0 so 4*0 = 0 and 0/4 = 0

statement 2

n^2 + n is divisible by 6.

clearly insufficient

the answer is (A)

:-D


Same approach except that, for the statment 1, I factorize to avoid huger calculus :)

n^3 - n
= n*(n^2 - 1)
= n*(n+1)*(n-1)
= (2*k+1) * ((2*k+1) +1) * ((2*k+1) -1)
= (2*k+1) * 2*(k+1) * 2*k
= 4 * (2k+1) * (k+1) * k

:)
Director
Director
User avatar
Joined: 26 Feb 2006
Posts: 904
Followers: 4

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

 [#permalink]

Show Tags

New post 28 Jul 2007, 09:21
KillerSquirrel wrote:
statement 1

n = 2k + 1, where k is an integer.

plug in for n

(2k + 1)^3 - (2k + 1)
(2k + 1)*((2k + 1)^2 - 1)
(2k + 1)*(4k^2 + 4k + 1 - 1)
(2k + 1)*(4k^2 + 4k)
8k^3 + 4k^2 + 4K + 8k^2
4(2k^3 + k^2 + k + 2k^2)

so we can say that n^3 - n divisible by 4

sufficient

0 is divisible by all numbers (see OG 11 page 108) n*0 = 0 so 4*0 = 0 and 0/4 = 0

statement 2

n^2 + n is divisible by 6.

clearly insufficient

the answer is (A)

:-D



n = 2k + 1, where k is an integer. plug in for n

(2k + 1)^3 - (2k + 1)
(2k + 1)*((2k + 1)^2 - 1)
(2k + 1)*(4k^2 + 4k + 1 - 1)
(2k + 1)*(4k^2 + 4k)
(2k + 1)* 4 (k^2 + k)
gotta. so I stop here.
VP
VP
User avatar
Joined: 08 Jun 2005
Posts: 1146
Followers: 6

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

 [#permalink]

Show Tags

New post 28 Jul 2007, 10:58
Himalayan wrote:

n = 2k + 1, where k is an integer. plug in for n

(2k + 1)^3 - (2k + 1)
(2k + 1)*((2k + 1)^2 - 1)
(2k + 1)*(4k^2 + 4k + 1 - 1)
(2k + 1)*(4k^2 + 4k)
(2k + 1)* 4 (k^2 + k)
gotta. so I stop here.


Perfect - thanks

:-D
  [#permalink] 28 Jul 2007, 10:58
Display posts from previous: Sort by

If n is a positive integer, is n^3 - n divisible by 4? 1) n

  post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

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®.