PYQ Vault

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.

Test yourself — a quick 15-question Logarithms recall quiz, instant score.

Concept 1 of 5: Taking the Log of an Exponential Equation

When the unknown sits in an exponent — ax=ba^x = b — apply a log to both sides to bring the exponent down: xlog⁡a=log⁡bx\log a = \log b. With a supplied value of log⁡102\log_{10} 2 you can then compute a decimal, or you can just collapse log expressions of the form k f(⋅)k\,f(\cdot) until they reduce to log⁡10=1\log 10 = 1.

Definition

Core move: ax=b⇒x=log⁡blog⁡aa^x = b \Rightarrow x = \dfrac{\log b}{\log a} (any common base). Two flavours appear:

  • Numeric: given log⁡102\log_{10} 2, evaluate xx from (0.2)x=2(0.2)^x = 2 by writing log⁡100.2=log⁡10210=log⁡102−1\log_{10} 0.2 = \log_{10}\tfrac{2}{10} = \log_{10} 2 - 1.
  • Collapse-to-1: expressions built from log⁡102\log_{10} 2 and log⁡105\log_{10} 5 simplify because log⁡102+log⁡105=log⁡1010=1\log_{10} 2 + \log_{10} 5 = \log_{10} 10 = 1. Group terms to expose a log⁡10(product=10k)\log_{10}(\text{product} = 10^k).

Bring the exponent down with a log

ax=b  ⇒  x=log⁡blog⁡aa^x = b \;\Rightarrow\; x = \dfrac{\log b}{\log a}

Worked example

If 3x=53^x = 5 and log⁡103=0.477, log⁡105=0.699\log_{10} 3 = 0.477,\ \log_{10} 5 = 0.699, find xx to two decimals.
Practice this conceptself-check

The same idea in a real exam question:

NDA · Sep 2018 · Q31Moderate

Example 1 · Logarithms · Solving Logarithmic Equations and Applications

If (0.2)x=2(0.2)^x = 2 and log⁡102=0.3010\log_{10} 2 = 0.3010, then what is the value of x to the nearest tenth?

log⁡100.2=log⁡102−1\log_{10} 0.2 = \log_{10} 2 - 1, which is negative

Writing 0.2=2100.2 = \tfrac{2}{10} gives log⁡100.2=log⁡102−log⁡1010=0.3010−1=−0.6990\log_{10} 0.2 = \log_{10} 2 - \log_{10} 10 = 0.3010 - 1 = -0.6990. Dropping the −1-1 flips the sign of xx — the answer to (0.2)x=2(0.2)^x = 2 is negative.

Concept 2 of 5: Substitution t = aˣ to a Quadratic

When a log equation mixes 2x2^x and 22x2^{2x} (or 3x3^x and 9x9^x), collapse both sides to a single log, drop the log, then let t=2xt = 2^x. The relation becomes a quadratic in tt; solve it and discard any non-positive tt, because 2x2^x is always positive.

Definition

Recipe:

  • Collapse to one log on each side using the laws, then equate arguments (since log⁡aM=log⁡aN⇒M=N\log_a M = \log_a N \Rightarrow M = N).
  • Substitute t=axt = a^x (so a2x=t2a^{2x} = t^2). The equation becomes a quadratic t2+bt+c=0t^2 + bt + c = 0.
  • Solve and screen: factorise (t2−5t+4=(t−1)(t−4)t^2-5t+4=(t-1)(t-4)) or use t=−b±b2−4c2t=\dfrac{-b\pm\sqrt{b^2-4c}}{2}, then reject any root t≤0t \le 0 — an exponential axa^x can never be 00 or negative. From the surviving tt, recover x=log⁡atx = \log_a t.

An AP condition on three logs, 2log⁡(2x−1)=log⁡2+log⁡(2x+3)2\log(2^x-1) = \log 2 + \log(2^x+3), feeds straight into this: square out to (2x−1)2=2(2x+3)(2^x-1)^2 = 2(2^x+3), a quadratic in t=2xt = 2^x.

Let t = aˣ and solve the quadratic (keep t > 0)

t=ax>0,t2+bt+c=0  ⇒  x=log⁡att = a^x > 0,\quad t^2 + bt + c = 0 \;\Rightarrow\; x = \log_a t

Worked example

Solve 4x−3⋅2x−4=04^x - 3\cdot 2^x - 4 = 0.
Practice this conceptself-check

The same idea in a real exam question:

NDA · Sep 2017 · Q1Moderate

Example 2 · Logarithms · Solving Logarithmic Equations and Applications

If x+log⁡10(1+2x)=xlog⁡105+log⁡106x + \log_{10}(1 + 2^x) = x\log_{10} 5 + \log_{10} 6, then xx is equal to

Throw out the non-positive t

A quadratic in t=2xt = 2^x often hands you a negative root. Because 2x2^x is strictly positive, that root yields no real xx — keep only t>0t > 0 before solving x=log⁡2tx = \log_2 t.

Concept 3 of 5: Domain Checks & Counting Solutions

A log equation with two different bases (log⁡4\log_4 and log⁡2\log_2) is solved by bringing both to one base, but the algebra can hand you roots that make some argument non-positive. The genuine count of solutions is only the roots that survive the domain — argument >0>0 for every log in the original equation.

Definition

Procedure for "how many solutions?":

  • Unify the base: log⁡4(x−1)=12log⁡2(x−1)\log_4(x-1) = \tfrac{1}{2}\log_2(x-1), so log⁡4(x−1)=log⁡2(x−3)\log_4(x-1) = \log_2(x-3) becomes 12log⁡2(x−1)=log⁡2(x−3)⇒x−1=(x−3)2\tfrac12\log_2(x-1) = \log_2(x-3)\Rightarrow x-1 = (x-3)^2.
  • Solve the resulting polynomial, then impose the domain: every original argument must be >0>0 (here x−1>0x-1>0 AND x−3>0x-3>0, so x>3x>3).
  • Inequalities: for xlog⁡7x>7x^{\log_7 x} > 7, take log⁡7\log_7 of both sides to get (log⁡7x)2>1(\log_7 x)^2 > 1, then ∣log⁡7x∣>1|\log_7 x| > 1 gives x>7x > 7 or 0<x<170 < x < \tfrac17.

Keep only roots with every argument > 0

log⁡aM=log⁡aN⇒M=N, then require M,N>0\log_a M = \log_a N \Rightarrow M = N,\ \text{then require } M,N > 0

Worked example

How many solutions does log⁡9(x+6)=log⁡3x\log_9(x+6) = \log_3 x have?

The same idea in a real exam question:

NDA · Apr 2024 · Q27Moderate

Example 3 · Logarithms · Solving Logarithmic Equations and Applications

What is the number of solutions of log⁡4(x−1)=log⁡2(x−3)\log_4(x-1)=\log_2(x-3)?

An algebraic root is not a solution until the domain clears it

x−1=(x−3)2x-1 = (x-3)^2 gives x=2x = 2 and x=5x = 5, but x=2x = 2 makes x−3=−1<0x-3 = -1 < 0, so log⁡2(x−3)\log_2(x-3) is undefined. Only x=5x = 5 is a genuine solution — always re-substitute into the ORIGINAL equation.

The argument must be strictly positive — 00 is not allowed

log⁡ax\log_a x is undefined for x≤0x \le 0, and that includes x=0x = 0: there is no power of aa that gives 00. A root that makes ANY argument equal to 00 (not just negative) must be rejected — the domain requires every argument >0> 0, strictly.

Concept 4 of 5: GP, Chain-Rule & AM-GM Conditions

The HARD log questions wrap a sequence or inequality condition around the same tools. A GP condition multiplies the outer terms; the chain rule log⁡xa⋅log⁡bx=log⁡ba\log_x a\cdot\log_b x = \log_b a collapses the product; and a "kk can never equal" question is usually AM-GM, t+1t≥2t + \tfrac1t \ge 2, in disguise.

Definition

Two HARD patterns:

  • GP of logs: log⁡xa, ax, log⁡bx\log_x a,\ a^x,\ \log_b x in GP means (ax)2=log⁡xa⋅log⁡bx(a^x)^2 = \log_x a\cdot\log_b x. The product collapses by the chain rule log⁡xa⋅log⁡bx=log⁡ba\log_x a\cdot\log_b x = \log_b a, giving a2x=log⁡baa^{2x} = \log_b a; take log⁡a\log_a to solve for xx.
  • AM-GM bound: writing log⁡xxy+log⁡yyx\log_x\tfrac{x}{y} + \log_y\tfrac{y}{x} with t=log⁡xy≥1t = \log_x y \ge 1 gives 2−t−1t2 - t - \tfrac1t. Since t+1t≥2t + \tfrac1t \ge 2 (AM-GM), the expression is ≤0\le 0 — so it can never equal any positive value.

Chain rule and the AM-GM floor

log⁡xa⋅log⁡bx=log⁡ba,t+1t≥2 (t>0)\log_x a\cdot\log_b x = \log_b a, \qquad t + \tfrac{1}{t} \ge 2\ (t>0)

Worked example

Find the maximum value of 2−(t+1t)2 - \Big(t + \dfrac{1}{t}\Big) for t>0t > 0.

The same idea in a real exam question:

NDA · Apr 2024 · Q28Hard

Example 4 · Logarithms · Solving Logarithmic Equations and Applications

For x≥y>1x\geq y>1, let log⁡x ⁣xy+log⁡y ⁣yx=k\log_x\!\dfrac{x}{y}+\log_y\!\dfrac{y}{x}=k, then the value of kk can never be equal to

The GP condition squares the MIDDLE term

For p,q,rp, q, r in GP the relation is q2=prq^2 = pr — the middle term is squared and set equal to the product of the outer two. Squaring the wrong term derails the whole chain-rule collapse.

Concept 5 of 5: Application — Trailing Zeros of a Factorial

The number of trailing zeros of n!n! is set by how many times 10=2×510 = 2\times 5 divides it — and since factors of 55 are scarcer than factors of 22, you just count the 55s. This is the chapter's one number-theory application that rides on the same "count the powers" instinct logs train.

Definition

Legendre's count (for the prime 55):

Z(n)=⌊n5⌋+⌊n25⌋+⌊n125⌋+⋯Z(n) = \left\lfloor\dfrac{n}{5}\right\rfloor + \left\lfloor\dfrac{n}{25}\right\rfloor + \left\lfloor\dfrac{n}{125}\right\rfloor + \cdots
gives the number of trailing zeros of n!n! (the power of 55 in n!n!; the power of 22 is always larger, so 55 is the bottleneck). To find how many nn give exactly zz zeros, note Z(n)Z(n) is non-decreasing and jumps at multiples of 55: a run of consecutive integers shares the same ZZ value until the next multiple of 55.

Legendre — trailing zeros count the 5s

Z(n)=∑i≥1⌊n5i⌋Z(n) = \sum_{i\ge 1}\left\lfloor \dfrac{n}{5^i} \right\rfloor

Worked example

How many trailing zeros does 30!30! have?
Practice this concept2 quick reps

The same idea in a real exam question:

NDA · Sep 2025 · Q4Moderate

Example 5 · Logarithms · Solving Logarithmic Equations and Applications

Let nn be a natural number. The number of consecutive zeros at the end of the expansion of n!n! is exactly 2. How many values of nn are possible?

Count the 5s, not the 2s — and don't forget 25, 125…

Each multiple of 2525 contributes an EXTRA 55 beyond the one already counted by ⌊n/5⌋\lfloor n/5\rfloor. Stopping at ⌊n/5⌋\lfloor n/5\rfloor undercounts for n≥25n \ge 25.

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

    ax=b  ⇒  x=log⁡blog⁡aa^x = b \;\Rightarrow\; x = \dfrac{\log b}{\log a}
  • Substitution t = aˣ to a Quadratic

    Let t = aˣ and solve the quadratic (keep t > 0)

    t=ax>0,t2+bt+c=0  ⇒  x=log⁡att = a^x > 0,\quad t^2 + bt + c = 0 \;\Rightarrow\; x = \log_a t
  • Domain Checks & Counting Solutions

    Keep only roots with every argument > 0

    log⁡aM=log⁡aN⇒M=N, then require M,N>0\log_a M = \log_a N \Rightarrow M = N,\ \text{then require } M,N > 0
  • GP, Chain-Rule & AM-GM Conditions

    Chain rule and the AM-GM floor

    log⁡xa⋅log⁡bx=log⁡ba,t+1t≥2 (t>0)\log_x a\cdot\log_b x = \log_b a, \qquad t + \tfrac{1}{t} \ge 2\ (t>0)
  • Application — Trailing Zeros of a Factorial

    Legendre — trailing zeros count the 5s

    Z(n)=∑i≥1⌊n5i⌋Z(n) = \sum_{i\ge 1}\left\lfloor \dfrac{n}{5^i} \right\rfloor

Watch out for (6)

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.