Loading…
Loading…
Spec: PRF1 · No calculator · ~190s
Letters only — the answer key is hidden. Work it out, then check the solution below.
No written hint yet — check the trope: assumes-what-proves. 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: assumes-what-proves
TMUA-P2-ERR1-008
A “proof” that the sum of two odds is odd reads: (1) Assume odd m, n with m + n odd. (2) Write m = 2j+1, n = 2k+1. (3) T…
Identifying errors in proofs
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