Last visit was: 25 Apr 2026, 13:28 It is currently 25 Apr 2026, 13:28
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.
Close
Request Expert Reply
Confirm Cancel
User avatar
TeHCM
Joined: 06 Jun 2004
Last visit: 30 Sep 2013
Posts: 490
Own Kudos:
Location: CA
Posts: 490
Kudos: 1,192
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
GoalStanford
Joined: 02 Jun 2004
Last visit: 26 Jan 2005
Posts: 96
Own Kudos:
Location: san jose,ca
Posts: 96
Kudos: 27
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
manan
Joined: 19 May 2004
Last visit: 13 Jul 2005
Posts: 33
Own Kudos:
Posts: 33
Kudos: 6
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Emmanuel
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
Kudos
Add Kudos
Bookmarks
Bookmark this Post
TeHCM
This question was in PP1

Is X divided by 36?

(1) X is divisible by 12
(2) X is divisible for 9

What is the best way to approach divisibility questions? Picking out numbers in this case did not help me...


LCD(9,12) = 36, => if X :: 12 and X :: 9 => X :: LCD(12,9) = 36.

X divides 36.

LCD(A,B) = lowest common divider of A and B, i.e., the lowest number that divides both A and B.

If X :: A and X :: B => X :: LCD(A,B).

What you need to do such problems is to find LCD of A and B(simply choosing numbers like 9*z, z - integer, and checking if 9*z :: 12).
User avatar
adnis
Joined: 26 Jan 2003
Last visit: 04 Mar 2008
Posts: 17
Location: Reality
Posts: 17
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
TeHCM
This question was in PP1

Is X divided by 36?

(1) X is divisible by 12
(2) X is divisible for 9

What is the best way to approach divisibility questions? Picking out numbers in this case did not help me...


the best approach is to find the factors of 36 (or whatever number it is) and see whether one of statements or both gives all of them.

In this problem:

Question stem: 36 = 2*2*3*3
(1) 12=2*2*3, not enough
(2) 9 = 9*9, not enough
taken together: LCD(9,12) = 2*2*3*3 =36

C is the answer
User avatar
adnis
Joined: 26 Jan 2003
Last visit: 04 Mar 2008
Posts: 17
Location: Reality
Posts: 17
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Emmanuel
TeHCM
This question was in PP1

Is X divided by 36?

(1) X is divisible by 12
(2) X is divisible for 9

What is the best way to approach divisibility questions? Picking out numbers in this case did not help me...

LCD(9,12) = 36, => if X :: 12 and X :: 9 => X :: LCD(12,9) = 36.

X divides 36.

LCD(A,B) = lowest common divider of A and B, i.e., the lowest number that divides both A and B.

If X :: A and X :: B => X :: LCD(A,B).

What you need to do such problems is to find LCD of A and B(simply choosing numbers like 9*z, z - integer, and checking if 9*z :: 12).


nice picture. is it grace there? :?:
User avatar
Emmanuel
Joined: 07 May 2004
Last visit: 26 Jul 2004
Posts: 104
Own Kudos:
Location: Ukraine, Russia(part-time)
Posts: 104
Kudos: 23
Kudos
Add Kudos
Bookmarks
Bookmark this Post
adnis
Emmanuel
TeHCM
This question was in PP1

Is X divided by 36?

(1) X is divisible by 12
(2) X is divisible for 9

What is the best way to approach divisibility questions? Picking out numbers in this case did not help me...

LCD(9,12) = 36, => if X :: 12 and X :: 9 => X :: LCD(12,9) = 36.

X divides 36.

LCD(A,B) = lowest common divider of A and B, i.e., the lowest number that divides both A and B.

If X :: A and X :: B => X :: LCD(A,B).

What you need to do such problems is to find LCD of A and B(simply choosing numbers like 9*z, z - integer, and checking if 9*z :: 12).

nice picture. is it grace there? :?:


Of course, the answer is C, but the author of the first post has problems with understanding HOW such problems should be solved.
User avatar
TeHCM
Joined: 06 Jun 2004
Last visit: 30 Sep 2013
Posts: 490
Own Kudos:
Location: CA
Posts: 490
Kudos: 1,192
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thank you guys for the tips...I will keep that in mind!!



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 Quantitative Questions 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!