Oct 14 08:00 PM PDT  11:00 PM PDT Join a 4day FREE online boot camp to kick off your GMAT preparation and get you into your dream bschool in R2.**Limited for the first 99 registrants. Register today! Oct 15 12:00 PM PDT  01:00 PM PDT Join this live GMAT class with GMAT Ninja to learn to conquer your fears of long, kooky GMAT questions. 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 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.
Author 
Message 
TAGS:

Hide Tags

Manager
Joined: 25 Feb 2012
Posts: 59

The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
Updated on: 28 Apr 2012, 06:21
Question Stats:
31% (02:36) correct 69% (02:52) wrong based on 265 sessions
HideShow timer Statistics
The function p(n) on nonnegative integer n is defined in the following way: the units digit of n is the exponent of 2 in the prime factorization of p(n), the tens digit is the exponent of 3, and in general, for positive integer k, the digit in the 10^(k–1) th place of n is the exponent on the kth smallest prime (compared to the set of all primes) in the prime factorization of p(n). For instance, p(102) = 20, since 20 = (5^1)(3^0)(2^2). What is the smallest positive integer that is not equal to p(n) for any permissible n? (A) 1 (B) 29 (C) 31 (D) 1,024 (E) 2,310 OA after some discussion.
Official Answer and Stats are available only to registered users. Register/ Login.
Originally posted by qtrip on 28 Apr 2012, 06:05.
Last edited by Bunuel on 28 Apr 2012, 06:21, edited 1 time in total.
Added the OA



Math Expert
Joined: 02 Sep 2009
Posts: 58310

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
28 Apr 2012, 06:18
qtrip wrote: The function p(n) on nonnegative integer n is defined in the following way: the units digit of n is the exponent of 2 in the prime factorization of p(n), the tens digit is the exponent of 3, and in general, for positive integer k, the digit in the 10^(k–1) th place of n is the exponent on the kth smallest prime (compared to the set of all primes) in the prime factorization of p(n). For instance, p(102) = 20, since 20 = (5^1)(3^0)(2^2). What is the smallest positive integer that is not equal to p(n) for any permissible n?
(A) 1 (B) 29 (C) 31 (D) 1,024 (E) 2,310
OA after some discussion. The function basically transforms the digits of integer n into the power of primes: 2, 3, 5, ... For example: \(p(9)=2^9\); \(p(49)=2^9*3^4\); \(p(349)=2^9*3^4*5^3\); \(p(6349)=2^9*3^4*5^3*7^4\); ... The question asks for the leas number that cannot be expressed by the function p(n). So, the digits of n transform to the power and since single digit cannot be more than 10 then p(n) cannot have the power of 10 or higher. So, the least number that cannot be expressed by the function p(n) is \(2^{10}=1,024\) (n just cannot have 10 as its digit). Answer: D. P.S. If you have the OA you have to indicate it under the spoiler.
_________________



Manager
Joined: 25 Feb 2012
Posts: 59

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
28 Apr 2012, 06:21
Thanks Bunuel..I was wondering how something like 11 can be represented. But now I understand why 1024 has to be the right answer.



Math Expert
Joined: 02 Sep 2009
Posts: 58310

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
28 Apr 2012, 06:27
qtrip wrote: Thanks Bunuel..I was wondering how something like 11 can be represented. But now I understand why 1024 has to be the right answer. 11 can be expressed as \(p(10,000)=2^0*3^0*5^0*7^0*11^1\).
_________________



Math Expert
Joined: 02 Sep 2009
Posts: 58310

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
25 Jun 2013, 05:56
Bumping for review and further discussion*. Get a kudos point for an alternative solution! *New project from GMAT Club!!! Check HERE
_________________



Manager
Joined: 14 Dec 2012
Posts: 64
Location: United States

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
01 Aug 2013, 20:24
Bunuel wrote: qtrip wrote: The function p(n) on nonnegative integer n is defined in the following way: the units digit of n is the exponent of 2 in the prime factorization of p(n), the tens digit is the exponent of 3, and in general, for positive integer k, the digit in the 10^(k–1) th place of n is the exponent on the kth smallest prime (compared to the set of all primes) in the prime factorization of p(n). For instance, p(102) = 20, since 20 = (5^1)(3^0)(2^2). What is the smallest positive integer that is not equal to p(n) for any permissible n?
(A) 1 (B) 29 (C) 31 (D) 1,024 (E) 2,310
OA after some discussion. The function basically transforms the digits of integer n into the power of primes: 2, 3, 5, ... For example: \(p(9)=2^9\); \(p(49)=2^9*3^4\); \(p(349)=2^9*3^4*5^3\); \(p(6349)=2^9*3^4*5^3*7^4\); ... The question asks for the leas number that cannot be expressed by the function p(n). So, the digits of n transform to the power and since single digit cannot be more than 10 then p(n) cannot have the power of 10 or higher. So, the least number that cannot be expressed by the function p(n) is \(2^{10}=1,024\) (n just cannot have 10 as its digit). Answer: D. P.S. If you have the OA you have to indicate it under the spoiler. Hi Bunuel, I am a bit confused here.Cant p(1024) be 2^4 *3^2*5^0*7^1.. kindly elaborate...i get what you mean but am unable to implement it here...



Verbal Forum Moderator
Joined: 10 Oct 2012
Posts: 591

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
02 Aug 2013, 01:22
up4gmat wrote: Bunuel wrote: qtrip wrote: The function p(n) on nonnegative integer n is defined in the following way: the units digit of n is the exponent of 2 in the prime factorization of p(n), the tens digit is the exponent of 3, and in general, for positive integer k, the digit in the 10^(k–1) th place of n is the exponent on the kth smallest prime (compared to the set of all primes) in the prime factorization of p(n). For instance, p(102) = 20, since 20 = (5^1)(3^0)(2^2). What is the smallest positive integer that is not equal to p(n) for any permissible n?
(A) 1 (B) 29 (C) 31 (D) 1,024 (E) 2,310
OA after some discussion. The function basically transforms the digits of integer n into the power of primes: 2, 3, 5, ... For example: \(p(9)=2^9\); \(p(49)=2^9*3^4\); \(p(349)=2^9*3^4*5^3\); \(p(6349)=2^9*3^4*5^3*7^4\); ... The question asks for the leas number that cannot be expressed by the function p(n). So, the digits of n transform to the power and since single digit cannot be more than 10 then p(n) cannot have the power of 10 or higher. So, the least number that cannot be expressed by the function p(n) is \(2^{10}=1,024\) (n just cannot have 10 as its digit). Answer: D. P.S. If you have the OA you have to indicate it under the spoiler. Hi Bunuel, I am a bit confused here.Cant p(1024) be 2^4 *3^2*5^0*7^1.. kindly elaborate...i get what you mean but am unable to implement it here... We don't have to find p(1024). Infact, the question asks to find the value of the smallest integer which can never be assumed by the function p(n), for any nonnegative integer,n. For eg, for p(n) =5, the initial integer n = 100, for p(n) = 7, n = 1000 and so on. Now, if p(n) were to be \(1024 = 2^{10}\), that would mean that the units digit of n was 10, which is not possible. Hope this helps.
_________________



Manager
Joined: 07 Apr 2014
Posts: 101

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
24 Aug 2014, 13:01
Hi, Could you use some options in the answer choice & explain the reasoning so that i could understand the concept clearly.
thanks in advance



Math Expert
Joined: 02 Sep 2009
Posts: 58310

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
24 Aug 2014, 13:10
luckyme17187 wrote: Hi, Could you use some options in the answer choice & explain the reasoning so that i could understand the concept clearly.
thanks in advance Solution is given here: thefunctionpnonnonnegativeintegernisdefinedin131459.html#p1079514 Please read it and also the discussion below it. If something will remain unclear please ask but try to be a little bit more specific. Thank you.
_________________



Intern
Joined: 20 Oct 2014
Posts: 1

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
26 Oct 2014, 15:50
The case of 1. p(what)=1?



Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 9700
Location: Pune, India

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
26 Oct 2014, 21:35
zaolupa wrote: The case of 1. p(what)=1? If n = 0, p(0) = 2^0 = 1
_________________
Karishma Veritas Prep GMAT Instructor
Learn more about how Veritas Prep can help you achieve a great GMAT score by checking out their GMAT Prep Options >



Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 9700
Location: Pune, India

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
26 Oct 2014, 21:42
qtrip wrote: The function p(n) on nonnegative integer n is defined in the following way: the units digit of n is the exponent of 2 in the prime factorization of p(n), the tens digit is the exponent of 3, and in general, for positive integer k, the digit in the 10^(k–1) th place of n is the exponent on the kth smallest prime (compared to the set of all primes) in the prime factorization of p(n). For instance, p(102) = 20, since 20 = (5^1)(3^0)(2^2). What is the smallest positive integer that is not equal to p(n) for any permissible n?
(A) 1 (B) 29 (C) 31 (D) 1,024 (E) 2,310
OA after some discussion. The question asks for the value that p(n) cannot take. p(n) is of the form \(2^a * 3^b * 5^c * 7^d\)... etc We know that this is prime factorization and that every positive integer can be prime factorized. Then what is the constraint on the value of p(n)? a, b, c, d etc are single digits. So if the prime factorization of a number is \(2^{10}\) or \(3^{24}\), it cannot be p(n). The smallest value that p(n) cannot take is \(2^{10} = 1024\). Answer (D)
_________________
Karishma Veritas Prep GMAT Instructor
Learn more about how Veritas Prep can help you achieve a great GMAT score by checking out their GMAT Prep Options >



NonHuman User
Joined: 09 Sep 2013
Posts: 13119

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
11 Jul 2019, 07:54
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: The function p(n) on nonnegative integer n is defined in
[#permalink]
11 Jul 2019, 07:54






