While Arithmetic Progressions connect deeply with mean and median balance, Geometric Progressions and Special Series require understanding multiplicative steps, infinite decay limits, and algebraic telescoping. This logic-first guide deconstructs the first-principles behind GP formulas, the AM-GM optimization equalizer, and cascading series methods frequently tested on the CAT.
Understand the logic of taking (n - 1) multiplicative steps to reach the n-th term $ar^{n-1}$, and see why the sum formula cancels all intermediate terms.
Instead of memorizing formulas, think of a Geometric Progression as taking multiplicative 'steps' from the starting point a using a constant multiplier r.
Track the number of multiplications needed to reach each term from the start:
Term 1 (0 steps): $T_1 = a = a r^0$
Term 2 (1 step): $T_2 = a \times r = a r^1$
Term 3 (2 steps): $T_3 = (a r) \times r = a r^2$
Term 4 (3 steps): $T_4 = (a r^2) \times r = a r^3$
Notice the pattern: to reach Term 4, you take 3 steps. To reach Term n, you take n − 1 steps!
Why this matters in CAT: You can jump directly between any two terms without finding a first!
Problem: The 3rd term of a GP is 12 and the 7th term is 192. Find the common ratio r.
The Long Way: Solve equations $a r^2 = 12$ and $a r^6 = 192$.
The Logic Shortcut: From Term 3 to Term 7 is (7 − 3) = 4 steps!
Discover why infinite decay yields a finite sum S∞ = a / (1 - r), and master the first-principles physics of bouncing ball distance problems.
When the common ratio is a proper fraction (|r| < 1), each subsequent term shrinks toward zero. An infinite number of terms produces a precise, finite sum.
Recall the finite sum formula:
If $|r| < 1$ (for example, $r = 1/2$), what happens to $r^n$ as $n \to \infty$?
As $n$ grows infinitely large, $r^n$ vanishes completely ($r^n \to 0$)!
Substitute $r^n = 0$ directly into the sum formula:
Important CAT Condition: This formula ONLY holds when $|r| < 1$.
Derive AM ≥ GM from the non-negative square (√a - √b)² ≥ 0, and use the Equalizer Rule to find algebraic minimums and maximums without calculus.
The foundation of all algebra optimization in CAT rests on a simple geometric and algebraic truth: the square of any real number can never be negative.
For any positive real numbers $a$ and $b$, consider the square of their square-root difference:
A squared real value is always zero or positive.
Expanding the expression:
Add $2\sqrt{ab}$ to both sides:
Learn how to split terms symmetrically when variables have asymmetric exponents (e.g. minimizing 2x + y given x²y = 64).
If given a constraint like $x^2 y = 64$, you cannot simply set $2x = y$. The exponents in the product ($x^2$ and $y^1$) are unequal. To make AM-GM work, the variables must cancel out into a pure number in the Geometric Mean.
Look at the power of each variable in the given product constraint. Split the linear sum into as many equal sub-parts as the exponent dictates:
Break complex fractions and radical sums into partial differences to watch intermediate terms cancel out in a clean cascade.
Like an old-fashioned brass telescope that collapses into a single compact tube, a Telescoping Sum is a series where every intermediate term cancels with its neighbor, leaving only First − Last.
Find the sum of the series:
$$ S = \frac{1}{1 \times 2} + \frac{1}{2 \times 3} + \frac{1}{3 \times 4} + \dots + \frac{1}{99 \times 100} $$
Notice that the numerator (1) is the difference between the factors in the denominator:
Concrete Numerical Intuition:
So we can rewrite each term in the series as a difference of two fractions. Now proceed to Step 2 to expand the entire series and watch the cascade!
Substitute each term with its split difference:
Observe: $-1/2$ cancels with $+1/2$, $-1/3$ with $+1/3$, and so on!
A 100-term summation solved in two lines of pure logic.
Apply the shift-and-subtract technique to evaluate AGP series to infinity, and detect periodic cycles to evaluate high-index recurrent terms.
An AGP has coefficients in an AP and multipliers in a GP. Multiplying by x and shifting terms right by one position transforms the coefficients into pure 1s.
Find the sum to infinity of:
$$ S = 1 + 2x + 3x^2 + 4x^3 + \dots \quad (|x| < 1) $$
Multiply the entire series by $x$ and shift one slot to the right:
$$ \phantom{x}S = 1 + 2x + 3x^2 + 4x^3 + \dots $$
$$ xS = \phantom{1 + \;} 1x + 2x^2 + 3x^3 + \dots $$
Notice what happens to the coefficient differences $(2 - 1), (3 - 2), (4 - 3)$:
The right-hand side has converted into a pure infinite GP!
Since $1 + x + x^2 + \dots = \frac{1}{1 - x}$:
For instance, if $x = 1/2$, $S = \frac{1}{(1 - 1/2)^2} = \frac{1}{1/4} = \mathbf{4}$.
A dedicated question set for Progressions is currently being authored. In the meantime, test your baseline score on the full Diagnostic:
Don't have a novel-a-week reading habit? Learn the structural blueprint to master CAT Reading Comprehension, eliminate option traps, and score 99+%ile in VARC.
Discover 7 battle-tested GMAT preparation strategies to break past score plateaus, master logical problem decomposition across Quant, Verbal, and Data Insights, and reach an elite 705+ score.
Why feeling the OG is easy is actually a sign of success, and how to use the 'Easy' questions to fix your pacing.