CSAT Solved Papers/ 2023/Q56

2023 CSAT — Q56

Quant Data sufficiency 2.5 marks Hard

Question: Is pp greater than qq?

Statement-1: p×qp \times q is greater than zero.

Statement-2: p2p^{2} is greater than q2q^{2}.

Which one of the following is correct in respect of the above Question and the Statements?

  1. A The Question can be answered by using one of the Statements alone, but cannot be answered using the other Statement alone
  2. B The Question can be answered by using either Statement alone
  3. C The Question can be answered by using both the Statements together, but cannot be answered using either Statement alone
  4. D The Question cannot be answered even by using both the Statements together Answer

Worked rationale

DS yes/no: hunt for one “yes” and one “no” case under each statement (and under both).

Statement-1 alone (pq>0pq > 0, same sign): p=3,q=1p>qp=3, q=1 \Rightarrow p > q (yes); p=1,q=3p<qp=1, q=3 \Rightarrow p < q (no). Both keep pq>0pq > 0. Insufficient.

Statement-2 alone (p2>q2p^2 > q^2, i.e. p>q|p| > |q|): p=3,q=1p=3, q=1 \Rightarrow yes; p=3,q=1p<qp=-3, q=1 \Rightarrow p < q, no. Insufficient.

Both together (pq>0pq > 0 and p>q|p| > |q|):

  • Both positive: p=3,q=1p=3, q=1pq>0pq>0, p>q|p|>|q|, and p>qp > q (yes).
  • Both negative: p=3,q=1p=-3, q=-1pq=3>0pq = 3 > 0, p2=9>1=q2p^2 = 9 > 1 = q^2, but p=3<1=qp = -3 < -1 = q (no).

A “yes” and a “no” survive both statements, so even together the answer is undecidable.

Answer: (d) The Question cannot be answered even by using both the Statements together.

Why the other options miss

  • A
    over-trusts a single statement: thinks p2>q2p^2 > q^2 alone settles p>qp > q, ignoring the sign ambiguity (pp could be the large negative).
  • B
    claims each statement is enough on its own: treats “same sign” or “bigger square” as fixing the order, missing both counterexamples.
  • C
    misses a case: combines to “both positive, p>qp>q|p|>|q| \Rightarrow p>q” but forgets the both-negative branch, where the order flips.

Specialist insight

The decisive case is both negative: pq>0pq > 0 and p>q|p| > |q| then force pp to be more negative, so p<qp < q — the exact opposite of the both-positive conclusion. DS discipline is to always test the negative branch when only signs and squares are given; the “yes/no” pair (p=3,q=1p=3,q=1 vs p=3,q=1p=-3,q=-1) breaks sufficiency even with both statements, giving (d).

The trap, in one line

Both-negative case (p=3,q=1p=-3,q=-1) satisfies pq>0pq>0 and p2>q2p^2>q^2 yet p<qp<q, so even together it's undecidable == (d).

← All 2023 CSAT questions