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...

What Is an Isomorphism? In mathematics, an isomorphism is a function that shows two mathematical objects have the same structure. Although the objects may look different, an isomorphism demonstrates that they behave in exactly the same way with respect to the operations that define them. If such a map exists, the objects are called isomorphic . An isomorphism tells us that two systems are essentially the same, differing only by a relabelling of their elements. The Basic Idea An isomorphism is a function: f : A → B that must be: Injective — different elements of A map to different elements of B. Surjective — every element of B comes from some element of A. Together these mean f is bijective , and so it has an inverse: f⁻¹ : B → A No information is lost moving from A to B or back. Preserving Structure Bijectivity alone is not enough. An isomorphism must also preserve structure. For groups, this means: f(a ⋆ b) = f(a) ∘ f(b) for all a, b ∈ A ,...

Proof by Induction: The Sum of Squares Formula Theorem. For any integer n ≥ 1, ∑ i=1 n i² = (1/6)·n·(n+1)·(2n+1) Proof (by mathematical induction) 1. Basis Step For n = 1: LHS = 1² = 1 RHS = (1/6)·1·(1+1)·(2·1+1) = (1/6)·1·2·3 = 1 Therefore, the formula holds for n = 1. 2. Inductive Hypothesis Assume the statement is true for some integer k ≥ 1: ∑(i=1→k) i² = (1/6)·k·(k+1)·(2k+1) 3. Inductive Step We must show it is true for n = k + 1: ∑(i=1→k+1) i² = [∑(i=1→k) i²] + (k+1)² = (1/6)·k·(k+1)·(2k+1) + (k+1)² = (1/6)(k+1)[k(2k+1) + 6(k+1)] = (1/6)(k+1)[2k² + 7k + 6] = (1/6)(k+1)(k+2)(2k+3) This matches the same form with k replaced by k+1: (1/6)·(k+1)·((k+1)+1)·(2(k+1)+1) Hence, the formula holds for n = k + 1. 4. Conclusion Since the statement is true for n = 1 (basis step), and true for n = k + 1 whenever it is true for n = k (inductive step), it follows by the principle of mathematical induction that ∑(i=1→n) i² = (1/6)·n·(n+1)·(2n+1) for al...

The Maclaurin Series — A Clean Derivation Many smooth functions can be written as an infinite polynomial. When this expansion is centred at x = 0 , we obtain the Maclaurin series . This article derives the Maclaurin formula directly from repeated differentiation, showing precisely why the coefficients involve derivatives and factorials. 1) Begin with a General Power Series Suppose a function f(x) can be expressed as f(x) = a₀ + a₁x + a₂x² + a₃x³ + … + aᵣxʳ + … The constants aᵣ are real coefficients whose values we wish to determine. 2) Evaluate at x = 0 f(0) = a₀ so a₀ = f(0). 3) Differentiate Once f′(x) = a₁ + 2a₂x + 3a₃x² + … + r·aᵣxʳ⁻¹ + … Setting x = 0 eliminates all higher powers: f′(0) = a₁. Thus, a₁ = f′(0). 4) Differentiate Again f″(x) = 2·1·a₂ + 3·2·a₃x + … + r(r−1)aᵣxʳ⁻² + … Evaluate at x = 0 : f″(0) = 2! · a₂ Hence a₂ = f″(0) / 2!. 5) The General Pattern Differentiate repeatedly. After r differentiations, a...

What Are Barycentric Coordinates? Barycentric coordinates provide a way to describe any point inside a triangle using the triangle’s own vertices as a reference. Instead of relying on the usual x–y axes, we express a point as a weighted combination of the three corners. The Core Idea Let a triangle have vertices A , B and C . Any point P inside (or on) the triangle can be written as P = αA + βB + γC The numbers α, β and γ are the barycentric coordinates of P. They indicate how strongly each vertex contributes to P. For this expression to make geometric sense, the three weights must satisfy α + β + γ = 1 This condition ensures that P behaves like a weighted average — a “blend” of A, B and C — rather than drifting away from the triangle. As long as all three values are non-negative ( α, β, γ ≥ 0 ), the point lies somewhere within the triangle. Examples α = 1 , β = γ = 0  →  P = A α = β = 0.5 , γ = 0  →  midpoint of AB α = ...

Injective, Surjective, and Bijective Functions In mathematics, a function describes how elements of one set are assigned to elements of another. Three important properties capture how completely and uniquely a function connects its domain to its codomain: injective , surjective , and bijective . These properties tell us whether different inputs can share the same output and whether every possible output is used. Injective (One-to-One) A function is injective if different inputs always produce different outputs. No two distinct elements in the domain are allowed to map to the same result in the codomain. Formally, a function f : A → B is injective if: f(a₁) = f(a₂) ⇒ a₁ = a₂ Equivalently, if a₁ ≠ a₂ , then f(a₁) ≠ f(a₂) . Example: f(x) = e x from ℝ → ℝ is injective. Different inputs produce different outputs, but not every real number is reached, so it is not surjective. Surjective (Onto) A function is surjective if every element of the codomain is reach...

What Is a Group in Mathematics? In abstract algebra, a group is a set G together with a binary operation (written as * ). The pair (G, *) is called a group when the operation satisfies the four conditions below. Closure: for all g₁, g₂ ∈ G , the product g₁ * g₂ is still in G . Identity: there exists an element e ∈ G such that for all g ∈ G , e * g = g * e = g . This element e is called the identity. Inverses: for each g ∈ G there exists an element g⁻¹ ∈ G such that g * g⁻¹ = g⁻¹ * g = e . Associativity: for all g₁, g₂, g₃ ∈ G , g₁ * (g₂ * g₃) = (g₁ * g₂) * g₃ . These four conditions are exactly what is required for (G, *) to be a group. Side note: Commutativity An operation is commutative if swapping the elements does not change the result: a * b = b * a . Commutativity is not required for a group to exist. It is important not to confuse commutativity with associativity . These are distinct i...

Function Composition: A Simple Way to Organise Your Mathematics Function composition is one of the most useful tools in mathematics. It allows us to combine several steps into a single process, keeping our work neat, organised, and easy to reuse. Rather than performing one operation after another by hand, composition lets us build those steps into a single function. Once you become comfortable with function composition, you never want to go back to doing everything manually. It reduces clutter, helps you work systematically, and allows you to achieve remarkable results with only a few lines of equations. What Is Function Composition? A function takes an input, performs an operation, and produces an output. Function composition takes this idea further: it links functions together so that the output of one becomes the input of the next. We write this as: (f ∘ g)(x) = f(g(x)) This means that g acts first, then f . The circle symbol ∘ simply means “do one funct...