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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
05 Jul 2007, 05:07

GK_Gmat wrote:

Amit05 wrote:

If an integer n is divisible by both 6 and 8, then it must also be divisible by which of the following? (A) 10 (B) 12 (C) 14 (D) 16 (E) 18

Though I got the correct ans by brute force. Just wondering which math rule could be applied here.

The way I figure it is taking the product of the prime factors which are not common among the two.

6= 3*2 8= 2*2*2

prod. of prime factors not common = 2*2*3=12

Answer B

I like this explanation. If it's divisible by 6, it must have every prime 6 has, and the same thing is true for 8. So there must be 2,2,3. Even if you don't find the lowest common multiple, as in above, you should still just look for the answers with just some 2's and one 3. 12 is the only one.

Note that 18 doesn't work because there's an extra 3 in it.

Last edited by ian7777 on 05 Jul 2007, 07:12, edited 1 time in total.

Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
14 Feb 2015, 14:47

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________

Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
14 Feb 2015, 20:00

Expert's post

1

This post was BOOKMARKED

Hi All,

In these sorts of situations, prime-factorization is a great technical approach to get to the correct answer. There is another method that is actually pretty easy though - we can TEST VALUES. Since the prompt asks for what N MUST be divisible by, we just need to start with the SMALLEST positive integer for N that is DIVISIBLE by BOTH 6 and 8.

Many Test Takers would say that 48 is the smallest integer, but it's NOT. The smallest integer is actually 24. Here's proof that's fairly easy to put together....

Multiples of 6: 6, 12, 18, 24 Multiples of 8: 8, 16, 24

This week went in reviewing all the topics that I have covered in my previous study session. I reviewed all the notes that I have made and started reviewing the Quant...

I was checking my phone all day. I wasn’t sure when I would receive the admission decision from Tepper. I received an acceptance from Goizueta in the early morning...

I started running as a cross country team member since highshcool and what’s really awesome about running is that...you never get bored of it! I participated in...