By the end of this chapter you'll be able to…

  • 1Use the coefficient-ratio test to classify a linear system as unique, infinite or no-solution
  • 2Apply sum and product of roots, and build a quadratic directly from stated root conditions
  • 3Resolve a common-root question between two quadratics by checking each candidate root
  • 4Solve polynomial inequalities with the wavy-curve method and modulus equations by casing on sign
  • 5Compose functions correctly and recognise a self-inverse composition pattern
  • 6Apply logarithm rules, especially the digit-count shortcut, and change of base
  • 7Solve AP/GP term and sum questions, and apply AM-GM to minimum/maximum questions
💡
Why this chapter matters in CAT
Algebra spans linear and simultaneous equations, quadratics, inequalities and modulus, functions, logarithms, and progressions, and nearly every hard question in this topic is a standard structure wearing an unfamiliar disguise — a quadratic dressed as a word problem, an inequality dressed as a range question, a progression dressed as a pattern. The genuine skill is recognising which standard tool applies fastest: sum/product of roots instead of the quadratic formula, the wavy-curve method instead of testing points at random, and AM-GM instead of calculus for a minimum-value question.

Before you start — revise these

🔗
Fluent algebraic manipulation of linear and quadratic expressions
This chapter assumes comfort with factoring and expanding; it does not re-teach these from scratch.
🔗
Arithmetic
The percentage and ratio habits from Arithmetic recur throughout Algebra's word problems.
🔗
Basic set and interval notation
Inequality solutions are expressed as intervals, which this chapter assumes you can read and write.

Algebra — CAT Quantitative Ability

Algebra is CAT's second-largest Quantitative Ability topic, spanning linear and simultaneous equations, quadratics, inequalities and modulus, functions, logarithms, and arithmetic and geometric progressions. Nearly every hard Algebra question is a standard structure wearing an unfamiliar disguise — a quadratic dressed as a word problem, an inequality dressed as a "find the range" question, a progression dressed as a pattern-recognition puzzle. Spotting the disguise is the skill; the algebra underneath is usually short.

1. Linear and simultaneous equations

Two linear equations in two unknowns, and , have a unique solution unless their coefficient ratios line up:

A question that asks "for what value of does this system have infinitely many solutions" is testing exactly this ratio condition, not elimination. Elimination or substitution only applies once you've confirmed a unique solution exists; setting up the ratio test first is faster than attempting to solve and discovering the system is inconsistent.

CAT rarely poses a bare two-variable system — it is usually buried inside an age problem ("A is twice as old as B was five years ago"), a cost problem ("2 pens and 3 pencils cost ₹18; 3 pens and 2 pencils cost ₹17") or a mixture problem.

The translation step — naming two unknowns and writing exactly two independent equations from the words — is the actual difficulty, since the algebra that follows is routine elimination. A system with three unknowns needs three independent equations; a common trap is writing three equations that are not actually independent (one is a combination of the other two), which leaves the system under-determined despite looking complete.

2. Quadratic equations

For , the roots satisfy two relationships that are usually faster than the quadratic formula itself:

The discriminant decides the nature of the roots: gives two distinct real roots, gives equal real roots, and gives a complex conjugate pair — no real roots.

This lets a question be answered without solving the quadratic at all. "For what values of does have real roots?" only needs : — the boundary case gives the equal-roots quadratic , and every opens up two genuinely distinct roots, which is a strictly weaker condition than the question asks for and is worth double-checking whenever a stem says "real and distinct" rather than merely "real."

A quadratic can be built directly from its roots without ever forming first: . This is the fast route whenever a question states two conditions on the roots rather than the coefficients.

Two quadratics sharing a common root is a distinct and recurring CAT pattern. The common root must satisfy both equations simultaneously, so substitute each equation's own roots into the other equation and check which one fits — there can be more than one value of an unknown parameter that works, corresponding to different choices of which root is shared.

Questions about a symmetric expression in the roots — , , or — never need the individual roots at all. Every symmetric expression can be rewritten purely in terms of the sum and product : for instance , and . Solving for the roots individually and then combining them is always slower and invites an avoidable arithmetic slip.

Quadratics also arise from word problems disguised as rate or dimension questions — "a rectangle's length exceeds its breadth by 3 cm and its area is 70 cm², find its dimensions" sets up , i.e. , factoring to ; only the positive root is physically meaningful, which is why a quadratic word problem's two algebraic roots are not automatically its two possible answers.

3. Inequalities and modulus

Polynomial inequalities are solved with the wavy-curve (sign-chart) method, not by inspection. Mark every root of the numerator and denominator on a number line, then track the sign of the expression across each interval, remembering that the sign flips at every root of odd multiplicity and does not flip at a root of even multiplicity. Points where the denominator is zero are always excluded, even when the inequality is non-strict.

A modulus equation is solved by casing on the sign of the expression inside the bars, not by squaring both sides indiscriminately — squaring works but often introduces extra terms that must be checked against the original equation's implicit sign conditions, which is exactly why every modulus solution must be verified by substitution back into the original equation.

A quadratic inequality such as factors to , which is the wavy-curve method with only two critical points: the expression is negative exactly between the roots, so the solution is .

The general rule for a quadratic that opens upward () is that it is negative strictly between its two real roots and positive outside them — a fact worth stating explicitly, because it is the special case of the wavy-curve method candidates reach for automatically, while the version with three or more factors (as in Example 3 below) is where most errors occur.

4. Functions and composition

A function's domain is the set of inputs for which it is defined, and its range is the resulting set of outputs. Composition is not commutative: and are generally different functions, computed by working from the innermost function outward.

A small number of functions are their own inverse under repeated composition, and recognising one saves an entire computation. If , then computing directly gives — a clean simplification rather than a messier nested fraction, and evaluating becomes trivial once this pattern is seen, since applying four times returns to itself.

An odd function satisfies and an even function satisfies ; a periodic function repeats its values at a fixed interval. All three properties are usually stated in a stem to shortcut a computation that would otherwise require evaluating the function at an inconvenient point.

Domain restrictions are frequently the entire question in disguise. A rational function excludes every for which ; a square root requires ; and a logarithm requires a strictly positive argument. A question that looks like it needs the wavy-curve method on an inequality is sometimes actually asking only for the domain of a function containing a square root or a denominator — read what is actually being asked before reaching for machinery.

A functional equation states a relationship a function must satisfy for all inputs, rather than giving its formula directly — for instance for all real forces to be (or behave like) an exponential function, since only satisfies that multiplicative-to-additive conversion. Recognising the standard functional-equation families (additive, multiplicative, and the self-inverse pattern of Example 5 below) is faster than trying to solve a functional equation from scratch under time pressure.

5. Logarithms

The number of digits in is — the single most-tested logarithm application on CAT, since it converts an unwieldy power into one multiplication and a floor function. Finding the number of digits in , given , needs only , floor to , plus , giving digits — never requiring the actual 20-digit number to be computed.

Trap. is defined only for and . A logarithmic inequality like flips direction if , exactly like multiplying an inequality by a negative number — a fact many candidates forget because logarithms "feel" monotonic in only one direction.

The digit-counting trick generalises into two related ideas worth keeping separate. alone is called the characteristic of , and it is exactly one less than the number of digits in for any ; the fractional part (the mantissa) determines the leading digits but is not needed for a pure digit-count question.

Confusing "number of digits" with "the characteristic itself" (forgetting the ) is the single most common slip on this topic, and it is worth a dedicated final check on every digit-count answer.

6. Arithmetic and geometric progressions

An AP question that gives two specific terms is really giving two linear equations in and — write both term equations, subtract to eliminate first, and the remaining term follows in one more step.

The infinite sum of a GP exists only when , and applying the formula outside that range silently produces a meaningless number rather than an error, so checking before using is not optional.

The AM-GM inequality is CAT's most useful non-progression optimisation tool, and it appears constantly inside algebra questions asking for a minimum or maximum:

For an expression like with , AM-GM gives a minimum of , attained exactly when , i.e. — a one-line answer to a question that calculus would also solve, but far more slowly under exam time pressure.

A harmonic progression (HP) is simply a sequence whose reciprocals form an AP, so any HP question is solved by inverting every term, solving it as an AP, and inverting the answer back at the end — there is no separate HP formula worth memorising beyond this one translation. The three means relate by a fixed, always-true inequality for positive numbers:

with equality throughout exactly when all the numbers are equal. This chain is what justifies the AM-GM shortcut used above, and it is also the fastest way to bound a quantity when a question gives an average (AM) and asks for a bound on a product (related to GM) or a rate (related to HM), without setting up the full optimisation from scratch.

Worked Examples

Example 1 (linear equations — easy). For what value of does the system and have infinitely many solutions?

The ratio condition requires . Since , we need .

Example 2 (quadratic — common root, hard). The equations and have a common root. Find all possible values of .

The roots of the first equation are and . If the common root is : substituting into the second equation gives . If the common root is : . Both are valid, giving (shared root ) or (shared root ) — a question asking for "the value of " in the singular is testing whether a candidate checks both roots rather than stopping at the first.

Example 3 (inequality, wavy curve — hard). Solve .

Mark the critical points on a number line ( excluded, since the expression is undefined there). Testing one point in each interval shows the expression is negative for , positive for , negative for , and positive for . Including the zeros of the numerator (, where the expression equals zero and the inequality is non-strict) and excluding : the solution is .

Example 4 (modulus — medium). Solve .

Case 1: . Check: and . Valid.

Case 2: . Check: and . Valid.

Both and satisfy the original equation.

Example 5 (functions, self-inverse composition — hard). If , find , and hence evaluate without further computation.

So , and applying twice more gives — four applications of return to the original input. Hence directly, with no fraction arithmetic needed at all.

Example 6 (logarithms — medium). Find the number of digits in , given .

Number of digits .

Example 7 (AP — easy). In an arithmetic progression, the 5th term is 17 and the 12th term is 38. Find the 20th term.

and . Subtracting: , so . The 20th term is .

Example 8 (AM-GM optimisation — hard). Find the minimum value of for , and state where it occurs.

By AM-GM, , so . Equality holds when (taking the positive root, since ). The minimum value is , attained at — verified directly: .

Summary

Check the coefficient-ratio condition before solving a simultaneous system — it decides unique, infinite, or no solution in one step.

Sum and product of roots, and , are usually faster than the quadratic formula; a shared root between two quadratics must be checked against each equation's own roots individually, since more than one parameter value can work.

Solve polynomial inequalities with the wavy-curve method across marked critical points, excluding any point where the expression is undefined; solve modulus equations by casing on sign, and always verify each case's solution against the original equation.

Composition is not commutative, and a function that is its own inverse under two applications ( for ) turns a repeated-composition question into a one-line pattern check.

The number of digits in is — the highest-yield single logarithm fact on the exam.

An AP question giving two terms is two linear equations in and ; a GP's infinite sum exists only for . AM-GM, , solves most "minimum of plus something over " questions in one line, with equality exactly when the two terms are equal.

Key formulas & results

Everything to memorise for the exam hall, in one card. Screenshot this for revision.

Linear system classification
Check this ratio before attempting elimination.
Sum and product of roots
Faster than the quadratic formula whenever only a symmetric expression in the roots is needed.
Discriminant
Answers 'for what k are the roots real' without solving the quadratic.
Quadratic from its roots
The fast route when a question states conditions on the roots rather than the coefficients.
Modulus
Every modulus solution must still be verified against the original equation's sign conditions.
Self-inverse composition
Recognising this pattern turns a 4-fold composition into a lookup.
Logarithm rules
Change of base converts an awkward log to one in a computable base.
Digit count
CAT's single most-tested logarithm application.
AP term and sum
Two given terms are two linear equations in $a$ and $d$.
GP term and infinite sum
The infinite-sum formula is meaningless outside $|r|<1$ — check this before applying it.
AM-GM-HM chain
Equality throughout exactly when every term is equal; the basis of the AM-GM optimisation shortcut.
⚠️

Traps CAT sets — and how to dodge them

These are the exact option-traps and misreads that cost marks under negative marking.

WATCH OUT
Solving a two-variable word problem without checking the two equations are actually independent
Confirm the two equations encode genuinely different information before eliminating; an equation that is a multiple of the other leaves the system under-determined.
Why it happens: Word problems can restate the same relationship in two different phrasings that look independent but reduce to one equation.
WATCH OUT
Finding a common root between two quadratics by checking only one of the first equation's roots
Substitute each of the first equation's roots into the second equation separately; more than one parameter value can be valid.
Why it happens: A shared root can be either of the first quadratic's two roots, and each choice generally gives a different answer.
WATCH OUT
Solving for individual roots to evaluate a symmetric expression like α²+β²
Rewrite the expression in terms of sum and product directly: α²+β²=(α+β)²−2αβ.
Why it happens: Symmetric expressions never require the individual root values, and computing them anyway wastes time and invites arithmetic errors.
WATCH OUT
Including a point where the denominator is zero in a 'greater than or equal to' inequality solution
Always exclude points where the expression is undefined, regardless of whether the inequality is strict or non-strict.
Why it happens: A zero denominator makes the expression undefined, not equal to any value, so it can never satisfy any inequality.
WATCH OUT
Squaring a modulus equation without verifying the resulting solutions
Case on the sign of the expression inside the modulus, and substitute every candidate solution back into the original equation.
Why it happens: Squaring can introduce extraneous roots that satisfy the squared equation but not the original signed one.
WATCH OUT
Assuming f(g(x)) equals g(f(x))
Compute compositions from the innermost function outward and treat the two orders as different functions unless proven otherwise.
Why it happens: Function composition is generally non-commutative; equality is the special case, not the rule.
WATCH OUT
Forgetting the +1 when counting digits from a logarithm
Digits in N = floor(log10 N) + 1, not floor(log10 N) alone.
Why it happens: The characteristic (floor of the log) is exactly one less than the digit count, and dropping the +1 undercounts by one digit every time.
WATCH OUT
Applying the GP infinite-sum formula without checking |r|<1
Verify the common ratio's magnitude is below 1 before using S∞ = a/(1-r).
Why it happens: Outside that range the series does not converge, and the formula produces a number with no meaning.

Exam-pattern practice

PYQ-style questions with full solutions. Work through them as a readiness check — mark yourself honestly and get your gap report at the end.

Readiness check

Are you exam-ready for Algebra?

12 problems from this chapter. Try each one, reveal the worked solution, mark yourself honestly — get your gap report at the end.

12 questions~8 min worth ~66 marks in CAT exams

5-minute revision

The whole chapter, distilled. Read this the night before the exam.

  • Check the coefficient-ratio condition before solving a linear system.
  • Sum of roots = −b/a; product of roots = c/a.
  • Discriminant sign (D>0, =0, <0) answers 'are the roots real' without solving.
  • Symmetric root expressions rewrite in terms of sum and product — never solve for individual roots.
  • A common root between two quadratics may match either root of the first equation.
  • Quadratic word problems can have an algebraic root that is not physically valid.
  • The wavy-curve method: mark critical points, test signs, exclude undefined points always.
  • A quadratic opening upward is negative strictly between its roots, positive outside.
  • Modulus equations are solved by casing on sign, then verified by substitution.
  • Function composition is not commutative; f(f(x)) = −1/x for f(x) = (x−1)/(x+1) is a useful self-inverse pattern.
  • Domain restrictions from square roots, denominators and logarithms are sometimes the entire question.
  • Digits in N = floor(log₁₀N) + 1 — do not drop the +1.
  • A GP's infinite sum requires |r| < 1; check this before applying S∞ = a/(1−r).
  • AM ≥ GM ≥ HM always, with equality exactly when all terms are equal.
  • AM-GM solves 'minimum of x plus k/x' questions in one line.

CAT question blueprint

How this topic is asked, tier by tier — so you can prep to the pattern.

Typical weightage: Algebra contributes an estimated 12-18 of QA's 66 marks (about 5 of 22 questions, +3/−1 on MCQs, no negative marking on TITA)

Question styleMarks eachTypical countWhat it tests
Quadratic equations3~2Sum/product of roots, discriminant, common-root and symmetric-expression questions
Inequalities and modulus3~1Wavy-curve method and sign-based modulus solving
Functions and composition3~1Composition order and self-inverse patterns
Logarithms3~1Log rules and the digit-count shortcut
Arithmetic and geometric progressions3~1Term/sum formulas for AP and GP
AM-GM and optimisation3~1Minimum/maximum of a sum with a fixed product, via AM-GM
Prep strategy
  • Day 1: linear systems and the coefficient-ratio classification.
  • Day 2: quadratic equations — sum/product, discriminant, common roots, symmetric expressions.
  • Day 3: inequalities (wavy-curve method) and modulus equations.
  • Day 4: functions, composition and domain restrictions.
  • Day 5: logarithms, especially the digit-count application.
  • Day 6: AP/GP and AM-GM, then a timed mixed set across all five sub-topics.

Exam-hall strategy

Battle-tested tips from mentors and toppers for this topic under the sectional clock.

  1. Check the coefficient-ratio test on any simultaneous-equation stem before attempting elimination.
  2. Reach for sum/product of roots before the quadratic formula whenever only a symmetric expression is asked.
  3. Use the discriminant to answer 'are the roots real' questions without ever solving the quadratic.
  4. For a shared root between two quadratics, test both of the first equation's roots against the second.
  5. Mark every critical point (including where the expression is undefined) before applying the wavy-curve method.
  6. Reach for AM-GM immediately on any 'minimum of x plus k/x' style question.

Beyond the exam

Where this skill shows up in the job you're competing for — and in life.

Break-even and cost modelling

Linear and quadratic equations model cost, revenue and profit functions, and sum/product of roots identifies break-even conditions quickly.

Resource-constrained optimisation

The AM-GM inequality is the textbook shortcut behind many 'minimise cost subject to a fixed product' business problems.

Compound growth modelling

Geometric progressions describe compounding growth or decay, and the infinite-sum condition mirrors when a repeated process converges to a stable value.

Where else this topic is tested

Prepare once, score in every exam that asks it.

XAT Quantitative Ability & DIVery high — near-identical algebra topics at a similar difficulty
SSC CGL / IBPS PO Quantitative AptitudeModerate — simpler linear/quadratic applications at a faster pace
GATE Engineering MathematicsModerate overlap on progressions and functions, at a more theoretical depth

Questions aspirants ask

Pulled from the Q&A community and mentor sessions.

Roughly 5 of QA's 22 questions, making it the second-largest QA topic after Arithmetic. It spans linear/simultaneous equations, quadratics, inequalities and modulus, functions, logarithms, and progressions, so a single Algebra question can draw on any of these sub-areas.

Rarely. Most quadratic questions ask about a symmetric property of the roots (their sum, product, or an expression built from both) rather than the individual root values, and sum/product of roots answers these directly without ever finding the roots themselves. Reach for the quadratic formula only when the individual root values are genuinely required.

Because the common root could be either of the first equation's two roots, and each choice typically gives a different value of the unknown parameter in the second equation. Checking only one root risks missing a valid answer or reporting an incomplete set of possibilities.

Use digits in N = floor(log₁₀N) + 1. For N = a^n, this is floor(n × log₁₀a) + 1, which needs only a known logarithm value and one multiplication — never the actual (potentially enormous) number itself.

Whenever the expression is a sum of positive terms whose product is a constant (like x + k/x, or the sum of two quantities with a fixed product), AM-GM gives the minimum in one line via 2√(product), with equality exactly when the two terms are equal — almost always faster than differentiating under exam time pressure.
Header Logo