Arithmetic-geometric series — common mistake

“Treating the expanding staircase (step height grows) as if only the length grew ignores the arithmetic part, a typical AGP error.”

Students often sum an AGP as if it were a pure GP, using S = a/(1-r). This omits the arithmetic factor d and yields a wrong answer. Always apply the r-multiplication-subtraction method or differentiate the GP sum to include the linear term.

Memory trick: AGP ≠ GP; include d term via r-multiply-subtract.

Means and inequalities

“When you blend different sized sugar cubes, the average weight (AM) never falls below the size-product average (GM).”

For any set of positive numbers, AM = Σx_i/n, GM = (Πx_i)^(1/n), HM = n/Σ(1/x_i). AM ≥ GM ≥ HM, with equality only if all numbers are equal. The trap is to apply the chain when a number is zero or negative; then GM or HM become undefined or the inequality reverses.

Memory trick: AM-GM-HM, big→small, equal only if all equal

Means and inequalities — common mistake

“A thermostat set for two rooms shows AM equals GM only when both rooms share the same temperature.”

A common slip is to write AM = GM for unequal numbers. The equality holds strictly when every term is equal; otherwise AM is strictly larger. Remember the condition before simplifying expressions.

Memory trick: AM=GM? Only when numbers identical.

Sum of special series

“Imagine writing 1,2,…,n in a line; the square of that length contains exactly 1³+2³+…+n³ dots.”

∑_(k=1)ⁿ k = n(n+1)/2, so ∑_(k=1)ⁿ k³ = [n(n+1)/2]². Meanwhile ∑_(k=1)ⁿ k² = n(n+1)(2n+1)/6. The trap is confusing the square-pyramidal formula with the cubic sum, or forgetting to square the triangular number.

Memory trick: Cubes = (Triangular)²; Squares = n(n+1)(2n+1)/6.

Sum of special series — common mistake

“Counting all squares on an n×n chessboard uses n(n+1)(2n+1)/6, not just the triangular number.”

The sum of squares formula is n(n+1)(2n+1)/6. A frequent error is replacing it by n(n+1)/2, which is only the sum of first n numbers. Ensure the (2n+1) term is present.

Memory trick: Squares: n·(n+1)·(2n+1)/6.

Telescoping series

“Unfolding a paper fan, each fold cancels the previous one, leaving only the first and last edges.”

If t_n can be written as f(n)−f(n+1), the series telescopes to f(1)−f(N+1). The trap is forgetting to decompose the term; without the difference the cancellation never occurs.

Memory trick: t_n = f(n)−f(n+1) → sum = f(1)−f(N+1).

Telescoping series — common mistake

“Peeling an onion layer by layer, if you skip a layer the sum won’t collapse—every term must be a difference.”

Missing the decomposition into a difference leads to a wrong answer, especially in infinite series where the limit of f(N) matters. Always verify t_n = f(n)−f(n+1) before summing.

Memory trick: Check term = Δf(n) before telescoping.

Relation between AM, GM of two numbers

“Mixing equal parts of milk and water, the average concentration never falls below the geometric mean of the two concentrations.”

For non-negative a,b, AM=(a+b)/2 and GM=√(ab) satisfy AM≥GM, equality only if a=b. The inequality requires a,b≥0; applying it with a negative number gives a false result.

Memory trick: AM≥GM – A always M ore than G

Relation between AM, GM of two numbers — common mistake

“Setting up a relay race, the distance between runners equals total distance divided by (runners + 1).”

To insert k arithmetic means between a and b, d=(b-a)/(k+1). For k geometric means, r=(b/a)^(1/(k+1)). The extra +1 is the common trap – using k alone gives wrong means.

Memory trick: Means + 1 gives spacing

AP sum: S_n = n/2 (2a + (n-1)d)

“Climbing a staircase where each step is 2 cm taller than the previous, the total rise after n steps equals the AP sum.”

The sum of n terms of an AP is n times the average of the first and last terms: Sₙ = n/2 (2a+(n-1)d). It follows by pairing term i with term n-i+1. A frequent mistake is writing n/2·2a+(n-1)d without parentheses, which changes the value.

AP sum: S_n = n/2 (2a + (n-1)d)

Memory trick: Average × count → n·(first+last)/2

GP sum: S_n = a(r^n - 1)/(r - 1)

“A ball bounces, each rebound reaching a fixed fraction of the previous height, forming a geometric series.”

S_n = a(rⁿ-1)/(r-1) for any r≠1, derived by multiplying the sum by r and subtracting. If r=1 the formula breaks (0/0); then S_n = n·a. Watch out for r=1.

GP sum: S_n = a(rⁿ - 1)/(r - 1)

Memory trick: r≠1 → use formula, else n·a

Infinite GP: S = a/(1 - r)

“Each successive resistor is half the previous one, so the total resistance approaches a finite limit.”

Infinite GP sum S = a/(1-r) only when |r|<1; otherwise the series diverges. Always test the convergence condition before applying the formula.

Infinite GP: S = a/(1 - r)

Memory trick: Converge only if |r|<1

Sum 1..n = n(n+1)/2

“If you number the seats in a half-filled theater from 1 to n, pairing seat 1 with n, 2 with n-1 each sums to n+1.”

Adding the first and last numbers gives the constant pair sum n+1; there are n/2 such pairs, and when n is odd the middle term (n+1)/2 is automatically counted, yielding S = n(n+1)/2. The trap is assuming n must be even and omitting the middle term.

Sum 1..n = n(n+1)/2

Memory trick: Gauss trick: (n+1)·n/2

Sum of squares = n(n+1)(2n+1)/6

“When you stack books of thickness 1 cm, 2 cm, …, n cm, the total height equals n(n+1)(2n+1)/6 cm.”

The sum of squares of the first n natural numbers is S = n(n+1)(2n+1)/6. It follows from telescoping (k+1)³−k³ = 3k²+3k+1. The formula works for integer n≥1 (S=0 for n=0) and cannot be applied to non-integers. In JEE problems, beware mixing it with Σk or Σk³ – the coefficients differ.

Sum of squares = n(n+1)(2n+1)/6

Memory trick: n·(n+1)·(2n+1) ÷ 6

AM >= GM >= HM

“A chef tasting three sauces finds the average flavor intensity (AM) never less than the multiplicative blend intensity (GM) and both exceed the harmonic blend (HM).”

For positive reals a₁…a_n, AM = Σa_i/n, GM = (Πa_i)^(1/n), HM = n/(Σ1/a_i). The chain AM ≥ GM ≥ HM holds with equality only if all a_i are equal. The full chain requires every a_i > 0; if any a_i = 0, HM is undefined and GM becomes 0, breaking the inequality.

AM >= GM >= HM

Memory trick: A > G > H, equal only if all equal

arithmetic progression vs geometric progression

“A staircase climbs with equal steps (AP) while a folding ladder doubles its length each time (GP).”

An AP adds a constant difference d, giving linear growth; a GP multiplies by a constant ratio r, giving exponential growth. Beware the special cases d=0 (constant AP) and r=1 (constant GP) which behave like each other.

Memory trick: Add d for AP, multiply r for GP.

finite series vs infinite series

“A bookshelf holds a fixed number of books (finite series); an endless stack of pages stays tidy only if each page gets shorter (|r|<1).”

A finite series always has a definite sum. An infinite series converges to a finite value only when its terms tend to zero fast enough; for a GP this requires |r|<1. Forgetting the |r|<1 condition makes the sum diverge.

Memory trick: Infinite GP sum = a/(1-r) only if |r|<1.

AM vs GM

“Mixing two drinks, the average taste (AM) is never less than the taste from multiplying their strengths (GM) unless both drinks are identical.”

For any set of non-negative real numbers, AM = (Σxi)/n and GM = (Πxi)^(1/n). By the AM-GM inequality, AM ≥ GM, with equality only if all xi are equal. The classic trap: applying the inequality when a term is negative (or GM becomes imaginary) is invalid – always check non-negativity first.

Memory trick: Add → bigger; Multiply → smaller; equal only when all equal.

Memory trick: Finite sum only if |r|<1.

Permutations versus combinations

“Choosing a lock code (order matters) versus picking team members (order irrelevant) captures permutations vs combinations.”

Permutations count ordered selections: P(n,r)=n!/(n-r)!. Combinations count unordered selections: C(n,r)=n!/[r!(n-r)!]. Note that P(n,r)=C(n,r)·r!. A typical error is using P when only C is required, inflating the answer.

Memory trick: Perm = Comb × r!

Permutations versus combinations — common mistake

“Confusing a race lineup (order changes result) with a group photo (order doesn’t) highlights the common mistake.”

When a problem asks for a selection where swapping members does not produce a new outcome, use combinations. Using nPr instead adds an extra factor of r! and gives a larger count. The trap appears especially in seating or grouping questions.

Memory trick: If swap changes answer → perm; else → comb

Fundamental principle of counting

“Choosing a pizza base (m ways) and a topping (n ways) gives m×n combos.”

If two choices are independent, each selection of the first can be paired with every selection of the second, so total ways = m·n. The trap: ensure the tasks truly have no overlap; if they influence each other you must not multiply.

Memory trick: AND → ×, OR → +

Fundamental principle of counting — common mistake

“Picking a shirt (m) and trousers (n) for an outfit illustrates the rule.”

When both items must be chosen, you multiply the counts; adding gives the number of either-or choices, which is wrong for a complete outfit. The classic slip is treating independent selections as mutually exclusive.

Memory trick: Both required → multiply

Arrangements with restrictions

“Four friends sit, with two best-friends insisting to be side-by-side.”

Treat the pair as a single block, giving (n-1)! arrangements, then multiply by 2! for their internal order. For ‘never together’, place the two in the gaps of the others: total – together. Trap: forgetting the 2! internal swaps of the block.

Memory trick: Together → block × internal!