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

Oldest

Best Reply

Author

Message

TAGS:

Manager

Joined: 20 Mar 2005

Posts: 170

Followers: 2

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

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

01 Oct 2007, 06:47

00:00

Question Stats:

0% (00:00) correct

0% (00:00) wrong

based on 0 sessions

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.

Director

Joined: 03 May 2007

Posts: 903

Schools: University of Chicago, Wharton School

Followers: 4

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

Re: DS - sets [#permalink]

01 Oct 2007, 07:53

Balvinder wrote:

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.

A. k (k + 1) (k - 1) are consequtive integers...

Manager

Joined: 05 Sep 2007

Posts: 148

Location: New York

Followers: 1

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

Re: DS - sets [#permalink]

01 Oct 2007, 08:05

Balvinder wrote:

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.

St.1: Insuf. b/c K=???
St.2: Insuf.- nothing about N????
1&2: Suffic.
n=k(k^2-1)
k-1 is a mult. of 3-->( k^2-1) is a mult of 3.
k=10 n=10x(100-1)=10x99=990 -->990/3=330
k=7 n=7x(49-1)=7x48=336-->336/6=56
C.

GMAT Club Legend

Joined: 07 Jul 2004

Posts: 5134

Location: Singapore

Followers: 9

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

[#permalink]

01 Oct 2007, 08:15

St1:

n = product of three consecutive integers.

If k = 1, then n = 0*1*2 = 0 ---> divisible by 6
If k = 2, then n = 1*2*3 = 6 ---> divisible by 6
If k = 3, then n = 3*4*5 = 60 ---> divisible by 6

Always divisible by 6. Sufficient.

St2:
Nothing about n. INsufficient.

Ans A

Director

Joined: 09 Aug 2006

Posts: 776

Followers: 1

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

[#permalink]

01 Oct 2007, 11:57

A

Plug in numbers strategy. n is always divisible by 6 if stat 1 is true.

Joined: 09 Jul 2007

Posts: 1114

Location: London

Followers: 4

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

Re: DS - sets [#permalink]

01 Oct 2007, 12:04

Balvinder wrote:

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.

A
1. use plug in method. (k-1)*k*(k+1)=N, this multiplication always has multiple of both 3 and 2 then the product is divisible by 6. suff

2. hmm. no info about N so out. insuff.

Re: DS - sets [#permalink] 01 Oct 2007, 12:04

	Similar topics	Author	Replies	Last post
Similar Topics:	If n and k are positive integers, is n divisible by 6? (1) n	nocilis	5	02 Feb 2005, 22:37
	If n and k are positive integers, is n divisible by 6? (1) n	chunjuwu	1	04 Feb 2005, 09:38
	N=k(k+1)(k-1), is n divisible by 6? 1) k is an positive	DLMD	13	07 Feb 2005, 11:18
	If n and k are positive integers, is n divisible by 6? (1) n	TOUGH GUY	7	12 May 2006, 11:54
	If n and k are positive integers, is n divisible by 6? (1) n	kapilnegi	15	29 May 2008, 13:31

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

Main navigation

GMAT Resources

Partners

MBA Resources

GMAT ® is a registered trademark of the Graduate Management Admission Council ® (GMAC ®). GMAT Club's website has not been reviewed or endorsed by GMAC.

GMAT Courses

Admissions Consulting

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

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

Main navigation

GMAT Resources

Partners

MBA Resources