NDA Maths · Logarithms
Solving Logarithmic Equations & Applications
Solving a log equation means turning it into an algebraic one — take the log of an exponential equation, substitute t = aˣ to reach a quadratic, then reject any root that breaks a domain.
Why this matters
Eleven PYQs, three of them HARD — this is where the chapter's difficulty concentrates. The recurring moves are few: collapse both sides to a single log and drop the log, substitute t = aˣ to get a quadratic, or take log₁₀ of an exponential equation. The HARD ones add a twist — a GP/chain-rule condition or an AM-GM bound — but the spine is always the same. Domain-checking is what separates a 4-mark answer from a wrong one.
Concept 1 of 5: Taking the Log of an Exponential Equation
Definition
Core move: (any common base). Two flavours appear:
- Numeric: given , evaluate from by writing .
- Collapse-to-1: expressions built from and simplify because . Group terms to expose a .
Bring the exponent down with a log
Worked example
Practice this conceptself-check
The same idea in a real exam question:
Example 1 · Logarithms · Solving Logarithmic Equations and Applications
, which is negative
Concept 2 of 5: Substitution t = aˣ to a Quadratic
Definition
Recipe:
- Collapse to one log on each side using the laws, then equate arguments (since ).
- Substitute (so ). The equation becomes a quadratic .
- Solve and screen: factorise () or use , then reject any root — an exponential can never be or negative. From the surviving , recover .
An AP condition on three logs, , feeds straight into this: square out to , a quadratic in .
Let t = aˣ and solve the quadratic (keep t > 0)
Worked example
Practice this conceptself-check
The same idea in a real exam question:
Example 2 · Logarithms · Solving Logarithmic Equations and Applications
Throw out the non-positive t
Concept 3 of 5: Domain Checks & Counting Solutions
Definition
Procedure for "how many solutions?":
- Unify the base: , so becomes .
- Solve the resulting polynomial, then impose the domain: every original argument must be (here AND , so ).
- Inequalities: for , take of both sides to get , then gives or .
Keep only roots with every argument > 0
Worked example
The same idea in a real exam question:
Example 3 · Logarithms · Solving Logarithmic Equations and Applications
An algebraic root is not a solution until the domain clears it
The argument must be strictly positive — is not allowed
Concept 4 of 5: GP, Chain-Rule & AM-GM Conditions
Definition
Two HARD patterns:
- GP of logs: in GP means . The product collapses by the chain rule , giving ; take to solve for .
- AM-GM bound: writing with gives . Since (AM-GM), the expression is — so it can never equal any positive value.
Chain rule and the AM-GM floor
Worked example
The same idea in a real exam question:
Example 4 · Logarithms · Solving Logarithmic Equations and Applications
The GP condition squares the MIDDLE term
Concept 5 of 5: Application — Trailing Zeros of a Factorial
Definition
Legendre's count (for the prime ):
Legendre — trailing zeros count the 5s
Worked example
Practice this concept2 quick reps
The same idea in a real exam question:
Example 5 · Logarithms · Solving Logarithmic Equations and Applications
Count the 5s, not the 2s — and don't forget 25, 125…
Summary — formulas & gotchas at a glance
A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.
Formulas (5)
- Taking the Log of an Exponential Equation
Bring the exponent down with a log
- Substitution t = aˣ to a Quadratic
Let t = aˣ and solve the quadratic (keep t > 0)
- Domain Checks & Counting Solutions
Keep only roots with every argument > 0
- GP, Chain-Rule & AM-GM Conditions
Chain rule and the AM-GM floor
- Application — Trailing Zeros of a Factorial
Legendre — trailing zeros count the 5s
Watch out for (6)
- , which is negative→ Taking the Log of an Exponential Equation
- Throw out the non-positive t→ Substitution t = aˣ to a Quadratic
- An algebraic root is not a solution until the domain clears it→ Domain Checks & Counting Solutions
- The argument must be strictly positive — is not allowed→ Domain Checks & Counting Solutions
- The GP condition squares the MIDDLE term→ GP, Chain-Rule & AM-GM Conditions
- Count the 5s, not the 2s — and don't forget 25, 125…→ Application — Trailing Zeros of a Factorial
Test yourself on Logarithms
10 past NDA questions from this chapter, timed at 13 minutes and marked the way the exam marks it. You see your score and every answer the moment you finish. Free to start.