Change of Base
When a problem mixes logs of different bases — say log_2 7 and log_3 7 — you cannot combine them until they share a base. The change-of-base rule fixes this: log_b a = (log_c a)/(log_c b) for any valid base c. Pick c = 10 or whatever simplifies the numbers. Two consequences are CAT favourites. First, the reciprocal rule: log_b a · log_a b = 1, so log_b a = 1/log_a b — flipping a log inverts its base and argument. Second, telescoping chains: log_2 3 · log_3 4 · log_4 5 · … · log_(n−1) n collapses to log_2 n, because each fraction cancels with the next. Also remember the base-power rule log_(b^m)(a^n) = (n/m)·log_b a, which lets you slide powers between the base and the argument. Spotting these collapses turns a scary product of logs into a one-line answer.
✅ 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
The three laws
| Definition | log_b N = x ⇔ b^x = N (b > 0, b ≠ 1, N > 0) |
|---|---|
| Product law | log_b(MN) = log_b M + log_b N |
| Quotient law | log_b(M/N) = log_b M − log_b N |
| Power law | log_b(M^n) = n · log_b M |
| Log of base / of 1 | log_b b = 1, log_b 1 = 0 |
CAT power-tools
| Change of base | log_b a = (log a)/(log b) = (log_c a)/(log_c b) |
|---|---|
| Reciprocal rule | log_b a · log_a b = 1, i.e. log_b a = 1/log_a b |
| Base-power rule | log_(b^m)(a^n) = (n/m) · log_b a |
| Identity | b^(log_b N) = N and a^(log_b c) = c^(log_b a) |
| Digit count of N (base 10) | digits = ⌊log_10 N⌋ + 1 |