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

It is currently 19 Jun 2013, 05:19
Customize  |  Hide

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

  Question banks Downloads My Bookmarks Reviews  
Author Message
TAGS:
VP
VP
User avatar
Joined: 13 Nov 2003
Posts: 1031
Location: Florida
Followers: 1

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

GMAT Tests User
n' is a natural number. State whether n (n┬▓ - [#permalink] New post 25 Nov 2003, 23:15
00:00

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
'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
Joined: 13 Nov 2003
Posts: 811
Location: BULGARIA
Followers: 1

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

GMAT Tests User
 [#permalink] New post 26 Nov 2003, 01: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: 1680
Followers: 4

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

 [#permalink] New post 26 Nov 2003, 02: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
Joined: 26 Aug 2003
Posts: 238
Location: United States
Followers: 1

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

GMAT Tests User
 [#permalink] New post 26 Nov 2003, 07: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.
VP
VP
User avatar
Joined: 13 Nov 2003
Posts: 1031
Location: Florida
Followers: 1

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

GMAT Tests User
 [#permalink] New post 26 Nov 2003, 08: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: 533
Location: 55405
Followers: 1

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

GMAT Tests User
 [#permalink] New post 26 Nov 2003, 08: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, 08:18
    Similar topics Author Replies Last post
Similar
Topics:
New posts n is an integer. Is n┬▓1 evenly divisible by 8? stolyar 2 04 Oct 2003, 08:11
New posts n' is a natural number. Is n (n - 1) is divisible by 24. (1) drdas 5 23 Sep 2004, 17:56
New posts If n is a natural number, is n ! < ^x ? I. n is an sgrover 1 23 Jun 2006, 16:59
New posts 3 State whether n (n² - 1) is divisible by 24 powerka 1 29 Aug 2009, 00:03
New posts Experts publish their posts in the topic If n is the integer, whether 30 is a factor of n? LM 1 26 Jan 2012, 06:38
Display posts from previous: Sort by

n' is a natural number. State whether n (n&#9516;&#9619; -

  Question banks Downloads My Bookmarks Reviews  


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