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

It is currently 02 Sep 2015, 03:05
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

n' is a natural number. State whether n (n┬▓ -

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
Director
Director
User avatar
Joined: 13 Nov 2003
Posts: 971
Location: Florida
Followers: 1

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

n' is a natural number. State whether n (n┬▓ - [#permalink] New post 25 Nov 2003, 22:15
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

'n' is a natural number. State whether n (n┬▓ - 1) is divisible by 24.

(1) 3 divides 'n' completely without leaving any remainder.

(2) 'n' is odd.

A. Statement (1) ALONE is sufficient but Statement (2) ALONE is not sufficient.
B. Statement (2) ALONE is sufficient but Statement (1) ALONE is not sufficient.
C. BOTH Statements TOGETHER are sufficient, but NEITHER Statement alone is sufficient.
D. Each Statement ALONE is sufficient.
E. Statements (1) and (2) TOGETHER are NOT sufficient.
Director
Director
avatar
Joined: 13 Nov 2003
Posts: 790
Location: BULGARIA
Followers: 1

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

 [#permalink] New post 26 Nov 2003, 00:44
as far as I know natural numbers=positive integers without 0, so from A n could be 3,6,9,and so on. The outcome is 24,210,720, so A is not sufficient, B states n is odd 3,9,15 .. which gives 24,720,3360 which are all divisible by 24 so IMO B is sufficient
SVP
SVP
User avatar
Joined: 03 Feb 2003
Posts: 1607
Followers: 6

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

 [#permalink] New post 26 Nov 2003, 01:14
agree with B

n(n┬▓-1)=n(n-1)(n+1)=(n-1)n(n+1)

(1) n is div by 3.

consider n=3: 2*3*4=24 is div by 24
consider n=6: 5*6*7 is not

(2) n is odd

n=2k+1
(n-1)n(n+1) is divisible by 6
moreover =2k(2k+1)(2k+2)=8k^3+12k^2+4k divisible by 4
thus divisible by 24

B.
Manager
Manager
avatar
Joined: 26 Aug 2003
Posts: 233
Location: United States
Followers: 1

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

 [#permalink] New post 26 Nov 2003, 06:02
I'd say B too.

(1) Since n is divisible by 3, (n┬▓ - 1) has to be divisible by 8 for the quanitity in question. We also know that n > 3. But not all values of n are such that (n┬▓ - 1) will be evenly divisible by 8. Not suff.
(2) If n is odd then n(n┬▓ - 1) is divisible by 24 for all values of n.
Director
Director
User avatar
Joined: 13 Nov 2003
Posts: 971
Location: Florida
Followers: 1

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

 [#permalink] New post 26 Nov 2003, 07:01
good explanation, stolyar. right answer is B
I just substituted values and got the answer... :idea:
Director
Director
User avatar
Joined: 28 Oct 2003
Posts: 503
Location: 55405
Followers: 1

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

 [#permalink] New post 26 Nov 2003, 07:18
To stolyar's point,

The product of three consecutive numbers will always be divisible by 24 if the middle number is odd. Because:

one of three consecutive numbers is always divisible by three (for obvious reasons)
every other even number is divisible by four.
The even number that's not divisible by four, when multiplied with the one that is, gives you a multiple of 8.
  [#permalink] 26 Nov 2003, 07:18
Display posts from previous: Sort by

n' is a natural number. State whether n (n┬▓ -

  Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Privacy Policy| 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®.