Students often understand the mathematics in a TMUA logic question but reverse the relationship being claimed. The solution is not to memorise isolated phrases. It is to identify the hypothesis, identify the conclusion and ask exactly which direction has been justified.

Use the current specification The official UAT-UK preparation page contains the current TMUA specification and Notes on Mathematics and Logic. Those documents should be the reference point for what may be assessed.

Implication: one direction only

The statement “if P, then Q” means that every situation in which P is true must also make Q true. It does not say what happens when P is false, and it does not automatically mean that Q can only occur when P occurs.

For example, if an integer is divisible by 4, then it is even. This is true. The reverse statement—if an integer is even, then it is divisible by 4—is false, as the counterexample 6 shows.

Converse and contrapositive

Starting from “if P, then Q”:

  • The converse is “if Q, then P”. It may be true or false independently.
  • The contrapositive is “if not Q, then not P”. It is logically equivalent to the original statement.

Using divisibility again, the contrapositive says: if an integer is not even, then it is not divisible by 4. This must be true because the original implication is true.

Necessary and sufficient conditions

If P implies Q, then P is sufficient for Q: knowing P is enough to guarantee Q. In the same implication, Q is necessary for P: P cannot occur without Q.

Sufficient P is sufficient for Q means P → Q.
Necessary P is necessary for Q means Q → P.
Necessary and sufficient Both directions hold: P → Q and Q → P.
Quick safeguard Write the arrow before judging the statement.

A common error is to let the grammar determine the arrow by instinct. Instead, test the meaning: if the condition is known, what is guaranteed?

Disproving a universal claim

A statement claiming that something happens for every permitted value can be disproved by one valid counterexample. The counterexample must satisfy all the conditions in the question and fail the conclusion.

Suppose someone claims: “For every real number x, if x² > 4 then x > 2.” Taking x = −3 satisfies x² > 4 but not x > 2, so the claim is false. Testing only positive values would hide the problem.

Read quantifiers literally

  • “For every x” requires the statement to work throughout the stated domain.
  • “There exists an x” requires at least one example.
  • Negating “every x has property A” gives “there exists an x without property A”.
  • Negating “there exists an x with property A” gives “every x lacks property A”.

Always note the domain. A statement can be true for positive integers and false for all integers, or true for real numbers and meaningless in a more restricted setting.

Match the proof method to the claim

A direct implication invites a direct proof or its contrapositive. A universal claim that looks doubtful invites a search for a counterexample. A statement about all positive integers may suggest induction, while a divisibility claim may be clearer after factorisation or separation into cases.

Before calculating, write one sentence describing what must be shown. This prevents a correct piece of algebra from being used to prove the converse of the required result.

A productive practice routine

  1. Replace the wording with P and Q.
  2. Draw the implication arrow in the correct direction.
  3. Write the converse and contrapositive separately.
  4. Search for edge cases: zero, negative values, equality and repeated roots.
  5. After answering, state why each rejected option fails.
One sentence worth remembering An implication promises what happens when its hypothesis is true; it makes no promise when the hypothesis is false.

This independent guide uses public information and Arij's teaching and assessment experience. It is not endorsed by UAT-UK, Pearson VUE or any university and does not use confidential assessment material.