Up until the 9th grade, I was terrible at math.
I did what every struggling student does: I tried to out-work the confusion. I would sit down and solve 50 practice problems in a row, hoping that through sheer brute force, the logic would eventually stick in my brain. It never did. If a test question looked slightly different than the practice problems, I would freeze.
The turning point happened when I stopped grinding and went back to the absolute basics. I realized a fundamental truth about human intelligence: Solving a high volume of easy problems does not build mathematical thinking. Solving a few very hard problems from first principles does.
Here is what school gets wrong about math, and how to actually build innovative thinking.
The Toolbox Fallacy
Most people think of math as a set of instructions. If you see problem A, use formula B.
But true mathematical thinking is not about memorizing instructions; it is about gathering mental tools. When a master carpenter looks at a broken chair, they don't look for a manual on how to fix that specific chair. They look at the structural failure, and then they look at their toolbox (hammers, saws, glue) to decide which tool solves the problem.
When I stopped trying to memorize formulas and started trying to understand why the formulas existed, my toolbox expanded. I stopped panicking when I saw a novel problem because I finally had the tools to dismantle it.
The Greatest Tool: Mathematical Induction
One of the greatest mental tools I ever acquired was Mathematical Induction.
In mathematics, induction is a way to prove that a statement is true for all natural numbers. You don't prove it for 1, then 2, then 3, all the way to infinity. Instead, you prove two things:
- The Base Case: The statement is true for the first number (n = 1).
- The Inductive Step: If the statement is true for n, then it must also be true for n + 1.
If you can prove those two things, you have essentially lined up an infinite row of dominoes, knocked the first one over, and proven that every single domino will eventually fall.
Induction vs. Computer Science (Recursion)
Understanding mathematical induction completely unlocked Computer Science for me. Specifically, it solved the hardest concept for junior programmers to grasp: Recursion.
Most programmers start by learning Loops (for-loops, while-loops). Looping is intuitive. It is how humans think: "Do this task 10 times and then stop."
But Recursion is a function that calls itself. To a beginner, this looks like an infinite paradox that will crash your computer. It feels unnatural.
But if you have the tool of Mathematical Induction in your toolbox, recursion suddenly makes perfect sense. A recursive function is just a programmatic implementation of an inductive proof!
- The Base Case: The condition where the function stops calling itself and returns a value.
- The Recursive Step: The function calling itself with a modified state (n - 1), assuming that the smaller version of the problem is already solved.
You cannot deeply understand recursion if you only understand loops. You can only understand recursion if you understand inductive thinking.
The Takeaway
If you are struggling to learn a complex topic (whether it is Calculus, React.js, or System Design), stop doing endless tutorials. Stop grinding out low-level practice problems.
Go all the way back to the foundation. Understand the philosophical "why" behind the first principles. Gather tools, not instructions. Once you build a strong foundation, the hard problems won't seem so hard anymore.