product of the integers

This topic has expert replies
User avatar
Master | Next Rank: 500 Posts
Posts: 489
Joined: Tue Jul 05, 2011 11:10 am
Thanked: 28 times
Followed by:5 members

product of the integers

by gmatblood » Mon Oct 31, 2011 4:31 am
If p is the product of the integers from 1 to 30,
inclusive, what is the greatest integer k for which 3^k is
a factor of p ?
(A) 10
(B) 12
(C) 14
(D) 16
(E) 18

IMO: 18
Last edited by gmatblood on Mon Oct 31, 2011 8:53 am, edited 1 time in total.

Legendary Member
Posts: 1085
Joined: Fri Apr 15, 2011 2:33 pm
Thanked: 158 times
Followed by:21 members

by pemdas » Mon Oct 31, 2011 4:53 am
del
Last edited by pemdas on Mon Apr 09, 2012 6:45 pm, edited 1 time in total.
Success doesn't come overnight!

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 » Mon Oct 31, 2011 5:34 am
gmatblood wrote:If p is the product of the integers from 1 to 30,
inclusive, what is the greatest integer k for which 3^k is
a factor of p ?
(A) 10
(B) 12
(C) 14
(D) 16
(E) 18

IMO: 18
I believe that 3k is supposed to be 3^k. I've amended the question to reflect its intent.

p = 30!.
3^k = the number of 3's that can be divided into p.
The quickest approach is to count how many times EACH POWER OF 3 can be divided into 30!:

30/3¹ = 10.
The calculation above indicates that 30! includes 10 multiples of 3¹.

30/3² = 30/9 = 3.
The calculation above indicates that 30! includes 3 multiples of 3².

30/3³ = 30/27 = 1.
The calculation above indicates that 30! includes 1 multiple of 3³.

Thus, p includes 10 multiples of 3, 3 multiples of 3², and 1 multiple of 3³.
Thus, the total number of 3's that can be divided into p = 10+3+1 = 14.

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

User avatar
Newbie | Next Rank: 10 Posts
Posts: 2
Joined: Thu Dec 29, 2016 1:38 am

by qazi11 » Thu Dec 29, 2016 1:52 am
This method seems to be working only when factorial of numbers are considered. how about instead of the factorial of a number we have a definite number say 10678 eg
for a number p=10678, what is the greatest integer k for which 2^k is
a factor of p ? .. is there any shortcut for this or it has to be done using prime factorisation of the entire 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 » Thu Dec 29, 2016 8:12 am
If p is the product of the integers from 1 to 30, inclusive, what is the greatest integer k for which 3^k is a factor of p?
A. 10
B. 12
C. 14
D. 16
E. 18
This question is really asking us to determine the number of 3's "hiding" in the prime factorization of p.

p = (1)(2)(3)(4)(5)(6)(7)(8)(9) . . . (27)(28)(29)(30)
= (1)(2)(3)(4)(5)(2)(3)(7)(8)(3)(3)(10)(11)(3)(4)(13)(14)(3)(5)(16)(17)(3)(3)(2)(19)(20)(3)(7)(22)(23)(3)(8)(25)(26). . . (3)(3)(3)(28)(29)(3)(10)
= (3^14)(other non-3 stuff)

Answer: C

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

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 Dec 29, 2016 9:06 am
Hi qazi11,

If you're given a single 'big' number to work with, then prime-factorization is likely going to be the best way to break that number down into it's 'pieces.'

It's also worth noting that NOTHING about the design of a GMAT question is 'random' - both the wording and the numbers are specifically chosen. Here, with 10678, we can immediately see that 2 is divisible...but there isn't anything else that's obviously a factor (not 3, 5, 9, any other even number, etc.) - which is meant to say that this is not a number that the GMAT would likely ask you to prime factor.

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

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 7245
Joined: Sat Apr 25, 2015 10:56 am
Location: Los Angeles, CA
Thanked: 43 times
Followed by:29 members

by Scott@TargetTestPrep » Wed Jan 04, 2017 7:21 am
gmatblood wrote:If p is the product of the integers from 1 to 30,
inclusive, what is the greatest integer k for which 3^k is
a factor of p ?
(A) 10
(B) 12
(C) 14
(D) 16
(E) 18
The product of the integers from 1 to 30, inclusive, is 30!. Thus, we need to determine the number of factors of 3 in 30!. To do so, we can use the following shortcut in which we divide 30 by 3, then divide the quotient (ignore any nonzero remainder) by 3, and continue this process until we no longer get a nonzero quotient.

30/3 = 10

10/3 = 3 (we can ignore the remainder)

3/3 = 1

Since 1/3 does not produce a nonzero quotient, we can stop.

The final step is to add up our quotients; that sum represents the number of factors of 3 within 30!.

Thus, there are 10 + 3 + 1 = 14 factors of 3 within 30!

Answer: C

Scott Woodbury-Stewart
Founder and CEO
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews

ImageImage

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3008
Joined: Mon Aug 22, 2016 6:19 am
Location: Grand Central / New York
Thanked: 470 times
Followed by:34 members

by Jay@ManhattanReview » Mon Jan 09, 2017 11:55 pm
gmatblood wrote:If p is the product of the integers from 1 to 30,
inclusive, what is the greatest integer k for which 3^k is
a factor of p ?
(A) 10
(B) 12
(C) 14
(D) 16
(E) 18

IMO: 18
Basically, we have to find out the number of 3s in the product of 1 to 30, inclusive.

All the multiples of 3 from 1 to 30 would have at least one 3.

The multiples of 3 are: 3, 6, 9, 12, 15, 18, 21, 24, 27, and 30. There are 10 numbers of 3s.

A few multiple of 3 would render two 3s: 9, 18, and 27. So let's count them twice. So, total 3s so far = 10 + 3 = 13.

A few multiple of 3 would render three 3s: 27. So let's count them thrice. So, total 3s so far = 10 + 3 + 1 = 14.

We need not seek out for multiples of 3^4 as 3^4 = 81 > 30.

Thus, the answer = 14. C

-Jay
_________________
Manhattan Review GMAT Prep

Locations: New York | Tokyo | Manchester | Geneva | and many more...

Schedule your free consultation with an experienced GMAT Prep Advisor! Click here.