Mike Breault

Intellectually Curious

Science EN ↓ 2000 episodes

Intellectually Curious is a podcast by Mike Breault featuring over 1,800 AI-powered explorations across science, mathematics, philosophy, and personal growth. Each short-form episode is generated, refined, and published with the help of large language models—turning curiosity into an ongoing audio encyclopedia. Designed for anyone who loves learning, it offers quick dives into everything from combinatorics and cryptography to systems thinking and psychology. Inspiration for this podcast: "Muad'Dib learned rapidly because his first training was in how to learn. And the first lesson of all was t...

Author

Mike Breault

Category

Science

Latest episode

Jul 10, 2026

Where to listen?

Podcasts in the app Replaio Radio Coming soon

Podcasts are coming to the app soon. Install now and be the first to see a whole new take on podcasts

Get it on Google Play Install for free Android 5M+ downloads · 4.8 rating iOS soon

Episodes

MCP Unchained: Cursor's Model Context Protocol for a Smarter AI Partner 26.04.2025

We dive into Cursor's MCP, a plugin-like protocol that lets AI see your whole project—databases, Notion docs, GitHub workflows—through SDTO and SSE servers. Learn why this matters, how to set up JSON configs, and how MCP turns your AI from a code generator into an integrated, context-aware teammate. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-chec...

OEIS A000205: Representable integers by x^2 + 3y^2 up to 2n 26.04.2025

An exploration of A000205—the count of positive integers ≤ 2n that can be written as x^2 + 3y^2. We unpack the binary quadratic form x^2 + 3y^2, its discriminant -12, and why representability ties to modular criteria and prime-factor parity via Thue–Vinogradov methods. In particular, n is representable by x^2 + 3y^2 iff the exponent of 2 in n or 2n is even and every prime p ≡ 2 (mod 3) occurs to a...

Wormholes in Wood: The Wormhole Coffee Table 26.04.2025

A Deep Dive into Olivier Gomez’s segmented black walnut table—how meticulous woodworking creates a tangible interpretation of spacetime shortcuts, the real physics of wormholes, and where art meets cosmology. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information. Sponsored by Embersilk LLC

The Odd-Triangle Puzzle: Minsky's Theorem and the Two-Adic Twist 25.04.2025

Can a square be dissected into an odd number of equal-area triangles? In this episode of The Deep Dive, we trace Fred Richmond's 1965 challenge, Paul Minsky's 1970 resolution, and the surprising blend of geometry, number theory, and combinatorics—using p-adic absolute values and Sperner's lemma—to prove the puzzle impossible. Note:   This podcast was AI-generated, and sometimes AI c...

OEIS A000204: Lucas numbers 25.04.2025

In this episode we dive into OEIS A000204, the Lucas numbers, starting with L1 = 1 and L2 = 3 and obeying L_n = L_{n-1} + L_{n-2}. They’re Fibonacci’s close cousins, sharing a recurrence but with a different seed. We explore their rich connections: identities with Fibonacci numbers (for example, L_n = F_{n-1} + F_{n+1}), and the closed form L_n = φ^n + ψ^n with φ = (1+√5)/2 and ψ = (1−√5)/2. We’ll...

OEIS A000203: Sum of divisors 25.04.2025

Sigma(n) is the sum of all positive divisors of n (including 1 and n itself). It is multiplicative: if gcd(a,b)=1 then sigma(ab)=sigma(a)sigma(b), and for a prime power p^a we have sigma(p^a)=1+p+p^2+...+p^a=(p^{a+1}-1)/(p-1). Thus sigma(n) for any n with prime factorization n=∏p_i^{a_i} is the product sigma(n)=∏(p_i^{a_i+1}-1)/(p_i-1). We'll walk through examples like n=6 (sigma=12) and n=12...

Brinell Hardness Unveiled: Indenters, Dwell Time, and HBW 23.04.2025

A Science Corner deep dive into the Brinell hardness test. Learn how a tungsten carbide ball indenter, a controlled dwell period, and careful indentation measurements produce the HBW value, how scales like HBW 103000 are reported, and why Brinell shines for inhomogeneous metals. We’ll also touch on ASTM E1015, equipment types A and B, and practical tips for accurate testing. Note:   This podcast w...

Captain of the Attack: Mastering Bowling in Cricket 23.04.2025

A Deep Dive into how captains orchestrate bowlers across formats—from new-ball swing to death overs, field settings to data-driven matchups. We explore conditions, ball types, workload management, and the human gut that guides decisions in real time, revealing the captain as the central strategist of the bowling attack. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Pl...

Discriminative vs Generative Models: The Two Lenses of AI 23.04.2025

In this Science Corner episode, a Nobel laureate guides us through the core distinction between discriminative models (learning P(Y|X) to draw decision boundaries) and generative models (learning P(X,Y) to understand the data and even generate new samples). We explore classic and modern methods, intuition with spam filtering, trade-offs like data needs and training challenges, and when each approa...

Deep Dive: The Mujoko Fly—Biology, Simulation, and Reinforcement Learning 23.04.2025

A concise, accessible tour of the Mujoko-based fruit fly model (Flybody) from Google DeepMind and Janelia Research Campus. We explore how anatomically detailed physics drives reinforcement learning for flight and walking, vision-guided tasks, and how these building blocks could inform robotics and embodied AI. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please doubl...

OEIS A000202: Floor(13n/8) with a recursive seed and Fibonacci connections 23.04.2025

In this episode we unpack A000202: a sequence defined from its first eight terms by the recurrence a_{i+j} = 13i + a_j, which yields the closed form a_n = floor(13n/8). We explore how such a simple rule builds an integer sequence, its linear recurrence signature, and a surprising link to Fibonacci numbers. We also touch on historical context (Sloan's Handbook, Fibonacci Quarterly), how it dif...

Pilidar Deep Dive: Open-Source 360° 3D Scanning from LiDAR to Point Cloud 23.04.2025

A Science Corner breakdown of the Pilidar DIY project: a Raspberry Pi–based, open-source 360° scanner. We explore how LiDAR distance data, panoramic imaging, and color-aware fusion create textured 3D scenes, using Open3D and Hugin to stitch and visualize the results—without getting lost in the math. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any...

AI at Scale: Energy, Compute, and the ARC Breakthrough 23.04.2025

We unpack the ARC challenge and OpenAI's O3, examine the staggering compute costs behind giant AI systems, and explore how scaling laws, data-center power, and chip manufacturing intersect with nuclear-powered ambitions and thermodynamics. A hard look at how infrastructure—and energy—might shape the future of AI and society. Note:   This podcast was AI-generated, and sometimes AI can make mis...

The Hidden Complexity of Booking a Flight 22.04.2025

In this Deep Dive, we pull back the curtain on online flight pricing—from routes and fare components to priceable units and airline inventory. We explore why computing the cheapest itinerary is NP-hard (and sometimes EXP-space hard in theory), how search is pruned with heuristics and caching, and how these ideas connect to prompt engineering. Note:   This podcast was AI-generated, and sometimes AI...

Within-Subjects Design: Repeated Measures in Math Research 22.04.2025

A clear, practical tour of within-subjects design—where the same participants experience all conditions or are measured repeatedly over time. We explore the core idea, key advantages like controlling individual differences and higher statistical power, the main challenges such as carryover effects and how counterbalancing helps, and the analytical tools—repeated measures ANOVA and linear mixed mod...

Alchemy: From Ancient Transformations to Modern Science 21.04.2025

An accessible tour of alchemy’s history, ideas, and legacy. From Egypt and Greco-Roman Alexandria through the Islamic and Indian worlds to medieval Europe and the birth of modern chemistry, we explore how alchemy blended craft, philosophy, and experimentation—and why it mattered for scientists like Newton and Boyle. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please...

Remembering with Science: Ebbinghaus, the Forgetting Curve, and Spaced Repetition 21.04.2025

A Science Corner deep dive into Hermann Ebbinghaus's pioneering memory experiments. We unpack the forgetting curve, the savings method, and the spacing effect—and discuss what these ideas mean for practical, effective learning today. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information. Sponsored by Embersilk LLC

Faxian: The Monk Who Walked from China to India 21.04.2025

In The Deep Dive, we follow Faxian, a Chinese Buddhist monk who, around age 60, set out on foot from Chang’an to India and back in the late 4th–early 5th century. His decade in India, his quest for a complete Vinaya, and the Sanskrit texts he gathered push the boundaries of our understanding of early Buddhism. We’ll explore his observations of Hinayana and Mahayana, his encounters with Buddhist ce...

OEIS A000200: Number of bicentered hydrocarbons with N atoms 21.04.2025

In this episode we explore OEIS A000200, the sequence that counts bicentered hydrocarbons with N carbon atoms. We explain bicentered meaning two shared carbon atoms (bridgeheads) in a two-ring system, distinguishing fused and bridged bicyclic skeletons while excluding spiro structures. We'll show how the bicyclo[a.b.c] naming encodes three carbon bridges between the bridgeheads and how the to...

OEIS A000201: Lower Wythoff sequence 21.04.2025

In this Deep Dive we unpack A000201—the lower Wythoff (Beatty) sequence. Defined by a(n) = floor(n·φ) with φ = (1 + √5)/2, it forms a companion pair with the upper Wythoff sequence b(n) = floor(n·φ²) (the “complementary” sequence). We explore how these two Beatty sequences partition the positive integers, why φ is the magic constant, and how the two lists up to infinity (1, 3, 4, 6, 8, …) and (2,...

The Ultimate Org Chart: A Deep Dive into Biological Taxonomy 19.04.2025

We explore how biologists turn the messy diversity of life into a coherent map. Starting with Linnaeus's hierarchical system and binomial names, through Darwin's evolution, to cladistics and DNA-based phylogenies, and finally the naming codes and debates over ranks. A clear, engaging tour of how taxonomy shapes biology. Note:   This podcast was AI-generated, and sometimes AI can make mis...

Goldbach's Conjecture: The Additive–Multiplicative Bridge 19.04.2025

In this Deep Dive we unpack the deceptively simple claim that every even number greater than 2 is the sum of two primes. We explore why the problem sits at the crossroads of addition and multiplication, how tools like the circle method and sieve theory struggle with the parity barrier, and what that means for a full proof. Along the way we trace key milestones—from Helfgott’s work on the weak Gold...

Cosines Unlocked: Generalizing Pythagoras and Solving Any Triangle 19.04.2025

A Deep Dive into the law of cosines: how it generalizes Pythagoras, how to use it to find sides or angles in any triangle, and the tricky ambiguous case. We’ll cover practical computation notes like round-off error, and uncover the long history—from Euclid’s Elements to medieval mathematicians and modern proofs—showing how this single formula connects geometry, algebra, and trigonometry. Note:   T...

OEIS A000199: Coefficients of Ramanujan's FQ mock theta function 19.04.2025

Join us as we trace the history of Ramanujan's mock theta functions, explain what A000199 captures—the odd-power coefficients in the FQ series—and survey the modern theory of mock modular forms, including shadows and indefinite theta series, plus surprising connections to knot invariants and black-hole entropy in string theory. Note:   This podcast was AI-generated, and sometimes AI can make...

OEIS A000197: Double factorial sequence 18.04.2025

Meet A000197, the double factorial sequence a(n) = n!!. Defined by a(0) = a(1) = 1 and a(n) = n · a(n−2), it splits into elegant even/odd cases with closed forms: for even n, a(n) = 2^{n/2} · (n/2)!; for odd n, a(n) = n! / (2^{(n−1)/2} · ((n−1)/2)!). This single rule drives hyper-exponential growth and yields rich structure: rapid size, 2-adic divisibility patterns, and the fact that the largest p...

Listen to the Intellectually Curious podcast in Replaio

Radio and podcasts in one app - free, with no sign-up. Install today and do not miss the launch

Get it on Google Play

Replaio is not a podcast publisher; show names, artwork and audio belong to their authors and are distributed through public RSS feeds.