Loading…
Loading…
Spec: PRF2 · No calculator · ~270s
Letters only — the answer key is hidden. Work it out, then check the solution below.
No written hint yet — check the trope: case-split-modulus, sign-case-omission. Name the trap first, work the stem by hand, then open the solution below.
Same topic · same level
TMUA-P2-PRF2-006
A lecturer proves that n^3 - n is divisible by 3 for every integer n by splitting into remainders modulo 3, writing n =…
Proof by cases
Same trap: case-split-modulus
TMUA-P2-PRF2-007
To solve |x-3|=5 by cases, which split is complete and correct?
Proof by cases
More in this topic
TMUA-P2-PRF2-014
Solve |x-1|+|x-3|=4.
Proof by cases