please solve this one.

This topic has expert replies
Newbie | Next Rank: 10 Posts
Posts: 7
Joined: Wed Aug 03, 2016 7:56 pm

please solve this one.

by aarzoo » Wed Aug 17, 2016 5:42 am
the product of the factors of a three digit number is equal to the ninth power of the number. find the least such number.

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pm
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1268 members
GMAT Score:770

by Brent@GMATPrepNow » Wed Aug 17, 2016 5:58 am
aarzoo wrote:the product of the factors of a three digit number is equal to the ninth power of the number. find the least such number.
This isn't really a GMAT-style question.

It's missing the 5 answer choices. If there were 5 answer choices, we could just check them to see which one satisfies the given conditions.

What's the source of this question?

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image

Newbie | Next Rank: 10 Posts
Posts: 7
Joined: Wed Aug 03, 2016 7:56 pm

by aarzoo » Wed Aug 17, 2016 6:09 am
1. 2^17
2. 768
3. 288
4.180
5. 140

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pm
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1268 members
GMAT Score:770

by Brent@GMATPrepNow » Wed Aug 17, 2016 7:32 am
aarzoo wrote:the product of the factors of a three digit number is equal to the ninth power of the number. find the least such number.

A) 2^17
B) 768
C) 288
D) 180
E) 140
In my opinion, this question is too hard/time-consuming for the GMAT (unless I'm missing something quite basic).

If the prime factorization of N = (p^a)(q^b)(r^c) . . . (where p, q, r, etc are different prime numbers), then N has a total of (a+1)(b+1)(c+1)(etc) positive divisors.

Example: 14000 = (2^4)(5^3)(7^1)
So, the number of positive divisors of 14000 = (4+1)(3+1)(1+1) =(5)(4)(2) = 40

If factors of the number must equal to the ninth power of the number, we want the number of divisors to be divisible by 9.

E) 140 = (2¹)(5¹)(7¹)
So, the number of positive divisors of 140 = (1+1)(1+1)(1+1) =(2)(2)(2) = 8
Since 8 is NOT divisible by 9, we can ELIMINATE A

D) 180 = (2²)(3²)(5¹)
So, the number of positive divisors of 180 = (2+1)(2+1)(1+1) =(3)(3)(2) = 18
18 IS divisible by 9, so B seems like a good contender.
To be sure, let's look at the factors of 180

So, the factors of 180 are: 2�, 2¹, 2², (3¹)(2�), (3¹)(2¹), (3¹)(2²), (3²)(2�), (3²)(2¹), (3²)(2²), (2�)(5), (2¹)(5), (2²)(5), (3¹)(2�)(5), (3¹)(2¹)(5), (3¹)(2²)(5), (3²)(2�)(5), (3²)(2¹)(5), and (3²)(2²)(5)

So, the product of all of the factors = (2�)(2¹)(2²)(3¹)(2�)(3¹)(2¹)(3¹)(2²)(3²)(2�)(3²)(2¹)(3²)(2²)(2�)(5)(2¹)(5)(2²)(5)(3¹)(2�)(5)(3¹)(2¹)(5)(3¹)(2²)(5)(3²)(2�)(5)(3²)(2¹)(5)(3²)(2²)(5)

The product of all of the factors = (2^18)(3^18)(5^9)

Notice that the product (2^18)(3^18)(5^9) is equal to [(2²)(3²)(5¹)]�

Answer: D
Brent Hanneson - Creator of GMATPrepNow.com
Image

User avatar
Legendary Member
Posts: 2663
Joined: Wed Jan 14, 2015 8:25 am
Location: Boston, MA
Thanked: 1153 times
Followed by:128 members
GMAT Score:770

by DavidG@VeritasPrep » Wed Aug 17, 2016 11:22 am
In my opinion, this question is too hard/time-consuming for the GMAT (unless I'm missing something quite basic).
Agreed. (That the question is too time-consuming for the GMAT, not that you're missing something basic.)
Veritas Prep | GMAT Instructor

Veritas Prep Reviews
Save $100 off any live Veritas Prep GMAT Course

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 » Fri Aug 19, 2016 2:03 am
You guys ARE missing something (kinda) basic here :p

To illustrate, let's take a smaller number, such as 30. To find the product of its factors, think of them in pairs:

1 * 30
2 * 15
3 * 10
5 * 6

So the product of the factors of 30 is 30�, where n is the number of factors divided by 2.

Let's say our number is x. We know that

x� = x�

So n = 9, and our number has 18 factors. From there, we find the smallest three digit number with 18 factors. Using our number of factors trick, we know that

18 = 3 * 3 * 2

so a number that's expressible as p² * q² * r, with p, q, and r prime, should do it. 2² * 3² * 5 is the smallest such number, so that's our guy.

(Properly speaking, we should consider other cases, such as p² * q� or p * q�, but if you've gotten this far you can quickly see why those will be give larger integers than 180.)

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 » Fri Aug 19, 2016 2:26 pm
Whoops, addendum to that last post: I should've said "with p, q, and r distinct primes" ... but hopefully it was clear from the context/inspiration.