If an integer n is divisible by both 6 and 8, then it must

Find the prime factors of both, then multiply.

Ex)

6=(2)(3)
8=(2)(2)(2)

LCM = 24

24 is only divisible by 12. Answer is B.

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.

I would go with the LCM approach since i believe it is more feasible when dealing with unusual numbers.

METHOD 1

6
0, 6, 12, 18, 24

8
0, 8, 16, 24

LCM = 24 which is divisible by 12.
hence, B.

METHOD 2

I also like the factoring approach for smaller numbers.

6= 2.3
8= 2.2.2

therefore, 2.2.3= 12, hence, B.

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

Now, which of the answer choices divides into 24?

Final Answer:

GMAT assassins aren't born, they're made,
Rich

This can be easily solved by testing the values.
Assume the number n = 24 (divisible by both 6 and 8)

Of the options, Only Option B satisfies.
Correct Option: B

N=24*P for some P
so B is correct
Rule used => a number is divisible by factors as well as factors of its factors
_________________

A very straightforward method involving the LCM exists to solve the problem.

First of all, "n" is divisible by both 6 and 8; This implies "n" is a Multiple of both 6 and 8.

Finding the LCM helps as all other Multiples of 6 and 8 may have extra prime factors which may lead to "n" be divisible by other numbers.

e.g. the LCM of 6 and 8 is 24, but if we find any multiple of 6 and 8 such as 48 or 72 then apart from 12, the number 48 is also divisible by 16 and 72 by 18.

Finally, check the divisiblity of the LCM by the options provided. Only one value should satisfy the divisibility condition.

Cheers!!!... Press "Kudos" if you liked the explanation.

n is divisible by both 6 and 8 means .... n = 6*8

n = 6*8 = (2^4) * 3 implies that the answer must meet two conditions:
(1) be divisible by the product of its prime which is 6=2*3. This by itself narrows down the answer to B=12 or E=18.
(2) contains at most one 3 and at most four 2's. E is not correct because it factors into two 3's which is one too many 3's.

The answer is B.

Let’s first find the LCM of 6 and 8. The prime factorization of 6 is 3 x 2 and the prime factorization of 8 is 2 x 2 x 2. Thus, the LCM of 6 and 8 is 3 x 2 x 2 x 2 = 24. Of all the answer choices, only 12 is a factor of 24, so n is divisible by 12.

Answer: B
_________________

6 = 2 * 3 and 8 = \(2^3\)

HCF of 6 and 8 is 2. hence, multiply the non- common factors: 3 * 2 * 2 = 12

Answer B

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