NEW HERE? LEARN MORE
closeclose
Last visit was: 25 Apr 2024, 01:03 It is currently 25 Apr 2024, 01:03
Decision Tracker
My Rewards
New posts
New comers' posts

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

The function p(n) on non-negative integer n is defined in

SORT BY:
Date
Kudos
Tags:
Find Similar Topics 
Show Tags
Hide Tags
avatar
qtrip
Manager
Manager
Joined: 25 Feb 2012
Posts: 57
Own Kudos [?]: 97 [73]
Given Kudos: 8
Send PM
The function p(n) on non-negative integer n is defined in [#permalink] New post   Updated on: 28 Apr 2012, 06:21
3
Kudos
69
Bookmarks
00:00
A
B
C
D
E

Difficulty:

95% (hard)

Question Stats:

36% (02:37) correct 64% (02:50) wrong based on 436 sessions
Hide Show timer Statistics
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

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
Most Helpful Reply
User avatar
L
Bunuel
Math Expert
Joined: 02 Sep 2009
Posts: 92903
Own Kudos [?]: 618874 [6]
Given Kudos: 81588
Send PM
CAT Tests Forum Quiz Mode
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   28 Apr 2012, 06:18
3
Kudos
3
Bookmarks
Expert Reply
qtrip wrote:
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.
General Discussion
avatar
qtrip
Manager
Manager
Joined: 25 Feb 2012
Posts: 57
Own Kudos [?]: 97 [0]
Given Kudos: 8
Send PM
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   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.
User avatar
L
Bunuel
Math Expert
Joined: 02 Sep 2009
Posts: 92903
Own Kudos [?]: 618874 [1]
Given Kudos: 81588
Send PM
CAT Tests Forum Quiz Mode
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   28 Apr 2012, 06:27
1
Kudos
Expert Reply
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\).
User avatar
L
Bunuel
Math Expert
Joined: 02 Sep 2009
Posts: 92903
Own Kudos [?]: 618874 [1]
Given Kudos: 81588
Send PM
CAT Tests Forum Quiz Mode
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   25 Jun 2013, 05:56
1
Kudos
Expert Reply
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
Manager
Manager
Joined: 14 Dec 2012
Posts: 60
Own Kudos [?]: 22 [0]
Given Kudos: 186
Location: United States
Send PM
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   01 Aug 2013, 20:24
Bunuel wrote:
qtrip wrote:
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...
User avatar
B
mau5
Verbal Forum Moderator
Joined: 10 Oct 2012
Posts: 485
Own Kudos [?]: 3092 [4]
Given Kudos: 141
Send PM
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   02 Aug 2013, 01:22
3
Kudos
1
Bookmarks
up4gmat wrote:
Bunuel wrote:
qtrip wrote:
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...


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
Intern
Intern
Joined: 20 Oct 2014
Posts: 1
Own Kudos [?]: [0]
Given Kudos: 2
Send PM
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   26 Oct 2014, 15:50
The case of 1. p(what)=1?
User avatar
L
KarishmaB
Tutor
Joined: 16 Oct 2010
Posts: 14822
Own Kudos [?]: 64907 [0]
Given Kudos: 426
Location: Pune, India
Send PM
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   26 Oct 2014, 21:35
Expert Reply
zaolupa wrote:
The case of 1. p(what)=1?


If n = 0,
p(0) = 2^0 = 1
User avatar
L
KarishmaB
Tutor
Joined: 16 Oct 2010
Posts: 14822
Own Kudos [?]: 64907 [4]
Given Kudos: 426
Location: Pune, India
Send PM
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   26 Oct 2014, 21:42
3
Kudos
1
Bookmarks
Expert Reply
qtrip wrote:
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 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)
User avatar
bumpbot
Non-Human User
Joined: 09 Sep 2013
Posts: 32662
Own Kudos [?]: 821 [0]
Given Kudos: 0
Send PM
Re: The function p(n) on non-negative integer n is defined in [#permalink] New post   01 Apr 2024, 06:10
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 Club Bot
gmatclubot
Re: The function p(n) on non-negative integer n is defined in [#permalink]
01 Apr 2024, 06:10
Moderators:
Bunuel
Math Expert
92901 posts
yashikaaggarwal
Senior Moderator - Masters Forum
3137 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne
Main navigation
GMAT Resources
Partners
MBA Resources
www.gmac.com|www.mba.com | | GMAT Club Rules | Terms and Conditions