Last visit was: 19 Nov 2025, 07:49 It is currently 19 Nov 2025, 07:49
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
Back to Forum
Create Topic
avatar
qtrip
avatar
Joined: 25 Feb 2012
Last visit: 03 May 2013
Posts: 57
Own Kudos:
114
 [86]
Given Kudos: 8
Posts: 57
Kudos: 114
 [86]
The function p(n) on non-negative integer n is defined in Updated on: 28 Apr 2012, 06:21
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
3
Kudos
Add Kudos
82
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

95% (hard)

Question Stats:

35% (02:35) correct 65% (02:50) wrong based on 536 sessions

History

Date
Time
Result
Not Attempted Yet
The function p(n) on non-negative 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.
ShowHide Answer
Official Answer
D
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,389
Own Kudos:
778,255
 [8]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,389
Kudos: 778,255
 [8]
The function p(n) on non-negative integer n is defined in 28 Apr 2012, 06:18
3
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
qtrip
The function p(n) on non-negative 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.
Show more

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.
User avatar
KarishmaB
User avatar
Joined: 16 Oct 2010
Last visit: 18 Nov 2025
Posts: 16,267
Own Kudos:
76,994
 [6]
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 76,994
 [6]
The function p(n) on non-negative integer n is defined in 26 Oct 2014, 21:42
4
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
qtrip
The function p(n) on non-negative 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.
Show more

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)
General Discussion
avatar
qtrip
avatar
Joined: 25 Feb 2012
Last visit: 03 May 2013
Posts: 57
Own Kudos:
114
Given Kudos: 8
Posts: 57
Kudos: 114
The function p(n) on non-negative integer n is defined in 28 Apr 2012, 06:21
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks Bunuel..I was wondering how something like 11 can be represented. But now I understand why 1024 has to be the right answer.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,389
Own Kudos:
778,255
 [1]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,389
Kudos: 778,255
 [1]
The function p(n) on non-negative integer n is defined in 28 Apr 2012, 06:27
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
qtrip
Thanks Bunuel..I was wondering how something like 11 can be represented. But now I understand why 1024 has to be the right answer.
Show more


11 can be expressed as \(p(10,000)=2^0*3^0*5^0*7^0*11^1\).
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,389
Own Kudos:
778,255
 [1]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,389
Kudos: 778,255
 [1]
The function p(n) on non-negative integer n is defined in 25 Jun 2013, 05:56
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bumping for review and further discussion*. Get a kudos point for an alternative solution!

*New project from GMAT Club!!! Check HERE

Theory on Exponents: math-number-theory-88376.html

All DS Exponents questions to practice: search.php?search_id=tag&tag_id=39
All PS Exponents questions to practice: search.php?search_id=tag&tag_id=60

Tough and tricky DS exponents and roots questions with detailed solutions: tough-and-tricky-exponents-and-roots-questions-125967.html
Tough and tricky PS exponents and roots questions with detailed solutions: tough-and-tricky-exponents-and-roots-questions-125956.html
avatar
up4gmat
avatar
Joined: 14 Dec 2012
Last visit: 29 Jun 2022
Posts: 59
Own Kudos:
22
Given Kudos: 186
Location: United States
Posts: 59
Kudos: 22
The function p(n) on non-negative integer n is defined in 01 Aug 2013, 20:24
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
qtrip
The function p(n) on non-negative 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.
Show more



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...
User avatar
mau5
User avatar
Verbal Forum Moderator
Joined: 10 Oct 2012
Last visit: 31 Dec 2024
Posts: 479
Own Kudos:
3,340
 [4]
Given Kudos: 141
Posts: 479
Kudos: 3,340
 [4]
The function p(n) on non-negative integer n is defined in 02 Aug 2013, 01:22
3
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
up4gmat
Bunuel
qtrip
The function p(n) on non-negative 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...
Show more

We don't have to find p(1024). In-fact, the question asks to find the value of the smallest integer which can never be assumed by the function p(n), for any non-negative 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.
avatar
zaolupa
avatar
Joined: 20 Oct 2014
Last visit: 30 Nov 2014
Posts: 1
Given Kudos: 2
Posts: 1
Kudos: 0
The function p(n) on non-negative integer n is defined in 26 Oct 2014, 15:50
Kudos
Add Kudos
Bookmarks
Bookmark this Post
The case of 1. p(what)=1?
User avatar
KarishmaB
User avatar
Joined: 16 Oct 2010
Last visit: 18 Nov 2025
Posts: 16,267
Own Kudos:
76,994
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 76,994
The function p(n) on non-negative integer n is defined in 26 Oct 2014, 21:35
Kudos
Add Kudos
Bookmarks
Bookmark this Post
zaolupa
The case of 1. p(what)=1?
Show more

If n = 0,
p(0) = 2^0 = 1
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,588
Own Kudos:
1,079
Posts: 38,588
Kudos: 1,079
The function p(n) on non-negative integer n is defined in 29 Apr 2025, 05:00
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
Moderators:
Bunuel
Math Expert
105389 posts
Krunaal
Tuck School Moderator
805 posts