Machine-translated by Google. Questions are authored in English.
Top

Discussion

STATEMENT :

P > J ≥ V = D > L ≤ C

CONCLUSION I : P > C

CONCLUSION II : D ≥ C

CONCLUSION III : L < P

CONCLUSION IV : J > L

  • A.None is true
  • B.Only I and II are true
  • C.Only IV is true
  • D.Only III and IV are true
  • E.Only II is true

Answer: D

Correct answer: Only III and IV are true

The chain is \[ P > J \ge V = D > L \le C. \] It descends steadily from P to L and then turns upward again at L, so L is the low point and C is cut off from everything to its left.

I. \( P > C \): C is reached only through the reversal at L, so nothing fixes it against P. Not determined.

II. \( D \ge C \): the same break, one link nearer. Not determined.

III. \( L < P \): the whole run \( P > J \ge V = D > L \) points one way and contains strict links, so \( P > L \). True.

IV. \( J > L \): the same run, started one element later - \( J \ge V = D > L \) - still with a strict link in it. True.

III and IV hold and the two conclusions involving C do not.

Two rules settle every question of this kind. A conclusion follows only when an unbroken chain of links runs between its two elements all pointing the same way; and the chain is strict if it contains at least one strict link, weak if every link is weak.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.