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

 It is currently 04 May 2015, 09:40

### 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
TAGS:
Manager
Joined: 20 Mar 2005
Posts: 170
Followers: 2

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

If n and k are positive integers, is n divisible by 6? (1) n [#permalink]  01 Oct 2007, 05:47
00:00

Difficulty:

(N/A)

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: 894
Schools: University of Chicago, Wharton School
Followers: 6

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

Re: DS - sets [#permalink]  01 Oct 2007, 06: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: 144
Location: New York
Followers: 1

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

Re: DS - sets [#permalink]  01 Oct 2007, 07: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=???
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: 5078
Location: Singapore
Followers: 22

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

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:

Ans A
Director
Joined: 09 Aug 2006
Posts: 766
Followers: 1

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

A

Plug in numbers strategy. n is always divisible by 6 if stat 1 is true.
VP
Joined: 09 Jul 2007
Posts: 1108
Location: London
Followers: 6

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

Re: DS - sets [#permalink]  01 Oct 2007, 11: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, 11:04
Similar topics Replies Last post
Similar
Topics:
8 Is the positive integer n divisible by 6? 4 12 Nov 2014, 09:05
23 If k is a positive integer and n = k(k + 7k), is n divisible 14 02 Nov 2013, 13:01
5 If n and k are positive integers, is n divisible by 6? 7 27 Aug 2009, 16:15
If n and k are positive integers, is n divisible by 6? (1) n 15 29 May 2008, 12:31
If n and k are positive integers, is n divisible by 6? (1) n 7 12 May 2006, 10:54
Display posts from previous: Sort by