Last visit was: 29 Apr 2026, 05:28 It is currently 29 Apr 2026, 05:28
Home
Messages
Tests
Schools
Events
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
User avatar
swat
User avatar
Joined: 24 Sep 2009
Last visit: 29 Oct 2009
Posts: 14
Own Kudos:
42
Posts: 14
Kudos: 42
n and m are positive integers, can n divisible by 3? 1/ n 24 Sep 2009, 13:58
Kudos
Add Kudos
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

(N/A)

Question Stats:

100% (03:33) correct 0% (00:00) wrong based on 2 sessions

History

Date
Time
Result
Not Attempted Yet
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
User avatar
Joined: 11 Sep 2009
Last visit: 11 Mar 2015
Posts: 80
Own Kudos:
1,145
 [1]
Given Kudos: 6
Posts: 80
Kudos: 1,145
 [1]
n and m are positive integers, can n divisible by 3? 1/ n 24 Sep 2009, 18:18
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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
User avatar
Joined: 24 Sep 2009
Last visit: 29 Oct 2009
Posts: 14
Own Kudos:
42
Posts: 14
Kudos: 42
n and m are positive integers, can n divisible by 3? 1/ n 24 Sep 2009, 20:29
Kudos
Add Kudos
Bookmarks
Bookmark this Post
AKProdigy87
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.
Show more


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
User avatar
Joined: 14 Dec 2008
Last visit: 10 Jan 2011
Posts: 70
Own Kudos:
418
Given Kudos: 39
Posts: 70
Kudos: 418
n and m are positive integers, can n divisible by 3? 1/ n 25 Sep 2009, 08:11
Kudos
Add Kudos
Bookmarks
Bookmark this Post
hi AKProdigy87 , good way of solving, but is this kind of substitution correct?
User avatar
sher676
User avatar
Joined: 08 Jul 2009
Last visit: 12 Apr 2012
Posts: 99
Own Kudos:
358
Given Kudos: 13
Posts: 99
Kudos: 358
n and m are positive integers, can n divisible by 3? 1/ n 25 Sep 2009, 11:34
Kudos
Add Kudos
Bookmarks
Bookmark this Post
swat
AKProdigy87
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.
Show more


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
avatar
Joined: 27 Oct 2008
Last visit: 28 Sep 2009
Posts: 95
Own Kudos:
315
Given Kudos: 3
Posts: 95
Kudos: 315
n and m are positive integers, can n divisible by 3? 1/ n 25 Sep 2009, 23:39
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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!
Moderators:
Bunuel
Math Expert
109968 posts
GMATBusters
GMAT Tutor
1922 posts