At first glance, it’s just a 2×2 grid. Four exponential numbers. No flashing lights, no smoke and mirrors. But hidden in that tiny setup is a mathematical riddle that’s resisted solution for nearly a century.
In this episode, we explore the Four Exponentials Conjecture, a quiet giant in the world of number theory. The idea is simple: if you pick two rationally independent numbers for your rows and two for your columns, and build exponentials from the combinations, at least one result must be transcendental—guaranteed.
That might sound like splitting hairs, but the implications are enormous. Proving this conjecture could unlock the deeper mysteries of exponential behavior, help us understand how "wild" numbers emerge, and even nudge open the gates to solving Schanuel’s Conjecture—one of math’s biggest unsolved problems.
We trace its origins from the 1940s to today’s cutting-edge attempts. You’ll hear how this compact problem bridges algebra, transcendence, and mathematical philosophy. Why can’t we trap all four numbers in the algebraic world? Why does this matter?
Because sometimes, proving one number is “weird enough” is all it takes to rewrite the rules.

June Huh wasn’t a math prodigy. He was a high school dropout who wanted to be a poet. But instead of writing verses, he found beauty in numbers—and ended up solving some of the hardest math problems in history. Huh cracked a 50-year-old puzzle in combinatorics, the math of patterns, arrangements, and hidden structures. His discoveries connect math to everything from AI to internet search engines, changing how we optimize systems and process information.
This episode explores how an outsider rewrote the rules of mathematics, proving that you don’t have to be a child genius to change the world. If you’ve ever struggled with math, this story might just make you see it in a whole new way.

What if geometry could guarantee a perfect shape—no matter how random your mess? Welcome to the world of the Happy Ending Problem, a mind-bending puzzle in combinatorial geometry that starts with just a handful of dots… and ends with a nearly century-old mystery still unsolved.
In this short documentary, we explore a charming-sounding problem with serious mathematical bite. Originally sparked by a group of Hungarian mathematicians in the 1930s—and rumored to have sparked a romance too—it asks: how many randomly placed points does it take to guarantee a convex polygon of a given size? We know the answer for small cases. But for larger shapes? It's still an open question.
We unravel why this simple-sounding puzzle hides deep complexity. From the ideas of Ramsey theory to breakthroughs in computational geometry, you'll hear how mathematicians—armed with clever algorithms and bold theory—keep pushing toward an answer.
At its heart, this is a story about inevitability: that in chaos, patterns will always emerge. Whether you're a math lover or just here for the beautiful strangeness of it all, you’ll find yourself hooked on the puzzle that promises a happy ending… but won’t tell us when.