Sequences and Series

Look at the numbers 2,4,8,16,32,…2, 4, 8, 16, 32, \ldots — the count of a person's ancestors doubling every generation — or at 3,3.3,3.33,3.333,…3, 3.3, 3.33, 3.333, \ldots — the successive decimal approximations you get dividing 1010 by 33. Both are ordered lists of numbers, one term after another, each pinned to a position: first, second, third, and so on. Mathematics gives this idea a name, sequence, and gives the running total of its terms another name, series. That is the whole chapter in one sentence — but inside that simple idea sits one of the most useful tools in the whole of school and competitive mathematics: the geometric progression (G.P.), a sequence in which every term is a constant multiple of the one before it. This chapter builds the vocabulary of sequences and series from scratch — general term, recursive definition, sigma notation for a sum — before turning to the two progressions that dominate the syllabus. You already met the arithmetic progression (A.P.) in Class 10, where each term adds a fixed amount to the last; here it is recapped just far enough to set up a comparison, because the chapter's real destination is the G.P., where each term is multiplied by a fixed ratio instead. You will derive the formula for the nnth term of a G.P., the formula for the sum of its first nn terms (and, pushed further, the sum of infinitely many terms when the ratio is small enough), the geometric mean of two numbers, and the single most quoted inequality in the chapter — that the arithmetic mean of two positive numbers is never smaller than their geometric mean. A final section turns sigma notation into three closed-form results — the sums of the first nn natural numbers, their squares, and their cubes — extending the sum-formula idea to series that are not geometric at all. Compound interest, population growth, radioactive decay, loan instalments, and the "chain letter" problem all reduce to a G.P. sum once you see the constant ratio hiding inside them. By the end of this chapter you should be able to recognise a progression on sight, write down its general term, sum any finite (or, for a G.P., suitable infinite) run of its terms, and move fluently between the algebraic formula and the real-world story it is modelling.

Key takeaways
  • A sequence is an ordered list a1,a2,a3,…,an,…a_1, a_2, a_3, \ldots, a_n, \ldots; formally a function with domain N\mathbb{N} (or a subset {1,2,…,k}\{1,2,\ldots,k\} for a finite sequence). The number at the nnth position, ana_n, is the general term.
  • A series is the indicated sum of a sequence's terms, a1+a2+⋯+ana_1 + a_2 + \cdots + a_n, compactly written with sigma notation as ∑k=1nak\sum_{k=1}^{n} a_k.
  • An arithmetic progression (A.P.) has a constant common difference dd: an=a+(n−1)da_n = a + (n-1)d, and its sum to nn terms is Sn=n2[2a+(n−1)d]=n2(a+l)S_n = \frac{n}{2}[2a + (n-1)d] = \frac{n}{2}(a+l).
  • A geometric progression (G.P.) has a constant common ratio r=ak+1/akr = a_{k+1}/a_k: general term an=arn−1a_n = ar^{n-1}.
  • Sum of a finite G.P.: Sn=a(rn−1)r−1S_n = \dfrac{a(r^n - 1)}{r-1} for r≠1r \neq 1, and Sn=naS_n = na for r=1r = 1 — two genuinely different cases, not one formula in disguise.
  • Sum of an infinite G.P. exists only when ∣r∣<1|r| < 1, and equals S∞=a1−rS_\infty = \dfrac{a}{1-r} — this is how a repeating decimal like 0.7‾0.\overline{7} collapses to the fraction 79\frac{7}{9}.
  • The geometric mean (G.M.) of two positive numbers a,ba, b is G=abG = \sqrt{ab}, so that a,G,ba, G, b forms a G.P.; more generally nn geometric means can be inserted between aa and bb using a common ratio r=(b/a)1/(n+1)r = (b/a)^{1/(n+1)}.
  • A.M. ≥\ge G.M.: for positive reals a,ba, b, a+b2≥ab\dfrac{a+b}{2} \ge \sqrt{ab}, with equality exactly when a=ba = b — proved from the single fact that a real square can never be negative.
  • Three special series close the chapter: ∑k=1nk=n(n+1)2\sum_{k=1}^n k = \frac{n(n+1)}{2}, ∑k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^n k^2 = \frac{n(n+1)(2n+1)}{6}, and ∑k=1nk3=[n(n+1)2]2\sum_{k=1}^n k^3 = \left[\frac{n(n+1)}{2}\right]^2.
  • Key idea: every sequence problem reduces to writing down its general term correctly, and every series problem reduces to choosing the right closed-form sum — arithmetic (constant difference), geometric (constant ratio, with a genuinely different formula at r = 1), or one of the three natural-number power sums.
The core insight

A sequence is fixed once you know its general term ana_n; a series is that sequence added up, and the two progressions that make the addition tractable are the arithmetic progression (an=a+(n−1)da_n = a + (n-1)d, sum Sn=n2[2a+(n−1)d]S_n = \frac{n}{2}[2a+(n-1)d], built by constant addition) and the geometric progression (an=arn−1a_n = ar^{n-1}, sum Sn=a(rn−1)r−1S_n = \frac{a(r^n-1)}{r-1} for r≠1r \neq 1, built by constant multiplication), with the geometric mean ab\sqrt{ab} and the inequality a+b2≥ab\frac{a+b}{2} \ge \sqrt{ab} tying the two progressions together.

What this chapter covers

The chapter opens by defining a sequence as an ordered list of numbers indexed by position, distinguishing finite from infinite sequences and explicit formulas (like an=2na_n = 2n) from recursive definitions (like the Fibonacci rule an=an−1+an−2a_n = a_{n-1} + a_{n-2}). It then defines the associated series and introduces sigma notation for writing sums compactly. A short recap of the arithmetic progression — general term and sum formula — sets up the central comparison of the chapter: constant addition versus constant multiplication. The bulk of the chapter is then the geometric progression: its general term an=arn−1a_n = ar^{n-1}, the sum to nn terms SnS_n (split carefully into the r=1r=1 and r≠1r \neq 1 cases), and, as a natural extension, the sum to infinitely many terms when ∣r∣<1|r| < 1. The geometric mean of two numbers and the technique of inserting several geometric means between two numbers follow directly from the general-term formula. The relationship between A.M. and G.M. — the inequality A≥GA \ge G — is proved algebraically and used to solve "given the A.M. and G.M., find the two numbers" problems. The chapter closes with special series: closed-form sums for the first nn natural numbers, their squares, and their cubes, each derived by the telescoping-sum technique rather than assumed.

The core ideas

Sequences: definition, notation and the general term

A sequence is an arrangement of numbers in a definite order — formally, a function whose domain is the set of natural numbers N\mathbb{N} or a subset of the form {1,2,3,…,k}\{1, 2, 3, \ldots, k\}. The terms are written a1,a2,a3,…,an,…a_1, a_2, a_3, \ldots, a_n, \ldots, where the subscript records the position of the term, not its value; ana_n, the term at the nnth position, is called the general term of the sequence, and knowing ana_n as a function of nn fixes the entire sequence. A sequence with a fixed, finite number of terms is a finite sequence (the ten generations of a person's ancestors, a1=2,a2=4,…,a10=1024a_1 = 2, a_2 = 4, \ldots, a_{10} = 1024, is finite); a sequence that never ends is an infinite sequence (the successive quotients 3,3.3,3.33,3.333,…3, 3.3, 3.33, 3.333, \ldots obtained by dividing 1010 by 33 never terminate).

an=2n(even naturals 2,4,6,…),an=2n−1(odd naturals 1,3,5,…)(1)a_n = 2n \quad (\text{even naturals } 2, 4, 6, \ldots), \qquad a_n = 2n - 1 \quad (\text{odd naturals } 1, 3, 5, \ldots) \qquad (1)

where: these are explicit formulas — substitute n=1,2,3,…n = 1, 2, 3, \ldots directly to generate every term (NCERT Example 1 builds exactly this skill: for an=2n+5a_n = 2n+5, substituting n=1,2,3n=1,2,3 gives a1=7,a2=9,a3=11a_1=7, a_2=9, a_3=11; for an=n−34a_n = \frac{n-3}{4}, the first three terms are −12,−14,0-\frac12, -\frac14, 0). Not every sequence has an explicit formula — the sequence of primes 2,3,5,7,11,…2, 3, 5, 7, 11, \ldots has no known algebraic formula for its nnth term at all and can only be described in words. Many sequences instead obey a recursive rule, where each term is defined in terms of the ones before it: the Fibonacci sequence 1,1,2,3,5,8,13,…1, 1, 2, 3, 5, 8, 13, \ldots is generated by a1=a2=1a_1 = a_2 = 1 and an=an−1+an−2a_n = a_{n-1} + a_{n-2} for n>2n > 2 (NCERT Example 3 works a similar recursive case, a1=1a_1 = 1, an=an−1+2a_n = a_{n-1} + 2, giving 1,3,5,7,91, 3, 5, 7, 9). Both explicit and recursive definitions count as a valid sequence — what matters is that there is some rule, however stated, that determines every term.

Series and sigma notation

Given a sequence a1,a2,a3,…,ana_1, a_2, a_3, \ldots, a_n, the expression formed by adding its terms, a1+a2+a3+⋯+ana_1 + a_2 + a_3 + \cdots + a_n, is called the series associated with that sequence. A series is finite or infinite exactly according to whether the underlying sequence is finite or infinite. It is worth being precise about a common source of confusion: the sequence is the ordered list, the series is the indicated sum, and "the sum of the series" refers to the single number you get after actually adding — for the finite series 1+3+5+71 + 3 + 5 + 7, the sum is 1616.

a1+a2+a3+⋯+an=∑k=1nak(2)a_1 + a_2 + a_3 + \cdots + a_n = \sum_{k=1}^{n} a_k \qquad (2)

where: Σ\Sigma (capital sigma) is read "the sum of", kk is the running index taking every integer value from the lower limit (11) to the upper limit (nn), and aka_k is the general term being summed — sigma notation is nothing more than shorthand for a long addition, and it is the notation used throughout the special-series results at the end of this chapter.

A quick recap: arithmetic progression

Before contrasting it with the geometric progression, recall the arithmetic progression (A.P.) you built in Class 10: a sequence in which every term after the first is obtained by adding a fixed number, the common difference dd, to the term before it — a,a+d,a+2d,a+3d,…a, a+d, a+2d, a+3d, \ldots. The general term and the sum to nn terms are the two working formulas you will need again in this chapter, especially when a problem mixes a G.P. with an A.P. (as several of this chapter's own miscellaneous problems do — for instance, subtracting fixed amounts from three numbers in G.P. to leave three numbers in A.P.).

an=a+(n−1)d,Sn=n2[2a+(n−1)d]=n2(a+l)(3)a_n = a + (n-1)d, \qquad S_n = \frac{n}{2}\big[2a + (n-1)d\big] = \frac{n}{2}(a + l) \qquad (3)

where: aa is the first term, d=ak+1−akd = a_{k+1} - a_k is the constant common difference (the defining test of an A.P. — the difference between consecutive terms is constant, in contrast with the G.P.'s constant ratio), nn is the number of terms, and l=anl = a_n is the last term of a finite A.P. The arithmetic mean (A.M.) of two numbers aa and bb is the single number AA that makes a,A,ba, A, b an A.P., which forces A=a+b2A = \frac{a+b}{2} — the ordinary average, and the quantity compared against the geometric mean later in this chapter.

Geometric progression: definition and the general term

Now contrast that constant addition with constant multiplication. Consider the sequences 2,4,8,16,…2, 4, 8, 16, \ldots and 19,−13,1,−3,…\frac19, -\frac13, 1, -3, \ldots (reversed for illustration) — in each, every term except the first bears a constant ratio to the term immediately before it: 22 in the first case. Such a sequence is called a geometric progression, abbreviated G.P. Formally, a sequence a1,a2,a3,…a_1, a_2, a_3, \ldots (every term non-zero) is a G.P. if

ak+1ak=r (constant), for every k≥1,an=a r n−1(4)\frac{a_{k+1}}{a_k} = r \ (\text{constant}), \text{ for every } k \ge 1, \qquad a_n = a\,r^{\,n-1} \qquad (4)

where: rr is the common ratio and a=a1a = a_1 is the first term; writing a1=aa_1 = a, the G.P. reads a,ar,ar2,ar3,…a, ar, ar^2, ar^3, \ldots. The general-term formula an=arn−1a_n = ar^{n-1} follows the same pattern-spotting NCERT uses to introduce it: a2=ar=ar2−1a_2 = ar = ar^{2-1}, a3=a2r=ar2=ar3−1a_3 = a_2 r = ar^2 = ar^{3-1}, a4=a3r=ar3=ar4−1a_4 = a_3 r = ar^3 = ar^{4-1}, and so the exponent is always one less than the term's position (NCERT Example 4 applies this directly: for the G.P. 5,25,125,…5, 25, 125, \ldots, a=5a = 5, r=5r = 5, so a10=5(5)9=510a_{10} = 5(5)^{9} = 5^{10} and, in general, an=5(5)n−1=5na_n = 5(5)^{n-1} = 5^n). A finite G.P. is written a,ar,ar2,…,arn−1a, ar, ar^2, \ldots, ar^{n-1}; an infinite one drops the final term and continues with dots.

Figure
Two bar charts side by side comparing an arithmetic progression with constant difference plus two growing linearly and a geometric progression with constant ratio times two growing exponentially, both starting at the value two, with small arrows between bars labelled plus two for the arithmetic case and times two for the geometric case
Constant addition versus constant multiplication A.P.: a = 2, d = 2 — linear growth G.P.: a = 2, r = 2 — exponential growth 2 4 6 8 10 12 +2 +2 +2 +2 +2 2 4 8 16 32 64 ×2 ×2 ×2 ×2

Sum to n terms of a G.P.

The whole practical value of a G.P. lies in being able to add a large number of its terms without adding them one by one. Denote the sum of the first nn terms by SnS_n.

Sn=na  (r=1),Sn=a(rn−1)r−1=a(1−rn)1−r  (r≠1)(5)S_n = na \ \ (r = 1), \qquad S_n = \frac{a(r^n - 1)}{r - 1} = \frac{a(1-r^n)}{1-r} \ \ (r \neq 1) \qquad (5)

where: aa is the first term, rr is the common ratio, and nn is the number of terms summed. The two cases are genuinely different formulas, not one written two ways — when r=1r=1 every term equals aa, so the sum is simply nn copies of aa added, and the r≠1r \neq 1 formula would in fact divide by zero if you tried to force r=1r=1 into it. The full derivation of the r≠1r \neq 1 case, by the classic "multiply by rr and subtract" trick, is given below as the first derivation. NCERT Example 7 shows the formula in action for 1+23+49+⋯1 + \frac23 + \frac49 + \cdots (here a=1a=1, r=23r=\frac23): Sn=3[1−(23)n]S_n = 3\left[1 - \left(\frac23\right)^n\right], and in particular S5=21181S_5 = \frac{211}{81}.

Sum to infinity of a G.P.

Push the finite-sum formula further: what happens as nn grows without bound? If ∣r∣<1|r| < 1, then rn→0r^n \to 0 as n→∞n \to \infty (each multiplication by rr shrinks the term further toward zero), so the finite sum Sn=a(1−rn)1−rS_n = \frac{a(1-r^n)}{1-r} approaches a fixed, finite limit instead of growing forever.

S∞=a1−r,∣r∣<1(6)S_\infty = \frac{a}{1-r}, \qquad |r| < 1 \qquad (6)

where: this sum exists — the series converges — only when ∣r∣<1|r| < 1; for ∣r∣≥1|r| \ge 1 the terms do not shrink to zero and the sum grows without bound or oscillates, so S∞S_\infty is simply not defined. This is exactly the mechanism behind a recurring decimal: 0.7‾=0.7+0.07+0.007+⋯0.\overline{7} = 0.7 + 0.07 + 0.007 + \cdots is a G.P. with a=0.7a = 0.7 and r=0.1r = 0.1, so S∞=0.71−0.1=0.70.9=79S_\infty = \frac{0.7}{1-0.1} = \frac{0.7}{0.9} = \frac{7}{9} — the familiar fraction for the repeating decimal, produced entirely from the infinite-G.P. formula.

Geometric mean and inserting means

The geometric mean (G.M.) of two positive numbers aa and bb is defined as G=abG = \sqrt{ab} — the number that makes a,G,ba, G, b a three-term G.P., since Ga=bG\frac{G}{a} = \frac{b}{G} gives exactly G2=abG^2 = ab. The idea generalises: given two positive numbers aa and bb, any number of terms can be inserted between them so that the whole extended list is a G.P.

G1,G2,…,Gn between a and b:r=(ba)1n+1,Gk=a r k=a(ba)kn+1(7)G_1, G_2, \ldots, G_n \text{ between } a \text{ and } b: \quad r = \left(\frac{b}{a}\right)^{\frac{1}{n+1}}, \qquad G_k = a\,r^{\,k} = a\left(\frac{b}{a}\right)^{\frac{k}{n+1}} \qquad (7)

where: with nn numbers inserted, bb becomes the (n+2)(n+2)th term of the sequence a,G1,G2,…,Gn,ba, G_1, G_2, \ldots, G_n, b, so b=arn+1b = ar^{n+1}, which is solved for rr as shown. NCERT Example 12 works the case n=3n=3 between 11 and 256256: here b=ar4=256b = ar^4 = 256, giving r=±4r = \pm 4 (taking real roots), so r=4r=4 gives G1,G2,G3=4,16,64G_1, G_2, G_3 = 4, 16, 64, and r=−4r=-4 gives −4,16,−64-4, 16, -64 — a reminder that an even-power equation for rr has more than one real solution.

The relationship between A.M. and G.M.

Let AA and GG be the arithmetic mean and geometric mean, respectively, of two given positive real numbers aa and bb: A=a+b2A = \frac{a+b}{2} and G=abG = \sqrt{ab}. These two "average-like" numbers are not equal in general, and the precise relationship between them is one of the most quoted inequalities in the chapter.

A≥G,i.e.a+b2≥ab,with equality iff a=b(8)A \ge G, \qquad \text{i.e.} \qquad \frac{a+b}{2} \ge \sqrt{ab}, \qquad \text{with equality iff } a = b \qquad (8)

where: the inequality holds for any two positive reals a,ba, b, and it becomes an equality in exactly one situation — when aa and bb are equal, so that both averages collapse to the same number. The full algebraic proof is the second derivation below; NCERT Example 13 shows the reverse use of the relationship — given A=10A = 10 and G=8G = 8, recovering the original numbers a=4,b=16a=4, b=16 (or a=16,b=4a=16,b=4) by solving a+b=20a+b=20 and ab=64ab=64 together.

Figure
A semicircle with diameter equal to a plus b split at an interior point into two segments of length a and length b, with a vertical chord erected at that point up to the circle whose length equals the square root of a times b, shown clearly shorter than the horizontal radius which equals a plus b over two, illustrating that the arithmetic mean is never smaller than the geometric mean
Why the radius (A.M.) is never shorter than the chord (G.M.) a b G = √(ab) radius = A = (a+b)/2 centre chord G never exceeds radius A — equality only when P is the centre, i.e. a = b

Special series: sums of natural numbers, squares and cubes

Not every series you meet is arithmetic or geometric — a very common type is a series built from powers of the natural numbers themselves, 1,2,3,…,n1, 2, 3, \ldots, n. Three such sums recur constantly, in this chapter's problems and throughout Class 11–12 mathematics, and each has a clean closed form.

∑k=1nk=n(n+1)2,∑k=1nk2=n(n+1)(2n+1)6,∑k=1nk3=[n(n+1)2]2(9)\sum_{k=1}^{n} k = \frac{n(n+1)}{2}, \qquad \sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6}, \qquad \sum_{k=1}^{n} k^3 = \left[\frac{n(n+1)}{2}\right]^2 \qquad (9)

where: the first result is simply the sum of an A.P. with a=1,d=1,l=na=1, d=1, l=n, applied to (3)(3); the second and third are proved by the telescoping-sum technique — writing a difference of consecutive cubes (or fourth powers) so that a sum collapses, worked in full as the third derivation below. Notice the elegant fact hidden in the third formula: the sum of the first nn cubes equals the square of the sum of the first nn natural numbers, ∑k3=(∑k)2\sum k^3 = \left(\sum k\right)^2.

Derivations

Derivation ADeriving the sum to n terms of a geometric progression

The goal is to derive the closed-form expression for Sn=a+ar+ar2+⋯+arn−1S_n = a + ar + ar^2 + \cdots + ar^{n-1}, the sum of the first nn terms of a G.P. with first term aa and common ratio rr, splitting the argument into the two genuinely distinct cases r=1r=1 and r≠1r \neq 1 rather than treating them as a single formula — the standard method multiplies the whole sum by rr and subtracts, which cancels every term except the first and the last, leaving an equation that can be solved directly for SnS_n.

Step 1. Dispose of the trivial case first. If r=1r = 1, every term of the G.P. equals aa (since ark−1=a⋅1k−1=aar^{k-1} = a \cdot 1^{k-1} = a for every kk), so Sn=a+a+⋯+a⏟n terms=naS_n = \underbrace{a + a + \cdots + a}_{n \text{ terms}} = na. This case needs no further algebra and, importantly, cannot be folded into the r≠1r \neq 1 formula below without dividing by zero.

Step 2. For r≠1r \neq 1, write out the sum explicitly: Sn=a+ar+ar2+⋯+arn−1S_n = a + ar + ar^2 + \cdots + ar^{n-1}, labelled equation (I). Multiply both sides by rr: rSn=ar+ar2+ar3+⋯+arnrS_n = ar + ar^2 + ar^3 + \cdots + ar^{n}, labelled equation (II). Every term of (II) except the last, arnar^n, also appears in (I); every term of (I) except the first, aa, also appears in (II) — the two sums are the same list of terms, shifted by one position.

Step 3. Subtract (II) from (I): Sn−rSn=(a+ar+⋯+arn−1)−(ar+ar2+⋯+arn)S_n - rS_n = (a + ar + \cdots + ar^{n-1}) - (ar + ar^2 + \cdots + ar^n). On the right, every middle term ar,ar2,…,arn−1ar, ar^2, \ldots, ar^{n-1} appears once with a plus sign (from (I)) and once with a minus sign (from (II)), so all of them cancel, leaving only the first term of (I) and the negative of the last term of (II): (1−r)Sn=a−arn=a(1−rn)(1-r)S_n = a - ar^n = a(1 - r^n).

Step 4. Since r≠1r \neq 1, divide both sides by (1−r)(1-r) to isolate SnS_n: Sn=a(1−rn)1−rS_n = \dfrac{a(1-r^n)}{1-r}, equivalently written Sn=a(rn−1)r−1S_n = \dfrac{a(r^n-1)}{r-1} by multiplying numerator and denominator by −1-1 — both forms are standard and interchangeable. As a check, take a=2,r=2,n=10a=2, r=2, n=10 (the ten-generation ancestor G.P.): S10=2(210−1)2−1=2(1024−1)=2046S_{10} = \dfrac{2(2^{10}-1)}{2-1} = 2(1024-1) = 2046, matching NCERT Example 11 exactly.

Go deeper · Derivation B · 1 minProving the arithmetic mean is never smaller than the geometric mean
Derivation BProving the arithmetic mean is never smaller than the geometric mean

The goal is to prove that for any two positive real numbers aa and bb, the arithmetic mean A=a+b2A = \frac{a+b}{2} is never smaller than the geometric mean G=abG = \sqrt{ab}, i.e. A≥GA \ge G, using nothing beyond the single fact that the square of any real number is non-negative — the same "sum of squares can't be negative" idea NCERT itself leans on in the chapter's harder miscellaneous problems (its four-variable G.P.-detection example rests on exactly this trick).

Step 1. Form the difference A−GA - G directly and try to show it is never negative: A−G=a+b2−abA - G = \dfrac{a+b}{2} - \sqrt{ab}. Put this over a common denominator of 22: A−G=a+b−2ab2A - G = \dfrac{a + b - 2\sqrt{ab}}{2}.

Step 2. Recognise the numerator as a perfect square. Since aa and bb are positive, write a=(a)2a = (\sqrt a)^2 and b=(b)2b = (\sqrt b)^2; then a+b−2ab=(a)2−2ab+(b)2=(a−b)2a + b - 2\sqrt{ab} = (\sqrt a)^2 - 2\sqrt a \sqrt b + (\sqrt b)^2 = (\sqrt a - \sqrt b)^2, the expansion of a perfect square run in reverse.

Step 3. Substitute this back: A−G=(a−b)22A - G = \dfrac{(\sqrt a - \sqrt b)^2}{2}. The numerator is a real number squared, and the square of any real number is always greater than or equal to zero; the denominator 22 is positive. A non-negative numerator divided by a positive number is itself non-negative, so A−G≥0A - G \ge 0, that is, A≥GA \ge G.

Step 4. Pin down equality. A−G=0A - G = 0 exactly when (a−b)2=0(\sqrt a - \sqrt b)^2 = 0, which happens exactly when a=b\sqrt a = \sqrt b, i.e. a=ba = b. So the inequality is strict, A>GA > G, whenever a≠ba \neq b, and becomes the equality A=GA = G only in the degenerate case a=ba = b — geometrically, the moment the two numbers coincide, both averages coincide with them. Since aa and bb were arbitrary positive reals, this proves A≥GA \ge G for every pair, which is exactly what the semicircle figure above shows visually: the radius (A.M.) only shrinks to equal the chord (G.M.) when the dividing point sits at the centre, i.e. a=ba = b.

Go deeper · Derivation C · 1 minDeriving the sum of the squares of the first n natural numbers by telescoping
Derivation CDeriving the sum of the squares of the first n natural numbers by telescoping

The goal is to derive the closed-form result ∑k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6} without guessing the formula and checking it afterwards, using a telescoping sum — a technique with no direct counterpart in the A.P./G.P. formulas above, but essential for the special-series results this chapter promises and for later calculus. The trick is to find an expression whose consecutive differences involve k2k^2, then sum those differences so that all the middle terms cancel, leaving only a first and last piece.

Step 1. Start from the algebraic identity k3−(k−1)3=3k2−3k+1k^3 - (k-1)^3 = 3k^2 - 3k + 1, obtained simply by expanding (k−1)3=k3−3k2+3k−1(k-1)^3 = k^3 - 3k^2 + 3k - 1 and subtracting it from k3k^3. This identity holds for every integer kk, and its right-hand side contains exactly the k2k^2 term we are trying to sum.

Step 2. Sum both sides of the identity from k=1k = 1 to k=nk = n: ∑k=1n[k3−(k−1)3]=∑k=1n(3k2−3k+1)\sum_{k=1}^{n}\left[k^3 - (k-1)^3\right] = \sum_{k=1}^{n}\left(3k^2 - 3k + 1\right). The left-hand side telescopes — write out the first few and last few terms: (13−03)+(23−13)+(33−23)+⋯+(n3−(n−1)3)(1^3 - 0^3) + (2^3-1^3) + (3^3-2^3) + \cdots + (n^3-(n-1)^3), and every term except the very first (131^3, really −03-0^3 cancels nothing) and the very last positive piece n3n^3 cancels against its neighbour, leaving simply n3−03=n3n^3 - 0^3 = n^3.

Step 3. Expand the right-hand side using linearity of summation: ∑k=1n(3k2−3k+1)=3∑k=1nk2−3∑k=1nk+∑k=1n1=3∑k=1nk2−3⋅n(n+1)2+n\sum_{k=1}^n (3k^2 - 3k + 1) = 3\sum_{k=1}^n k^2 - 3\sum_{k=1}^n k + \sum_{k=1}^n 1 = 3\sum_{k=1}^n k^2 - 3 \cdot \frac{n(n+1)}{2} + n, using the already-established sum ∑k=n(n+1)2\sum k = \frac{n(n+1)}{2} from equation (3)(3) and the fact that summing the constant 11 a total of nn times gives nn.

Step 4. Equate the two sides and solve for ∑k2\sum k^2: n3=3∑k=1nk2−3n(n+1)2+nn^3 = 3\sum_{k=1}^n k^2 - \frac{3n(n+1)}{2} + n, so 3∑k2=n3−n+3n(n+1)2=n3+−2n+3n2+3n2=n3+3n2+n2=2n3+3n2+n23\sum k^2 = n^3 - n + \frac{3n(n+1)}{2} = n^3 + \frac{-2n + 3n^2 + 3n}{2} = n^3 + \frac{3n^2+n}{2} = \frac{2n^3 + 3n^2 + n}{2}. Factor the numerator: 2n3+3n2+n=n(2n2+3n+1)=n(n+1)(2n+1)2n^3+3n^2+n = n(2n^2+3n+1) = n(n+1)(2n+1). Hence 3∑k2=n(n+1)(2n+1)23\sum k^2 = \frac{n(n+1)(2n+1)}{2}, giving ∑k=1nk2=n(n+1)(2n+1)6\sum_{k=1}^n k^2 = \dfrac{n(n+1)(2n+1)}{6} exactly. As a check: n=3n=3 gives 12+22+32=141^2+2^2+3^2 = 14, and the formula gives 3⋅4⋅76=846=14\frac{3\cdot4\cdot7}{6} = \frac{84}{6}=14 — matching. (The cube sum ∑k3=[n(n+1)/2]2\sum k^3 = [n(n+1)/2]^2 is proved the same way, starting instead from k4−(k−1)4=4k3−6k2+4k−1k^4-(k-1)^4 = 4k^3-6k^2+4k-1.)

Worked examples

Board level - the tenth term of a G.P. given two later terms (NCERT Example 6 pattern)

In a G.P., the 3rd term is 2424 and the 6th term is 192192. Find the 10th term.

Step 1. Translate both given terms into the general-term formula (4)(4): a3=ar2=24a_3 = ar^2 = 24, labelled (I), and a6=ar5=192a_6 = ar^5 = 192, labelled (II).

Step 2. Divide (II) by (I) to eliminate aa in one step: ar5ar2=19224\dfrac{ar^5}{ar^2} = \dfrac{192}{24}, which simplifies to r3=8r^3 = 8, so r=2r = 2.

Step 3. Substitute r=2r=2 back into (I) to find aa: a(2)2=24⇒4a=24⇒a=6a(2)^2 = 24 \Rightarrow 4a = 24 \Rightarrow a = 6.

Step 4. Apply the general-term formula once more for n=10n=10: a10=ar9=6(2)9=6×512a_{10} = ar^{9} = 6(2)^9 = 6 \times 512. Answer: the 10th term is a10=3072a_{10} = 3072.

Board level - recovering two numbers from their A.M. and G.M. (NCERT Example 13 pattern)

The A.M. and G.M. of two positive numbers aa and bb are 1010 and 88 respectively. Find the numbers.

Step 1. Write both conditions as equations using the definitions in (3)(3) and the G.M. definition: a+b2=10⇒a+b=20\dfrac{a+b}{2} = 10 \Rightarrow a+b = 20, labelled (I); ab=8⇒ab=64\sqrt{ab} = 8 \Rightarrow ab = 64, labelled (II).

Step 2. Two numbers are known once both their sum and product are known, using the identity (a−b)2=(a+b)2−4ab(a-b)^2 = (a+b)^2 - 4ab. Substitute: (a−b)2=(20)2−4(64)=400−256=144(a-b)^2 = (20)^2 - 4(64) = 400 - 256 = 144.

Step 3. Take the square root, keeping both signs since (a−b)2=144(a-b)^2=144 has two real roots: a−b=±12a - b = \pm 12, labelled (III).

Step 4. Solve (I) and (III) together. Taking a−b=12a-b=12 with a+b=20a+b=20 gives 2a=32⇒a=16,b=42a=32 \Rightarrow a=16, b=4; taking a−b=−12a-b=-12 gives a=4,b=16a=4, b=16 instead — the same pair of numbers in the other order. Answer: the numbers are 44 and 1616 (in either order), and indeed 4+162=10\frac{4+16}{2}=10 and 4×16=8\sqrt{4 \times 16} = 8, confirming A=10≥G=8A=10 \ge G=8 as the A.M.–G.M. inequality demands.

Competitive level (JEE / NEET) - a functional equation hiding a geometric progression

A function ff satisfies f(x+y)=f(x)f(y)f(x+y) = f(x)f(y) for all x,y∈Nx, y \in \mathbb{N}, with f(1)=3f(1) = 3. If ∑x=1nf(x)=120\sum_{x=1}^{n} f(x) = 120, find the value of nn.

Step 1. Decode the functional equation. Setting y=1y=1 repeatedly, f(x+1)=f(x)f(1)=3f(x)f(x+1) = f(x)f(1) = 3f(x) — every term is exactly 33 times the one before it. That is precisely the defining property of a G.P. with common ratio r=f(1)=3r = f(1) = 3, and first term f(1)=3f(1) = 3. So f(1),f(2),f(3),…=3,9,27,…f(1), f(2), f(3), \ldots = 3, 9, 27, \ldots, i.e. f(x)=3xf(x) = 3^x.

Step 2. Recognise ∑x=1nf(x)\sum_{x=1}^n f(x) as the sum of the first nn terms of this G.P. and apply formula (5)(5) with a=3,r=3a=3, r=3: Sn=3(3n−1)3−1=3(3n−1)2S_n = \dfrac{3(3^n - 1)}{3-1} = \dfrac{3(3^n-1)}{2}.

Step 3. Set this equal to the given total and solve for nn: 3(3n−1)2=120⇒3(3n−1)=240⇒3n−1=80⇒3n=81\dfrac{3(3^n-1)}{2} = 120 \Rightarrow 3(3^n-1) = 240 \Rightarrow 3^n - 1 = 80 \Rightarrow 3^n = 81.

Step 4. Since 81=3481 = 3^4, and the exponential function 3n3^n is one-to-one (strictly increasing) for positive nn, this equation has exactly one solution. Answer: n=4n = 4. Timing note: under two minutes once the functional equation is decoded. The entire problem is a disguise — the moment f(x+1)=f(1)⋅f(x)f(x+1) = f(1)\cdot f(x) is spotted, it collapses into a completely ordinary G.P.-sum question. The trap is trying to solve the functional equation "from scratch" instead of testing the single substitution y=1y=1, which is the standard opening move for any equation of the form f(x+y)=f(x)f(y)f(x+y) = f(x)f(y).

Common traps

The most damaging slip in this chapter is applying the G.P. sum formula Sn=a(rn−1)r−1S_n = \frac{a(r^n-1)}{r-1} blindly when r=1r=1, where it divides by zero and is simply undefined — always check rr first and switch to Sn=naS_n = na if r=1r=1. A second very common error is testing the "constant ratio" condition using only the first two terms of a sequence and assuming it holds throughout; the definition requires ak+1/aka_{k+1}/a_k to equal the same rr for every consecutive pair, so a sequence like 2,4,9,18,…2, 4, 9, 18, \ldots (ratios 2,2.25,22, 2.25, 2) is not a G.P. even though its first ratio looks promising. Sign errors are frequent with a negative common ratio: if r<0r<0, then rn−1r^{n-1} alternates sign depending on whether nn is odd or even, so ana_n oscillates in sign, and forgetting this leads to wrong-signed answers in problems like Example 12's r=±4r=\pm4 case. Taking an even root (square root, fourth root, and so on) to solve for rr or for a mean routinely loses a valid solution — always keep both ±\pm roots until the problem's context (for example, "positive numbers only") rules one out. Students often confuse the arithmetic mean and geometric mean formulas under exam pressure, writing a+b\sqrt{a+b} or ab2\frac{ab}{2} instead of a+b2\frac{a+b}{2} and ab\sqrt{ab} — keeping the mnemonic "A.M. adds, then halves; G.M. multiplies, then roots" avoids this. Finally, the infinite-sum formula S∞=a1−rS_\infty = \frac{a}{1-r} is sometimes applied to a G.P. with ∣r∣≥1|r| \ge 1, where no finite sum exists at all — always check ∣r∣<1|r|<1 before reaching for it, and recall that finite-G.P. sums have no such restriction on rr.

You should be able to…

  • State the definition of a sequence as an ordered list (or function on N\mathbb{N}), and distinguish an explicit general-term formula from a recursive definition.
  • Translate between a series written in full and the same series written in sigma notation, in both directions.
  • Recall the A.P. formulas an=a+(n−1)da_n = a+(n-1)d and Sn=n2[2a+(n−1)d]S_n = \frac{n}{2}[2a+(n-1)d] from Class 10 well enough to use them inside a mixed A.P./G.P. problem.
  • Recognise a geometric progression by testing whether ak+1/aka_{k+1}/a_k is constant across every consecutive pair, not just the first two terms.
  • Write the general term an=arn−1a_n = ar^{n-1} of a G.P. and solve for any one of aa, rr, nn or ana_n given the other three.
  • Derive and correctly apply the sum-to-nn-terms formula for a G.P., choosing the right case at r=1r=1 versus r≠1r \neq 1.
  • State the condition ∣r∣<1|r|<1 for an infinite G.P. to have a sum, and compute S∞=a1−rS_\infty = \frac{a}{1-r} when it applies.
  • Compute the geometric mean ab\sqrt{ab} of two positive numbers, and insert nn geometric means between two given numbers.
  • Prove the inequality A≥GA \ge G from the single fact that a real square is non-negative, and use it to recover two numbers from their given A.M. and G.M.
  • State and apply the three special-series formulas for ∑k\sum k, ∑k2\sum k^2 and ∑k3\sum k^3, and explain how the telescoping-sum technique produces them.

Ask the tutor: Want to work through NCERT's four-number G.P.-detection problem — where a sum-of-squares inequality forces a,b,c,da,b,c,d into a geometric progression — using the same A.M.–G.M. proof technique step by step?

What exactly is the difference between a sequence and a series? I keep mixing them up.

A sequence is the ordered list of numbers itself, like 1,3,5,7,91, 3, 5, 7, 9 — you can point to its third term or its tenth term without doing any arithmetic. A series is what you get when you add the terms of a sequence together, like 1+3+5+7+91+3+5+7+9; the phrase "sum of the series" then refers to the single number that addition produces, here 2525. Every sequence has an associated series, but they are different objects: the sequence has terms at positions, the series has a running total. Sigma notation, ∑k=1nak\sum_{k=1}^{n} a_k, is simply a compact way to write the series belonging to the sequence aka_k.

Why does the sum-to-n-terms formula for a G.P. need two separate cases instead of one formula?

Because at r=1r=1 the standard formula Sn=a(rn−1)r−1S_n = \frac{a(r^n-1)}{r-1} divides by zero, which is not a small numerical glitch but a genuine breakdown — the algebra used to derive that formula (multiplying by rr and subtracting) relies on dividing by (1−r)(1-r) at the very last step, and that step is only valid when r≠1r \neq 1. When r=1r=1 the G.P. is just a constant sequence a,a,a,…a, a, a, \ldots, and its sum is found far more directly by simple multiplication, Sn=naS_n = na, with no subtraction trick needed at all. Both cases are equally "real" G.P.s; the formula just genuinely forks in two depending on whether the ratio is 11 or not.

Is the A.M. always bigger than the G.M., or can they ever be equal?

The arithmetic mean is always at least as large as the geometric mean for positive numbers, A≥GA \ge G, and the two become exactly equal in precisely one situation: when the two original numbers are themselves equal, a=ba=b. You can see this in the derivation above — the gap A−GA-G works out to (a−b)22\frac{(\sqrt a - \sqrt b)^2}{2}, and a square can only be zero when the thing being squared, a−b\sqrt a - \sqrt b, is itself zero. So as soon as a≠ba \neq b, no matter how close together they are, AA is strictly larger than GG; the geometric picture (radius versus chord in the semicircle figure) makes the same point visually.

When does an infinite geometric series actually have a sum, and why does the common ratio matter so much?

An infinite G.P. a+ar+ar2+⋯a + ar + ar^2 + \cdots has a finite sum only when ∣r∣<1|r| < 1, because only then do the terms arn−1ar^{n-1} shrink toward zero as nn grows, letting the running total settle down to the fixed value S∞=a1−rS_\infty = \frac{a}{1-r}. If ∣r∣≥1|r| \ge 1, the terms either stay the same size or grow, so the running total either grows without any bound (for r≥1r \ge 1) or oscillates forever without settling (for r≤−1r \le -1) — in both cases there is simply no single number the sum approaches, so S∞S_\infty does not exist. Always check ∣r∣<1|r|<1 before writing down the infinite-sum formula; it is the one condition every exam question testing this idea is designed to make you verify.

My problem gives me three numbers in G.P. and asks about them also being related to an A.P. — how do I even start?

This is a very common competitive-exam pattern, and this chapter's own miscellaneous problems include one just like it (three numbers summing to a fixed total form a G.P., but subtracting fixed constants from them in order produces an A.P.). The reliable method is to name the G.P. terms symmetrically as ar,a,ar\frac{a}{r}, a, ar (rather than a,ar,ar2a, ar, ar^2) — this makes the product of the three terms simply a3a^3, which usually simplifies the algebra dramatically when a product is given. Write the G.P. sum condition and the A.P. condition as two separate equations in aa and rr, use the product (or sum) condition to pin down aa first, and then solve the remaining equation for rr — exactly the structure used in NCERT Example 9, where the three G.P. terms ar,a,ar\frac{a}{r}, a, ar summing to 1312\frac{13}{12} with product −1-1 pins down a=−1a=-1 immediately, before rr is found from a quadratic.

Before this

Where this leads