Skip to content
Technique

A chain links two letters only if every sign between them points the same way

Logical Reasoning • Inequality Chains

Statement

Follow the chain from one letter to the other. If every sign between them is , or , the first is at least the second, and strictly greater when at least one sign is . If every sign is , they are equal. If the signs point both ways, as in , nothing definite follows.

How to use it

  1. 1Find the two letters and read only the signs between them.
  2. 2If the signs mix > and <, the relation cannot be decided.
  3. 3If they all face one way, the relation is strict () when any sign is strict, and only when every sign is or .
  4. 4A claim that one is always greater fails when the path has no strict sign, since the two can then be equal.

Worked example

If , is always greater than ?

Step-by-step

  1. 1
    Signs from to : , , . All face one way.
  2. 2
    One of them, , is strict, so always.

    Why: A strict step anywhere on a one-way path makes the whole link strict.

Answer

Yes.

Watch out

Reading as , and so claiming 'always greater' when the two can be equal, is the trap. So is drawing a conclusion across a reversed sign.

Also known as

coded inequality, inequality statements, chain of inequalities

Appears in past papers

2025

2024

2023

2018

2016