Last visit was: 14 Jul 2024, 07:42 It is currently 14 Jul 2024, 07:42
Toolkit
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

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.

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

SORT BY:
Tags:
Show Tags
Hide Tags
Senior Manager
Joined: 09 Aug 2006
Posts: 283
Own Kudos [?]: 498 [16]
Given Kudos: 0
Senior Manager
Joined: 15 Jun 2007
Posts: 484
Own Kudos [?]: 19 [8]
Given Kudos: 0
General Discussion
Senior Manager
Joined: 09 Aug 2006
Posts: 350
Own Kudos [?]: 986 [3]
Given Kudos: 0
CIO
Joined: 09 Mar 2003
Posts: 227
Own Kudos [?]: 171 [1]
Given Kudos: 0
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
1
Bookmarks
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

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.

Originally posted by ian7777 on 05 Jul 2007, 06:07.
Last edited by ian7777 on 05 Jul 2007, 08:12, edited 1 time in total.
Senior Manager
Joined: 16 May 2007
Posts: 434
Own Kudos [?]: 246 [0]
Given Kudos: 0
Q48  V34
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
I would go with the LCM approach since i believe it is more feasible when dealing with unusual numbers.
Manager
Joined: 04 Jun 2007
Posts: 149
Own Kudos [?]: 681 [2]
Given Kudos: 0
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
2
Kudos
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.
GMAT Club Legend
Joined: 19 Dec 2014
Status:GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Posts: 21835
Own Kudos [?]: 11778 [1]
Given Kudos: 450
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
1
Kudos
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?

GMAT assassins aren't born, they're made,
Rich
Tutor
Joined: 20 Aug 2015
Posts: 349
Own Kudos [?]: 1408 [0]
Given Kudos: 10
Location: India
GMAT 1: 760 Q50 V44
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
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

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
Alum
Joined: 12 Aug 2015
Posts: 2272
Own Kudos [?]: 3195 [0]
Given Kudos: 893
GRE 1: Q169 V154
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
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
Intern
Joined: 29 Jun 2015
Status:It's time...
Posts: 7
Own Kudos [?]: 11 [1]
Given Kudos: 34
Location: India
Concentration: Operations, General Management
GMAT 1: 590 Q48 V25
GPA: 3.59
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
1
Kudos
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

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.
Intern
Joined: 04 Jun 2017
Posts: 5
Own Kudos [?]: 0 [0]
Given Kudos: 5
If an integer n is divisible by both 6 and 8, then it must [#permalink]
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.
Target Test Prep Representative
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 19130
Own Kudos [?]: 22627 [0]
Given Kudos: 286
Location: United States (CA)
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
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

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.

Math Revolution GMAT Instructor
Joined: 16 Aug 2015
Posts: 10135
Own Kudos [?]: 17014 [0]
Given Kudos: 4
GMAT 1: 760 Q51 V42
GPA: 3.82
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
6 = 2 * 3 and 8 = $$2^3$$

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

Non-Human User
Joined: 09 Sep 2013
Posts: 33968
Own Kudos [?]: 851 [0]
Given Kudos: 0
Re: If an integer n is divisible by both 6 and 8, then it must [#permalink]
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]
Moderator:
Math Expert
94342 posts