Gauss's pairing trick, and why it generalises

What to assume they know

• A fixed step between neighbours is the whole definition — the general form of an AP and what the multiplier on the step counts
• Building the rule for the nth term out of repeated addition — the nth-term rule, since the last entry of the sum is written using it
• Collecting like terms and simplifying an expression containing a bracket
• That addition can be reordered and regrouped freely

What they should be able to do

• Reproduce Gauss's argument for the whole numbers from 1 to 100 and explain what each of its two lines does
• Explain why the paired totals in that argument are all equal, in terms of one number rising while the other falls by the same amount
• Carry the identical construction out on a general AP written as a, a + d, a + 2d, …
• Show that the kth column of the stacked rows simplifies to a single expression free of k
• Derive the sum of the first n entries of an AP from the doubled sum, and say where the division by two comes from
• State exactly which property of the list the derivation depends on, and give a list for which it fails
• Apply the derived formula to a situation stated in words

Where it usually goes wrong

• "The trick works because 1 and 100 happen to add to 101." They do, but so do 2 and 99, and 3 and 98, and every other pair — because each step forward is matched by a step back of the same size. It is the matching that does the work, not the arithmetic of one pair.
• "You can pair the first with the last for any list." You can pair anything; what you cannot generally do is get the same total every time. The rabbit list shows the columns wandering.
• "The formula only works when the number of entries is even." Pairing language suggests it might, but the derivation never pairs entries with each other — it stacks two full copies of the list, so an odd count is no obstacle. The 100-entry case and a 21-entry case both work, and 21 is odd.
• "S is the last term." S is the running total of everything up to and including position n. Students routinely substitute a sum where a term belongs.
• "The division by two is a rule." It is the reverse of having written the total down twice. Say so, and it stops being a rule to forget.
• "Gauss discovered the formula." The chapter presents a schoolroom anecdote about one calculation. What the section then does — generalising the method to every AP — is the mathematics; the anecdote is the way in.

Questions to check understanding

• Sum a stated number of terms of a given AP
• Sum a described series of payments, savings or penalties over a fixed period
• Show that a stated total is correct by adding a short AP directly and then by formula, and compare
• Explain in words why writing a sum in reverse and adding is legitimate
• Sum the first n whole numbers, or the first n multiples of a given number
• Given a real total and a stated number of terms, work backwards to a missing input — the direction the next topic develops

Examples worth working on the board

Inputs only. Values marked verified are worked out here on the chapter's printed data.

• The money box, restated as a summing problem (§5.4, p. 63). ₹100 goes in on the first birthday and the deposit rises by ₹50 every year; the question asks what the box holds by the twenty-first birthday. The chapter is explicit that writing out twenty-one numbers and adding them is possible but tedious, which is the motivation for everything that follows.
• Gauss's problem (§5.4, p. 63). Add the whole numbers from 1 up to 100. The chapter says the answer, 5050, was given immediately, then reconstructs the method: the total written forwards, the same total written backwards, and the two added. Verified: each stacked pair comes to 101, there are 100 of them, so twice the total is 10100 and the total is 5050.
• Why the pairs agree — the argument to make explicit. Step one place along the forward row and the entry rises by d; the same step along the reversed row drops the entry by d, because the reversed row runs the other way. The two changes cancel, so the column total never moves. This reasoning is added here. The chapter displays the outcome — every bracket in its stacked line is identical — without spelling out why. Section 5 exists to supply the reason, because without it the trick is a coincidence a student cannot re-derive.
• The same thing in symbols (§5.4, p. 64). The chapter writes the total of the first n entries as its equation (1), the reversed total as its equation (2), and adds them term by term. The result is a run of identical brackets with an underbrace beneath it reading n times, giving twice the total as n[2a + (n − 1)d]. Verified as algebra: the kth column takes a + (k − 1)d from the forward row and a + (n − k)d from the reversed row, and those add to 2a + (n − 1)d — an expression with no k left in it, which is precisely the claim that every column is the same.
• The halving step (p. 64). Because the stacking produced two copies of the total, the final division by two is the undoing of that doubling and nothing more.
• The counter-case to keep the hypothesis visible. Apply the same stacking to the chapter's rabbit list 1, 1, 2, 3, 5, 8 (Fig. 5.3, p. 50). Verified: the columns come to 9, 6, 5, 5, 6, 9 — not one repeated value, so nothing can be factored out and the method yields no formula. Use this immediately after the derivation; it is the cheapest way to show what the constant step was doing.
• The money box, answered (§5.4, p. 65). Inputs a = 100, d = 50, n = 21. Verified: the doubled total is 21 × [200 + 20 × 50] = 21 × 1200, so the total is 12600.
• A sanity check worth showing. Applying the formula to the whole numbers 1 to 100, with a = 1, d = 1 and n = 100, verified: 100/2 × [2 + 99] = 50 × 101 = 5050. The general result reproduces the special case it was built from, which is the least a derivation should have to survive.

Figures to have open

• The two-row stack, with the forward AP on top and the reversed AP beneath, drawn so that columns are visibly aligned. This is the chapter's own display (p. 64) and it must be redrawn rather than reproduced — the alignment is the argument.
• A single-column close-up with the two opposing arrows of size d. Standard schematic and entirely not in the book; the chapter shows the equal brackets but draws no such picture.
• The underbrace panel from p. 64 — identical brackets under a brace labelled with the count. Verified on the printed page: the brace and its label are set beneath the run of brackets.
• Fig. 5.3, the rabbit diagram (p. 50), or just the six counts 1, 1, 2, 3, 5, 8 from it, for the counter-case. On the printed page the figure shows the six counts down its left edge and arrows spreading to pairs of drawn rabbits; only the counts are needed here.
• A twenty-one-slot bar for the money box, deposits rising by ₹50, with the total beneath. Standard schematic.

Where this sits in the book

• NCERT Mathematics, Textbook for Class X, Chapter 5 "Arithmetic Progressions", §5.4 Sum of First n Terms of an AP, pp. 63–65 up to the money-box computation
• The money box situation being reopened is stated in §5.1 item (v), p. 50; the rabbit list used as a counter-case is §5.1 item (vi) with Fig. 5.3, p. 50
• The chapter points back to its own Chapter 1 for who Gauss was; that is a cross-reference outside this chapter's pages and the explanation need not follow it
• The formula is restated as point 4 of the summary, §5.5, p. 72