Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack

 It is currently 28 May 2017, 15:59

### 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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

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

Author Message
TAGS:

### Hide Tags

Director
Joined: 09 Aug 2006
Posts: 521
Followers: 2

Kudos [?]: 96 [0], given: 0

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

### Show Tags

04 Jul 2007, 20:50
3
This post was
BOOKMARKED
00:00

Difficulty:

5% (low)

Question Stats:

91% (01:42) correct 10% (01:01) wrong based on 200 sessions

### HideShow timer Statistics

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
[Reveal] Spoiler: OA

Last edited by Bunuel on 16 Feb 2015, 03:19, edited 1 time in total.
Renamed the topic, edited the question, added the OA and moved to PS forum.
Director
Joined: 09 Aug 2006
Posts: 758
Followers: 1

Kudos [?]: 210 [0], given: 0

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

### Show Tags

05 Jul 2007, 00:12
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

Director
Joined: 15 Jun 2007
Posts: 504
Followers: 1

Kudos [?]: 10 [0], given: 0

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

### Show Tags

05 Jul 2007, 00:13
2
This post was
BOOKMARKED
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.
CIO
Joined: 09 Mar 2003
Posts: 463
Followers: 2

Kudos [?]: 64 [0], given: 0

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

### Show Tags

05 Jul 2007, 06: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

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, 08:12, edited 1 time in total.
Director
Joined: 16 May 2007
Posts: 548
Followers: 2

Kudos [?]: 66 [0], given: 0

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

### Show Tags

05 Jul 2007, 07:17
I would go with the LCM approach since i believe it is more feasible when dealing with unusual numbers.
Senior Manager
Joined: 04 Jun 2007
Posts: 368
Followers: 1

Kudos [?]: 75 [0], given: 0

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

### Show Tags

05 Jul 2007, 08:11
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: 09 Sep 2013
Posts: 15501
Followers: 651

Kudos [?]: 210 [0], given: 0

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

### Show Tags

14 Feb 2015, 15: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.
_________________
EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 9125
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: 340 Q170 V170
Followers: 445

Kudos [?]: 2876 [0], given: 169

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

### Show Tags

14 Feb 2015, 21:00
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?

[Reveal] Spoiler:
B

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

760+: Learn What GMAT Assassins Do to Score at the Highest Levels
Contact Rich at: Rich.C@empowergmat.com

# Rich Cohen

Co-Founder & GMAT Assassin

# Special Offer: Save \$75 + GMAT Club Tests

60-point improvement guarantee
www.empowergmat.com/

***********************Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!***********************

GMAT Club Legend
Joined: 09 Sep 2013
Posts: 15501
Followers: 651

Kudos [?]: 210 [0], given: 0

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

### Show Tags

24 Feb 2016, 17:55
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.
_________________
Senior Manager
Joined: 20 Aug 2015
Posts: 397
Location: India
GMAT 1: 760 Q50 V44
Followers: 30

Kudos [?]: 261 [0], given: 10

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

### Show Tags

25 Feb 2016, 00:51
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
_________________

Reach out to us at bondwithus@gmatify.com

BSchool Forum Moderator
Joined: 12 Aug 2015
Posts: 2135
Followers: 73

Kudos [?]: 615 [0], given: 556

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

### Show Tags

14 Mar 2016, 00:49
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
_________________

Give me a hell yeah ...!!!!!

Intern
Status: It's time...
Joined: 29 Jun 2015
Posts: 9
Location: India
Concentration: Operations, General Management
GMAT 1: 590 Q48 V25
GPA: 3.59
Followers: 0

Kudos [?]: 7 [0], given: 34

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

### Show Tags

27 May 2016, 05:45
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.
_________________

Perseverance, the answer to all our woes. Amen.

Re: If an integer n is divisible by both 6 and 8, then it must   [#permalink] 27 May 2016, 05:45
Similar topics Replies Last post
Similar
Topics:
4 If a and n are integers, and a^3=360n, then n must be divisible by 3 25 Oct 2016, 17:02
1 If n is an integer number, and m=115n, then m must be divisible by whi 7 24 Oct 2016, 18:58
If both m and n are negative integers, which of the following must be 2 04 Aug 2016, 22:44
3 If positive integer n is divisible by both 4 and 21, then n must be di 3 31 Mar 2016, 05:10
1 The integer x is divisible by both 8 and 14. Which of the following 2 03 Dec 2015, 06:31
Display posts from previous: Sort by