Trace it. Derive it. Know it.
Every cluster below maps one schematic path — from first principles to the final equation. Expand a node to follow the full derivation trace.
Arithmetic Progression (A.P.): General Term, Gauss Pairing Sum S_n & Arithmetic Means
3 concepts · 8.1What structural properties define an A.P., how does Gauss pairing yield S_n, and what theorem governs the sum of n inserted A.M.s?
An Arithmetic Progression (A.P.) is a sequence of numbers in which each term after the first is obtained by adding a fixed constant called the Common Difference (d = T_n - T_(n-1)) to the preceding term. The General Term is given by T_n = a + (n - 1)d = d · n + (a - d), which proves that the n-th term of an A.P. is strictly a linear polynomial in n with leading coefficient equal to d. Sum to n terms is derived via Gauss's forward-backward pairing trick: writing S_n forwards and backwards and adding yields 2 S_n = n(a + l), giving S_n = n/2 [a + l] = n/2 [2a + (n - 1)d]. Notice that S_n is always a quadratic polynomial in n with ZERO constant term: S_n = A n^2 + B n, where the common difference d is exactly 2A. A single Arithmetic Mean (A.M.) between two numbers a and b is A = (a + b)/2. When n arithmetic means A_1, A_2, ..., A_n are inserted between a and b such that a, A_1, ..., A_n, b forms an A.P. of (n + 2) terms, the common step size is d = (b - a)/(n + 1). The k-th inserted mean is A_k = a + k · d. Crucially, the sum of all n inserted arithmetic means is identically equal to n times the single A.M. between a and b: sum_{k=1}^n A_k = n · (a + b)/2. Furthermore, in any finite A.P., the sum of terms equidistant from the beginning and end is invariant: T_k + T_(n-k+1) = a + l.
A.P. Definition, General Term T_n & Polynomial Signatures
T_n = a + (n-1)d. S_n = n/2 [2a + (n-1)d]. d = 2 · (coeff of n^2 in S_n).
Equidistant Symmetry & Symmetric Selection of Terms
T_k + T_(n-k+1) = a + l. 3 terms: a - d, a, a + d. 4 terms: a - 3d, a - d, a + d, a + 3d.
Insertion of n Arithmetic Means & Total Sum Theorem
d = (b - a)/(n + 1). A_k = a + k · d. Sum of n A.M.s = n · (a + b)/2.
Geometric Progression (G.P.): General Term, Finite/Infinite Sums & Geometric Means Insertion
3 concepts · 8.2How does exponential scaling define a G.P., when does an infinite G.P. converge to a/(1-r), and what theorem governs the product of n inserted G.M.s?
A Geometric Progression (G.P.) is a sequence in which each term is obtained by multiplying the preceding term by a fixed, non-zero constant called the Common Ratio (r = T_n / T_(n-1)). The General Term is given by T_n = a · r^(n - 1), representing discrete exponential growth (for |r| > 1), decay (for |r| < 1), or alternating oscillation (for r < 0). The finite sum to n terms is derived via the S - rS elimination trick: subtracting r · S_n from S_n causes all interior terms to cancel, leaving (1 - r) S_n = a(1 - r^n), hence S_n = a(1 - r^n)/(1 - r) = a(r^n - 1)/(r - 1) for r != 1. The Sum of an Infinite G.P. (S_infty): If and only if the common ratio satisfies |r| < 1 (-1 < r < 1), the power r^n approaches 0 as n -> infty. Thus, the infinite series converges to the clean closed form: S_infty = a / (1 - r). If |r| >= 1, the infinite series diverges. A single Geometric Mean (G.M.) between two positive numbers a and b is G = sqrt(ab). When n geometric means G_1, G_2, ..., G_n are inserted between positive numbers a and b such that a, G_1, ..., G_n, b forms a G.P. of (n + 2) terms, the common ratio is r = (b/a)^(1/(n + 1)). The k-th inserted mean is G_k = a · r^k = a · (b/a)^(k/(n + 1)). Crucially, the product of all n inserted geometric means equals the n-th power of the single G.M. between a and b: prod_{k=1}^n G_k = (sqrt(ab))^n = (ab)^(n/2) = G^n.
G.P. Definition, General Term T_n & Finite Sum S_n
T_n = a · r^(n-1). S_n = a(1 - r^n)/(1 - r) for r != 1. Derived via S - rS shift.
Infinite Geometric Series Convergence: S_infty = a / (1 - r)
S_infty = a / (1 - r) valid IF AND ONLY IF |r| < 1. If |r| >= 1, series diverges.
Insertion of n Geometric Means & Product Theorem
r = (b/a)^(1/(n+1)). G_k = a · r^k. Product of n G.M.s = (sqrt(ab))^n = G^n.
Harmonic Progression (H.P.) & The Grand Inequality A >= G >= H (G^2 = AH)
3 concepts · 8.3What is an H.P., why must all problems be solved via reciprocal A.P., and how does the AM-GM-HM inequality govern constrained optimization?
A Harmonic Progression (H.P.) is a sequence of non-zero numbers whose reciprocals form an Arithmetic Progression (A.P.): a_1, a_2, ..., a_n is in H.P. <=> 1/a_1, 1/a_2, ..., 1/a_n is in A.P. The general term is T_n = 1 / [a + (n - 1)d]. The Cardinal Rule of H.P. is that there is NO general formula for the sum of an H.P. All H.P. problems must be solved by taking reciprocals, operating entirely within A.P., and taking reciprocals of the final result. The Harmonic Mean (H.M.) between two positive numbers a and b is H = 2ab / (a + b). The Grand Mean Hierarchy: For any two positive, unequal real numbers a and b: (1) A, G, H form a Geometric Progression: G^2 = A · H <=> G = sqrt(A · H). (2) The Fundamental Inequality: A >= G >= H, with equality if and only if a = b. Quadratic with roots a and b: x^2 - 2Ax + G^2 = 0, yielding roots a, b = A +- sqrt(A^2 - G^2). The Generalized AM-GM Inequality: For any n positive real numbers x_1, x_2, ..., x_n, their Arithmetic Mean is always greater than or equal to their Geometric Mean: (x_1 + x_2 + ... + x_n)/n >= (x_1 · x_2 · ... · x_n)^(1/n), with equality iff x_1 = x_2 = ... = x_n. Weighted AM-GM: (m_1 x_1 + ... + m_k x_k)/(m_1 + ... + m_k) >= (x_1^m_1 ... x_k^m_k)^(1/sum m_i). This is the premier analytical technique in competitive mathematics for solving non-calculus minimum/maximum optimization problems.
Harmonic Progression & Harmonic Mean H = 2ab / (a + b)
a, b, c in H.P. <=> 1/a, 1/b, 1/c in A.P. H = 2ab / (a + b). No sum formula exists.
The Grand Mean Relation: A >= G >= H and G^2 = A · H
A, G, H form a G.P. (G^2 = AH). A >= G >= H with equality iff a = b.
The AM-GM Inequality in Optimization (Splitting Heuristic)
(x_1 + ... + x_n)/n >= (x_1 ... x_n)^(1/n) for x_i > 0. Equality iff all x_i equal.
Arithmetico-Geometric Progression (A.G.P.) & The S - rS Elimination Algorithm
3 concepts · 8.4What is an A.G.P., why must S_n be derived via the 4-step shift algorithm, and what closed form governs S_infty?
An Arithmetico-Geometric Progression (A.G.P.) is a sequence formed by multiplying corresponding terms of an Arithmetic Progression and a Geometric Progression. Its standard form is: a, (a + d)r, (a + 2d)r^2, (a + 3d)r^3, ..., [a + (n - 1)d]r^(n - 1). The general term is T_n = [a + (n - 1)d] r^(n - 1). Sum to n terms (S_n) is evaluated by the Universal 4-Step S - rS Shift Algorithm: Step 1: Write S_n in full. Step 2: Multiply S_n by common ratio r, and shift every term one position to the right. Step 3: Subtract r · S_n from S_n. The subtraction leaves the isolated initial term 'a', produces an interior pure Geometric Progression of (n - 1) terms with first term d · r and common ratio r, and leaves a trailing negative boundary term -[a + (n - 1)d] r^n. Step 4: Sum the interior G.P. and divide by (1 - r). Infinite A.G.P. Sum (S_infty): If and only if the common ratio satisfies |r| < 1, as n -> infty, both r^(n-1) and [a + (n-1)d] r^n vanish to 0. The infinite sum condenses into the elegant closed form: S_infty = a / (1 - r) + (d · r) / (1 - r)^2. In this master formula, the first component a/(1 - r) represents the sum of the pure G.P., while the second component (d · r)/(1 - r)^2 represents the incremental accumulation generated by the arithmetic common difference d.
A.G.P. Structure & The General Term T_n
T_n = [a + (n-1)d] r^(n-1). Formed by multiplying terms of A.P. and G.P.
The Master S - rS Right-Shift Subtraction Algorithm
Multiply by r, shift right, subtract: (1 - r)S_n = a + d r(1 - r^(n-1))/(1 - r) - [a+(n-1)d]r^n.
Infinite A.G.P. Sum: S_infty = a / (1 - r) + dr / (1 - r)^2
S_infty = a/(1 - r) + d · r / (1 - r)^2 for |r| < 1.
Sum of Special Sequences (sum n, sum n^2, sum n^3) & Method of Differences
3 concepts · 8.5What closed forms govern power sums of natural numbers, and how does the Method of Differences resolve non-standard sequences?
This concept formalizes standard natural number power sums and difference-based polynomial fitting: (1) Standard Natural Number Power Sums: (A) Sum of First n Natural Numbers: S_1 = sum_{k=1}^n k = n(n + 1)/2 = C(n + 1, 2) (Triangular numbers). (B) Sum of Squares: S_2 = sum_{k=1}^n k^2 = n(n + 1)(2n + 1)/6. Derived algebraically via the telescoping identity (k + 1)^3 - k^3 = 3k^2 + 3k + 1. (C) Sum of Cubes: S_3 = sum_{k=1}^n k^3 = [n(n + 1)/2]^2 = (S_1)^2. Nicomachus' Theorem states that the sum of the first n cubes is identically equal to the square of the sum of the first n natural numbers. Even/Odd Square Sub-Sums: Sum of first n even squares = 2n(n + 1)(2n + 1)/3; Sum of first n odd squares = n(2n - 1)(2n + 1)/3. (2) The Method of Successive Differences: When a sequence T_1, T_2, ..., T_n is neither an A.P. nor a G.P., construct the sequence of first differences: Delta_k = T_(k+1) - T_k. (A) If Delta_k forms an A.P. with common difference d != 0, then T_n is a quadratic polynomial in n: T_n = a n^2 + b n + c. (B) If the second differences form an A.P., T_n is a cubic polynomial: T_n = a n^3 + b n^2 + c n + d. (C) If Delta_k forms a G.P. with common ratio r, T_n is exponential: T_n = a · r^(n-1) + b n + c. The general term is extracted via: T_n = T_1 + sum_{k=1}^{n-1} Delta_k. Once T_n is expressed as a polynomial in n, the series sum S_n = sum_{k=1}^n T_k is evaluated by distributing the sigma operator across the standard sums sum n^3, sum n^2, sum n, and sum 1.
Natural Number Power Sums: sum n, sum n^2, and sum n^3
sum n = n(n+1)/2. sum n^2 = n(n+1)(2n+1)/6. sum n^3 = [n(n+1)/2]^2 = (sum n)^2.
Even and Odd Square Sub-Sum Partitions
Even squares: 2n(n+1)(2n+1)/3. Odd squares: n(2n-1)(2n+1)/3.
The Method of Successive Differences for Polynomial Fitting
T_n = T_1 + sum_{k=1}^{n-1} Delta_k. If Delta_k in A.P., T_n is quadratic; if in G.P., T_n has r^(n-1).
Telescoping Series (V_n - V_(n-1) Method) & Partial Fraction Decomposition
3 concepts · 8.6How does the V_n - V_(n-1) difference method trigger domino cancellations, and how are multi-factor denominators decomposed?
The Telescoping Series Method (also known as the Method of Differences or V_n - V_(n-1) Method) is the most powerful general summation technique in advanced algebra. If the general term T_k of any series can be expressed as a difference of two consecutive evaluations of an auxiliary function V: T_k = V_k - V_(k - 1) (or V_(k-1) - V_k), then when the series S_n = sum_{k=1}^n T_k is summed, an instantaneous domino cancellation occurs where all intermediate terms extinguish each other: S_n = (V_1 - V_0) + (V_2 - V_1) + ... + (V_n - V_(n-1)) = V_n - V_0. Only the extreme boundary terms survive. For an infinite series, S_infty = lim_{n -> infty} V_n - V_0. Canonical Telescoping Archetypes: (1) Partial Fractions with 2 Factors: 1 / [n(n + 1)] = 1/n - 1/(n + 1). Sum S_n = 1 - 1/(n + 1) = n/(n + 1), and S_infty = 1. (2) Multi-Factor Partial Fractions: In 1 / [n(n + 1)(n + 2)], the difference between the extreme outer factors is (n + 2) - n = 2. Multiplying and dividing by 2 yields: T_k = (1/2) [ 1 / (k(k+1)) - 1 / ((k+1)(k+2)) ]. Telescoping yields: S_n = (1/2) [ 1/(1 · 2) - 1/((n+1)(n+2)) ] = 1/4 - 1 / [2(n+1)(n+2)], giving S_infty = 1/4. General Rule for m consecutive factors: T_k = [1 / ((m - 1)d)] [ 1 / (first m - 1 factors) - 1 / (last m - 1 factors) ]. (3) Radical Telescoping: In 1 / [sqrt(k) + sqrt(k + 1)], rationalizing gives sqrt(k + 1) - sqrt(k), yielding S_n = sqrt(n + 1) - 1. (4) Factorial Telescoping: k · k! = [(k + 1) - 1] k! = (k + 1)! - k!, yielding sum k · k! = (n + 1)! - 1.
The Telescoping Mechanism & Boundary Survival Law
If T_k = V_k - V_(k-1), sum_{k=1}^n T_k = V_n - V_0. S_infty = lim V_n - V_0.
Partial Fractions Splitting for Multi-Factor Denominators
1/[k(k+1)...(k+m)] = [1/(m·d)] [ 1/(first m factors) - 1/(last m factors) ].
Radical & Factorial Telescoping Archetypes
1/(sqrt(k) + sqrt(k+1)) = sqrt(k+1) - sqrt(k). k · k! = (k+1)! - k!.