For an odd integer n, the function f(n) is defined as the product of all odd integers from 1 to n. The lowest odd prime factor f(71)-Â1 lies between...
A. 3 and 10
B. 11 and 30
C. 31 and 50
D. 51 and 70
E. 71 and above
I'm confused how to set up the formulas here. Can any experts help?
For an odd integer n, the function f(n) is defined as the pr
This topic has expert replies
-
- Moderator
- Posts: 426
- Joined: Tue Aug 22, 2017 8:48 pm
- Followed by:1 members
- GMATGuruNY
- GMAT Instructor
- Posts: 15539
- Joined: Tue May 25, 2010 12:04 pm
- Location: New York, NY
- Thanked: 13060 times
- Followed by:1906 members
- GMAT Score:790
Since the difference between them is 1, f(71) and f(71)-1 are consecutive integers.ardz24 wrote:For an odd integer n, the function f(n) is defined as the product of all odd integers from 1 to n. The lowest odd prime factor f(71)-Â1 lies between...
A. 3 and 10
B. 11 and 30
C. 31 and 50
D. 51 and 70
E. 71 and above
Consecutive integers are COPRIMES: they share no factors other than 1.
Let's examine why:
If x is a multiple of 2, then the next smallest multiple of 2 is x-2.
If x is a multiple of 3, then the next smallest multiple of 3 is x-3.
If x is a multiple of 4, then the next smallest multiple of 4 is x-4.
Using this logic, if we go from x to x-1, we get only to the next smallest multiple of 1.
Implication:
1 is the only factor that x and x-1 have in common.
In other words, x and x-1 are COPRIMES.
Thus:
f(71) and f(71)-1 are COPRIMES.
They share no factors other than 1.
f(71) = 1 * 3 * 5 *....* 67 * 69 * 71.
Looking at the values on the right, we can see that every odd prime number between 1 and 71, inclusive, is a factor of f(71).
Since f(71) and f(71)-1 are coprimes, NONE of the odd prime numbers between 1 and 71, inclusive, can be a factor of f(71)-1.
Thus, the smallest odd prime factor of f(71)-1 must be GREATER THAN 71.
The correct answer is E.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
GMAT/MBA Expert
- Scott@TargetTestPrep
- GMAT Instructor
- Posts: 7243
- Joined: Sat Apr 25, 2015 10:56 am
- Location: Los Angeles, CA
- Thanked: 43 times
- Followed by:29 members
We see that f(n) = 1 x 3 x 5 x ... x n. So f(71) = 1 x 3 x 5 x ... x 71. However, since f(71) is divisible by all odd numbers from 1 to 71, f(71) - 1 will not be divisible by any odd numbers from 1 to 71. So the lowest odd prime factor of f(71) - 1 must be greater than 71.BTGmoderatorAT wrote:For an odd integer n, the function f(n) is defined as the product of all odd integers from 1 to n. The lowest odd prime factor f(71)-Â1 lies between...
A. 3 and 10
B. 11 and 30
C. 31 and 50
D. 51 and 70
E. 71 and above
Answer: E
Scott Woodbury-Stewart
Founder and CEO
[email protected]
See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews
GMAT/MBA Expert
- Scott@TargetTestPrep
- GMAT Instructor
- Posts: 7243
- Joined: Sat Apr 25, 2015 10:56 am
- Location: Los Angeles, CA
- Thanked: 43 times
- Followed by:29 members
We see that f(n) = 1 x 3 x 5 x ... x n. So f(71) = 1 x 3 x 5 x ... x 71. However, since f(71) is divisible by all odd numbers from 1 to 71, f(71) - 1 will not be divisible by any odd numbers from 1 to 71. So the lowest odd prime factor of f(71) - 1 must be greater than 71.BTGmoderatorAT wrote:For an odd integer n, the function f(n) is defined as the product of all odd integers from 1 to n. The lowest odd prime factor f(71)-Â1 lies between...
A. 3 and 10
B. 11 and 30
C. 31 and 50
D. 51 and 70
E. 71 and above
Answer: E
Scott Woodbury-Stewart
Founder and CEO
[email protected]
See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews