by Sage Pearce-Higgins Sun Dec 16, 2018 7:37 am
If a statement is not sufficient on Data Sufficiency, then we should be able to prove that by testing cases. That is to say that we can find two cases which agree with the statement but that give different answers to the question. Let's see if we can do that.
Statement 2 tells us that "r – s is the least of the numbers". So If I pick r = 1 and s = 1, then r – s = 0, which is indeed smaller than the other combinations. For this case, r + s = 2, and that's the greatest. Now we're looking for another case that follows the statement, but that has a different answer to the question. Let's try r = 3 and s = 3. For this second case, r – s = 0, r + s = 6, r x s = 9, and r/s = 1. Again, r – s is the smallest (what we need to agree with the statement), but the biggest this time is r x s, showing that statement 2 doesn't give us a definite answer to the question - it's insufficient.