CSAT Solved Papers/ 2025/Q50

2025 CSAT — Q50

Quant Statement validity 2.5 marks Hard

Three teams P,Q,RP, Q, R participated in a tournament in which the teams play with one another exactly once. A win fetches a team 22 points and a draw 11 point. A team gets no point for a loss. Each team scored exactly one goal in the tournament. The team PP got 33 points, QQ got 22 points and RR got 11 point. Which of the following statements is/are correct?

I. The result of the match between PP and QQ is a draw with the score 000 - 0.

II. The number of goals scored by RR against QQ is 11.

  1. A I only
  2. B II only
  3. C Both I and II Answer
  4. D Neither I nor II

Worked rationale

There are 33 matches (PPQQ, PPRR, QQRR); each match awards 22 points total, so points sum to 6=3+2+16 = 3+2+1 ✓. Decode the points table.

Points ⇒ results. P=3P=3 over two matches forces one win ++ one draw (2+12+1; no other split). R=1R=1 forces one draw ++ one loss (1+01+0). Q=2Q=2 is either two draws or one win ++ one loss. The points table alone admits two result sets:

  • (A) PPQQ draw, PP beat RR, QQRR draw — check: P=2+1=3P=2{+}1=3, Q=1+1=2Q=1{+}1=2, R=0+1=1R=0{+}1=1 ✓.
  • (B) PP beat QQ, PPRR draw, QQ beat RR — check: P=2+1=3P=2{+}1=3, Q=0+2=2Q=0{+}2=2, R=1+0=1R=1{+}0=1 ✓.

The goal constraint then eliminates (B): under (B), PP won vs QQ so (as PP scored only 11 goal total) PPQQ is 1100 and the PPRR draw is 0000; QQ won vs RR scoring 1\ge1 there but QQ scored 00 vs PP, so QQ‘s goal is vs RR, forcing RR to score 00 vs QQ; but then RR‘s total is 00 (draw vs PP at 0000) +0=01+\,0 = 0 \ne 1 — contradiction. So only set (A) survives:

PQ: draw,P beat R,QR: draw.P\text{–}Q:\ \text{draw},\qquad P\text{ beat }R,\qquad Q\text{–}R:\ \text{draw}.

Goal accounting. Each team scored exactly 11 goal in total (across its two matches). Let the PPQQ draw be d ⁣ ⁣dd\!-\!d and the QQRR draw be e ⁣ ⁣ee\!-\!e (draws are level). PP won PPRR, so PP‘s goals there >R> R‘s.

  • PP total: d+(P’s goals vs R)=1d + (P\text{'s goals vs }R) = 1. Since PP won, PP‘s goals vs R1R \ge 1, forcing d=0d = 0 and PP scored 11 vs RR. So PPQQ is 0000 — Statement I is TRUE.
  • QQ total: d+e=0+e=1e=1d + e = 0 + e = 1 \Rightarrow e = 1.
  • RR total: (R’s goals vs P)+e=1(R\text{'s goals vs }P) + e = 1. As PP won 1100, RR‘s goals vs P=0P = 0, consistent with e=1e=1.

So the QQRR draw is 1111: RR scored e=1e = 1 goal against QQ — Statement II is TRUE.

Answer: (c) Both I and II.

Why the other options miss

  • A
    stops one deduction short: nails the 0000 draw but stops before the goal total forces the QQRR draw to be 1111, missing II.
  • B
    reasons the goal totals but never deduces that the PPQQ draw must be scoreless, missing I.
  • D
    stops at the points table (which alone leaves two result sets) and declares the scenario under-determined, never applying the goal-total constraint that eliminates set (B) and pins both scorelines.

Specialist insight

This is a two-layer deduction: the points table alone narrows the results to two sets (3 = win+draw, 1 = draw+loss), and the “exactly one goal each” constraint then both eliminates one result set and pins the scorelines. The decisive insight is that PP won a match yet scored only one goal in the whole tournament — so that win is 1100 and its draw must be 0000, which cascades to make the QQRR draw 1111. Treat the points and the goal-totals as two separate accounting books that must both balance; that is exactly the structured reasoning CSAT rewards here.

The trap, in one line

Points leave two result sets; "one goal each" eliminates one and forces PP's win to be 1100, the PPQQ draw 0000, and the QQRR draw 1111 — so both I and II hold.

← All 2025 CSAT questions