NEW HERE? LEARN MORE
closeclose
Last visit was: 25 Apr 2024, 00:40 It is currently 25 Apr 2024, 00:40
Decision Tracker
My Rewards
New posts
New comers' posts

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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel

n and m are positive integers, can n divisible by 3? 1/ n

User avatar
swat
Intern
Intern
Joined: 24 Sep 2009
Posts: 14
Own Kudos [?]: 39 [0]
Given Kudos: 0
Send PM
n and m are positive integers, can n divisible by 3? 1/ n [#permalink] New post   24 Sep 2009, 13:58
00:00
A
B
C
D
E

Difficulty:

(N/A)

Question Stats:

100% (03:33) correct 0% (00:00) wrong based on 2 sessions
Hide Show timer Statistics
n and m are positive integers, can n divisible by 3?
1/ n divisible by m(m^2+2)
2/ n divisible by m^2(m+2)

I guess it's C ???



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
User avatar
AKProdigy87
Manager
Manager
Joined: 11 Sep 2009
Posts: 81
Own Kudos [?]: 1005 [1]
Given Kudos: 6
Send PM
Re: n and m are positive integers, can n divisible by 3? 1/ n [#permalink] New post   24 Sep 2009, 18:18
1
Kudos
The answer is A.

Any integer can be represented in terms of divisibility by 3 by placing them in the following 3 groups:

a) (3x) - Divisible by 3 (ex. 3, 6, 9, etc.)
b) (3x + 1) - Remainder of 1 (ex. 4, 7, 10, etc.)
c) (3x + 2) - Remainder of 2 (ex. 5, 8, 11, etc.)

where x is an integer.

Statement 1: n divisible by m(m^2+2):

a) Let m = 3x
\(m(m^2 + 2) = (3x)((3x)^2 + 2) = 3(x)(9x^2 + 2)\) DIVISIBLE BY 3

b) Let m = 3x + 1
\(m(m^2 + 2) = (3x+1)((3x+1)^2 + 2) = (3x + 1)(9x^2 + 6x + 1 + 2)\)
\(= (3x + 1)(9x^2 + 6x + 3) = 3(3x^2 + 2x + 1)(3x + 1)\) DIVISIBLE BY 3

c) Let m = 3x + 2
\(m(m^2 + 2) = (3x+2)((3x+2)^2 + 2) = (3x + 1)(9x^2 + 12x + 4 + 2)\)
\(= (3x + 1)(9x^2 + 12x + 6) = 3(3x^2 + 4x + 2)(3x + 1)\) DIVISIBLE BY 3

Therefore Statement 1 is sufficient. If n is divisible by m(m^2 + 2), then it is divisible by 3.

Statement 2: n divisible by m^2(m+2):
...
c) Let m = 3x + 2
[m]m^2(m + 2) = (3x+2)(3x+2)(3x+2+2) = (3x+2)(3x+2)(3x+4) NOT DIVISIBLE BY 3

Therefore Statement 2 is not sufficient.

The answer is A.
User avatar
swat
Intern
Intern
Joined: 24 Sep 2009
Posts: 14
Own Kudos [?]: 39 [0]
Given Kudos: 0
Send PM
Re: n and m are positive integers, can n divisible by 3? 1/ n [#permalink] New post   24 Sep 2009, 20:29
AKProdigy87 wrote:
The answer is A.

Any integer can be represented in terms of divisibility by 3 by placing them in the following 3 groups:

a) (3x) - Divisible by 3 (ex. 3, 6, 9, etc.)
b) (3x + 1) - Remainder of 1 (ex. 4, 7, 10, etc.)
c) (3x + 2) - Remainder of 2 (ex. 5, 8, 11, etc.)

where x is an integer.

Statement 1: n divisible by m(m^2+2):

a) Let m = 3x
\(m(m^2 + 2) = (3x)((3x)^2 + 2) = 3(x)(9x^2 + 2)\) DIVISIBLE BY 3

b) Let m = 3x + 1
\(m(m^2 + 2) = (3x+1)((3x+1)^2 + 2) = (3x + 1)(9x^2 + 6x + 1 + 2)\)
\(= (3x + 1)(9x^2 + 6x + 3) = 3(3x^2 + 2x + 1)(3x + 1)\) DIVISIBLE BY 3

c) Let m = 3x + 2
\(m(m^2 + 2) = (3x+2)((3x+2)^2 + 2) = (3x + 1)(9x^2 + 12x + 4 + 2)\)
\(= (3x + 1)(9x^2 + 12x + 6) = 3(3x^2 + 4x + 2)(3x + 1)\) DIVISIBLE BY 3

Therefore Statement 1 is sufficient. If n is divisible by m(m^2 + 2), then it is divisible by 3.

Statement 2: n divisible by m^2(m+2):
...
c) Let m = 3x + 2
[m]m^2(m + 2) = (3x+2)(3x+2)(3x+2+2) = (3x+2)(3x+2)(3x+4) NOT DIVISIBLE BY 3

Therefore Statement 2 is not sufficient.

The answer is A.



Hi AKProdigy87,

I don't quite understand that. Say we have n=4 and m=2.
Then m(m^2+2)=2(2^2+2)=12
n=4 is devisible by 12 but doesn't mean 3 is divisible by n.
User avatar
manojgmat
Manager
Manager
Joined: 14 Dec 2008
Posts: 71
Own Kudos [?]: 337 [0]
Given Kudos: 39
Send PM
Re: n and m are positive integers, can n divisible by 3? 1/ n [#permalink] New post   25 Sep 2009, 08:11
hi AKProdigy87 , good way of solving, but is this kind of substitution correct?
User avatar
sher676
Manager
Manager
Joined: 08 Jul 2009
Posts: 99
Own Kudos [?]: 343 [0]
Given Kudos: 13
Send PM
Re: n and m are positive integers, can n divisible by 3? 1/ n [#permalink] New post   25 Sep 2009, 11:34
swat wrote:
AKProdigy87 wrote:
The answer is A.

Any integer can be represented in terms of divisibility by 3 by placing them in the following 3 groups:

a) (3x) - Divisible by 3 (ex. 3, 6, 9, etc.)
b) (3x + 1) - Remainder of 1 (ex. 4, 7, 10, etc.)
c) (3x + 2) - Remainder of 2 (ex. 5, 8, 11, etc.)

where x is an integer.

Statement 1: n divisible by m(m^2+2):

a) Let m = 3x
\(m(m^2 + 2) = (3x)((3x)^2 + 2) = 3(x)(9x^2 + 2)\) DIVISIBLE BY 3

b) Let m = 3x + 1
\(m(m^2 + 2) = (3x+1)((3x+1)^2 + 2) = (3x + 1)(9x^2 + 6x + 1 + 2)\)
\(= (3x + 1)(9x^2 + 6x + 3) = 3(3x^2 + 2x + 1)(3x + 1)\) DIVISIBLE BY 3

c) Let m = 3x + 2
\(m(m^2 + 2) = (3x+2)((3x+2)^2 + 2) = (3x + 1)(9x^2 + 12x + 4 + 2)\)
\(= (3x + 1)(9x^2 + 12x + 6) = 3(3x^2 + 4x + 2)(3x + 1)\) DIVISIBLE BY 3

Therefore Statement 1 is sufficient. If n is divisible by m(m^2 + 2), then it is divisible by 3.

Statement 2: n divisible by m^2(m+2):
...
c) Let m = 3x + 2
[m]m^2(m + 2) = (3x+2)(3x+2)(3x+2+2) = (3x+2)(3x+2)(3x+4) NOT DIVISIBLE BY 3

Therefore Statement 2 is not sufficient.

The answer is A.



Hi AKProdigy87,

I don't quite understand that. Say we have n=4 and m=2.
Then m(m^2+2)=2(2^2+2)=12
n=4 is devisible by 12 but doesn't mean 3 is divisible by n.



The q is saying n is divisible by m(m^2+2) if m is 12 then the minimum value of n is 12 which is divisible by 3.
avatar
srivas
Manager
Manager
Joined: 27 Oct 2008
Posts: 97
Own Kudos [?]: 295 [0]
Given Kudos: 3
Send PM
Re: n and m are positive integers, can n divisible by 3? 1/ n [#permalink] New post   25 Sep 2009, 23:39
Yes. Statement 1 alone is sufficient
taking m(m^2+2) and since m is positive integer, you can take m = 1,2,3 and so on
for any such value of m, this equation m(m^2+2) will always be a multiple of 3.
Since its a multiple of 3 and is a factor of n, thus n will be a multiple of 3 or in other words n will be divisible b 3.

Statement 2 is not sufficient
taking m^2(m+2) and since m is positive integer, you can take m = 1,2,3 and so on
for any such value of m, this equation m^2(m+2), seems to be a multiple of 3 in some cases and not a multiple in some cases. So based on this alone we cannot guess if n is divisible by 3 or not.

Hence A.



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Data Sufficiency (DS) Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!
GMAT Club Bot
gmatclubot
Re: n and m are positive integers, can n divisible by 3? 1/ n [#permalink]
25 Sep 2009, 23:39
Moderators:
Bunuel
Math Expert
92901 posts
yashikaaggarwal
Senior Moderator - Masters Forum
3137 posts
GMATBusters
GMAT Tutor
1905 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne
Main navigation
GMAT Resources
Partners
MBA Resources
www.gmac.com|www.mba.com | | GMAT Club Rules | Terms and Conditions