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: proof-direction-reversed. Name the trap first, work the stem by hand, then open the solution below.
Same topic · same level
TMUA-P2-PRF1-004
A student proves: if n is odd then n^2 - 1 is divisible by 8. Proof: write n = 2k + 1; then n^2 - 1 = 4k(k+1); since one…
Direct proof
Same trap: proof-direction-reversed
TMUA-P2-ARG1-004
Let P and Q be statements. The claim “ P if and only if Q ” (written P iff Q ) asserts which of the following?
Statements and connectives
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