Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

unit modulo n

An integer $a$ with $1 \le a < n$ that has a multiplicative inverse mod $n$ -- equivalently, $\gcd(a,n)=1$ .

Examples

$3$ is a unit mod $8$ since $\gcd(3,8)=1$ ; $2$ is not, since $\gcd(2,8)=2$ .