If n and k are positive integers, is n divisible by 6? (1) n : DS Archive
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 20 Jan 2017, 17:39

### 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

# If n and k are positive integers, is n divisible by 6? (1) n

Author Message
Manager
Joined: 10 Oct 2005
Posts: 113
Location: Hollywood
Followers: 0

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

If n and k are positive integers, is n divisible by 6? (1) n [#permalink]

### Show Tags

12 May 2006, 10:54
00:00

Difficulty:

(N/A)

Question Stats:

100% (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 and k are positive integers, is n divisible by 6?

(1) n = k(k + 1)(k - 1)
(2) k â€“ 1 is a multiple of 3.
_________________

The GMAT, too tough to be denied.
Beat the tough questions...

Intern
Joined: 04 May 2006
Posts: 49
Followers: 0

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

### Show Tags

12 May 2006, 11:03
I think its A.
1 is sufficient bcoz, in three consecutive numbers atleast one will be even (so multiple of 2) and atleast 1 will be multiple of 3. So it's sufficient.
_________________

If A equals success, then the formula is: A = X + Y + Z, X is work. Y is play. Z is keep your mouth shut.
Albert Einstein

Director
Joined: 06 May 2006
Posts: 792
Followers: 3

Kudos [?]: 32 [0], given: 2

### Show Tags

12 May 2006, 12:17
(2) is sufficient too.

if k-1 is odd, then k is even, so (k-1)*k*(k+1) is divisible by 6.
if k-1 is even, then it already is divisible by 6.
Intern
Joined: 04 May 2006
Posts: 49
Followers: 0

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

### Show Tags

12 May 2006, 12:23
Agree with D. (Both are sufficient.)
_________________

If A equals success, then the formula is: A = X + Y + Z, X is work. Y is play. Z is keep your mouth shut.
Albert Einstein

VP
Joined: 21 Sep 2003
Posts: 1065
Location: USA
Followers: 3

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

### Show Tags

12 May 2006, 12:27
mendiratta_1812 wrote:
Agree with D. (Both are sufficient.)

Nope. Second Statement does not define any relationship between n and k!! Be careful.. While evaluating the second statement, forget everything that you know from first statement.
_________________

"To dream anything that you want to dream, that is the beauty of the human mind. To do anything that you want to do, that is the strength of the human will. To trust yourself, to test your limits, that is the courage to succeed."

- Bernard Edmonds

Intern
Joined: 04 May 2006
Posts: 49
Followers: 0

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

### Show Tags

12 May 2006, 12:41

I think my mind stops working at 2 a.m. Thank god, GMAT is not at night.

_________________

If A equals success, then the formula is: A = X + Y + Z, X is work. Y is play. Z is keep your mouth shut.
Albert Einstein

Director
Joined: 06 May 2006
Posts: 792
Followers: 3

Kudos [?]: 32 [0], given: 2

### Show Tags

12 May 2006, 13:04

Got egg all over my face.
Manager
Joined: 10 Oct 2005
Posts: 113
Location: Hollywood
Followers: 0

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

### Show Tags

13 May 2006, 05:29
Picking number theory here.

A alone is sufficient.

B gives no information concerning n.

OA is A
_________________

The GMAT, too tough to be denied.
Beat the tough questions...

13 May 2006, 05:29
Display posts from previous: Sort by