January 22, 2019 January 22, 2019 10:00 PM PST 11:00 PM PST In case you didn’t notice, we recently held the 1st ever GMAT game show and it was awesome! See who won a full GMAT course, and register to the next one. January 26, 2019 January 26, 2019 07:00 AM PST 09:00 AM PST Attend this webinar to learn how to leverage Meaning and Logic to solve the most challenging Sentence Correction Questions.
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, 05:21
Question Stats:
31% (02:42) correct 69% (02:55) wrong based on 338 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, 05:05.
Last edited by Bunuel on 28 Apr 2012, 05:21, edited 1 time in total.
Added the OA



Math Expert
Joined: 02 Sep 2009
Posts: 52390

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
28 Apr 2012, 05: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.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



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, 05: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: 52390

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
28 Apr 2012, 05:27



Math Expert
Joined: 02 Sep 2009
Posts: 52390

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
25 Jun 2013, 04:56



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

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
01 Aug 2013, 19: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: 611

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
02 Aug 2013, 00: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.
_________________
All that is equal and notDeep Dive Inequality
Hit and Trial for Integral Solutions



Manager
Joined: 07 Apr 2014
Posts: 111

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
24 Aug 2014, 12: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: 52390

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
24 Aug 2014, 12:10



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, 14:50
The case of 1. p(what)=1?



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

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
26 Oct 2014, 20: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: 8805
Location: Pune, India

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
26 Oct 2014, 20: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: 9464

Re: The function p(n) on nonnegative integer n is defined in
[#permalink]
Show Tags
21 May 2018, 03:19
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.
_________________
GMAT Books  GMAT Club Tests  Best Prices on GMAT Courses  GMAT Mobile App  Math Resources  Verbal Resources




Re: The function p(n) on nonnegative integer n is defined in &nbs
[#permalink]
21 May 2018, 03:19






