My experience with the GMAT tells me that the questions on the quant section are NOT of an exceptionally tough variety - just the very SMART variety.

One must, MUST (I cannot emphasis this enough) R E A D the question properly.

Something I need to learn myself (mum's voice going 'haste makes waste' is playing in my head right now!) - Towards this end I would like to start a new thread - problems that may or may not be very tough = but require understanding (and remembering while solving) the question properly.

Lets start the series with :

PS - 1

Is |n| < 1 ?

(1) nx – n < 0

(2) x–1 = –2


(A) Statement (1) ALONE is sufficient to answer the question, but statement (2) alone is not.
(B) Statement (2) ALONE is sufficient to answer the question, but statement (1) alone is not.
(C) Statements (1) and (2) TAKEN TOGETHER are sufficient to answer the question, but NEITHER statement ALONE is sufficient.
(D) EACH statement ALONE is sufficient to answer the question.
(E) Statements (1) and (2) TAKEN TOGETHER are NOT sufficient to answer the question.

(picked from MahattanGMAT)