Loading…
Loading…
Spec: PRF2 · No calculator · ~210s
Letters only — the answer key is hidden. Work it out, then check the solution below.
No written hint yet — check the trope: modulus-two-cases, missing-sign-case. Name the trap first, work the stem by hand, then open the solution below.
Same topic · same level
TMUA-P2-PRF2-003
Prove: for every integer n, the remainder of n^2 on division by 4 is 0 or 1. Which case argument is valid?
Proof by cases
Same trap: modulus-two-cases
TMUA-P1-MM1-014
Find the sum of all real solutions of |3x - 4| = 11.
Algebra and functions
Step up a 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