Sum of exponents in the prime breakup of s

This topic has expert replies
Legendary Member
Posts: 641
Joined: Tue Feb 14, 2012 3:52 pm
Thanked: 11 times
Followed by:8 members
Hello,

Can you please tell me how to solve this:

Function f(s) equals the sum of the exponents in the prime break-up of s.
For example: f(120) = 5, since 120 = (23)(31)(51), and 3 + 1 + 1 = 5. If
f(m) = 4 and f(n) = 5, what is the value of f(mn)?

(A) 4
(B) 5
(C) 9
(D) 18
(E) 20

OA: C


Thanks,
Sri
Source: — Problem Solving |

GMAT Instructor
Posts: 2630
Joined: Wed Sep 12, 2012 3:32 pm
Location: East Bay all the way
Thanked: 625 times
Followed by:119 members
GMAT Score:780

by Matt@VeritasPrep » Wed Feb 19, 2014 5:13 pm
Let's start with one of the functions to get a sense of what's happening.

If f(m) = 4, then m is either x�, x³ * y, or x² * y², where x and y are distinct prime factors of m.

(For instance, f(16) = 4, since 16 = 2�, f(24) = 4, since 24 = 2³ * 3, etc.)

In any case, as we see, the sum is 4. f(n) is similar, but with partitions of 5 instead of 4 (e.g. x³ * y², etc.) ("Partitions" here means "ways you can add positive integers to obtain a sum of 5".)

When we multiply the two numbers together, our possibilities include

m * n = x� * (x³ * y²)
or
m * n = (x² * y²) * (x� * y)

Notice that in these cases (and any others) the sum is 9, so you're set!

The easiest way to do this on the test is probably to pick small numbers, such as m = 16 and n = 32, that fit the functions, then to see what your result is. Since the question implies the answer will be the same for ALL integers m and n, any two you pick should suffice.

GMAT/MBA Expert

User avatar
Elite Legendary Member
Posts: 10392
Joined: Sun Jun 23, 2013 6:38 pm
Location: Palo Alto, CA
Thanked: 2867 times
Followed by:511 members
GMAT Score:800

by [email protected] » Thu Feb 20, 2014 12:25 am
Hi Sri,

What is the source of this question? I ask because this question essentially asks you to "prime factor" a number AND consider duplicates, which is something that GMAT usually does NOT ask for.

Since f(m) has 4 prime factors (including duplicates) and f(n) has 5 prime factors (including duplicates), the f(mn) must have 9 prime factors (including duplicates); the 4 from the first number and the 5 from the second number. This doesn't match the "design" of GMAT questions that cover this concept, so you're not gong to end up seeing this on Test Day.

GMAT assassins aren't born, they're made,
Rich
Contact Rich at [email protected]
Image

User avatar
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

by GMATGuruNY » Thu Feb 20, 2014 4:25 am
The portion in red reflects the intent of the problem.
gmattesttaker2 wrote: Function f(s) equals the sum of the exponents in the prime break-up of s.
For example: f(120) = 5, since 120 = (2³)(3¹)(5¹), and 3 + 1 + 1 = 5. If
f(m) = 4 and f(n) = 5, what is the value of f(mn)?

(A) 4
(B) 5
(C) 9
(D) 18
(E) 20

OA: C
f(x) = the sum of the exponents when x is prime-factored.
To illustrate:
If x = 2³3�, then f(2³3�) = 3+4 = 7.
If x = 5²11�, then f(5²11�) = 2+8 = 10.
But there is no requirement that the prime-factorization of x be composed of more than one exponent.
If the prime-factorization of x is composed of only ONE exponent, then that ONE exponent is also the SUM of the exponents:
If x = 2³, then f(2³) = 3.

Since f(m) = 4, let m = 2�.
Since f(n) = 5, let n = 2�.
Result:
f(mn) = f(2�2�) = f(2�) = 9.

The correct answer is C.
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