Oct 16 08:00 PM PDT  09:00 PM PDT EMPOWERgmat is giving away the complete Official GMAT Exam Pack collection worth $100 with the 3 Month Pack ($299) Oct 18 08:00 AM PDT  09:00 AM PDT Learn an intuitive, systematic approach that will maximize your success on Fillintheblank GMAT CR Questions. Oct 19 07:00 AM PDT  09:00 AM PDT Does GMAT RC seem like an uphill battle? eGMAT is conducting a free webinar to help you learn reading strategies that can enable you to solve 700+ level RC questions with at least 90% accuracy in less than 10 days. Sat., Oct 19th at 7 am PDT Oct 20 07:00 AM PDT  09:00 AM PDT Get personalized insights on how to achieve your Target Quant Score. Oct 22 08:00 PM PDT  09:00 PM PDT On Demand for $79. For a score of 4951 (from current actual score of 40+) AllInOne Standard & 700+ Level Questions (150 questions)
Author 
Message 
TAGS:

Hide Tags

Manager
Joined: 04 Nov 2012
Posts: 50

g(x) is defined as the product of all even integers k such t
[#permalink]
Show Tags
Updated on: 01 Apr 2013, 04:34
Question Stats:
63% (02:31) correct 37% (02:29) wrong based on 353 sessions
HideShow timer Statistics
g(x) is defined as the product of all even integers k such that 0 < k ≤ x. For example, g(14) = 2 × 4 × 6 × 8 × 10 × 12 × 14. If g(y) is divisible by 4^11, what is the smallest possible value for y? (A) 22 (B) 24 (C) 28 (D) 32 (E) 44 Now, i just need help with the approach. One way is to manually count all the powers of 2 that would be sufficient. However, i would like to use the formula for counting the power of a prime number as given in the gmat club maths book. i.e For n! suppose we need to find out the powers of prime number p in n!: n/p +n/p^2 +n/p^3 +......n/p^k where p^k <n. I think it would make no difference even though it is not a factorial in the question, as we are anyway counting only powers of 2. My question is, while using this formula, how many powers of p(2 in this question) should we take in this case to get the value of n(y in this question). Can it be done this way? Please help.
Official Answer and Stats are available only to registered users. Register/ Login.
Originally posted by 12bhang on 01 Apr 2013, 04:31.
Last edited by Bunuel on 01 Apr 2013, 04:34, edited 1 time in total.
Renamed the topic and edited the question.




Manager
Joined: 26 Feb 2013
Posts: 51
Concentration: Strategy, General Management
WE: Consulting (Telecommunications)

Re: g(x) is defined as the product of all even integers k such t
[#permalink]
Show Tags
01 Apr 2013, 10:34
g(x) is defined as the product of all even integers k such that 0 < k ≤ x. For example, g(14) = 2 × 4 × 6 × 8 × 10 × 12 × 14. If g(y) is divisible by 4^11, what is the smallest possible value for y?
(A) 22 (B) 24 (C) 28 (D) 32 (E) 44
4^11=2^22. So we have to find a product with atleast 22 2's in it.
in option 1 22 the total no of 2's = [22/2] + [22/4] +[22/8] +[22/16] = 11+5+2+1 = 19 in option 2 24 the total no of 2's = [24/2] + [24/4] +[24/8] +[24/16] = 12+6+3+1 = 22 . Hence B




Verbal Forum Moderator
Joined: 10 Oct 2012
Posts: 590

Re: g(x) is defined as the product of all even integers k such t
[#permalink]
Show Tags
01 Apr 2013, 05:59
12bhang wrote: g(x) is defined as the product of all even integers k such that 0 < k ≤ x. For example, g(14) = 2 × 4 × 6 × 8 × 10 × 12 × 14. If g(y) is divisible by 4^11, what is the smallest possible value for y?
(A) 22 (B) 24 (C) 28 (D) 32 (E) 44
Please help. For the given function g(y), the generalized notation will be of the type : 2^(y/2)*[y/2]! We can see that g(14) = 2^7*7!. Now the number of times 2 appears in 7! is given by : [7/2]+[7/4] = 3+1 = 4; where [x] denotes the greatest integer less than or equal to x .Thus, the total number of times 2 appears in g(14) is 7+4 = 11 times. Now, given that g(y) is divisible by 4^11 = 2^22. Thus the value of y should be such that 2 appears 22 times in g(y). Now g(22) = 2^11*11!. Just as above, we can see that the number of 2's is 11+[11/2]+[11/4]+[11/8] = 11+5+2+1 = 19. For g(24) = 2^12*12! . The total number of 2's = 12+[12/2]+[12/4]+[12/8] = 12+6+3+1 = 22. B.
_________________



Manager
Joined: 07 Apr 2012
Posts: 87
Location: United States
Concentration: Entrepreneurship, Operations
GPA: 3.9
WE: Operations (Manufacturing)

Re: g(x) is defined as the product of all even integers k such t
[#permalink]
Show Tags
11 Nov 2013, 07:24
12bhang wrote: g(x) is defined as the product of all even integers k such that 0 < k ≤ x. For example, g(14) = 2 × 4 × 6 × 8 × 10 × 12 × 14. If g(y) is divisible by 4^11, what is the smallest possible value for y?
(A) 22 (B) 24 (C) 28 (D) 32 (E) 44
Now, i just need help with the approach. One way is to manually count all the powers of 2 that would be sufficient. However, i would like to use the formula for counting the power of a prime number as given in the gmat club maths book. i.e
For n! suppose we need to find out the powers of prime number p in n!: n/p +n/p^2 +n/p^3 +......n/p^k where p^k <n.
I think it would make no difference even though it is not a factorial in the question, as we are anyway counting only powers of 2.
My question is, while using this formula, how many powers of p(2 in this question) should we take in this case to get the value of n(y in this question).
Can it be done this way? Please help. Method I : Counting Method. Method II : As you rightly pointed we can apply factorial theorem here , since presence of any odd factor will not affect our finding the # of 2s So you are supposed to take greatest integer of N/P + N/p2 + N/p3......till pn exceed N. So in our case, [24/2] + [24/4] + [24/8] + [24/16] = 12 + 6 + 3 + 1 = 22 Hope its clear.



Manager
Joined: 26 Sep 2013
Posts: 184
Concentration: Finance, Economics
GMAT 1: 670 Q39 V41 GMAT 2: 730 Q49 V41

Re: g(x) is defined as the product of all even integers k such t
[#permalink]
Show Tags
11 Nov 2013, 18:32
mau5 wrote: 12bhang wrote: g(x) is defined as the product of all even integers k such that 0 < k ≤ x. For example, g(14) = 2 × 4 × 6 × 8 × 10 × 12 × 14. If g(y) is divisible by 4^11, what is the smallest possible value for y?
(A) 22 (B) 24 (C) 28 (D) 32 (E) 44
Please help. For the given function g(y), the generalized notation will be of the type : 2^(y/2)*[y/2]! We can see that g(14) = 2^7*7!. Now the number of times 2 appears in 7! is given by : [7/2]+[7/4] = 3+1 = 4; where [x] denotes the greatest integer less than or equal to x .Thus, the total number of times 2 appears in g(14) is 7+4 = 11 times. Now, given that g(y) is divisible by 4^11 = 2^22. Thus the value of y should be such that 2 appears 22 times in g(y). Now g(22) = 2^11*11!. Just as above, we can see that the number of 2's is 11+[11/2]+[11/4]+[11/8] = 11+5+2+1 = 19. For g(24) = 2^12*12! . The total number of 2's = 12+[12/2]+[12/4]+[12/8] = 12+6+3+1 = 22. B. How did you see that g(4)=2^7*7??? I'm always baffled how you guys look at these problems and instantly see that stuff. It takes most people several minutes to multiply the product of that one and you guys just see it right at it's exponent level instantly. I'm quite jealous



Intern
Status: My heart can feel, my brain can grasp, I'm indomitable.
Affiliations: Educator
Joined: 16 Oct 2012
Posts: 37
Location: Bangladesh
WE: Social Work (Education)

Re: g(x) is defined as the product of all even integers k such t
[#permalink]
Show Tags
08 Nov 2015, 00:04
g(24)=2.4.6……24=2^12*12! Power of prime 2 in 12! =12/2+12/4+12/8 =6+3+1 =10 2^(12+10)=2^22=4^11 Plug in method starting with middle man "C" ANS: B
_________________
please press "+1 Kudos" if useful



Director
Joined: 26 Oct 2016
Posts: 613
Location: United States
Concentration: Marketing, International Business
GPA: 4
WE: Education (Education)

Re: g(x) is defined as the product of all even integers k such t
[#permalink]
Show Tags
26 Feb 2017, 17:49
Pasting official solution to this problem.
Attachments
official.PNG [ 106.76 KiB  Viewed 1760 times ]
_________________
Thanks & Regards, Anaira Mitch



NonHuman User
Joined: 09 Sep 2013
Posts: 13204

Re: g(x) is defined as the product of all even integers k such t
[#permalink]
Show Tags
16 Oct 2018, 01:47
Hello from the GMAT Club BumpBot! Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up  doing my job. I think you may find it valuable (esp those replies with Kudos). Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________




Re: g(x) is defined as the product of all even integers k such t
[#permalink]
16 Oct 2018, 01:47






