Skip to main content

Posts

The Cubic Solution

Most of us remember the quadratic formula from secondary school algebra. If you hand a student any equation of the form a x^2 + b x + c = 0, they can immediately rattle off the solution using "negative b plus or minus the square root of b squared minus 4ac, all over 2a." It is compact, deterministic, and dependable. But what happens when you step up to degree three? For the general cubic equation, a x^3 + b x^2 + c*x + d = 0, is there an equivalent closed-form master formula? ​The answer is yes, though its history is full of mathematical intrigue, duels, and secrecy in 16th-century Italy involving Scipione del Ferro, Niccolò Tartaglia, and Gerolamo Cardano. Unlike the quadratic case, which relies on a simple completion of the square, solving the cubic requires a two-stage strategy: first, eliminating the quadratic term through a clever shift, and second, splitting the single unknown into two interacting variables that reveal a hidden quadratic equation underneath. Here is ho...

The Geometry of Approximation: The Historical Evolution of Gram-Schmidt Orthogonalization

Mathematics rarely evolves in a vacuum. Major algorithms are almost always born out of practical necessities, and the Gram-Schmidt orthogonalization process is no exception. Long before it became a standard undergraduate linear algebra exercise, the core philosophy of turning a set of messy, dependent vectors into a clean, orthogonal basis was driven by a single, persistent problem: how to find the best possible approximation of data and functions through the method of least squares. In the late eighteenth and early nineteenth centuries, giants like Pierre-Simon Laplace grappled with errors in astronomical observations and data fitting. When attempting to minimize sum-of-squares errors, implicit forms of orthogonalization naturally emerged. Although Laplace did not frame his work as an explicit vector-space algorithm—indeed, the modern concept of a vector space was decades away—his approach inherently relied on building orthogonal components to simplify calculations. These early pionee...

Building the Math Mentor Framework Together: What Are We Missing?

In my last post, we explored what happens when we apply Tim Ferriss’s Tribe of Mentors interview framework to the mathematics classroom. Adapting his 11 high-leverage questions gave us a great starting point for extracting actionable wisdom from master educators—focusing on real tools, resilient mindsets, and sustainable boundaries rather than vague platitudes. But as I’ve sat with that list and reflected on my own practice, I realized this framework is still very much in the developmental stage. The original Ferriss questions are heavily focused on personal optimization. However, whether I am managing a heavy theory course or facilitating a distinct, hands-on lab environment, the reality is that a math classroom is an ecosystem. It relies on shared struggle and dynamic relationships. To truly capture the wisdom of master math educators, I need your input. What else do we need to deconstruct, and how should we ask about it? Drafting the Missing Topics: Help Me Refine These Here are th...

The Tribe of Math Mentors: 11 Questions Every Educator Should Answer

It is easy to get caught up in the vague, existential questions of education: How do I become a better teacher? How do I make math engaging? How do I survive the burnout? But as author Tim Ferriss noted when writing his book Tribe of Mentors, "Life punishes the vague wish and rewards the specific ask." When Ferriss set out to deconstruct the habits of world-class performers, he didn’t ask them broad questions about "the secret to success." He engineered 11 highly specific questions designed to bypass rehearsed answers and force his subjects to share actionable, vulnerable, and unconventional insights. Recently, I started thinking about how perfectly this methodology translates to our world. What if we asked these exact types of questions to master math teachers? What if we used them to guide the next generation of educators? Here is my best thinking of what Ferriss’s Tribe of Mentors questionnaire looks like when translated into the context of the mathematics classr...

Beyond Taylor Series: The Magic and History of Padé Approximations

If you have ever taken a calculus class, you probably remember the Taylor series. It is the mathematical magic trick that lets you turn complicated functions—like sines, cosines, and exponentials—into simple, infinitely long polynomials. For centuries, it has been a cornerstone of numerical mathematics. But the Taylor series has a dark secret: it frequently breaks. If a function has a vertical asymptote (a pole) or if you move too far from your starting point, the Taylor series spirals out of control into infinity. It is strictly bounded by what mathematicians call a "radius of convergence." Enter the Padé approximation . Instead of using a single polynomial to estimate a function, a Padé approximant uses a fraction (a ratio of two polynomials). This simple structural change unlocks a profound level of mathematical power, allowing us to see past the limits of Taylor series and model complex, chaotic systems in modern physics and engineering. A Brief History: From Franc...

The Möbius Assassin: Sifting Primes over Morning Coffee

When you spend enough time looking at the structural foundations of mathematics, you start to appreciate the tools that do the heavy lifting behind the scenes. Today, I want to talk about one of those tools—a beautiful proof showing how the Möbius function acts as an elegant filter for prime numbers. If you are a multiplicative function, the Möbius function is the ultimate editor. Here is how it works, broken down piece by piece. The Cast of Characters Before we get to the proof, let's define the three main concepts at play. 1. Multiplicative Functions A function f(n) is "multiplicative" if it respects numbers that have no common factors. If "a" and "b" share no prime factors, then: f(a * b) = f(a) * f(b) Every integer is just a unique fingerprint of prime numbers multiplied together. Because our function is multiplicative, we don't need to evaluate it for every massive number to infinity; we only need to understand how it behaves for prime powers...

From Peasant Arithmetic to Modern Cryptography: The Hidden Magic of Halving and Doubling

As educators, one of our greatest challenges is humanizing mathematics. We often present mathematical operations as sterile, modern inventions delivered from on high, stripping away the messy, brilliant, human history behind them. Take multiplication, for example. Most of us learned the standard algorithm—stack the numbers, multiply the digits, carry the tens, add it all up. But what if there was a completely different way to multiply? A way that requires no memorization of times tables beyond multiplying and dividing by two? Enter the Russian Peasant Algorithm. It is a brilliant piece of historical arithmetic that seems like a parlor trick at first glance. But pull back the curtain, and you will find it is the exact same mathematical engine driving the encryption of your modern web browser. Let's break down how this centuries-old method builds a bridge straight into abstract algebra and computer science. The Algorithm: Halving and Doubling The rules of Russian Peasant Multiplicati...

Unlocking the Matrix: A Guide to Solving Systems of 3 Equations

    If you have ever felt like algebra is just moving letters around a page until a number falls out, solving systems of equations in three variables might seem like the ultimate boss battle. Instead of just dealing with x and y on a flat piece of paper, a third variable (like z, or in our case r, s, and t) brings the math into three-dimensional space. Every equation represents a flat plane, and solving the system means finding the exact 3D coordinate where all three planes intersect. But before we dive into a full 3x3 system, let's talk about what happens when the number of equations doesn't perfectly match the number of variables. The Goldilocks Problem: Too Many or Not Enough Equations? For a system to have a single, beautifully neat solution, you generally need exactly as many equations as you have variables. But what if the balance is off? Not Enough Equations (Underdetermined Systems): Let's say you have 3 variables but only 2 equations. This is like having two plane...

The Blueprint of Modern Analysis: Borel Sets, sigma-algebras, and Integration

Modern probability and advanced calculus rest on foundations much deeper than the simple integration rules taught in calculus. The transition from the classical Riemann integral to the robust  Lebesgue integral  requires redefining how we perceive "size" and how we classify subsets of a space. This post will trace the hierarchy of concepts that build modern analysis, moving from fundamental topology to the rigorous definition of a probability space. 1. The Foundation: Topology and Allowable Shapes Before we can calculate the "size" of something, we must define what we are allowed to work with. Topology  is the study of openness and proximity. On the real number line, the topology defines open intervals, like the set of all numbers x such that 0 < x < 1. Topology gives the space its "structure" regarding limits and continuity. In integration, we need a mathematical structure that is broader than just open inte...

Comparison: Variation of Parameters vs. Undetermined Coefficients

When solving non-homogeneous linear differential equations, finding the particular solution (often written as y_p) is the most critical step. You generally have two tools in your belt: the Method of Undetermined Coefficients and the Method of Variation of Parameters. While both aim for the same result, they operate on very different logic. Here is a breakdown of how they stack up. 1. Undetermined Coefficients: The "Educated Guess" This method is the "shortcut" of the differential equation world. It relies on the fact that for certain types of functions, the derivative looks remarkably like the original function.  * How it works: You assume y_p takes the same form as the non-homogeneous term g(x). If g(x) is an exponential like e^(2x), you guess A * e^(2x). If g(x) is sin(x), you guess A * cos(x) + B * sin(x).  * The Constraint: It only works if g(x) is a polynomial, exponential, sine/cosine, or a product/sum of these.  * The Big Pro: It is algebraically straightforw...

Why We Should Never Tell Students What They Can Tell Us

Why We Should Never Tell Students What They Can Tell Us A student-centered approach to deeper mathematical thinking There is a deceptively simple idea in teaching that can fundamentally reshape classroom practice: never say anything a student can say. This principle comes from Steve Reinhart’s article Never Say Anything a Kid Can Say! (2000), and it challenges teachers to resist the urge to explain, clarify, or summarize when students themselves are capable of doing that intellectual work. When we connect Reinhart’s insight with Robert Kaplinsky’s instructional reflection and Dan Finkel’s TEDx talk, Five Principles of Extraordinary Math Teaching , a coherent vision of student-centered learning emerges. In that vision, students are active sense-makers and communicators, and the teacher’s primary job is to design experiences that make student thinking visible. Lead with a question Dan Finkel argues that extraordinary math teaching begins with questions worth thinking about, not ...