Last visit was: 25 Apr 2024, 23:59 It is currently 25 Apr 2024, 23:59

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
SORT BY:
Date
User avatar
Intern
Intern
Joined: 16 Mar 2017
Posts: 13
Own Kudos [?]: 99 [50]
Given Kudos: 15
Send PM
Most Helpful Reply
Retired Moderator
Joined: 25 Feb 2013
Posts: 895
Own Kudos [?]: 1527 [7]
Given Kudos: 54
Location: India
GPA: 3.82
Send PM
General Discussion
Senior SC Moderator
Joined: 22 May 2016
Posts: 5330
Own Kudos [?]: 35491 [5]
Given Kudos: 9464
Send PM
Director
Director
Joined: 29 Jun 2017
Posts: 778
Own Kudos [?]: 396 [0]
Given Kudos: 2198
Send PM
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#permalink]
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
Joined: 29 Jun 2017
Posts: 778
Own Kudos [?]: 396 [0]
Given Kudos: 2198
Send PM
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#permalink]
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
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 18761
Own Kudos [?]: 22055 [0]
Given Kudos: 283
Location: United States (CA)
Send PM
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#permalink]
Expert Reply
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
Manager
Manager
Joined: 29 May 2017
Posts: 154
Own Kudos [?]: 19 [0]
Given Kudos: 63
Location: Pakistan
Concentration: Social Entrepreneurship, Sustainability
Send PM
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#permalink]
ScottTargetTestPrep wrote:
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 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.
Answer: B


i understand that k is even and that k is divisible by 3 but dont follow why is this div by 6.

Also, any particular reason why you chose m as 1 2 3?

thanks
Target Test Prep Representative
Joined: 14 Oct 2015
Status:Founder & CEO
Affiliations: Target Test Prep
Posts: 18761
Own Kudos [?]: 22055 [0]
Given Kudos: 283
Location: United States (CA)
Send PM
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#permalink]
Expert Reply
Mansoor50 wrote:


i understand that k is even and that k is divisible by 3 but dont follow why is this div by 6.

Also, any particular reason why you chose m as 1 2 3?

thanks[/quote]

For the first one, we are using the rule that if x is divisible by n and m, then x is divisible by LCM(n, m). If k is even (i.e. divisible by 2) and k is divisible by 3, then k has to be divisible by LCM(2, 3) = 6.

For the second question, the values m = 1, 2 and 3 correspond to the simplest special cases of the more general argument to follow. It's sometimes helpful to look at a few special cases before attacking the general case.
Manager
Manager
Joined: 06 May 2021
Posts: 61
Own Kudos [?]: 22 [0]
Given Kudos: 36
Location: India
GMAT 1: 680 Q48 V35
Send PM
If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#permalink]
CrackverbalGMAT, avigutman could you please share your approach for this question? How can we look at it more logically instead of plugging random numbers?
Tutor
Joined: 17 Jul 2019
Posts: 1304
Own Kudos [?]: 2287 [1]
Given Kudos: 66
Location: Canada
GMAT 1: 780 Q51 V45
GMAT 2: 780 Q50 V47
GMAT 3: 770 Q50 V45
Send PM
If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#permalink]
1
Kudos
Expert Reply
CrushTHYGMAT wrote:
could you please share your approach for this question? How can we look at it more logically instead of plugging random numbers?

Hi CrushTHYGMAT, I think you'll find exactly what you're looking for here:
https://gmatclub.com/forum/if-n-is-an-i ... l#p2662420
This will enable you to solve such problems in under 30 seconds, with no pen or paper.
User avatar
Non-Human User
Joined: 09 Sep 2013
Posts: 32680
Own Kudos [?]: 822 [0]
Given Kudos: 0
Send PM
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#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.
GMAT Club Bot
Re: If k and m are integers and k = m*(m+4)*(m+5), k must be divisible by [#permalink]
Moderators:
Math Expert
92915 posts
Senior Moderator - Masters Forum
3137 posts

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