Intuition The ONE core idea
An arithmetic-geometric progression (AGP) is a list of numbers where every term is a counting number that grows slowly multiplied by a shrinking (or growing) power — like 1 , 2 × 2 1 , 3 × 4 1 , … The whole trick for adding them up is to make a shifted copy of the list and subtract, so the slow-growing part collapses into an easy pure-multiplication list we already know how to total.
This page builds — from absolute zero — every single symbol the parent note fires at you: n , ∑ , subscripts, a , d , r , powers, ∣ r ∣ , and the idea of a "limit as n → ∞ ".
Before any letters, look at what we are staring at.
Definition Sequence vs Series
A sequence is just an ordered list of numbers , one after another: 3 , 5 , 7 , 9 , …
A series is what you get when you add the members of a sequence: 3 + 5 + 7 + 9 + ⋯
The picture: a sequence is a row of dots on a number line; a series is the total height when you stack those dots into one bar.
Why the topic needs it: an AGP is a sequence , but the whole chapter is about its series — the running total. Keep the two words separate in your head or every formula below reads as noise.
n
n is a position counter : it says which term of the list we mean. n = 1 is the first term, n = 2 the second, and so on. It is always a whole number 1 , 2 , 3 , …
Picture: n is the house number on a street of terms. It points; it is not the value living there.
Intuition Why we need a letter for position
Without n you could only talk about specific terms ("the 4th one"). With n you can say one rule for all of them at once : "the n -th term is (something involving n )". That single sentence is what lets us write a formula instead of an endless list.
The letter k does the exact same job. We use k as the "moving" counter inside a sum and keep n for the final term, so the two never collide.
Definition Subscript notation
T n (read "T-sub-n") means the term sitting at position n . The small n below is the address; T is the box at that address.
S n means the sum of the first n terms — the running total after you have added n of them.
Worked example Reading a subscript
If the sequence is 2 , 4 , 6 , 8 , … then T 3 = 6 (position 3 holds a 6), and S 3 = 2 + 4 + 6 = 12 (add the first three).
Why the topic needs it: the parent's headline formula S n = ∑ ( a + ( k − 1 ) d ) r k − 1 is a subscript. Without knowing S n = "total of first n terms" the boxed result is unreadable.
T n is not S n
The trap: treating "the 5th term" and "the sum up to the 5th term" as the same thing. Fix: T = one box's value; S = the pile of boxes so far.
Definition Sigma notation
∑ k = 1 n ( expression in k )
means: start with k = 1 , plug it into the expression, then k = 2 , then k = 3 , … up to k = n , and add every result together . The ∑ is a capital Greek "S" for S um.
Read it out loud as a recipe:
k = 1 → bottom of the sign → your starting house number.
n → top of the sign → your last house number.
the expression → what to compute at each house.
Why the topic needs it: it is pure shorthand. Writing 1 + 2 x + 3 x 2 + ⋯ forever is impossible; ∑ k ≥ 1 k x k − 1 says it in one breath.
Definition Arithmetic Progression (AP)
An AP is a list where you add the same fixed number every step : a , a + d , a + 2 d , a + 3 d , …
== a == = the first term (where you start).
== d == = the common difference (the constant step you add each time).
The n -th term is a + ( n − 1 ) d — you took ( n − 1 ) steps of size d away from the start.
( n − 1 ) " and not "n "?
At the first term (n = 1 ) you have taken zero steps, so you want a + 0 ⋅ d . Since n − 1 = 0 when n = 1 , the "− 1 " makes the count line up. Look at the figure: the arrow count is always one less than the house number.
Why the topic needs it: a + ( n − 1 ) d is the "arithmetic coefficient" that rides on top of every AGP term. It grows in a straight line — this slowness is exactly why the series can still add up to a finite number.
Definition Geometric Progression (GP)
A GP is a list where you multiply by the same fixed number every step : b , b r , b r 2 , b r 3 , …
== r == = the common ratio (the number you multiply by each step).
r n − 1 means r multiplied by itself ( n − 1 ) times: r 0 = 1 , r 1 = r , r 2 = r ⋅ r , and so on.
r does, picture-first
If r > 1 each term is bigger than the last → the bars grow (explode).
If r = 1 every term is the same → a flat row.
If 0 < r < 1 each term is a fraction of the last → the bars shrink toward zero.
If r < 0 the terms flip sign each step (up, down, up, down), and their sizes still follow ∣ r ∣ .
The figure shows all these regimes side by side.
Why the topic needs it: the geometric part supplies the shrinking that lets an infinite pile stay finite — but only when the shrinking actually happens, i.e. when ∣ r ∣ < 1 (next section).
Definition Absolute value
∣ r ∣ means the ==distance of r from zero==, throwing away the sign. ∣3∣ = 3 and ∣ − 3∣ = 3 .
Picture: how far the point sits from 0 on the number line, always measured as a positive length.
Intuition Why the condition is
∣ r ∣ < 1 , not r < 1
We care whether the terms shrink in size , and size ignores sign. r = − 2 1 makes terms flip sign but they do shrink (∣ − 2 1 ∣ = 2 1 < 1 ). Meanwhile r = − 2 flips sign and grows (∣ − 2∣ = 2 > 1 ). Only ∣ r ∣ < 1 guarantees shrinking, so only then can an infinite AGP have a finite total.
Why the topic needs it: this single inequality is the gatekeeper for the whole "infinite sum" formula. Miss it and you'll happily write a finite answer for a series that actually blows up.
n → ∞
n → ∞ (read "n tends to infinity") means: let the number of terms keep growing without stopping , and ask what value the running total S n settles down toward.
Picture: watch the running-total bar. If it climbs but keeps getting closer and closer to one ceiling and never passes it, that ceiling is the limit — the "sum to infinity".
Intuition Slow-count loses to fast-shrink
In an AGP each term is ( a + ( n − 1 ) d ) × r n − 1 : a straight-line grower times a power that decays when ∣ r ∣ < 1 . Decay by repeated multiplication always outruns straight-line growth, so the terms → 0 fast enough that the pile stops rising. This is the whole justification for sums to infinity and connects to Limits: exponential vs polynomial growth .
Why the topic needs it: the parent gets its clean S ∞ = 1 − r a + ( 1 − r ) 2 d r by taking exactly this limit and letting the r n terms vanish.
This links straight to Power series and generating functions , where ∑ n x n − 1 = ( 1 − x ) 2 1 is the same object viewed as a function of x .
Recall Cover the answers — can you say each before revealing?
What is the difference between a sequence and a series? ::: A sequence is an ordered list of numbers; a series is their sum.
What does the index n point to? ::: The position of a term (its house number), always a whole number ≥ 1 .
What does S n mean (vs T n )? ::: S n = sum of the first n terms; T n = the single value at position n .
Unfold ∑ k = 1 3 ( 2 k − 1 ) . ::: 1 + 3 + 5 = 9 .
Give the n -th term of an AP with start a , step d . ::: a + ( n − 1 ) d .
Why is it ( n − 1 ) d and not n d ? ::: At n = 1 you've taken zero steps, and n − 1 = 0 makes that work.
What does r n − 1 compute, and what is r 0 ? ::: r multiplied by itself ( n − 1 ) times; r 0 = 1 .
Why is the infinite-sum condition ∣ r ∣ < 1 and not r < 1 ? ::: We need the size of terms to shrink; size ignores sign, and ∣ r ∣ < 1 guarantees shrinking.
What does "n → ∞ " ask? ::: What fixed value the running total S n settles toward as terms never stop.
Which grows faster for large n when ∣ r ∣ < 1 : ( a + ( n − 1 ) d ) or the decay of r n − 1 ? ::: The decay wins — repeated shrinking beats straight-line growth, so terms → 0 .