Co-primes
Two numbers are co-prime (relatively prime) when their HCF is 1 — they share no prime factor. They need not be prime themselves: 8 and 9 are co-prime, though neither is prime. Co-primality drives the rule φ(mn) = φ(m)φ(n) for co-prime m, n, and it is the condition that lets the Chinese Remainder Theorem combine moduli. Euler’s totient φ(N) counts how many integers from 1 to N are co-prime to N, using φ(N) = N × ∏(1 − 1/p) over the distinct primes p of N. For a prime, φ(p) = p − 1; for a prime power, φ(p^k) = p^k − p^(k−1). Twin primes are pairs of primes differing by 2 (11 and 13, 17 and 19); any two distinct primes are automatically co-prime. In CAT, totient turns up when counting fractions in lowest terms or numbers coprime to N in a range.
✅ Solved examples
✏️ Practice — try these, take hints as needed
📝 Topic test — 8 questions
Auto-graded with full solutions; saved to your dashboard. Use the calculator and formula sheet (top-right) any time.
Formula Reference Sheet
Primality & factorisation
| Primality test | N is prime if no prime ≤ √N divides N |
|---|---|
| Standard form | N = p₁^a × p₂^b × p₃^c × … |
| Number of factors | (a+1)(b+1)(c+1)… |
| Sum of factors | ∏ (p^(e+1) − 1)/(p − 1) |
| Product of factors | N^(d/2), d = number of factors |
Co-primes & totient
| Euler’s totient | φ(N) = N × ∏ (1 − 1/p) |
|---|---|
| φ of a prime | φ(p) = p − 1 |
| φ of prime power | φ(p^k) = p^k − p^(k−1) |
| Co-prime test | a, b co-prime ⇔ HCF(a, b) = 1 |
| Multiplicativity | φ(mn) = φ(m)φ(n) if HCF(m, n) = 1 |