GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 23 Mar 2019, 05:49

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.

Close

Request Expert Reply

Confirm Cancel

If p,q are distinct and greater than 1, p + q =

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

 
Senior PS Moderator
User avatar
V
Joined: 26 Feb 2016
Posts: 3361
Location: India
GPA: 3.12
Premium Member
If p,q are distinct and greater than 1, p + q =  [#permalink]

Show Tags

New post 02 Mar 2019, 01:26
4
00:00
A
B
C
D
E

Difficulty:

  95% (hard)

Question Stats:

25% (02:56) correct 75% (02:20) wrong based on 28 sessions

HideShow timer Statistics

If \(p,q\) are distinct and greater than 1, \(p+q =\) ?

1. \(q^p=p^q\)
2. \(q=p^2\)

Source: Experts Global

_________________

You've got what it takes, but it will take everything you've got

examPAL Representative
User avatar
G
Joined: 07 Dec 2017
Posts: 906
If p,q are distinct and greater than 1, p + q =  [#permalink]

Show Tags

New post 02 Mar 2019, 02:09
pushpitkc wrote:
If \(p,q\) are distinct and greater than 1, \(p+q =\) ?

1. \(q^p=p^q\)
2. \(q=p^2\)

Source: Experts Global


If it isn't entirely clear how to interpret the statements, we'll first try using specific numbers to give us a clue how to proceed (and eliminate ambiguous statements).
This is an Alternative approach.

(1) Trying q = 2 gives 2^p = p^2. So 2^p has to be a square number, and as it is also a power of 2 we'll try 4,16, 64... 4 doesn't work because then p = 2 but p and q are distinct, but 16 could work as then p = 4. If we try 64 we fail again as 8^2 = 64 but 2^8 = 256 and trying any larger number won't work as it makes the exponent larger. So if p = 2 q has to equal 4.
Based on the above, we know that p has to be a power of q, so we can write p = q^n. Substituting gives q^(q^n) = (q^n)^q an using power laws q^(q^n) = q^(nq). Then q^n = nq and since q > 1 we can divide by it to get q^(n-1) = n. So if we pick n = 2 then q = 2 and p = 4 which is what we got above. If we pick n = 3 then q^2 = 3 so q = sqrt(3) and we get some other answer. We won't bother to actually calculate, as this is definitely insufficient.

(2) Once again, we can pick whichever number we like for p, giving another number for q, and then plug this into p + q to get some (different) result.
Insufficient.

Combined:
This is exactly the equation we got to above, with p and q reversed. So we know that n = 2 and therefore there is one solution (q = 4, and p = 2).

If this isn't clear, then simplify the statements by substituting (2) into (1):
(p^2)^p = p^(p^2). Using power laws, this implies that p^(2p)=p^(p^2) and therefore, since p > 1, that 2p = p^2, which gives p = 2 (as p cannot equal 0). Then q = 4 and p + q = 6.
Sufficient.

(C) is our answer.
_________________
_________________

Image
Sign up for 7-day free trial
Image

GMAT Club Bot
If p,q are distinct and greater than 1, p + q =   [#permalink] 02 Mar 2019, 02:09
Display posts from previous: Sort by

If p,q are distinct and greater than 1, p + q =

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


Copyright

GMAT Club MBA Forum Home| About| Terms and Conditions and Privacy Policy| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.