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

 It is currently 10 Dec 2019, 09:57

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

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

Author Message
TAGS:

### Hide Tags

Intern
Joined: 02 Nov 2010
Posts: 5
The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

Updated on: 15 Jul 2019, 03:01
6
49
00:00

Difficulty:

45% (medium)

Question Stats:

68% (01:38) correct 32% (01:53) wrong based on 752 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

Source: Nova GMAT
Difficulty Level: 600

Originally posted by PASSINGGMAT on 26 Jan 2011, 14:00.
Last edited by SajjadAhmad on 15 Jul 2019, 03:01, edited 1 time in total.
Math Expert
Joined: 02 Sep 2009
Posts: 59634
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

26 Jan 2011, 14:38
35
27
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.
_________________
##### General Discussion
Manager
Joined: 07 Jan 2010
Posts: 103
Location: So. CA
WE 1: 2 IT
WE 2: 4 Software Analyst
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

27 Jan 2011, 22:45
awesome explanation
Senior Manager
Joined: 08 Nov 2010
Posts: 268
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### 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: 641
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

08 Mar 2011, 20:14
1
Product of Any three consecutive integers must be divisible by 6.
Intern
Joined: 22 Nov 2012
Posts: 19
Location: United States
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: 15685
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

29 Mar 2015, 19:21
1
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.

GMAT assassins aren't born, they're made,
Rich
_________________
Contact Rich at: Rich.C@empowergmat.com

The Course Used By GMAT Club Moderators To Earn 750+

souvik101990 Score: 760 Q50 V42 ★★★★★
ENGRTOMBA2018 Score: 750 Q49 V44 ★★★★★
Intern
Joined: 31 May 2015
Posts: 1
Concentration: Marketing, Finance
Schools: Wharton '17
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

30 Sep 2016, 22:33
[align=]I tried the sum with f(13), which is equal to 17 X 18 X 19 (this number isn't divisible by 6)?[/align]
_________________
PNH0505
EMPOWERgmat Instructor
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 15685
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

01 Oct 2016, 16:45
Hi pnh0505,

You are correct that when you use M=13, then f(13) = (17)(18)(19). However, that product IS divisible by 6 - because 18 is divisible by 6.

GMAT assassins aren't born, they're made,
Rich
_________________
Contact Rich at: Rich.C@empowergmat.com

The Course Used By GMAT Club Moderators To Earn 750+

souvik101990 Score: 760 Q50 V42 ★★★★★
ENGRTOMBA2018 Score: 750 Q49 V44 ★★★★★
Director
Status: Come! Fall in Love with Learning!
Joined: 05 Jan 2017
Posts: 525
Location: India
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

01 Mar 2017, 01:24
In three consecutive integers we can say that one of it will be an even number and one will a multiple of three.
To the product will be definitely the product of 6.
Option C
_________________
GMAT Mentors
Intern
Joined: 23 Mar 2018
Posts: 19
Re: The function f(m) is defined for all positive integers m as  [#permalink]

### Show Tags

03 Apr 2019, 23:00
Bunuel wrote:
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.

Best Explanation !!
Re: The function f(m) is defined for all positive integers m as   [#permalink] 03 Apr 2019, 23:00
Display posts from previous: Sort by