GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 23 Feb 2019, 07:09

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
Events & Promotions in February
PrevNext
SuMoTuWeThFrSa
272829303112
3456789
10111213141516
17181920212223
242526272812
Open Detailed Calendar
  • FREE Quant Workshop by e-GMAT!

     February 24, 2019

     February 24, 2019

     07:00 AM PST

     09:00 AM PST

    Get personalized insights on how to achieve your Target Quant Score.
  • Free GMAT RC Webinar

     February 23, 2019

     February 23, 2019

     07:00 AM PST

     09:00 AM PST

    Learn reading strategies that can help even non-voracious reader to master GMAT RC. Saturday, February 23rd at 7 AM PT

If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

 
Intern
Intern
avatar
Joined: 16 Mar 2017
Posts: 13
If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by  [#permalink]

Show Tags

New post 19 Sep 2017, 06:23
8
00:00
A
B
C
D
E

Difficulty:

  25% (medium)

Question Stats:

73% (01:24) correct 27% (01:42) wrong based on 155 sessions

HideShow timer Statistics

If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by which of following(s)?

I. 3
II. 6
III. 8

A. I
B. I and II
C. II and III
D. II
E. III
Most Helpful Community Reply
Retired Moderator
avatar
D
Joined: 25 Feb 2013
Posts: 1217
Location: India
GPA: 3.82
GMAT ToolKit User Premium Member Reviews Badge
If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by  [#permalink]

Show Tags

New post 19 Sep 2017, 08:34
2
3
petrified17 wrote:
If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by which of following(s)?

I. 3
II. 6
III. 8

A. I
B. I and II
C. II and III
D. II
E. III


Mathematical approach

\(k=m*(m+4)*(m+5) = (m+3-3)*(m+4)*(m+5)\)

or \(k = (m+3)*(m+4)*(m+5)-3(m+4)*(m+5)\)

Now, \((m+3)\), \((m+4)\) & \((m+5)\) are three consecutive integers, hence MUST be divisible by \(3\) & \(6\)

\(-3(m+4)*(m+5)\), has \(3\) as a factor and \((m+4)\) & \((m+5)\) are consecutive integers, hence either of the two will be a multiple of \(2\). Hence the product MUST be multiple of \(3\) & \(6\)

Therefore \(k\) MUST be divisible by \(3\) & \(6\)

Option B
General Discussion
Senior SC Moderator
avatar
V
Joined: 22 May 2016
Posts: 2496
If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by  [#permalink]

Show Tags

New post 19 Sep 2017, 07:47
2
1
1
petrified17 wrote:
If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by which of following(s)?

I. 3
II. 6
III. 8

A. I
B. I and II
C. II and III
D. II
E. III

Plug in m = 1, m = 2, m = -7

(1)(5)(6) = 30
divisible by 3 and 6

(2)(6)(7) = 84
divisible by 3 and 6

(-7)(-3)(-2) = -42
divisible by 3 and 6

Answer B
_________________

To live is the rarest thing in the world.
Most people just exist.

Oscar Wilde

Director
Director
avatar
S
Joined: 29 Jun 2017
Posts: 524
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by  [#permalink]

Show Tags

New post 16 Oct 2018, 08:21
if m is divided by 3, so the expression is divided by 3
if m is not dividec by 3, m+1 or m+2 is divided by 3, and m+4 or m+5 is divided by 3.
in conclusion, the expression is divided by 3

m+4 and m+5 are consecutive numbers , so, one of them must be divided by 2
so, the expression is divided by 3

for 8
if m is divided by 2, but not divided by 4, m+4 is divided by 2. and m+7 is odd. so the expression is not divided by 8

answer is b.
Director
Director
avatar
S
Joined: 29 Jun 2017
Posts: 524
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by  [#permalink]

Show Tags

New post 16 Oct 2018, 23:20
if m is divided by 3, so the expression is divided by 3
if m is not dividec by 3, m+1 or m+2 is divided by 3, and m+4 or m+5 is divided by 3.
in conclusion, the expression is divided by 3

m+4 and m+5 are consecutive numbers , so, one of them must be divided by 2
so, the expression is divided by 3

for 8
if m is divided by 2, but not divided by 4, m+4 is divided by 2. and m+7 is odd. so the expression is not divided by 8

answer is b.
Target Test Prep Representative
User avatar
P
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 4972
Location: United States (CA)
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by  [#permalink]

Show Tags

New post 17 Oct 2018, 18:03
petrified17 wrote:
If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by which of following(s)?

I. 3
II. 6
III. 8

A. I
B. I and II
C. II and III
D. II
E. III



Roman Numeral I:

If m is 1, then k = 1 x 5 x 6.

If m is 2, k = 2 x 6 x 7.

If m is 3, k = 3 x 7 x 9.

In all three cases, we see that m*(m+4)*(m+5) must be divisible by 3. A more dynamic proof to show that k is divisible by 3 is to let m = 3q + r where q is an integer and r = 0, 1 or 2.

If m = 3q, obviously k is divisible by 3 since m is a multiple of 3.

If m = 3q + 1, then k is divisible by 3 since m + 5 = 3q + 6 is a multiple of 3.

If m = 3q + 2, then k is divisible by 3 since m + 4 = 3q + 6 is a multiple of 3.

Hence, k is always divisible by 3, regardless of the value of integer m.

Roman Numeral II:

We observe that m + 4 and m + 5 are two consecutive integers, hence, one of them is necessarily even. We know that k is even and from Roman Numeral I, we also know that k is divisible by 3. Thus, k must be divisible by 6.

Roman Numeral III:

We notice that m and m + 4 have the same parity (they are both odd or both even) and the parity of m + 5 is opposite to that of m (if m is even, m + 5 is odd and if m is odd, m + 5 is even). When we have a product of three integers, the product can be divisible by 8 if a) one of the integers is divisible by 8, b) one of the integers is divisible by 4 and one of the integers is divisible by 2 or c) each of the integers is divisible by 2.Since the parity of m + 5 is opposite to the remaining integers, it is impossible that each of m, m + 4 and m + 5 are divisible by 2. So if we pick a value for m such that neither of m, m + 4 and m + 5 are divisible by 4, the product cannot be divisible by 8. Such a value is m = 1, in which case k = 1*5*6 = 30. As we can see, k is not necessarily divisible by 8.

Answer: B
_________________

Scott Woodbury-Stewart
Founder and CEO

GMAT Quant Self-Study Course
500+ lessons 3000+ practice problems 800+ HD solutions

GMAT Club Bot
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by   [#permalink] 17 Oct 2018, 18:03
Display posts from previous: Sort by

If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


Copyright

GMAT Club MBA Forum Home| About| Terms and Conditions and Privacy Policy| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.