Geometric Bites

Arithmetic and Geometric Sequences Arithmetic and geometric sequences are two fundamental types of numerical progressions. They describe how quantities grow or shrink by addition or by multiplication, and they form the foundation for topics such as series, summation formulas, and exponential growth. 1. Arithmetic Sequence An arithmetic sequence is a list of numbers in which each term differs from the previous one by a fixed amount called the common difference d . a, a + d, a + 2d, a + 3d, … , a + (n − 1)d a – first term d – common difference The n th term, denoted T n , is given by: T n = a + (n − 1)d Each new term is obtained by adding d to the previous term. The difference between consecutive terms remains constant: T k+1 − T k = d Example: If a = 4 and d = 3, the sequence is 4, 7, 10, 13, 16, … The 20th term is T 20 = 4 + (20 − 1)×3 = 61. 2. Geometric Sequence A geometric sequence is a list of numbers where each term is fo...

The Method of Differences — A Clean Proof of the Sum of Cubes The method of differences is a remarkably elegant tool for evaluating finite sums. When each term of a series can be written in the form f(r+1) − f(r) , the sum “collapses” — all interior terms cancel, leaving only a boundary expression. This behaviour is called a telescoping sum . 1) Telescoping Sums Assume the general term u r can be written as: u r = f(r+1) − f(r). Then the finite sum from r = 1 to r = n becomes: Σ u r = Σ ( f(r+1) − f(r) ). To see what happens, write out a few terms: u₁ = f(2) − f(1) u₂ = f(3) − f(2) u₃ = f(4) − f(3) ⋮ uₙ = f(n+1) − f(n) When these are added, everything cancels except the first and last pieces: Σ u r = f(n+1) − f(1). This is the essence of the method: interior structure disappears, leaving just the difference between the final and initial states. 2) A Classic Application — The Sum of Cubes We will use this technique to prove the well-known ...