Loading…
Loading…
Spec: PRF1 · No calculator · ~180s
Letters only — the answer key is hidden. Work it out, then check the solution below.
No written hint yet — check the trope: direct-proof. Name the trap first, work the stem by hand, then open the solution below.
Same topic · same level
TMUA-P2-PRF1-003
To prove directly that if integers a | b and b | c then a | c, a student writes: b = as and c = bt for integers s, t, so…
Direct proof
Same trap: direct-proof
TMUA-P2-PRF1-007
A student proves directly that if n is odd then n^2 is odd. Which of the following is a valid direct proof?
Direct proof
Step up a level
TMUA-P2-PRF1-006
A competition proof claims that for every integer n, the number n^3 - n is divisible by 6, arguing as follows: factorise…
Direct proof