Intellectually Curious

Join us on a journey into the diabolical cube, a 3D puzzle built from six single-layer polycubes. We uncover its ancient history, the surprising 13 distinct solutions (mirror images included), and how computational geometry helps map the puzzle’s solution space. Along the way we connect the puzzle to real-world topics like computer graphics, robotics, and protein folding, showing how play can spar...

A beginner-friendly deep dive into molten salt reactors (MSRs): how they work, why fast and thorium-based designs matter, the safety and materials challenges, and what it would take to deploy MSRs for electricity and process heat. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information. Sponsored by Embersilk LLC

Join us as we unpack the offbeat physics stories that made 2024 shine. From champagne cork shockwaves and cicada pee jets to quantum escape rooms and AI-informed brews, we explore how physics shows up in everyday life—and what it might mean for the future. A playful tour through fluids, materials, and public science outreach—powered by curiosity and a bit of nerdy whimsy. Note:   This podcast was...

An accessible episode unpacking Schrödinger's cat, quantum superposition, the measurement problem, decoherence, and major interpretations like Copenhagen and many-worlds. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information. Sponsored by Embersilk LLC

Explore A000088, the OEIS entry counting unlabeled simple graphs on n nodes. We’ll trace the first terms (1, 1, 2, 4, 11, 34) and explain why the count grows so rapidly, roughly like 2^{n(n-1)/2} divided by n! as most graphs have no nontrivial automorphisms. We’ll glimpse how to derive connected graphs via the Euler transform and even see how the same sequence appears in counting equivalence class...

A STEM-minded deep dive into Hayden Pickering's take on algorithmic layout. We unpack incomplete grids, CSS nth-child tricks, and the push for semantic HTML and ARIA labeling, while weighing accessibility, ethics, and the practical trade-offs of utility-first CSS. Along the way we explore how computational thinking extends beyond the screen—from data visualization to real-world system design....

Join us as we unpack Google DeepMind's AlphaProof and AlphaGeometry 2, the first AI system to win a silver medal at the 2024 International Mathematical Olympiad. We explore how reinforcement learning, a Gemini-based language model, Lean translation, and AlphaZero-inspired search come together to tackle problems in algebra, number theory, and geometry—and how formal verification in Lean ensure...

A journey from 16th‑century German clock watches to today’s smartwatches, tracing how timepieces evolved from luxury status symbols to precise engineering. Drawing on highlights from Wikipedia and the Watches article, we cover key turning points: fusee and balance spring; escapements; jewel bearings; temperature compensation; chronometers; the wristwatch’s WWI rise; self-winding and shock resistan...

An exploration of A000087, counting unrooted, non-separable planar maps with a distinguished face. We trace the bijection with beta-1 trees, explain primitive and multi-edge-free maps, and show how internal tree structure encodes map features like two-face counts. We’ll also connect these maps to permutations via decomposable/indecomposable constructions and mesh patterns, and touch on application...

Join us as we explore polyominoes—edge-connected squares that spark rich combinatorics and computation. We’ll trace the journey from counting free, one‑sided, and fixed polyominoes with clever algorithms to tiling questions that are NP‑complete, meet the Conway criterion, and reveal surprising connections to puzzles and games like Tetris, Blokus, and spatial Sudoku. Note:   This podcast was AI-gen...

Join us for a high-level tour of logic programming, where facts and rules become a dialogue with the computer. We'll unpack head/body clauses, non-monotonic reasoning with negation as failure, and the distinction between representation and control that shapes algorithms. We'll skim major families—Prolog, Datalog, ASP—and extensions like CLP, ALP, ILP, and meta-logic where programs can re...

We explore A000086, the function counting residues x that satisfy x^2+x+1 ≡ 0 (mod n). We’ll unpack how this congruence behaves, including its equivalence (via a shift) to x^2+1 ≡ 0, its multiplicative nature, and the prime-power rules: for p=3, e=1 yields 1, while higher powers give 0; for primes p ≡ 1 (mod 3) the value is 2; for primes p ≡ 2 (mod 3) it’s 0. The pattern of 0 or powers of 2 hints...

A deep-dive into how Mahalanobis distance measures distance not just by coordinates but within the data's own landscape, using the covariance structure to account for correlations. We trace its origin from skull measurements to modern uses in clustering, anomaly detection, and fraud detection, and unpack the formula, intuition, and practical caveats—like the multivariate normal assumption and...

We explore A000085, the involution numbers that count self-inverse permutations on n elements. From the classic recursive rule a(n) = a(n-1) + (n-1)a(n-2) to a direct closed form, we’ll see how these numbers pop up in surprising corners of math. Along the way we’ll connect involutions to pairings and matchings in graphs, touch on their links to representation theory and Young tableaux, and discuss...

A friendly dive into Naive Bayes classifiers: what Bayes' theorem does, why the 'naive' independence assumption often works surprisingly well, and how Gaussian, Multinomial, and Bernoulli variants fit different data. We’ll explore real-world uses like spam filtering and text classification, and walk through approachable examples—like predicting gender from simple measurements—withou...

Join us on a journey from ancient ideas to modern neural networks as we dissect the sigmoid function—the unmistakable S-curve. We’ll unpack its key mathematical properties (bounded outputs, differentiability, a single inflection point) and explain why they matter for training neural networks via backpropagation. Along the way we’ll trace its cross-disciplinary history—from psychology and engineeri...

Welcome back to Part II of our exploration of correlation in number theory. We survey how linear and rank correlations — from Pearson’s product-moment coefficient to Spearman and Kendall — reveal hidden order among numbers, even when relationships aren’t simple. Tracing ideas from Galton to Pearson, we discuss how correlations can illuminate patterns in primes and prime gaps, and connect these ide...

A practical dive into cosine similarity: its math (dot product over magnitudes), why normalization matters, and how the angle between high-dimensional vectors reveals patterns. We explore applications in data mining, NLP, and recommender systems, compare cosine similarity to cosine distance, and peek at advanced twists like the soft cosine measure and cross-disciplinary relatives such as the Otsuk...

A concise, STEM-minded tour of gradient descent. We start with the valley-floor intuition, trace its 19th–20th century roots (Cauchy and Hadamard), and show how the method recasts equations as minimization problems. The episode dives into learning rate, local minima vs saddle points, and practical variants—SGD, momentum, Nesterov, and ADAM—before looking at real-world applications in training deep...

A deep dive into the normal (Gaussian) distribution—its defining bell curve, key properties, and the central limit theorem. We'll cover the math (PDF, CDF, Z-scores) and explore real-world applications in biology, hydrology, education, and finance, plus limitations and a nod to its history. Note:   This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any cri...

A deep dive from first principles to real-world impact: what a Z score really measures, how standard deviation standardizes comparisons, and the jump from population to sample (Z vs. T). We'll connect Z scores to percentiles, and explore practical applications in anomaly detection, process control, standardized testing, and cross-scale comparisons—showing how this small statistic acts like a...

Exploring A000084: the number of unlabeled series-parallel networks with n edges. We’ll see how this simple counting problem ties into circuit topology, co-graphs, P4-free graphs, and equivalent resistances. Join us as we trace the math from McMahon’s yoke chains through Riordan, Shannon, Foster, Cameron, and the OEIS itself, uncovering how one sequence threads through combinatorics, graph theory,...

A concise tour of linear Diophantine equations: how to tell when a solution exists using gcd, how to actually find solutions with the extended Euclidean algorithm and Bezout’s identity, and how infinite solution families arise. We’ll connect the theory to real-world puzzles like the Absent‑Minded Teller, plus applications in programming contests and cryptography. Note:   This podcast was AI-genera...

We explore A000083, the versatile sequence that begins 1, 1, 1, 2, 4, 9, 23 and pops up in two seemingly different worlds: mixed Hosoya trees with heterogeneous branches, and polygonal cacti with bridges where cycles are linked by edges. We unpack how the same counting rule captures both structures and how the generating function ties A000083 to three related sequences—A000237, A035349, and A03535...

Join us as we unravel divisibility rules—from the familiar tricks for 11 and 7 to methods that extend beyond 30. We’ll connect these patterns to modular arithmetic, explain what an inverse modulo is, and show how primes can have fast divisibility tests derived from the inverse of 10. Plus, practical STEM applications, real-world uses, and ideas you can bring into the classroom. Note:   This podcas...