The change-of-base formula
Statement
For valid bases , , and , .
Why is it true?
Calculators and computers only implement a logarithm in one or two fixed bases; this formula lets any base be computed from those, by expressing "how many times to multiply by " in terms of "how many times to multiply by ".
Proof sketch
Let . By definition of logarithm, this means .
By definition of logarithm again (applied to base this time), itself can be written as . Substitute this into : using the power-of-a-power rule .
Take of both sides. By definition, means exactly (the same injectivity fact used in the product-law proof guarantees this step is valid, not just "plausible").
Since we have (because ), so we may divide both sides by : Recalling gives exactly .
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.