Smooth Numbers: Pebbles, Primes, and the Power Behind Cryptography

A concise journey into smooth numbers—the quiet, powerful building blocks behind cryptography, integer factorization, and big math questions. We explain what 'smooth' means, the Dickman-De Bruijn function, and how this idea connects to open problems like smoothness in short intervals and Vinogradov's conjecture, with insights drawn from Andrew Granville's work.

Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.

Sponsored by Embersilk LLC