Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 26 Jul 2016, 11:26

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

# The function f(m) is defined for all positive integers m as

Author Message
TAGS:

### Hide Tags

Intern
Joined: 02 Nov 2010
Posts: 8
Followers: 0

Kudos [?]: 25 [1] , given: 1

The function f(m) is defined for all positive integers m as [#permalink]

### Show Tags

26 Jan 2011, 14:00
1
KUDOS
15
This post was
BOOKMARKED
00:00

Difficulty:

35% (medium)

Question Stats:

66% (02:03) correct 34% (01:16) wrong based on 458 sessions

### HideShow timer Statistics

The function f(m) is defined for all positive integers m as the product of m + 4, m + 5, and m + 6. If n is a positive integer, then f(n) must be divisible by which one of the following numbers?

(A) 4
(B) 5
(C) 6
(D) 7
(E) 11
[Reveal] Spoiler: OA
Math Expert
Joined: 02 Sep 2009
Posts: 34073
Followers: 6087

Kudos [?]: 76551 [15] , given: 9976

### Show Tags

26 Jan 2011, 14:38
15
KUDOS
Expert's post
10
This post was
BOOKMARKED
PASSINGGMAT wrote:
The function f(m) is defined for all positive integers m as the product of m + 4, m + 5, and m + 6. If n is a positive integer, then f(n) must be divisible by which one of the following numbers?
(A) 4
(B) 5
(C) 6
(D) 7
(E) 11

Given: $$f(n)=(n+4)(n+5)(n+6)$$, where $$n$$ is a positive integer. Question: $$f(n)$$ must be divisible by which one of the following numbers.

Now, $$(n+4)(n+5)(n+6)$$ is the product of 3 consecutive integers so out of them one is definitely divisible by 3 and at least one is divisible by 2, so $$f(n)$$ must be divisible by 2*3=6.

Generally out of ANY $$k$$ consecutive integers one is always divisible by $$k$$ and at least one by $$k-1$$, $$k-2$$, ... For example out of ANY 5 consecutive integers there is one which is divisible by 5, and at least one which is divisible by 4, 3, and 2. That's because an integer divided by an integer $$k$$ can give a remainder of: 0 (when it's divisible by $$k$$), 1, 2, ..., or $$k-1$$ (total of $$k$$ different remainders from 0 to $$k-1$$), so out of $$k$$ consecutive integers there definitely will be one which gives a reminder of zero, so divisible by $$k$$.

Which give us the following property: the product of $$k$$ consecutive integers is always divisible by $$k!$$, so by $$k$$ too. For example: given $$k=4$$ consecutive integers $$\{3,4,5,6\}$$ --> the product of 3*4*5*6 is 360, which is divisible by 4!=24.

If we apply this property to the original question we'll have that the product of given 3 consecutive integers $$(n+4)(n+5)(n+6)$$ must be divisible by 3!=6.

Hope it's clear.
_________________
Manager
Joined: 07 Jan 2010
Posts: 147
Location: So. CA
WE 1: 2 IT
WE 2: 4 Software Analyst
Followers: 2

Kudos [?]: 51 [0], given: 57

### Show Tags

27 Jan 2011, 22:45
awesome explanation
Senior Manager
Joined: 08 Nov 2010
Posts: 417
Followers: 7

Kudos [?]: 87 [0], given: 161

### Show Tags

29 Jan 2011, 12:59
Ye, Bunuel - u rocked it. +1.
_________________
Director
Status: Impossible is not a fact. It's an opinion. It's a dare. Impossible is nothing.
Affiliations: University of Chicago Booth School of Business
Joined: 03 Feb 2011
Posts: 920
Followers: 13

Kudos [?]: 307 [1] , given: 123

### Show Tags

08 Mar 2011, 20:14
1
KUDOS
Product of Any three consecutive integers must be divisible by 6.
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 10609
Followers: 495

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

Re: The function f(m) is defined for all positive integers m as [#permalink]

### Show Tags

03 Oct 2013, 19:46
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 Legend
Joined: 09 Sep 2013
Posts: 10609
Followers: 495

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

Re: The function f(m) is defined for all positive integers m as [#permalink]

### Show Tags

14 Nov 2014, 00:34
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.
_________________
Intern
Joined: 22 Nov 2012
Posts: 20
Location: United States
Followers: 0

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

Re: The function f(m) is defined for all positive integers m as [#permalink]

### Show Tags

29 Mar 2015, 11:19
Bunuel

Very informative explanation Bunuel!

Thanks !
_________________

GMAT,
It is not finished untill I win!!!

EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 6908
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: 340 Q170 V170
Followers: 300

Kudos [?]: 2044 [1] , given: 161

Re: The function f(m) is defined for all positive integers m as [#permalink]

### Show Tags

29 Mar 2015, 19:21
1
KUDOS
Expert's post
Hi All,

This question is based on a couple of Number Properties; as such, you can also TEST VALUES to get to the solution.

We're told that the f(M) = (M+4)(M+5)(M+6) for all POSITIVE integers. We're asked which of the following numbers MUST divide into f(N).

IF....
N = 1
f(1) = (5)(6)(7)

At this point, you can either multiply out the numbers and check the 5 answer choices against that product OR prime factor the f(1)....

(5)(6)(7) = (5)(2)(3)(7)

Of the 5 answer choices, only 2 of them divide into this product (Answers B and C; 5 and 6).

From here, we should look to try to eliminate one of the options. It's actually not that hard....

IF....
N = 2
f(2) = (6)(7)(8)

Looking at this, we can see that 6 IS a factor while 5 is NOT.

[Reveal] Spoiler:
C

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

# 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: 10609
Followers: 495

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

Re: The function f(m) is defined for all positive integers m as [#permalink]

### Show Tags

14 Apr 2016, 23:24
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: The function f(m) is defined for all positive integers m as   [#permalink] 14 Apr 2016, 23:24
Similar topics Replies Last post
Similar
Topics:
2 The function f is defined for all positive integers n by 1 21 Feb 2012, 05:49
21 The function f is defined for all positive integers n by the 12 29 Jan 2012, 16:53
12 The function f is defined for all the positive integers n by 7 28 Oct 2010, 08:27
6 The function F is defined for all positive integers n by the 5 24 Jan 2010, 19:38
1 The function f is defined for all positive integers n by the following 5 29 Sep 2009, 12:12
Display posts from previous: Sort by