- AP: = a+(n-1)d -- use (n-1), not n
- GP: = ar^(n-1), S = a
- Infinite GP: S = , converges only if |r|<1
- sum(k) = n
- sum() = n(n+1)
- sum() = [n]^2 = [sum(k)]^2
- AM >= GM >= HM; equality iff all equal
- AM*HM = for two positive numbers
- ) = 1/k - -- telescoping
- AGP: use S-rS technique
- Three in AP: assume a-d, a, a+d (sum = 3a)
- Three in GP: assume a/r, a, ar (product = )
- HP: convert to AP of reciprocals, no direct sum
- = => AP with d = 2A (no constant term!)
- = - S_(n-1) for n>=2; check =
- k*k! = (k+1)!-k! -- telescoping identity
- Rationalize: +sqrt(k+1)) = sqrt(k+1)-sqrt(k)
- x + k/x >= 2*sqrt(k) for x>0 (AM-GM)
- log converts GP to AP; exponential converts AP to GP
- Sum of first n odd numbers =
Part of ALG-03 — Sequences & Series (AP, GP, Special Series)
Rapid Revision Bullets
Want to generate AI summaries of your own documents? NoteTube turns PDFs, videos, and articles into study-ready summaries.
Sign up free to create your own