If a is not equal b
Is 1/ (a-b) > ab
1. mod a > mod b
2. a <b
As I understand and read from the explanation given on the solution page its conditional rephrasing question
i.e we must from the any statement know as to whether (a-b)<0 or
(a-b)>0
But the solution in the book si not worked towards finding whether (a-b) > or less than 0 instead plugging of number is used.
Can you pls use show how to use the statement for finding (a-b)> or less than 0 without plugging number.
If we go by the principle of determinig whether a-b>0 or a-b<0 than statement 2 is sufficient but than in statement 1 we get two different conditions i.e a>b which implies a-b>0 and a<-b which implies a+b<0
We are not concerned about a+b<0 hence a-b>0 info suggests that statement 1 too is sufficient.
The rephrasing technique for inequality DS ,described in the book is really helpful.
I encountered another question on Grockit , where the technique could be used but i was not confident of using...
Can you pls help me with it...
If m is not equal to - n
Is [(m-n)/(m+n)] > 1
1. n <0
2 m>0
For the statement to be sufficient we must know whether (m+n)>0 or less than zero but no statement provides that info on combining we get know m-n>0 which is not of our concern, we want to know whether (m+n) is less or greater than zero.
Srry for so long post .
pls help me with the above questions as this is one of the topic, knowledge of which i essential to cross Q 49 mark......
Regards
Archit