We can not take negative fractions for A & B , Because Then it will be imaginary Numbers and we don't deal with those numbers in Gmat.spepakay wrote:What is the most efficient way of solving the below problem? Please provide step by step solution. Just to clarify, the ^ (caret) implies "to the power of". Thanks in advance.
Is A^B > B^A?
(1) A^A > A^B
(2) B^A > B^B
I would like to proof it with putting in numbers for A & B, Starting with +ve integers , -ve integers , +ve fractions and Zero.
It looks that we are in for a very lengthy solution.
(1) A^A > A^B
Let A = 4 , B = 3
A^B > B^A :arrow: 4^3 = 64 , 3^4 = 81 , So answer is No.
Let A = 3 , B = 2
A^B > B^A :arrow: 3^2 = 9 , 2^3 = 8 , Answer is Yes.
So insufficient.
(2) B^A > B^B
Let A = 3 , B = 2
A^B > B^A :arrow: 3^2 = 9 , 2^3 = 8 , Answer is Yes.
Let A = 4 , B = 3
A^B > B^A :arrow: 4^3 = 64 , 3^4 = 81 , So answer is No.
So insufficient. Again.
NOTE: By Putting in same values in both the same statements we get a yes or no. So even by combining the statement we get the same answer. So still insufficient.
MY personal suggestion. Always start with easy number like +ve integers. then go to - ve integers and only if required go to fractions.........
My answer is E, What is the OA?












