In short

The instant a problem hands you the sum s = a+b and the product p = ab — or hands you something you can immediately read as a sum and a product, like a + 1/a or the roots of a quadratic — every "find a^k + b^k" or "find a^k - b^k" question is one identity application away. Memorise the five-line lookup card below, recognise the pattern in the question, substitute. You do not need to solve for a and b separately. In fact, doing so is what costs you marks and time.

JEE Mains will give you eighty seconds per question. JEE Advanced even less per multi-step. So when a question says "If a + b = 5 and ab = 6, find a^3 + b^3", you do not have time to set up t^2 - 5t + 6 = 0, factor it, find a = 2 and b = 3, cube them, and add. That is forty seconds you don't have.

The recognition rule is this: inputs of the form (sum, product) deserve outputs computed by symmetric identities, full stop. The roots themselves are a distraction. This article is the exam-focused lookup card for that recognition.

(For the underlying intuition — why symmetric inputs deserve symmetric tools — see Symmetric Expressions: Think Identities, Not Brute Force. For a deep zoom on the workhorse a^2 + b^2 case alone, see x^2 + y^2 as (x+y)^2 - 2xy. This article is the exam-room reference card that ties them together — a recognition tool, not a derivation.)

The lookup card — memorise these five lines

Throughout, s = a+b and p = ab.

Lookup card for power sums in terms of sum s and product pA reference card with five identities, colour-grouped by exponent. Squares are blue, cubes are orange, fourth powers are purple. Each identity rewrites a power sum or power difference in terms of s equals a plus b and p equals a times b. Power sums in terms of s = a+b and p = ab DEGREE 2 a² + b² = s² − 2p a² − b² = s · √(s² − 4p) (sign from a vs b) DEGREE 3 a³ + b³ = s(s² − 3p) a³ − b³ = √(s² − 4p) · (s² − p) DEGREE 4 a⁴ + b⁴ = (s² − 2p)² − 2p² Newton recurrence: P_n = s·P_{n−1} − p·P_{n−2}, with P_0 = 2, P_1 = s
The five most-used formulas, colour-grouped by exponent. Squares in blue, cubes in orange, fourth power in purple. The footer is Newton's recurrence, which lets you climb to any higher power without memorising more.

A line-by-line tour:

Why solving for a and b would lose marks and time: even if the roots are nice integers, the substitution route is \sim 5× faster. And the moment the roots become irrational — discriminant s^2 - 4p is not a perfect square, e.g. s = 3, p = 1 gives roots (3 \pm \sqrt{5})/2 — cubing surds and adding them is brutal. The symmetric route doesn't notice or care that the roots are ugly.

Worked example 1 — straight substitution

If s = a + b = 5 and p = ab = 6, find a^2 + b^2 and a^3 + b^3.

Apply line 1 of the card:

a^2 + b^2 = s^2 - 2p = 25 - 12 = 13

Apply line 3 of the card:

a^3 + b^3 = s(s^2 - 3p) = 5 \cdot (25 - 18) = 5 \cdot 7 = 35

Done. Two lines. Total time: under twenty seconds.

Example 1 pipeline diagramTwo input boxes labelled s equals 5 and p equals 6 feed into two output boxes: a squared plus b squared equals 13, and a cubed plus b cubed equals 35. s = 5 p = 6 s² − 2p s(s² − 3p) a² + b² = 13 a³ + b³ = 35
Sum and product feed in; both power sums fall out. Note that $a$ and $b$ are never named — even though they happen to be $2$ and $3$ here, you never used that fact.

You could verify by solving: t^2 - 5t + 6 = 0 gives t = 2 or 3, so a = 2, b = 3 (or vice versa). Then 4 + 9 = 13 and 8 + 27 = 35. The same answers — but the verification took longer than the original computation.

Why this is the recognition pattern, not a one-off trick: every JEE Mains paper has at least one question of this form. Once you see "s and p given, find power sum", your hand should reach for the card before your brain finishes reading the question.

Worked example 2 — the a + 1/a disguise

If a + \dfrac{1}{a} = 3, find a^4 + \dfrac{1}{a^4}.

Set b = 1/a. Then ab = a \cdot (1/a) = 1 — so the product is forced to be 1. The given is a + b = 3. So you have s = 3 and p = 1 in disguise.

Apply line 1 of the card:

a^2 + \tfrac{1}{a^2} = s^2 - 2p = 9 - 2 = 7

Now climb one more rung. Square both sides of a^2 + 1/a^2 = 7:

\left(a^2 + \tfrac{1}{a^2}\right)^2 = a^4 + 2 \cdot a^2 \cdot \tfrac{1}{a^2} + \tfrac{1}{a^4} = a^4 + 2 + \tfrac{1}{a^4} = 49

So:

a^4 + \tfrac{1}{a^4} = 49 - 2 = 47

Done. Equivalently, apply line 5 of the card directly: a^4 + b^4 = (s^2 - 2p)^2 - 2p^2 = 7^2 - 2 \cdot 1 = 49 - 2 = 47. Same answer.

Why the a + 1/a pattern is so popular with question-setters: the substitution b = 1/a silently fixes p = 1, so the setter only has to give you one number (s) and the symmetric machinery can compute everything. It is the cleanest possible "find power sum" question, and it appears in nearly every JEE syllabus year. Spotting the disguise — that a + 1/a is a sum and a \cdot 1/a is the hidden product — is the recognition step.

Worked example 3 — Newton's recurrence

Verify Newton's recurrence on the data of Example 1.

Newton's recurrence says: if P_n = a^n + b^n, then for every n \geq 2,

P_n = s \cdot P_{n-1} - p \cdot P_{n-2}

with seeds P_0 = a^0 + b^0 = 2 and P_1 = a + b = s. Why this recurrence exists: multiply P_{n-1} = a^{n-1} + b^{n-1} by s = a + b. You get sP_{n-1} = a^n + b^n + ab^{n-1} + a^{n-1}b = P_n + ab(a^{n-2} + b^{n-2}) = P_n + p \cdot P_{n-2}. Rearrange to get the recurrence. It is the structural reason every P_n is computable from s, p alone.

Use s = 5, p = 6:

  • P_0 = 2
  • P_1 = 5
  • P_2 = s \cdot P_1 - p \cdot P_0 = 5 \cdot 5 - 6 \cdot 2 = 25 - 12 = 13 ✓ (matches Example 1)
  • P_3 = s \cdot P_2 - p \cdot P_1 = 5 \cdot 13 - 6 \cdot 5 = 65 - 30 = 35 ✓ (matches Example 1)
  • P_4 = s \cdot P_3 - p \cdot P_2 = 5 \cdot 35 - 6 \cdot 13 = 175 - 78 = 97
  • P_5 = s \cdot P_4 - p \cdot P_3 = 5 \cdot 97 - 6 \cdot 35 = 485 - 210 = 275

Cross-check P_4 with line 5 of the card: (s^2 - 2p)^2 - 2p^2 = (25 - 12)^2 - 2 \cdot 36 = 169 - 72 = 97 ✓.

Why memorise the recurrence as well as the card: in any problem that asks for a^5 + b^5 or higher, you do not need a sixth identity — just two lines of recurrence from the previous two values. The card handles the common cases, the recurrence handles everything else. This is the JEE/Olympiad workhorse — the same pattern that powers Newton's identities for n variables.

How to recognise the pattern in an exam

Train your eye for these triggers. If any one of them lights up, reach for the card.

When the trigger fires, do not solve the quadratic. Read s and p off, look up the relevant line of the card, substitute. Answer in twenty seconds.

Common confusions

Going deeper

If you came here for the exam-room recognition rule, you have it — memorise the card, train the trigger, substitute. Stop here. The rest is for readers curious about why a five-line card is enough.

Newton's identities — the general principle

Newton's identities are the systematic version of the recurrence. For a polynomial with roots r_1, r_2, \ldots, r_n, define the power sums P_k = r_1^k + r_2^k + \cdots + r_n^k and the elementary symmetric polynomials e_1, e_2, \ldots, e_n (the coefficients of the polynomial up to sign, by Vieta's formulas). Newton's identities say:

P_k = e_1 P_{k-1} - e_2 P_{k-2} + e_3 P_{k-3} - \cdots

For two variables, this collapses to P_k = s P_{k-1} - p P_{k-2} — exactly what Example 3 used. The same recurrence, applied with three or more roots, lets you compute power sums of cubic, quartic, and higher equations without ever solving them. This is the engine behind a large fraction of JEE Advanced and Olympiad algebra.

The fundamental theorem of symmetric polynomials

The deeper reason any a^k + b^k can be written using only s and p is the fundamental theorem of symmetric polynomials: every polynomial expression in a, b that is unchanged under swapping them ("symmetric") can be uniquely written as a polynomial in e_1 = s and e_2 = p. Power sums P_k are symmetric, so they qualify. The lookup card is the first few cases of this theorem made explicit. The theorem itself, generalised, drives Galois theory and the proof that the general quintic has no radical solution.

References